./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/aws-c-common/aws_byte_buf_from_empty_array_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba5571e8-93c2-4fee-9bfe-87db15f63ae6/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba5571e8-93c2-4fee-9bfe-87db15f63ae6/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba5571e8-93c2-4fee-9bfe-87db15f63ae6/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba5571e8-93c2-4fee-9bfe-87db15f63ae6/bin/uautomizer-ZsLfNo2U6R/config/AutomizerReach.xml -i ../../sv-benchmarks/c/aws-c-common/aws_byte_buf_from_empty_array_harness.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba5571e8-93c2-4fee-9bfe-87db15f63ae6/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba5571e8-93c2-4fee-9bfe-87db15f63ae6/bin/uautomizer-ZsLfNo2U6R --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 2e74061603d1466b037b305bab04ccfaa41041189a61fef40533e07a2fdf1d25 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-25 15:46:36,378 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 15:46:36,380 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 15:46:36,408 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 15:46:36,408 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 15:46:36,412 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 15:46:36,415 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 15:46:36,419 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 15:46:36,422 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 15:46:36,430 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 15:46:36,431 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 15:46:36,433 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 15:46:36,433 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 15:46:36,434 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 15:46:36,435 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 15:46:36,436 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 15:46:36,437 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 15:46:36,438 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 15:46:36,439 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 15:46:36,441 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 15:46:36,443 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 15:46:36,445 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 15:46:36,446 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 15:46:36,447 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 15:46:36,450 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 15:46:36,451 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 15:46:36,451 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 15:46:36,452 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 15:46:36,453 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 15:46:36,453 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 15:46:36,454 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 15:46:36,455 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 15:46:36,455 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 15:46:36,456 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 15:46:36,457 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 15:46:36,458 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 15:46:36,458 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 15:46:36,459 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 15:46:36,459 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 15:46:36,460 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 15:46:36,461 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 15:46:36,462 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba5571e8-93c2-4fee-9bfe-87db15f63ae6/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-11-25 15:46:36,484 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 15:46:36,484 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 15:46:36,484 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 15:46:36,485 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 15:46:36,485 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 15:46:36,486 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 15:46:36,486 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 15:46:36,487 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 15:46:36,487 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 15:46:36,487 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 15:46:36,487 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 15:46:36,488 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 15:46:36,488 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 15:46:36,488 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 15:46:36,488 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 15:46:36,489 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 15:46:36,489 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 15:46:36,489 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 15:46:36,489 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 15:46:36,490 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 15:46:36,490 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 15:46:36,490 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 15:46:36,490 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 15:46:36,491 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 15:46:36,491 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 15:46:36,491 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 15:46:36,491 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 15:46:36,492 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 15:46:36,492 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 15:46:36,492 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 15:46:36,492 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 15:46:36,493 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_ba5571e8-93c2-4fee-9bfe-87db15f63ae6/bin/uautomizer-ZsLfNo2U6R/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba5571e8-93c2-4fee-9bfe-87db15f63ae6/bin/uautomizer-ZsLfNo2U6R Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2e74061603d1466b037b305bab04ccfaa41041189a61fef40533e07a2fdf1d25 [2022-11-25 15:46:36,752 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 15:46:36,786 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 15:46:36,789 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 15:46:36,791 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 15:46:36,791 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 15:46:36,792 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba5571e8-93c2-4fee-9bfe-87db15f63ae6/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/aws-c-common/aws_byte_buf_from_empty_array_harness.i [2022-11-25 15:46:40,066 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 15:46:40,627 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 15:46:40,628 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba5571e8-93c2-4fee-9bfe-87db15f63ae6/sv-benchmarks/c/aws-c-common/aws_byte_buf_from_empty_array_harness.i [2022-11-25 15:46:40,674 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba5571e8-93c2-4fee-9bfe-87db15f63ae6/bin/uautomizer-ZsLfNo2U6R/data/0b81e4b36/ae686e9fe5614ec9b0fa6515393d0c5e/FLAG24bf58925 [2022-11-25 15:46:40,695 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba5571e8-93c2-4fee-9bfe-87db15f63ae6/bin/uautomizer-ZsLfNo2U6R/data/0b81e4b36/ae686e9fe5614ec9b0fa6515393d0c5e [2022-11-25 15:46:40,697 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 15:46:40,699 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 15:46:40,703 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 15:46:40,703 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 15:46:40,707 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 15:46:40,709 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 03:46:40" (1/1) ... [2022-11-25 15:46:40,710 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72cb0ac2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:46:40, skipping insertion in model container [2022-11-25 15:46:40,711 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 03:46:40" (1/1) ... [2022-11-25 15:46:40,718 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 15:46:40,835 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 15:46:41,109 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_ba5571e8-93c2-4fee-9bfe-87db15f63ae6/sv-benchmarks/c/aws-c-common/aws_byte_buf_from_empty_array_harness.i[4503,4516] [2022-11-25 15:46:41,118 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_ba5571e8-93c2-4fee-9bfe-87db15f63ae6/sv-benchmarks/c/aws-c-common/aws_byte_buf_from_empty_array_harness.i[4563,4576] [2022-11-25 15:46:42,380 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 15:46:42,382 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 15:46:42,387 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 15:46:42,388 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 15:46:42,392 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 15:46:42,415 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 15:46:42,416 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 15:46:42,418 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 15:46:42,418 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 15:46:42,526 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-11-25 15:46:42,527 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-11-25 15:46:42,528 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-11-25 15:46:42,533 WARN L623 FunctionHandler]: Unknown extern function ntohl [2022-11-25 15:46:42,535 WARN L623 FunctionHandler]: Unknown extern function htons [2022-11-25 15:46:42,536 WARN L623 FunctionHandler]: Unknown extern function ntohs [2022-11-25 15:46:42,910 WARN L623 FunctionHandler]: Unknown extern function my_abort [2022-11-25 15:46:42,912 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-11-25 15:46:42,913 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-11-25 15:46:42,915 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-11-25 15:46:42,918 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-11-25 15:46:42,920 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-11-25 15:46:42,921 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-11-25 15:46:42,922 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-11-25 15:46:42,923 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-11-25 15:46:42,924 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-11-25 15:46:42,925 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-11-25 15:46:43,168 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-11-25 15:46:43,245 WARN L623 FunctionHandler]: Unknown extern function memchr [2022-11-25 15:46:43,266 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-11-25 15:46:43,314 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-11-25 15:46:43,323 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 15:46:43,323 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 15:46:43,373 WARN L623 FunctionHandler]: Unknown extern function fprintf [2022-11-25 15:46:43,380 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 15:46:43,425 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 15:46:43,438 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_ba5571e8-93c2-4fee-9bfe-87db15f63ae6/sv-benchmarks/c/aws-c-common/aws_byte_buf_from_empty_array_harness.i[4503,4516] [2022-11-25 15:46:43,439 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_ba5571e8-93c2-4fee-9bfe-87db15f63ae6/sv-benchmarks/c/aws-c-common/aws_byte_buf_from_empty_array_harness.i[4563,4576] [2022-11-25 15:46:43,471 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 15:46:43,471 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 15:46:43,472 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 15:46:43,472 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 15:46:43,473 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 15:46:43,479 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 15:46:43,479 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 15:46:43,480 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 15:46:43,481 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 15:46:43,487 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-11-25 15:46:43,488 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-11-25 15:46:43,489 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-11-25 15:46:43,492 WARN L623 FunctionHandler]: Unknown extern function ntohl [2022-11-25 15:46:43,494 WARN L623 FunctionHandler]: Unknown extern function htons [2022-11-25 15:46:43,494 WARN L623 FunctionHandler]: Unknown extern function ntohs [2022-11-25 15:46:43,514 WARN L623 FunctionHandler]: Unknown extern function my_abort [2022-11-25 15:46:43,515 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-11-25 15:46:43,515 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-11-25 15:46:43,516 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-11-25 15:46:43,517 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-11-25 15:46:43,518 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-11-25 15:46:43,518 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-11-25 15:46:43,519 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-11-25 15:46:43,519 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-11-25 15:46:43,520 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-11-25 15:46:43,520 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-11-25 15:46:43,541 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-11-25 15:46:43,562 WARN L623 FunctionHandler]: Unknown extern function memchr [2022-11-25 15:46:43,569 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-11-25 15:46:43,586 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-11-25 15:46:43,594 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 15:46:43,598 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 15:46:43,641 WARN L623 FunctionHandler]: Unknown extern function fprintf [2022-11-25 15:46:43,643 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 15:46:43,962 INFO L208 MainTranslator]: Completed translation [2022-11-25 15:46:43,963 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:46:43 WrapperNode [2022-11-25 15:46:43,963 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 15:46:43,965 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 15:46:43,967 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 15:46:43,967 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 15:46:43,976 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:46:43" (1/1) ... [2022-11-25 15:46:44,105 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:46:43" (1/1) ... [2022-11-25 15:46:44,228 INFO L138 Inliner]: procedures = 690, calls = 2613, calls flagged for inlining = 59, calls inlined = 5, statements flattened = 789 [2022-11-25 15:46:44,232 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 15:46:44,232 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 15:46:44,232 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 15:46:44,233 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 15:46:44,242 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:46:43" (1/1) ... [2022-11-25 15:46:44,242 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:46:43" (1/1) ... [2022-11-25 15:46:44,262 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:46:43" (1/1) ... [2022-11-25 15:46:44,262 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:46:43" (1/1) ... [2022-11-25 15:46:44,312 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:46:43" (1/1) ... [2022-11-25 15:46:44,332 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:46:43" (1/1) ... [2022-11-25 15:46:44,337 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:46:43" (1/1) ... [2022-11-25 15:46:44,342 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:46:43" (1/1) ... [2022-11-25 15:46:44,358 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 15:46:44,358 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 15:46:44,359 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 15:46:44,359 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 15:46:44,364 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:46:43" (1/1) ... [2022-11-25 15:46:44,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 15:46:44,392 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba5571e8-93c2-4fee-9bfe-87db15f63ae6/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:46:44,412 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba5571e8-93c2-4fee-9bfe-87db15f63ae6/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 15:46:44,422 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba5571e8-93c2-4fee-9bfe-87db15f63ae6/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 15:46:44,460 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_buf_is_valid [2022-11-25 15:46:44,460 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_buf_is_valid [2022-11-25 15:46:44,460 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 15:46:44,461 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-25 15:46:44,461 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-25 15:46:44,461 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-25 15:46:44,461 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-25 15:46:44,462 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 15:46:44,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-25 15:46:44,463 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 15:46:44,463 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 15:46:44,463 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2022-11-25 15:46:44,464 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2022-11-25 15:46:44,464 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-11-25 15:46:44,464 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-11-25 15:46:44,464 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 15:46:44,465 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-25 15:46:44,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-25 15:46:44,465 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2022-11-25 15:46:44,465 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2022-11-25 15:46:44,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 15:46:44,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 15:46:44,844 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 15:46:44,846 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 15:46:46,201 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 15:46:46,207 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 15:46:46,208 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-25 15:46:46,210 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:46:46 BoogieIcfgContainer [2022-11-25 15:46:46,210 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 15:46:46,212 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 15:46:46,213 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 15:46:46,216 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 15:46:46,216 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 03:46:40" (1/3) ... [2022-11-25 15:46:46,217 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@617b8cd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 03:46:46, skipping insertion in model container [2022-11-25 15:46:46,217 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:46:43" (2/3) ... [2022-11-25 15:46:46,217 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@617b8cd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 03:46:46, skipping insertion in model container [2022-11-25 15:46:46,218 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:46:46" (3/3) ... [2022-11-25 15:46:46,219 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_byte_buf_from_empty_array_harness.i [2022-11-25 15:46:46,238 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 15:46:46,239 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-25 15:46:46,288 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 15:46:46,295 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;@5edb647e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 15:46:46,295 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-25 15:46:46,299 INFO L276 IsEmpty]: Start isEmpty. Operand has 69 states, 48 states have (on average 1.25) internal successors, (60), 49 states have internal predecessors, (60), 14 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-11-25 15:46:46,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-25 15:46:46,307 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:46:46,308 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:46:46,308 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:46:46,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:46:46,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1393308319, now seen corresponding path program 1 times [2022-11-25 15:46:46,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:46:46,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247652503] [2022-11-25 15:46:46,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:46:46,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:46:46,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:46,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 15:46:47,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:47,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:46:47,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:47,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 15:46:47,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:47,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-25 15:46:47,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:47,139 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-25 15:46:47,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:46:47,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247652503] [2022-11-25 15:46:47,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247652503] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:46:47,149 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:46:47,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:46:47,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28371160] [2022-11-25 15:46:47,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:46:47,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:46:47,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:46:47,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:46:47,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:46:47,224 INFO L87 Difference]: Start difference. First operand has 69 states, 48 states have (on average 1.25) internal successors, (60), 49 states have internal predecessors, (60), 14 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-25 15:46:47,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:46:47,580 INFO L93 Difference]: Finished difference Result 133 states and 180 transitions. [2022-11-25 15:46:47,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:46:47,582 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2022-11-25 15:46:47,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:46:47,591 INFO L225 Difference]: With dead ends: 133 [2022-11-25 15:46:47,592 INFO L226 Difference]: Without dead ends: 62 [2022-11-25 15:46:47,595 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:46:47,604 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 34 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 15:46:47,605 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 70 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 15:46:47,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-11-25 15:46:47,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2022-11-25 15:46:47,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 43 states have internal predecessors, (50), 14 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-11-25 15:46:47,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 77 transitions. [2022-11-25 15:46:47,663 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 77 transitions. Word has length 29 [2022-11-25 15:46:47,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:46:47,664 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 77 transitions. [2022-11-25 15:46:47,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-25 15:46:47,666 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 77 transitions. [2022-11-25 15:46:47,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-25 15:46:47,669 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:46:47,669 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:46:47,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 15:46:47,669 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:46:47,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:46:47,671 INFO L85 PathProgramCache]: Analyzing trace with hash 85103393, now seen corresponding path program 1 times [2022-11-25 15:46:47,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:46:47,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285666063] [2022-11-25 15:46:47,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:46:47,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:46:47,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:48,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 15:46:48,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:48,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:46:48,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:48,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 15:46:48,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:48,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-25 15:46:48,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:48,567 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-25 15:46:48,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:46:48,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285666063] [2022-11-25 15:46:48,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285666063] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:46:48,569 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:46:48,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 15:46:48,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21493286] [2022-11-25 15:46:48,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:46:48,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 15:46:48,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:46:48,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 15:46:48,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-25 15:46:48,574 INFO L87 Difference]: Start difference. First operand 62 states and 77 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-25 15:46:48,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:46:48,957 INFO L93 Difference]: Finished difference Result 115 states and 143 transitions. [2022-11-25 15:46:48,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 15:46:48,958 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2022-11-25 15:46:48,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:46:48,961 INFO L225 Difference]: With dead ends: 115 [2022-11-25 15:46:48,961 INFO L226 Difference]: Without dead ends: 65 [2022-11-25 15:46:48,962 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-11-25 15:46:48,963 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 54 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 15:46:48,963 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 135 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 15:46:48,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-11-25 15:46:48,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-11-25 15:46:48,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 44 states have (on average 1.1818181818181819) internal successors, (52), 46 states have internal predecessors, (52), 14 states have call successors, (14), 5 states have call predecessors, (14), 6 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) [2022-11-25 15:46:48,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 80 transitions. [2022-11-25 15:46:48,975 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 80 transitions. Word has length 29 [2022-11-25 15:46:48,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:46:48,976 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 80 transitions. [2022-11-25 15:46:48,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-25 15:46:48,976 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 80 transitions. [2022-11-25 15:46:48,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-25 15:46:48,977 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:46:48,977 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:46:48,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 15:46:48,978 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:46:48,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:46:48,978 INFO L85 PathProgramCache]: Analyzing trace with hash -682621012, now seen corresponding path program 1 times [2022-11-25 15:46:48,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:46:48,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822348355] [2022-11-25 15:46:48,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:46:48,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:46:49,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:49,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 15:46:49,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:49,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:46:49,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:49,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 15:46:49,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:50,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-25 15:46:50,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:50,147 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-25 15:46:50,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:46:50,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822348355] [2022-11-25 15:46:50,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822348355] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:46:50,148 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:46:50,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-25 15:46:50,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551876034] [2022-11-25 15:46:50,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:46:50,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 15:46:50,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:46:50,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 15:46:50,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-25 15:46:50,158 INFO L87 Difference]: Start difference. First operand 65 states and 80 transitions. Second operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-25 15:46:50,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:46:50,650 INFO L93 Difference]: Finished difference Result 77 states and 93 transitions. [2022-11-25 15:46:50,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 15:46:50,651 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 35 [2022-11-25 15:46:50,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:46:50,652 INFO L225 Difference]: With dead ends: 77 [2022-11-25 15:46:50,652 INFO L226 Difference]: Without dead ends: 75 [2022-11-25 15:46:50,653 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2022-11-25 15:46:50,653 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 61 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 15:46:50,654 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 227 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 15:46:50,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-11-25 15:46:50,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2022-11-25 15:46:50,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 50 states have (on average 1.16) internal successors, (58), 53 states have internal predecessors, (58), 15 states have call successors, (15), 6 states have call predecessors, (15), 8 states have return successors, (17), 14 states have call predecessors, (17), 14 states have call successors, (17) [2022-11-25 15:46:50,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 90 transitions. [2022-11-25 15:46:50,664 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 90 transitions. Word has length 35 [2022-11-25 15:46:50,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:46:50,664 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 90 transitions. [2022-11-25 15:46:50,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-25 15:46:50,664 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 90 transitions. [2022-11-25 15:46:50,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-25 15:46:50,666 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:46:50,666 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:46:50,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 15:46:50,666 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:46:50,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:46:50,667 INFO L85 PathProgramCache]: Analyzing trace with hash 834697204, now seen corresponding path program 1 times [2022-11-25 15:46:50,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:46:50,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42587482] [2022-11-25 15:46:50,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:46:50,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:46:50,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:51,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 15:46:51,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:51,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:46:51,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:51,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 15:46:51,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:51,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-25 15:46:51,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:52,215 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-25 15:46:52,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:46:52,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42587482] [2022-11-25 15:46:52,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42587482] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:46:52,216 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:46:52,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-25 15:46:52,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338003164] [2022-11-25 15:46:52,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:46:52,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 15:46:52,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:46:52,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 15:46:52,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-25 15:46:52,220 INFO L87 Difference]: Start difference. First operand 74 states and 90 transitions. Second operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-25 15:46:52,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:46:52,742 INFO L93 Difference]: Finished difference Result 156 states and 195 transitions. [2022-11-25 15:46:52,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 15:46:52,743 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 39 [2022-11-25 15:46:52,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:46:52,745 INFO L225 Difference]: With dead ends: 156 [2022-11-25 15:46:52,745 INFO L226 Difference]: Without dead ends: 99 [2022-11-25 15:46:52,745 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2022-11-25 15:46:52,746 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 97 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 15:46:52,747 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 147 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 15:46:52,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-11-25 15:46:52,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 79. [2022-11-25 15:46:52,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 55 states have (on average 1.1818181818181819) internal successors, (65), 58 states have internal predecessors, (65), 15 states have call successors, (15), 6 states have call predecessors, (15), 8 states have return successors, (17), 14 states have call predecessors, (17), 14 states have call successors, (17) [2022-11-25 15:46:52,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 97 transitions. [2022-11-25 15:46:52,759 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 97 transitions. Word has length 39 [2022-11-25 15:46:52,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:46:52,760 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 97 transitions. [2022-11-25 15:46:52,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-25 15:46:52,761 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 97 transitions. [2022-11-25 15:46:52,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-25 15:46:52,762 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:46:52,762 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:46:52,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 15:46:52,763 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:46:52,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:46:52,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1092862642, now seen corresponding path program 1 times [2022-11-25 15:46:52,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:46:52,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114268357] [2022-11-25 15:46:52,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:46:52,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:46:53,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:56,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 15:46:56,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:56,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:46:56,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:56,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 15:46:56,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:56,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-25 15:46:56,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:57,349 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-25 15:46:57,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:46:57,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114268357] [2022-11-25 15:46:57,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114268357] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:46:57,350 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:46:57,350 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-25 15:46:57,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896620448] [2022-11-25 15:46:57,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:46:57,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-25 15:46:57,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:46:57,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-25 15:46:57,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-11-25 15:46:57,352 INFO L87 Difference]: Start difference. First operand 79 states and 97 transitions. Second operand has 10 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-25 15:46:58,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:46:58,909 INFO L93 Difference]: Finished difference Result 168 states and 208 transitions. [2022-11-25 15:46:58,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-25 15:46:58,910 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 39 [2022-11-25 15:46:58,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:46:58,911 INFO L225 Difference]: With dead ends: 168 [2022-11-25 15:46:58,911 INFO L226 Difference]: Without dead ends: 106 [2022-11-25 15:46:58,912 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=124, Invalid=256, Unknown=0, NotChecked=0, Total=380 [2022-11-25 15:46:58,913 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 177 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-25 15:46:58,913 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 136 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-25 15:46:58,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-11-25 15:46:58,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 88. [2022-11-25 15:46:58,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 64 states have (on average 1.203125) internal successors, (77), 67 states have internal predecessors, (77), 15 states have call successors, (15), 6 states have call predecessors, (15), 8 states have return successors, (17), 14 states have call predecessors, (17), 14 states have call successors, (17) [2022-11-25 15:46:58,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 109 transitions. [2022-11-25 15:46:58,924 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 109 transitions. Word has length 39 [2022-11-25 15:46:58,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:46:58,925 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 109 transitions. [2022-11-25 15:46:58,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-25 15:46:58,925 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 109 transitions. [2022-11-25 15:46:58,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-25 15:46:58,926 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:46:58,927 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:46:58,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 15:46:58,927 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:46:58,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:46:58,928 INFO L85 PathProgramCache]: Analyzing trace with hash -187001036, now seen corresponding path program 1 times [2022-11-25 15:46:58,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:46:58,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086822512] [2022-11-25 15:46:58,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:46:58,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:46:59,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:59,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 15:46:59,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:59,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:46:59,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:59,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 15:46:59,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:59,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-25 15:46:59,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:00,083 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-25 15:47:00,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:47:00,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086822512] [2022-11-25 15:47:00,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086822512] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:47:00,084 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:47:00,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-25 15:47:00,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558663299] [2022-11-25 15:47:00,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:47:00,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 15:47:00,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:47:00,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 15:47:00,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-25 15:47:00,087 INFO L87 Difference]: Start difference. First operand 88 states and 109 transitions. Second operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-25 15:47:00,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:47:00,590 INFO L93 Difference]: Finished difference Result 180 states and 222 transitions. [2022-11-25 15:47:00,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 15:47:00,591 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 39 [2022-11-25 15:47:00,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:47:00,593 INFO L225 Difference]: With dead ends: 180 [2022-11-25 15:47:00,593 INFO L226 Difference]: Without dead ends: 104 [2022-11-25 15:47:00,593 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2022-11-25 15:47:00,594 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 113 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 15:47:00,594 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 163 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 15:47:00,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-11-25 15:47:00,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 87. [2022-11-25 15:47:00,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 63 states have (on average 1.2063492063492063) internal successors, (76), 66 states have internal predecessors, (76), 15 states have call successors, (15), 6 states have call predecessors, (15), 8 states have return successors, (17), 14 states have call predecessors, (17), 14 states have call successors, (17) [2022-11-25 15:47:00,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 108 transitions. [2022-11-25 15:47:00,608 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 108 transitions. Word has length 39 [2022-11-25 15:47:00,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:47:00,608 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 108 transitions. [2022-11-25 15:47:00,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-25 15:47:00,609 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 108 transitions. [2022-11-25 15:47:00,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-25 15:47:00,610 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:47:00,610 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:47:00,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 15:47:00,610 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:47:00,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:47:00,611 INFO L85 PathProgramCache]: Analyzing trace with hash -753650698, now seen corresponding path program 1 times [2022-11-25 15:47:00,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:47:00,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164022175] [2022-11-25 15:47:00,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:47:00,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:47:00,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:00,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 15:47:00,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:00,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:47:00,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:00,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 15:47:00,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:00,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-25 15:47:00,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:00,932 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-25 15:47:00,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:47:00,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164022175] [2022-11-25 15:47:00,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164022175] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:47:00,937 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:47:00,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 15:47:00,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090682622] [2022-11-25 15:47:00,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:47:00,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 15:47:00,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:47:00,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 15:47:00,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 15:47:00,940 INFO L87 Difference]: Start difference. First operand 87 states and 108 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-25 15:47:01,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:47:01,229 INFO L93 Difference]: Finished difference Result 172 states and 216 transitions. [2022-11-25 15:47:01,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 15:47:01,230 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 39 [2022-11-25 15:47:01,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:47:01,231 INFO L225 Difference]: With dead ends: 172 [2022-11-25 15:47:01,231 INFO L226 Difference]: Without dead ends: 97 [2022-11-25 15:47:01,232 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-25 15:47:01,232 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 62 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 15:47:01,233 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 116 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 15:47:01,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-11-25 15:47:01,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 87. [2022-11-25 15:47:01,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 63 states have (on average 1.1904761904761905) internal successors, (75), 66 states have internal predecessors, (75), 15 states have call successors, (15), 6 states have call predecessors, (15), 8 states have return successors, (17), 14 states have call predecessors, (17), 14 states have call successors, (17) [2022-11-25 15:47:01,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 107 transitions. [2022-11-25 15:47:01,253 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 107 transitions. Word has length 39 [2022-11-25 15:47:01,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:47:01,254 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 107 transitions. [2022-11-25 15:47:01,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-25 15:47:01,255 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 107 transitions. [2022-11-25 15:47:01,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-25 15:47:01,257 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:47:01,257 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:47:01,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 15:47:01,258 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:47:01,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:47:01,259 INFO L85 PathProgramCache]: Analyzing trace with hash -2033514376, now seen corresponding path program 1 times [2022-11-25 15:47:01,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:47:01,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716866445] [2022-11-25 15:47:01,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:47:01,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:47:01,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:02,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 15:47:02,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:02,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:47:02,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:02,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 15:47:02,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:02,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-25 15:47:02,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:02,353 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-25 15:47:02,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:47:02,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716866445] [2022-11-25 15:47:02,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716866445] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:47:02,354 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:47:02,354 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-25 15:47:02,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650323217] [2022-11-25 15:47:02,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:47:02,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 15:47:02,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:47:02,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 15:47:02,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-25 15:47:02,356 INFO L87 Difference]: Start difference. First operand 87 states and 107 transitions. Second operand has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-25 15:47:02,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:47:02,766 INFO L93 Difference]: Finished difference Result 169 states and 208 transitions. [2022-11-25 15:47:02,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 15:47:02,767 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 39 [2022-11-25 15:47:02,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:47:02,768 INFO L225 Difference]: With dead ends: 169 [2022-11-25 15:47:02,768 INFO L226 Difference]: Without dead ends: 99 [2022-11-25 15:47:02,768 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2022-11-25 15:47:02,769 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 59 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 15:47:02,769 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 142 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 15:47:02,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-11-25 15:47:02,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 89. [2022-11-25 15:47:02,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 65 states have (on average 1.2) internal successors, (78), 68 states have internal predecessors, (78), 15 states have call successors, (15), 6 states have call predecessors, (15), 8 states have return successors, (17), 14 states have call predecessors, (17), 14 states have call successors, (17) [2022-11-25 15:47:02,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 110 transitions. [2022-11-25 15:47:02,778 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 110 transitions. Word has length 39 [2022-11-25 15:47:02,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:47:02,778 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 110 transitions. [2022-11-25 15:47:02,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-25 15:47:02,778 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 110 transitions. [2022-11-25 15:47:02,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-25 15:47:02,779 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:47:02,780 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:47:02,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 15:47:02,780 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:47:02,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:47:02,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1775348938, now seen corresponding path program 1 times [2022-11-25 15:47:02,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:47:02,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895338481] [2022-11-25 15:47:02,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:47:02,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:47:02,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:03,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 15:47:03,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:03,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:47:03,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:03,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 15:47:03,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:03,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-25 15:47:03,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:03,432 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-25 15:47:03,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:47:03,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895338481] [2022-11-25 15:47:03,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895338481] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:47:03,433 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:47:03,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 15:47:03,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498494536] [2022-11-25 15:47:03,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:47:03,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 15:47:03,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:47:03,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 15:47:03,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-25 15:47:03,436 INFO L87 Difference]: Start difference. First operand 89 states and 110 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-25 15:47:03,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:47:03,823 INFO L93 Difference]: Finished difference Result 168 states and 208 transitions. [2022-11-25 15:47:03,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 15:47:03,824 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 39 [2022-11-25 15:47:03,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:47:03,825 INFO L225 Difference]: With dead ends: 168 [2022-11-25 15:47:03,825 INFO L226 Difference]: Without dead ends: 96 [2022-11-25 15:47:03,825 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-11-25 15:47:03,826 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 60 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 15:47:03,826 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 111 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 15:47:03,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-11-25 15:47:03,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 87. [2022-11-25 15:47:03,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 63 states have (on average 1.1746031746031746) internal successors, (74), 66 states have internal predecessors, (74), 15 states have call successors, (15), 6 states have call predecessors, (15), 8 states have return successors, (17), 14 states have call predecessors, (17), 14 states have call successors, (17) [2022-11-25 15:47:03,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 106 transitions. [2022-11-25 15:47:03,839 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 106 transitions. Word has length 39 [2022-11-25 15:47:03,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:47:03,839 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 106 transitions. [2022-11-25 15:47:03,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-25 15:47:03,840 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 106 transitions. [2022-11-25 15:47:03,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-25 15:47:03,842 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:47:03,843 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:47:03,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 15:47:03,843 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:47:03,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:47:03,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1543914243, now seen corresponding path program 1 times [2022-11-25 15:47:03,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:47:03,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734887780] [2022-11-25 15:47:03,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:47:03,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:47:03,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:04,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 15:47:04,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:04,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:47:04,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:04,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 15:47:04,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:04,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-25 15:47:04,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:04,828 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-25 15:47:04,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:47:04,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734887780] [2022-11-25 15:47:04,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734887780] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:47:04,829 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:47:04,829 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-25 15:47:04,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451056402] [2022-11-25 15:47:04,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:47:04,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-25 15:47:04,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:47:04,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-25 15:47:04,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-11-25 15:47:04,831 INFO L87 Difference]: Start difference. First operand 87 states and 106 transitions. Second operand has 11 states, 10 states have (on average 2.9) internal successors, (29), 8 states have internal predecessors, (29), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-25 15:47:05,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:47:05,333 INFO L93 Difference]: Finished difference Result 109 states and 129 transitions. [2022-11-25 15:47:05,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-25 15:47:05,334 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 8 states have internal predecessors, (29), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 41 [2022-11-25 15:47:05,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:47:05,335 INFO L225 Difference]: With dead ends: 109 [2022-11-25 15:47:05,335 INFO L226 Difference]: Without dead ends: 107 [2022-11-25 15:47:05,336 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2022-11-25 15:47:05,336 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 70 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 15:47:05,337 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 287 Invalid, 481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 464 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 15:47:05,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-11-25 15:47:05,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 89. [2022-11-25 15:47:05,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 65 states have (on average 1.1692307692307693) internal successors, (76), 68 states have internal predecessors, (76), 15 states have call successors, (15), 6 states have call predecessors, (15), 8 states have return successors, (17), 14 states have call predecessors, (17), 14 states have call successors, (17) [2022-11-25 15:47:05,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 108 transitions. [2022-11-25 15:47:05,345 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 108 transitions. Word has length 41 [2022-11-25 15:47:05,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:47:05,345 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 108 transitions. [2022-11-25 15:47:05,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 8 states have internal predecessors, (29), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-25 15:47:05,345 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 108 transitions. [2022-11-25 15:47:05,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-25 15:47:05,346 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:47:05,346 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:47:05,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-25 15:47:05,347 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:47:05,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:47:05,347 INFO L85 PathProgramCache]: Analyzing trace with hash -842849665, now seen corresponding path program 1 times [2022-11-25 15:47:05,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:47:05,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120101432] [2022-11-25 15:47:05,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:47:05,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:47:05,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:06,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 15:47:06,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:06,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:47:06,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:06,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 15:47:06,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:06,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-25 15:47:06,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:06,531 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-25 15:47:06,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:47:06,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120101432] [2022-11-25 15:47:06,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120101432] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:47:06,532 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:47:06,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-25 15:47:06,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193133577] [2022-11-25 15:47:06,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:47:06,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 15:47:06,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:47:06,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 15:47:06,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-25 15:47:06,535 INFO L87 Difference]: Start difference. First operand 89 states and 108 transitions. Second operand has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-25 15:47:06,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:47:06,974 INFO L93 Difference]: Finished difference Result 171 states and 204 transitions. [2022-11-25 15:47:06,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 15:47:06,975 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 41 [2022-11-25 15:47:06,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:47:06,976 INFO L225 Difference]: With dead ends: 171 [2022-11-25 15:47:06,976 INFO L226 Difference]: Without dead ends: 99 [2022-11-25 15:47:06,977 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-11-25 15:47:06,977 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 56 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 15:47:06,978 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 163 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 15:47:06,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-11-25 15:47:06,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 82. [2022-11-25 15:47:06,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 60 states have (on average 1.1833333333333333) internal successors, (71), 62 states have internal predecessors, (71), 14 states have call successors, (14), 6 states have call predecessors, (14), 7 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) [2022-11-25 15:47:06,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 99 transitions. [2022-11-25 15:47:06,985 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 99 transitions. Word has length 41 [2022-11-25 15:47:06,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:47:06,986 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 99 transitions. [2022-11-25 15:47:06,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-25 15:47:06,986 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 99 transitions. [2022-11-25 15:47:06,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-25 15:47:06,987 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:47:06,988 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:47:06,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-25 15:47:06,988 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:47:06,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:47:06,989 INFO L85 PathProgramCache]: Analyzing trace with hash -143563596, now seen corresponding path program 1 times [2022-11-25 15:47:06,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:47:06,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829049078] [2022-11-25 15:47:06,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:47:06,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:47:07,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:07,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 15:47:07,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:07,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:47:07,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:07,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 15:47:07,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:07,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-25 15:47:07,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:07,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-25 15:47:07,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:07,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-25 15:47:07,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:07,425 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-25 15:47:07,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:47:07,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829049078] [2022-11-25 15:47:07,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829049078] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:47:07,426 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:47:07,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 15:47:07,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822088838] [2022-11-25 15:47:07,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:47:07,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 15:47:07,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:47:07,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 15:47:07,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-25 15:47:07,428 INFO L87 Difference]: Start difference. First operand 82 states and 99 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-25 15:47:07,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:47:07,707 INFO L93 Difference]: Finished difference Result 114 states and 135 transitions. [2022-11-25 15:47:07,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 15:47:07,708 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 48 [2022-11-25 15:47:07,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:47:07,709 INFO L225 Difference]: With dead ends: 114 [2022-11-25 15:47:07,709 INFO L226 Difference]: Without dead ends: 82 [2022-11-25 15:47:07,709 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-11-25 15:47:07,710 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 62 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 15:47:07,710 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 105 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 15:47:07,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-11-25 15:47:07,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2022-11-25 15:47:07,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 60 states have (on average 1.1666666666666667) internal successors, (70), 62 states have internal predecessors, (70), 14 states have call successors, (14), 6 states have call predecessors, (14), 7 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) [2022-11-25 15:47:07,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 98 transitions. [2022-11-25 15:47:07,716 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 98 transitions. Word has length 48 [2022-11-25 15:47:07,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:47:07,717 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 98 transitions. [2022-11-25 15:47:07,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-25 15:47:07,717 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 98 transitions. [2022-11-25 15:47:07,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-11-25 15:47:07,718 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:47:07,721 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:47:07,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-25 15:47:07,721 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:47:07,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:47:07,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1027849983, now seen corresponding path program 1 times [2022-11-25 15:47:07,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:47:07,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086791990] [2022-11-25 15:47:07,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:47:07,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:47:07,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:08,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 15:47:08,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:08,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:47:08,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:08,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 15:47:08,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:08,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-25 15:47:08,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:08,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-25 15:47:08,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:08,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-25 15:47:08,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:08,574 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-25 15:47:08,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:47:08,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086791990] [2022-11-25 15:47:08,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086791990] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:47:08,575 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:47:08,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-25 15:47:08,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767184461] [2022-11-25 15:47:08,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:47:08,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 15:47:08,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:47:08,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 15:47:08,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-25 15:47:08,578 INFO L87 Difference]: Start difference. First operand 82 states and 98 transitions. Second operand has 9 states, 8 states have (on average 4.0) internal successors, (32), 6 states have internal predecessors, (32), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-11-25 15:47:08,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:47:08,961 INFO L93 Difference]: Finished difference Result 98 states and 115 transitions. [2022-11-25 15:47:08,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 15:47:08,962 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.0) internal successors, (32), 6 states have internal predecessors, (32), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 54 [2022-11-25 15:47:08,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:47:08,963 INFO L225 Difference]: With dead ends: 98 [2022-11-25 15:47:08,963 INFO L226 Difference]: Without dead ends: 96 [2022-11-25 15:47:08,964 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2022-11-25 15:47:08,964 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 59 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 15:47:08,964 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 226 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 15:47:08,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-11-25 15:47:08,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2022-11-25 15:47:08,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 69 states have (on average 1.144927536231884) internal successors, (79), 73 states have internal predecessors, (79), 15 states have call successors, (15), 7 states have call predecessors, (15), 10 states have return successors, (18), 14 states have call predecessors, (18), 14 states have call successors, (18) [2022-11-25 15:47:08,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 112 transitions. [2022-11-25 15:47:08,970 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 112 transitions. Word has length 54 [2022-11-25 15:47:08,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:47:08,974 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 112 transitions. [2022-11-25 15:47:08,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.0) internal successors, (32), 6 states have internal predecessors, (32), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-11-25 15:47:08,974 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 112 transitions. [2022-11-25 15:47:08,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-25 15:47:08,976 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:47:08,976 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:47:08,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-25 15:47:08,977 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:47:08,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:47:08,977 INFO L85 PathProgramCache]: Analyzing trace with hash -1667671931, now seen corresponding path program 1 times [2022-11-25 15:47:08,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:47:08,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92541579] [2022-11-25 15:47:08,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:47:08,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:47:09,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:11,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 15:47:11,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:11,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:47:11,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:11,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 15:47:11,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:11,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-25 15:47:11,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:11,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-25 15:47:11,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:11,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-25 15:47:11,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:11,697 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-25 15:47:11,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:47:11,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92541579] [2022-11-25 15:47:11,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92541579] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 15:47:11,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1062703609] [2022-11-25 15:47:11,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:47:11,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:47:11,698 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba5571e8-93c2-4fee-9bfe-87db15f63ae6/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:47:11,702 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba5571e8-93c2-4fee-9bfe-87db15f63ae6/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 15:47:11,722 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba5571e8-93c2-4fee-9bfe-87db15f63ae6/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-25 15:47:12,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:12,923 INFO L263 TraceCheckSpWp]: Trace formula consists of 2479 conjuncts, 42 conjunts are in the unsatisfiable core [2022-11-25 15:47:12,933 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:47:14,180 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-25 15:47:14,180 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:47:14,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1062703609] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 15:47:14,915 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 15:47:14,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 24 [2022-11-25 15:47:14,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427597701] [2022-11-25 15:47:14,916 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 15:47:14,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-25 15:47:14,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:47:14,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-25 15:47:14,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=825, Unknown=0, NotChecked=0, Total=930 [2022-11-25 15:47:14,919 INFO L87 Difference]: Start difference. First operand 95 states and 112 transitions. Second operand has 24 states, 22 states have (on average 2.9545454545454546) internal successors, (65), 22 states have internal predecessors, (65), 6 states have call successors, (10), 4 states have call predecessors, (10), 5 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) [2022-11-25 15:47:18,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:47:18,229 INFO L93 Difference]: Finished difference Result 242 states and 287 transitions. [2022-11-25 15:47:18,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-25 15:47:18,229 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 2.9545454545454546) internal successors, (65), 22 states have internal predecessors, (65), 6 states have call successors, (10), 4 states have call predecessors, (10), 5 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) Word has length 58 [2022-11-25 15:47:18,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:47:18,231 INFO L225 Difference]: With dead ends: 242 [2022-11-25 15:47:18,231 INFO L226 Difference]: Without dead ends: 203 [2022-11-25 15:47:18,232 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 74 SyntacticMatches, 3 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 580 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=373, Invalid=1979, Unknown=0, NotChecked=0, Total=2352 [2022-11-25 15:47:18,233 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 293 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 1101 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 1190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 1101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-11-25 15:47:18,233 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 191 Invalid, 1190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 1101 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-11-25 15:47:18,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2022-11-25 15:47:18,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 158. [2022-11-25 15:47:18,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 116 states have (on average 1.146551724137931) internal successors, (133), 121 states have internal predecessors, (133), 25 states have call successors, (25), 12 states have call predecessors, (25), 16 states have return successors, (28), 24 states have call predecessors, (28), 23 states have call successors, (28) [2022-11-25 15:47:18,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 186 transitions. [2022-11-25 15:47:18,251 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 186 transitions. Word has length 58 [2022-11-25 15:47:18,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:47:18,252 INFO L495 AbstractCegarLoop]: Abstraction has 158 states and 186 transitions. [2022-11-25 15:47:18,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 2.9545454545454546) internal successors, (65), 22 states have internal predecessors, (65), 6 states have call successors, (10), 4 states have call predecessors, (10), 5 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) [2022-11-25 15:47:18,253 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 186 transitions. [2022-11-25 15:47:18,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-25 15:47:18,253 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:47:18,254 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:47:18,270 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba5571e8-93c2-4fee-9bfe-87db15f63ae6/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-25 15:47:18,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba5571e8-93c2-4fee-9bfe-87db15f63ae6/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-25 15:47:18,466 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:47:18,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:47:18,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1347431687, now seen corresponding path program 1 times [2022-11-25 15:47:18,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:47:18,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737496650] [2022-11-25 15:47:18,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:47:18,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:47:18,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:19,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 15:47:19,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:19,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:47:19,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:19,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 15:47:19,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:19,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-25 15:47:19,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:19,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-25 15:47:19,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:19,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-25 15:47:19,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:19,914 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-25 15:47:19,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:47:19,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737496650] [2022-11-25 15:47:19,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737496650] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:47:19,915 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:47:19,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-25 15:47:19,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222393688] [2022-11-25 15:47:19,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:47:19,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-25 15:47:19,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:47:19,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-25 15:47:19,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-11-25 15:47:19,917 INFO L87 Difference]: Start difference. First operand 158 states and 186 transitions. Second operand has 11 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-25 15:47:20,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:47:20,651 INFO L93 Difference]: Finished difference Result 250 states and 291 transitions. [2022-11-25 15:47:20,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-25 15:47:20,652 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 58 [2022-11-25 15:47:20,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:47:20,653 INFO L225 Difference]: With dead ends: 250 [2022-11-25 15:47:20,654 INFO L226 Difference]: Without dead ends: 157 [2022-11-25 15:47:20,654 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2022-11-25 15:47:20,655 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 109 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-25 15:47:20,655 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 131 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-25 15:47:20,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-11-25 15:47:20,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 149. [2022-11-25 15:47:20,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 108 states have (on average 1.1203703703703705) internal successors, (121), 112 states have internal predecessors, (121), 25 states have call successors, (25), 12 states have call predecessors, (25), 15 states have return successors, (27), 24 states have call predecessors, (27), 23 states have call successors, (27) [2022-11-25 15:47:20,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 173 transitions. [2022-11-25 15:47:20,671 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 173 transitions. Word has length 58 [2022-11-25 15:47:20,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:47:20,672 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 173 transitions. [2022-11-25 15:47:20,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-25 15:47:20,673 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 173 transitions. [2022-11-25 15:47:20,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-25 15:47:20,673 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:47:20,674 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:47:20,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-25 15:47:20,674 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:47:20,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:47:20,675 INFO L85 PathProgramCache]: Analyzing trace with hash -499081653, now seen corresponding path program 1 times [2022-11-25 15:47:20,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:47:20,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050334780] [2022-11-25 15:47:20,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:47:20,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:47:20,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:21,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 15:47:21,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:21,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:47:21,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:21,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 15:47:21,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:21,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-25 15:47:21,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:21,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-25 15:47:21,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:21,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-25 15:47:21,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:22,186 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-25 15:47:22,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:47:22,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050334780] [2022-11-25 15:47:22,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050334780] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:47:22,187 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:47:22,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-25 15:47:22,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955730441] [2022-11-25 15:47:22,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:47:22,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-25 15:47:22,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:47:22,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-25 15:47:22,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-11-25 15:47:22,190 INFO L87 Difference]: Start difference. First operand 149 states and 173 transitions. Second operand has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-25 15:47:22,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:47:22,821 INFO L93 Difference]: Finished difference Result 219 states and 252 transitions. [2022-11-25 15:47:22,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-25 15:47:22,822 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 58 [2022-11-25 15:47:22,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:47:22,823 INFO L225 Difference]: With dead ends: 219 [2022-11-25 15:47:22,824 INFO L226 Difference]: Without dead ends: 153 [2022-11-25 15:47:22,824 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2022-11-25 15:47:22,825 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 74 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 504 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 15:47:22,825 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 121 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 504 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 15:47:22,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-11-25 15:47:22,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 149. [2022-11-25 15:47:22,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 108 states have (on average 1.1018518518518519) internal successors, (119), 112 states have internal predecessors, (119), 25 states have call successors, (25), 12 states have call predecessors, (25), 15 states have return successors, (27), 24 states have call predecessors, (27), 23 states have call successors, (27) [2022-11-25 15:47:22,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 171 transitions. [2022-11-25 15:47:22,846 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 171 transitions. Word has length 58 [2022-11-25 15:47:22,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:47:22,847 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 171 transitions. [2022-11-25 15:47:22,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-25 15:47:22,848 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 171 transitions. [2022-11-25 15:47:22,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-11-25 15:47:22,851 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:47:22,852 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:47:22,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-25 15:47:22,852 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:47:22,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:47:22,853 INFO L85 PathProgramCache]: Analyzing trace with hash 592257393, now seen corresponding path program 1 times [2022-11-25 15:47:22,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:47:22,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976594487] [2022-11-25 15:47:22,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:47:22,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:47:22,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:24,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 15:47:24,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:24,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:47:24,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:24,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 15:47:24,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:24,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-25 15:47:24,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:24,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-25 15:47:24,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:24,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-25 15:47:24,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:24,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-25 15:47:24,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:24,072 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-25 15:47:24,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:47:24,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976594487] [2022-11-25 15:47:24,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976594487] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:47:24,090 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:47:24,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-25 15:47:24,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413708625] [2022-11-25 15:47:24,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:47:24,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 15:47:24,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:47:24,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 15:47:24,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-25 15:47:24,093 INFO L87 Difference]: Start difference. First operand 149 states and 171 transitions. Second operand has 9 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 4 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-25 15:47:24,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:47:24,615 INFO L93 Difference]: Finished difference Result 159 states and 180 transitions. [2022-11-25 15:47:24,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 15:47:24,619 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 4 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 60 [2022-11-25 15:47:24,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:47:24,620 INFO L225 Difference]: With dead ends: 159 [2022-11-25 15:47:24,620 INFO L226 Difference]: Without dead ends: 157 [2022-11-25 15:47:24,621 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2022-11-25 15:47:24,622 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 55 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 15:47:24,622 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 123 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 15:47:24,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-11-25 15:47:24,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2022-11-25 15:47:24,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 114 states have (on average 1.0964912280701755) internal successors, (125), 118 states have internal predecessors, (125), 25 states have call successors, (25), 14 states have call predecessors, (25), 17 states have return successors, (27), 24 states have call predecessors, (27), 23 states have call successors, (27) [2022-11-25 15:47:24,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 177 transitions. [2022-11-25 15:47:24,642 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 177 transitions. Word has length 60 [2022-11-25 15:47:24,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:47:24,642 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 177 transitions. [2022-11-25 15:47:24,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 4 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-25 15:47:24,643 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 177 transitions. [2022-11-25 15:47:24,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-11-25 15:47:24,644 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:47:24,644 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:47:24,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-25 15:47:24,645 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:47:24,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:47:24,646 INFO L85 PathProgramCache]: Analyzing trace with hash 506399248, now seen corresponding path program 1 times [2022-11-25 15:47:24,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:47:24,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327362199] [2022-11-25 15:47:24,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:47:24,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:47:24,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:25,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 15:47:25,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:25,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:47:25,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:25,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 15:47:25,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:25,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-25 15:47:25,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:25,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-25 15:47:25,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:25,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-25 15:47:25,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:25,489 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-25 15:47:25,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:47:25,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327362199] [2022-11-25 15:47:25,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327362199] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:47:25,490 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:47:25,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-25 15:47:25,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691702231] [2022-11-25 15:47:25,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:47:25,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-25 15:47:25,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:47:25,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-25 15:47:25,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-11-25 15:47:25,492 INFO L87 Difference]: Start difference. First operand 157 states and 177 transitions. Second operand has 11 states, 10 states have (on average 4.0) internal successors, (40), 8 states have internal predecessors, (40), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-11-25 15:47:25,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:47:25,996 INFO L93 Difference]: Finished difference Result 183 states and 204 transitions. [2022-11-25 15:47:25,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-25 15:47:25,997 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.0) internal successors, (40), 8 states have internal predecessors, (40), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 60 [2022-11-25 15:47:25,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:47:25,998 INFO L225 Difference]: With dead ends: 183 [2022-11-25 15:47:25,999 INFO L226 Difference]: Without dead ends: 181 [2022-11-25 15:47:25,999 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2022-11-25 15:47:26,000 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 68 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 15:47:26,000 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 286 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 15:47:26,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2022-11-25 15:47:26,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 170. [2022-11-25 15:47:26,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 124 states have (on average 1.0887096774193548) internal successors, (135), 129 states have internal predecessors, (135), 26 states have call successors, (26), 15 states have call predecessors, (26), 19 states have return successors, (29), 25 states have call predecessors, (29), 24 states have call successors, (29) [2022-11-25 15:47:26,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 190 transitions. [2022-11-25 15:47:26,015 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 190 transitions. Word has length 60 [2022-11-25 15:47:26,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:47:26,016 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 190 transitions. [2022-11-25 15:47:26,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.0) internal successors, (40), 8 states have internal predecessors, (40), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-11-25 15:47:26,016 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 190 transitions. [2022-11-25 15:47:26,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-11-25 15:47:26,017 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:47:26,017 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:47:26,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-25 15:47:26,018 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:47:26,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:47:26,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1207463826, now seen corresponding path program 1 times [2022-11-25 15:47:26,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:47:26,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590364698] [2022-11-25 15:47:26,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:47:26,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:47:26,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:26,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 15:47:26,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:26,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:47:26,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:26,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 15:47:26,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:26,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-25 15:47:26,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:26,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-25 15:47:26,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:26,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-25 15:47:26,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:27,140 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-25 15:47:27,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:47:27,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590364698] [2022-11-25 15:47:27,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590364698] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:47:27,140 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:47:27,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-25 15:47:27,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015260667] [2022-11-25 15:47:27,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:47:27,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-25 15:47:27,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:47:27,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-25 15:47:27,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-11-25 15:47:27,142 INFO L87 Difference]: Start difference. First operand 170 states and 190 transitions. Second operand has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-25 15:47:27,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:47:27,726 INFO L93 Difference]: Finished difference Result 240 states and 266 transitions. [2022-11-25 15:47:27,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 15:47:27,726 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 60 [2022-11-25 15:47:27,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:47:27,728 INFO L225 Difference]: With dead ends: 240 [2022-11-25 15:47:27,728 INFO L226 Difference]: Without dead ends: 164 [2022-11-25 15:47:27,729 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2022-11-25 15:47:27,729 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 84 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 15:47:27,730 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 100 Invalid, 461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 15:47:27,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-11-25 15:47:27,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 162. [2022-11-25 15:47:27,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 118 states have (on average 1.0677966101694916) internal successors, (126), 122 states have internal predecessors, (126), 25 states have call successors, (25), 15 states have call predecessors, (25), 18 states have return successors, (27), 24 states have call predecessors, (27), 23 states have call successors, (27) [2022-11-25 15:47:27,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 178 transitions. [2022-11-25 15:47:27,748 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 178 transitions. Word has length 60 [2022-11-25 15:47:27,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:47:27,748 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 178 transitions. [2022-11-25 15:47:27,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-25 15:47:27,749 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 178 transitions. [2022-11-25 15:47:27,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-11-25 15:47:27,750 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:47:27,750 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:47:27,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-25 15:47:27,751 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:47:27,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:47:27,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1397895009, now seen corresponding path program 1 times [2022-11-25 15:47:27,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:47:27,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225530314] [2022-11-25 15:47:27,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:47:27,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:47:27,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:28,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 15:47:28,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:28,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:47:28,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:28,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 15:47:28,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:28,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-25 15:47:28,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:28,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-25 15:47:28,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:28,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-25 15:47:28,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:28,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-25 15:47:28,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:28,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-25 15:47:28,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:28,825 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-11-25 15:47:28,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:47:28,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225530314] [2022-11-25 15:47:28,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225530314] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:47:28,826 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:47:28,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-25 15:47:28,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972019880] [2022-11-25 15:47:28,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:47:28,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-25 15:47:28,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:47:28,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-25 15:47:28,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-11-25 15:47:28,828 INFO L87 Difference]: Start difference. First operand 162 states and 178 transitions. Second operand has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 5 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-11-25 15:47:29,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:47:29,338 INFO L93 Difference]: Finished difference Result 172 states and 187 transitions. [2022-11-25 15:47:29,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-25 15:47:29,339 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 5 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 66 [2022-11-25 15:47:29,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:47:29,340 INFO L225 Difference]: With dead ends: 172 [2022-11-25 15:47:29,340 INFO L226 Difference]: Without dead ends: 170 [2022-11-25 15:47:29,341 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2022-11-25 15:47:29,341 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 64 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 15:47:29,342 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 118 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 464 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 15:47:29,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2022-11-25 15:47:29,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2022-11-25 15:47:29,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 124 states have (on average 1.064516129032258) internal successors, (132), 128 states have internal predecessors, (132), 25 states have call successors, (25), 17 states have call predecessors, (25), 20 states have return successors, (27), 24 states have call predecessors, (27), 23 states have call successors, (27) [2022-11-25 15:47:29,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 184 transitions. [2022-11-25 15:47:29,354 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 184 transitions. Word has length 66 [2022-11-25 15:47:29,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:47:29,355 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 184 transitions. [2022-11-25 15:47:29,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 5 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-11-25 15:47:29,355 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 184 transitions. [2022-11-25 15:47:29,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-11-25 15:47:29,356 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:47:29,356 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:47:29,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-25 15:47:29,357 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:47:29,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:47:29,357 INFO L85 PathProgramCache]: Analyzing trace with hash 2018654228, now seen corresponding path program 1 times [2022-11-25 15:47:29,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:47:29,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179163356] [2022-11-25 15:47:29,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:47:29,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:47:29,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:32,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 15:47:32,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:32,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:47:32,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:32,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 15:47:32,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:32,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-25 15:47:32,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:32,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-25 15:47:32,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:32,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-25 15:47:33,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:33,655 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-25 15:47:33,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:47:33,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179163356] [2022-11-25 15:47:33,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179163356] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 15:47:33,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [317479499] [2022-11-25 15:47:33,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:47:33,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:47:33,656 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba5571e8-93c2-4fee-9bfe-87db15f63ae6/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:47:33,657 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba5571e8-93c2-4fee-9bfe-87db15f63ae6/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 15:47:33,678 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba5571e8-93c2-4fee-9bfe-87db15f63ae6/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-25 15:47:34,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:34,427 INFO L263 TraceCheckSpWp]: Trace formula consists of 2488 conjuncts, 40 conjunts are in the unsatisfiable core [2022-11-25 15:47:34,432 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:47:34,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:47:34,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:47:34,502 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-11-25 15:47:35,689 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-25 15:47:35,690 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:47:36,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [317479499] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 15:47:36,196 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 15:47:36,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 14] total 31 [2022-11-25 15:47:36,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898068740] [2022-11-25 15:47:36,201 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 15:47:36,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-25 15:47:36,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:47:36,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-25 15:47:36,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1223, Unknown=0, NotChecked=0, Total=1332 [2022-11-25 15:47:36,209 INFO L87 Difference]: Start difference. First operand 170 states and 184 transitions. Second operand has 31 states, 27 states have (on average 3.3703703703703702) internal successors, (91), 27 states have internal predecessors, (91), 10 states have call successors, (13), 4 states have call predecessors, (13), 7 states have return successors, (12), 8 states have call predecessors, (12), 9 states have call successors, (12) [2022-11-25 15:47:39,295 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:47:43,495 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 15:47:47,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:47:47,201 INFO L93 Difference]: Finished difference Result 396 states and 423 transitions. [2022-11-25 15:47:47,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-11-25 15:47:47,201 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 27 states have (on average 3.3703703703703702) internal successors, (91), 27 states have internal predecessors, (91), 10 states have call successors, (13), 4 states have call predecessors, (13), 7 states have return successors, (12), 8 states have call predecessors, (12), 9 states have call successors, (12) Word has length 64 [2022-11-25 15:47:47,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:47:47,203 INFO L225 Difference]: With dead ends: 396 [2022-11-25 15:47:47,203 INFO L226 Difference]: Without dead ends: 269 [2022-11-25 15:47:47,206 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 83 SyntacticMatches, 2 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 934 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=413, Invalid=4009, Unknown=0, NotChecked=0, Total=4422 [2022-11-25 15:47:47,207 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 312 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 2590 mSolverCounterSat, 191 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 2783 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 191 IncrementalHoareTripleChecker+Valid, 2590 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2022-11-25 15:47:47,208 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 365 Invalid, 2783 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [191 Valid, 2590 Invalid, 2 Unknown, 0 Unchecked, 8.5s Time] [2022-11-25 15:47:47,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2022-11-25 15:47:47,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 204. [2022-11-25 15:47:47,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 154 states have (on average 1.051948051948052) internal successors, (162), 158 states have internal predecessors, (162), 26 states have call successors, (26), 20 states have call predecessors, (26), 23 states have return successors, (27), 25 states have call predecessors, (27), 24 states have call successors, (27) [2022-11-25 15:47:47,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 215 transitions. [2022-11-25 15:47:47,250 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 215 transitions. Word has length 64 [2022-11-25 15:47:47,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:47:47,250 INFO L495 AbstractCegarLoop]: Abstraction has 204 states and 215 transitions. [2022-11-25 15:47:47,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 27 states have (on average 3.3703703703703702) internal successors, (91), 27 states have internal predecessors, (91), 10 states have call successors, (13), 4 states have call predecessors, (13), 7 states have return successors, (12), 8 states have call predecessors, (12), 9 states have call successors, (12) [2022-11-25 15:47:47,251 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 215 transitions. [2022-11-25 15:47:47,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-11-25 15:47:47,252 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:47:47,252 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:47:47,267 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba5571e8-93c2-4fee-9bfe-87db15f63ae6/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-25 15:47:47,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba5571e8-93c2-4fee-9bfe-87db15f63ae6/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:47:47,462 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:47:47,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:47:47,462 INFO L85 PathProgramCache]: Analyzing trace with hash -134753713, now seen corresponding path program 1 times [2022-11-25 15:47:47,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:47:47,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677514188] [2022-11-25 15:47:47,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:47:47,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:47:47,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:48,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 15:47:48,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:48,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:47:48,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:48,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 15:47:48,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:48,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-25 15:47:48,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:48,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-25 15:47:48,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:48,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-25 15:47:48,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:48,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-25 15:47:48,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:48,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-25 15:47:48,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:48,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-25 15:47:48,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:48,321 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-11-25 15:47:48,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:47:48,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677514188] [2022-11-25 15:47:48,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677514188] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:47:48,322 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:47:48,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-25 15:47:48,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744358674] [2022-11-25 15:47:48,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:47:48,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 15:47:48,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:47:48,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 15:47:48,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-25 15:47:48,325 INFO L87 Difference]: Start difference. First operand 204 states and 215 transitions. Second operand has 9 states, 8 states have (on average 3.875) internal successors, (31), 7 states have internal predecessors, (31), 4 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-11-25 15:47:48,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:47:48,837 INFO L93 Difference]: Finished difference Result 214 states and 224 transitions. [2022-11-25 15:47:48,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 15:47:48,838 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.875) internal successors, (31), 7 states have internal predecessors, (31), 4 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 72 [2022-11-25 15:47:48,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:47:48,839 INFO L225 Difference]: With dead ends: 214 [2022-11-25 15:47:48,840 INFO L226 Difference]: Without dead ends: 212 [2022-11-25 15:47:48,842 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2022-11-25 15:47:48,843 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 50 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 15:47:48,844 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 129 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 15:47:48,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2022-11-25 15:47:48,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2022-11-25 15:47:48,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 160 states have (on average 1.05) internal successors, (168), 164 states have internal predecessors, (168), 26 states have call successors, (26), 22 states have call predecessors, (26), 25 states have return successors, (27), 25 states have call predecessors, (27), 24 states have call successors, (27) [2022-11-25 15:47:48,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 221 transitions. [2022-11-25 15:47:48,889 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 221 transitions. Word has length 72 [2022-11-25 15:47:48,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:47:48,890 INFO L495 AbstractCegarLoop]: Abstraction has 212 states and 221 transitions. [2022-11-25 15:47:48,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.875) internal successors, (31), 7 states have internal predecessors, (31), 4 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-11-25 15:47:48,890 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 221 transitions. [2022-11-25 15:47:48,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-11-25 15:47:48,892 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:47:48,893 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:47:48,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-25 15:47:48,893 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:47:48,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:47:48,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1256277667, now seen corresponding path program 1 times [2022-11-25 15:47:48,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:47:48,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882208090] [2022-11-25 15:47:48,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:47:48,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:47:49,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:49,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 15:47:49,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:49,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:47:49,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:49,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 15:47:49,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:49,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-25 15:47:49,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:49,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-25 15:47:49,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:49,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-25 15:47:49,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:49,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-25 15:47:49,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:49,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-25 15:47:49,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:49,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-25 15:47:49,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:49,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-25 15:47:49,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:49,986 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-25 15:47:49,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:47:49,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882208090] [2022-11-25 15:47:49,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882208090] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:47:49,987 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:47:49,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-25 15:47:49,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760656936] [2022-11-25 15:47:49,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:47:49,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-25 15:47:49,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:47:49,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-25 15:47:49,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-11-25 15:47:49,988 INFO L87 Difference]: Start difference. First operand 212 states and 221 transitions. Second operand has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-25 15:47:50,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:47:50,464 INFO L93 Difference]: Finished difference Result 222 states and 230 transitions. [2022-11-25 15:47:50,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-25 15:47:50,465 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) Word has length 79 [2022-11-25 15:47:50,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:47:50,466 INFO L225 Difference]: With dead ends: 222 [2022-11-25 15:47:50,466 INFO L226 Difference]: Without dead ends: 216 [2022-11-25 15:47:50,467 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-11-25 15:47:50,468 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 42 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 15:47:50,468 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 183 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 15:47:50,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2022-11-25 15:47:50,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 212. [2022-11-25 15:47:50,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 161 states have (on average 1.0372670807453417) internal successors, (167), 164 states have internal predecessors, (167), 25 states have call successors, (25), 23 states have call predecessors, (25), 25 states have return successors, (27), 24 states have call predecessors, (27), 24 states have call successors, (27) [2022-11-25 15:47:50,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 219 transitions. [2022-11-25 15:47:50,511 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 219 transitions. Word has length 79 [2022-11-25 15:47:50,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:47:50,512 INFO L495 AbstractCegarLoop]: Abstraction has 212 states and 219 transitions. [2022-11-25 15:47:50,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-25 15:47:50,512 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 219 transitions. [2022-11-25 15:47:50,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-11-25 15:47:50,514 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:47:50,514 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 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, 1, 1] [2022-11-25 15:47:50,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-25 15:47:50,514 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:47:50,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:47:50,515 INFO L85 PathProgramCache]: Analyzing trace with hash 195550462, now seen corresponding path program 1 times [2022-11-25 15:47:50,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:47:50,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194019530] [2022-11-25 15:47:50,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:47:50,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:47:50,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:51,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 15:47:51,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:51,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:47:51,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:51,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 15:47:51,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:51,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-25 15:47:51,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:51,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-25 15:47:51,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:51,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-25 15:47:51,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:51,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-25 15:47:51,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:51,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-25 15:47:51,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:51,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-25 15:47:51,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:51,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-25 15:47:51,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:51,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-11-25 15:47:51,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:51,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-11-25 15:47:51,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:51,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-11-25 15:47:51,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:51,978 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2022-11-25 15:47:51,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:47:51,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194019530] [2022-11-25 15:47:51,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194019530] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 15:47:51,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [322274145] [2022-11-25 15:47:51,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:47:51,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:47:51,979 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba5571e8-93c2-4fee-9bfe-87db15f63ae6/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:47:51,983 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba5571e8-93c2-4fee-9bfe-87db15f63ae6/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 15:47:52,006 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba5571e8-93c2-4fee-9bfe-87db15f63ae6/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-25 15:47:52,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:52,579 INFO L263 TraceCheckSpWp]: Trace formula consists of 2580 conjuncts, 30 conjunts are in the unsatisfiable core [2022-11-25 15:47:52,587 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:47:53,845 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-25 15:47:53,845 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 10 [2022-11-25 15:47:53,851 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-25 15:47:53,852 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 10 [2022-11-25 15:47:53,860 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 39 proven. 10 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-11-25 15:47:53,860 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:47:54,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [322274145] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 15:47:54,184 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 15:47:54,185 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 17 [2022-11-25 15:47:54,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803635114] [2022-11-25 15:47:54,185 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 15:47:54,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-25 15:47:54,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:47:54,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-25 15:47:54,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2022-11-25 15:47:54,188 INFO L87 Difference]: Start difference. First operand 212 states and 219 transitions. Second operand has 17 states, 16 states have (on average 4.875) internal successors, (78), 15 states have internal predecessors, (78), 6 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (22), 5 states have call predecessors, (22), 6 states have call successors, (22) [2022-11-25 15:47:56,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:47:56,072 INFO L93 Difference]: Finished difference Result 249 states and 255 transitions. [2022-11-25 15:47:56,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-25 15:47:56,072 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 4.875) internal successors, (78), 15 states have internal predecessors, (78), 6 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (22), 5 states have call predecessors, (22), 6 states have call successors, (22) Word has length 96 [2022-11-25 15:47:56,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:47:56,074 INFO L225 Difference]: With dead ends: 249 [2022-11-25 15:47:56,074 INFO L226 Difference]: Without dead ends: 101 [2022-11-25 15:47:56,075 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 168 SyntacticMatches, 11 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 271 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=230, Invalid=1030, Unknown=0, NotChecked=0, Total=1260 [2022-11-25 15:47:56,075 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 117 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 874 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 911 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 874 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-25 15:47:56,076 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 222 Invalid, 911 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 874 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-25 15:47:56,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-11-25 15:47:56,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2022-11-25 15:47:56,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 75 states have (on average 1.0) internal successors, (75), 75 states have internal predecessors, (75), 14 states have call successors, (14), 12 states have call predecessors, (14), 11 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-11-25 15:47:56,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 102 transitions. [2022-11-25 15:47:56,095 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 102 transitions. Word has length 96 [2022-11-25 15:47:56,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:47:56,096 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 102 transitions. [2022-11-25 15:47:56,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 4.875) internal successors, (78), 15 states have internal predecessors, (78), 6 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (22), 5 states have call predecessors, (22), 6 states have call successors, (22) [2022-11-25 15:47:56,096 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 102 transitions. [2022-11-25 15:47:56,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-11-25 15:47:56,098 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:47:56,098 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:47:56,115 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba5571e8-93c2-4fee-9bfe-87db15f63ae6/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-25 15:47:56,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba5571e8-93c2-4fee-9bfe-87db15f63ae6/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:47:56,308 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:47:56,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:47:56,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1936668706, now seen corresponding path program 1 times [2022-11-25 15:47:56,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:47:56,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060100994] [2022-11-25 15:47:56,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:47:56,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:47:57,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:59,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 15:47:59,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:59,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 15:47:59,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:59,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 15:47:59,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:59,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-25 15:47:59,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:59,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-25 15:47:59,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:59,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-25 15:47:59,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:59,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-25 15:47:59,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:59,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-25 15:47:59,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:59,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-11-25 15:47:59,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:59,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-11-25 15:47:59,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:59,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-11-25 15:47:59,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:59,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-25 15:47:59,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:59,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-11-25 15:47:59,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:59,746 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2022-11-25 15:47:59,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:47:59,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060100994] [2022-11-25 15:47:59,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060100994] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:47:59,747 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:47:59,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-25 15:47:59,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778983927] [2022-11-25 15:47:59,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:47:59,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-25 15:47:59,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:47:59,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-25 15:47:59,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2022-11-25 15:47:59,750 INFO L87 Difference]: Start difference. First operand 101 states and 102 transitions. Second operand has 14 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 11 states have internal predecessors, (44), 6 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) [2022-11-25 15:48:00,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:48:00,858 INFO L93 Difference]: Finished difference Result 101 states and 102 transitions. [2022-11-25 15:48:00,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-25 15:48:00,860 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 11 states have internal predecessors, (44), 6 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) Word has length 108 [2022-11-25 15:48:00,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:48:00,861 INFO L225 Difference]: With dead ends: 101 [2022-11-25 15:48:00,861 INFO L226 Difference]: Without dead ends: 0 [2022-11-25 15:48:00,861 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=79, Invalid=383, Unknown=0, NotChecked=0, Total=462 [2022-11-25 15:48:00,862 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 59 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 636 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-25 15:48:00,862 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 156 Invalid, 675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 636 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-25 15:48:00,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-25 15:48:00,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-25 15:48:00,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:48:00,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-25 15:48:00,863 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 108 [2022-11-25 15:48:00,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:48:00,863 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-25 15:48:00,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 11 states have internal predecessors, (44), 6 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) [2022-11-25 15:48:00,863 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-25 15:48:00,863 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-25 15:48:00,866 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-25 15:48:00,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-25 15:48:00,872 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-25 15:48:07,963 INFO L895 garLoopResultBuilder]: At program point bounded_mallocENTRY(lines 6882 6887) the Hoare annotation is: (or (forall ((|v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_2| Int)) (= (mod (select (select |#memory_int| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_2|) 16) 18446744073709551616) 0)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) [2022-11-25 15:48:07,963 INFO L899 garLoopResultBuilder]: For program point bounded_mallocFINAL(lines 6882 6887) no Hoare annotation was computed. [2022-11-25 15:48:07,963 INFO L899 garLoopResultBuilder]: For program point bounded_mallocEXIT(lines 6882 6887) no Hoare annotation was computed. [2022-11-25 15:48:07,964 INFO L899 garLoopResultBuilder]: For program point L6883-1(lines 6883 6885) no Hoare annotation was computed. [2022-11-25 15:48:07,965 INFO L895 garLoopResultBuilder]: At program point L6883(lines 6883 6885) the Hoare annotation is: (or (forall ((|v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_2| Int)) (= (mod (select (select |#memory_int| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_2|) 16) 18446744073709551616) 0)) (and (= |bounded_malloc_#in~size| bounded_malloc_~size) (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) [2022-11-25 15:48:07,965 INFO L902 garLoopResultBuilder]: At program point aws_byte_buf_is_validENTRY(lines 7375 7381) the Hoare annotation is: true [2022-11-25 15:48:07,965 INFO L899 garLoopResultBuilder]: For program point L7377-3(line 7377) no Hoare annotation was computed. [2022-11-25 15:48:07,965 INFO L899 garLoopResultBuilder]: For program point L7377-1(line 7377) no Hoare annotation was computed. [2022-11-25 15:48:07,965 INFO L899 garLoopResultBuilder]: For program point L7377(lines 7377 7380) no Hoare annotation was computed. [2022-11-25 15:48:07,966 INFO L899 garLoopResultBuilder]: For program point L7377-7(lines 7377 7380) no Hoare annotation was computed. [2022-11-25 15:48:07,966 INFO L899 garLoopResultBuilder]: For program point L7377-6(lines 7377 7378) no Hoare annotation was computed. [2022-11-25 15:48:07,966 INFO L899 garLoopResultBuilder]: For program point L7377-4(lines 7377 7378) no Hoare annotation was computed. [2022-11-25 15:48:07,966 INFO L899 garLoopResultBuilder]: For program point L7377-11(lines 7377 7380) no Hoare annotation was computed. [2022-11-25 15:48:07,966 INFO L899 garLoopResultBuilder]: For program point L7377-9(lines 7377 7380) no Hoare annotation was computed. [2022-11-25 15:48:07,966 INFO L899 garLoopResultBuilder]: For program point aws_byte_buf_is_validFINAL(lines 7375 7381) no Hoare annotation was computed. [2022-11-25 15:48:07,967 INFO L899 garLoopResultBuilder]: For program point aws_byte_buf_is_validEXIT(lines 7375 7381) no Hoare annotation was computed. [2022-11-25 15:48:07,967 INFO L899 garLoopResultBuilder]: For program point L7380-2(line 7380) no Hoare annotation was computed. [2022-11-25 15:48:07,967 INFO L899 garLoopResultBuilder]: For program point L7380(line 7380) no Hoare annotation was computed. [2022-11-25 15:48:07,967 INFO L899 garLoopResultBuilder]: For program point L7380-6(line 7380) no Hoare annotation was computed. [2022-11-25 15:48:07,967 INFO L899 garLoopResultBuilder]: For program point L7380-4(line 7380) no Hoare annotation was computed. [2022-11-25 15:48:07,967 INFO L899 garLoopResultBuilder]: For program point L7380-3(line 7380) no Hoare annotation was computed. [2022-11-25 15:48:07,968 INFO L899 garLoopResultBuilder]: For program point L7380-8(line 7380) no Hoare annotation was computed. [2022-11-25 15:48:07,968 INFO L899 garLoopResultBuilder]: For program point L211-2(lines 210 212) no Hoare annotation was computed. [2022-11-25 15:48:07,968 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 210 212) the Hoare annotation is: true [2022-11-25 15:48:07,968 INFO L899 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2022-11-25 15:48:07,968 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 210 212) no Hoare annotation was computed. [2022-11-25 15:48:07,968 INFO L899 garLoopResultBuilder]: For program point nondet_uint64_tEXIT(line 266) no Hoare annotation was computed. [2022-11-25 15:48:07,968 INFO L902 garLoopResultBuilder]: At program point nondet_uint64_tENTRY(line 266) the Hoare annotation is: true [2022-11-25 15:48:07,968 INFO L899 garLoopResultBuilder]: For program point nondet_uint64_tFINAL(line 266) no Hoare annotation was computed. [2022-11-25 15:48:07,969 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-25 15:48:07,969 INFO L899 garLoopResultBuilder]: For program point L7106-1(line 7106) no Hoare annotation was computed. [2022-11-25 15:48:07,969 INFO L899 garLoopResultBuilder]: For program point L8219-1(line 8219) no Hoare annotation was computed. [2022-11-25 15:48:07,969 INFO L895 garLoopResultBuilder]: At program point L8219(line 8219) the Hoare annotation is: (and (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.base| 0)) (exists ((|v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_2| Int)) (not (= (mod (select (select |#memory_int| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_2|) 16) 18446744073709551616) 0))) (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base| 0)) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|) (or (<= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| (* (div |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| 18446744073709551616) 18446744073709551616)) (<= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| (+ (* (div (+ (- 1) |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1|) 18446744073709551616) 18446744073709551616) 36028797018963967))) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 0)) [2022-11-25 15:48:07,969 INFO L899 garLoopResultBuilder]: For program point L7100-1(lines 7099 7112) no Hoare annotation was computed. [2022-11-25 15:48:07,970 INFO L895 garLoopResultBuilder]: At program point L7100(line 7100) the Hoare annotation is: (let ((.cse6 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse8 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse9 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 8))) (let ((.cse2 (= (select .cse8 .cse9) 0)) (.cse5 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.offset| 0)) (.cse3 (select .cse6 .cse9))) (let ((.cse0 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse7 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 24)) (.cse1 (and .cse2 .cse5 (= .cse3 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|)))) (and (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.base| 0) (= (select .cse0 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset|) 0) (or .cse1 (and .cse2 (= .cse3 0))) (= |ULTIMATE.start_assert_bytes_match_~b#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.capacity| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|) (let ((.cse4 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.offset| 0))) (or (and .cse4 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| 0)) (and (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse4))) .cse5 (= (select .cse0 (+ 16 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset|)) |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.len| 0) (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.base| 0)) (= (select .cse6 .cse7) 0) (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base| 0)) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|) (<= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| (+ (* (div (+ (- 1) |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1|) 18446744073709551616) 18446744073709551616) 36028797018963967)) (= |ULTIMATE.start_assert_bytes_match_~b#1.base| |ULTIMATE.start_assert_bytes_match_~a#1.base|) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.offset| 0) (= 0 (select .cse8 .cse7)) (not (= |ULTIMATE.start_assert_bytes_match_~a#1.base| 0)) (= |ULTIMATE.start_assert_bytes_match_~a#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 0) (or (and (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_#t~mem1205#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_#t~mem1205#1.base| 0)) .cse1))))) [2022-11-25 15:48:07,970 INFO L895 garLoopResultBuilder]: At program point L8230(line 8230) the Hoare annotation is: (let ((.cse3 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base|)) (.cse0 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base|)) (.cse8 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset| 8))) (let ((.cse4 (select .cse0 .cse8)) (.cse5 (= (select .cse3 .cse8) 0)) (.cse2 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base|))) (let ((.cse1 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset| 24)) (.cse7 (select .cse2 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset| 16))) (.cse6 (and (= .cse4 0) .cse5))) (and (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base| 0)) (= 0 (select .cse0 .cse1)) (= (select .cse2 |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset|) 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.base| 0)) (= (select .cse3 .cse1) 0) (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base| 0)) (or (and (= .cse4 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse5) .cse6) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|) (= .cse7 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|) (or (<= .cse7 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse7) 18446744073709551616)))) .cse6) (or (<= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| (* (div |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| 18446744073709551616) 18446744073709551616)) (<= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| (+ (* (div (+ (- 1) |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1|) 18446744073709551616) 18446744073709551616) 36028797018963967))) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 0))))) [2022-11-25 15:48:07,971 INFO L895 garLoopResultBuilder]: At program point L8963(line 8963) the Hoare annotation is: (exists ((|v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_2| Int)) (not (= (mod (select (select |#memory_int| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_2|) 16) 18446744073709551616) 0))) [2022-11-25 15:48:07,971 INFO L899 garLoopResultBuilder]: For program point L8963-1(line 8963) no Hoare annotation was computed. [2022-11-25 15:48:07,971 INFO L895 garLoopResultBuilder]: At program point L8969(lines 8969 8971) the Hoare annotation is: (let ((.cse20 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 24)) (.cse21 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse6 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.offset| 0)) (.cse19 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse22 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 8)) (.cse23 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|))) (let ((.cse0 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.base| 0)) (.cse1 (= (select .cse23 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset|) 0)) (.cse2 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_#t~mem1204#1.base| 0)) (.cse3 (= (select .cse19 .cse22) 0)) (.cse4 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.capacity| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse7 (= (select .cse23 (+ 16 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset|)) |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse8 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.len| 0)) (.cse5 (and .cse6 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| 0))) (.cse9 (select .cse21 .cse22)) (.cse10 (= (select .cse21 .cse20) 0)) (.cse11 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_#t~mem1204#1.offset| 0)) (.cse12 (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base| 0))) (.cse13 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.offset| 0)) (.cse14 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse15 (or (<= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| (* (div |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| 18446744073709551616) 18446744073709551616)) (<= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| (+ (* (div (+ (- 1) |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1|) 18446744073709551616) 18446744073709551616) 36028797018963967)))) (.cse16 (= 0 (select .cse19 .cse20))) (.cse17 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (or .cse5 (and (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse6)) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.offset| 0) .cse7 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse8 (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.base| 0)) (= .cse9 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.offset| 0) .cse16 .cse17 (exists ((|v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8| Int)) (let ((.cse18 (select (select |#memory_int| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8|) 16))) (and (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.capacity| .cse18) (not (= (mod .cse18 18446744073709551616) 0)))))) (and .cse0 .cse1 .cse2 (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base| 0)) .cse3 .cse4 .cse7 .cse8 (or .cse5 (<= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.capacity| (+ 36028797018963967 (* 18446744073709551616 (div (+ (- 1) |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.capacity|) 18446744073709551616))))) (= .cse9 0) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17)))) [2022-11-25 15:48:07,972 INFO L899 garLoopResultBuilder]: For program point L7107-1(lines 7107 7109) no Hoare annotation was computed. [2022-11-25 15:48:07,972 INFO L899 garLoopResultBuilder]: For program point L8969-1(lines 8969 8971) no Hoare annotation was computed. [2022-11-25 15:48:07,972 INFO L895 garLoopResultBuilder]: At program point L7107(lines 7107 7109) the Hoare annotation is: (let ((.cse6 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse8 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse9 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 8))) (let ((.cse2 (= (select .cse8 .cse9) 0)) (.cse5 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.offset| 0)) (.cse3 (select .cse6 .cse9))) (let ((.cse0 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse7 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 24)) (.cse1 (and .cse2 .cse5 (= .cse3 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|)))) (and (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.base| 0) (= (select .cse0 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset|) 0) (or .cse1 (and .cse2 (= .cse3 0))) (= |ULTIMATE.start_assert_bytes_match_~b#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.capacity| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|) (let ((.cse4 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.offset| 0))) (or (and .cse4 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| 0)) (and (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse4))) .cse5 (= (select .cse0 (+ 16 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset|)) |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.len| 0) (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.base| 0)) (= (select .cse6 .cse7) 0) (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base| 0)) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|) (<= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| (+ (* (div (+ (- 1) |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1|) 18446744073709551616) 18446744073709551616) 36028797018963967)) (= |ULTIMATE.start_assert_bytes_match_~b#1.base| |ULTIMATE.start_assert_bytes_match_~a#1.base|) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.offset| 0) (= 0 (select .cse8 .cse7)) (not (= |ULTIMATE.start_assert_bytes_match_~a#1.base| 0)) (= |ULTIMATE.start_assert_bytes_match_~a#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 0) (or (and (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_#t~mem1205#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_#t~mem1205#1.base| 0)) .cse1))))) [2022-11-25 15:48:07,972 INFO L899 garLoopResultBuilder]: For program point L8230-2(line 8230) no Hoare annotation was computed. [2022-11-25 15:48:07,973 INFO L895 garLoopResultBuilder]: At program point L8967(line 8967) the Hoare annotation is: (let ((.cse19 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 24)) (.cse20 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse16 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.offset| 0)) (.cse18 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse21 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 8)) (.cse22 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|))) (let ((.cse0 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.base| 0)) (.cse1 (= (select .cse22 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset|) 0)) (.cse2 (= (select .cse18 .cse21) 0)) (.cse3 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.capacity| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse6 (and .cse16 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| 0))) (.cse4 (= (select .cse22 (+ 16 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset|)) |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse5 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.len| 0)) (.cse7 (select .cse20 .cse21)) (.cse8 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_#t~mem1202#1| 0)) (.cse9 (= (select .cse20 .cse19) 0)) (.cse10 (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base| 0))) (.cse11 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.offset| 0)) (.cse12 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse13 (or (<= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| (* (div |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| 18446744073709551616) 18446744073709551616)) (<= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| (+ (* (div (+ (- 1) |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1|) 18446744073709551616) 18446744073709551616) 36028797018963967)))) (.cse14 (= 0 (select .cse18 .cse19))) (.cse15 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 0))) (or (and .cse0 .cse1 (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base| 0)) .cse2 .cse3 .cse4 .cse5 (or .cse6 (<= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.capacity| (+ 36028797018963967 (* 18446744073709551616 (div (+ (- 1) |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.capacity|) 18446744073709551616))))) (= .cse7 0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 (or .cse6 (and (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse16)) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.offset| 0) .cse4 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse5 (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.base| 0)) (= .cse7 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.offset| 0) .cse14 .cse15 (exists ((|v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8| Int)) (let ((.cse17 (select (select |#memory_int| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8|) 16))) (and (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.capacity| .cse17) (not (= (mod .cse17 18446744073709551616) 0))))))))) [2022-11-25 15:48:07,973 INFO L895 garLoopResultBuilder]: At program point L8230-1(line 8230) the Hoare annotation is: (let ((.cse18 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base|))) (let ((.cse0 (select .cse18 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset| 16))) (.cse15 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base|)) (.cse16 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset| 8)) (.cse19 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base|)) (.cse17 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset| 24))) (let ((.cse1 (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base| 0))) (.cse2 (= 0 (select .cse19 .cse17))) (.cse4 (<= |ULTIMATE.start_aws_byte_buf_from_empty_array_#t~ret1050#1| 1)) (.cse5 (<= 1 |ULTIMATE.start_aws_byte_buf_from_empty_array_#t~ret1050#1|)) (.cse3 (select .cse19 .cse16)) (.cse6 (= (select .cse18 |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset|) 0)) (.cse7 (= (select .cse15 .cse17) 0)) (.cse8 (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base| 0))) (.cse9 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse10 (= .cse0 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse11 (or (<= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| (* (div |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| 18446744073709551616) 18446744073709551616)) (<= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| (+ (* (div (+ (- 1) |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1|) 18446744073709551616) 18446744073709551616) 36028797018963967)))) (.cse12 (= (select .cse15 .cse16) 0)) (.cse13 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset| 0)) (.cse14 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 0))) (or (and (<= .cse0 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse0) 18446744073709551616)))) .cse1 .cse2 (= .cse3 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse4 .cse5 .cse6 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.base| 0)) .cse7 .cse8 .cse9 .cse10 .cse11 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.offset| 0) .cse12 .cse13 .cse14) (and .cse1 .cse2 .cse4 .cse5 (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base| 0)) (= .cse3 0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14))))) [2022-11-25 15:48:07,973 INFO L899 garLoopResultBuilder]: For program point L8967-1(line 8967) no Hoare annotation was computed. [2022-11-25 15:48:07,973 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-25 15:48:07,973 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-25 15:48:07,973 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-11-25 15:48:07,974 INFO L899 garLoopResultBuilder]: For program point L7099(lines 7099 7112) no Hoare annotation was computed. [2022-11-25 15:48:07,974 INFO L899 garLoopResultBuilder]: For program point L8959(lines 8959 8975) no Hoare annotation was computed. [2022-11-25 15:48:07,974 INFO L899 garLoopResultBuilder]: For program point L8972(lines 8972 8974) no Hoare annotation was computed. [2022-11-25 15:48:07,974 INFO L899 garLoopResultBuilder]: For program point L8972-2(lines 8972 8974) no Hoare annotation was computed. [2022-11-25 15:48:07,974 INFO L902 garLoopResultBuilder]: At program point L8976(line 8976) the Hoare annotation is: true [2022-11-25 15:48:07,974 INFO L895 garLoopResultBuilder]: At program point L8966-1(line 8966) the Hoare annotation is: (let ((.cse20 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 24)) (.cse21 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse6 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.offset| 0)) (.cse19 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse22 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 8)) (.cse23 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|))) (let ((.cse0 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.base| 0)) (.cse1 (= (select .cse23 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset|) 0)) (.cse2 (<= 1 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_#t~ret1201#1|)) (.cse3 (= (select .cse19 .cse22) 0)) (.cse4 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.capacity| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse7 (= (select .cse23 (+ 16 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset|)) |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse8 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.len| 0)) (.cse5 (and .cse6 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| 0))) (.cse9 (select .cse21 .cse22)) (.cse10 (= (select .cse21 .cse20) 0)) (.cse11 (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base| 0))) (.cse12 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.offset| 0)) (.cse13 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse14 (or (<= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| (* (div |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| 18446744073709551616) 18446744073709551616)) (<= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| (+ (* (div (+ (- 1) |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1|) 18446744073709551616) 18446744073709551616) 36028797018963967)))) (.cse15 (= 0 (select .cse19 .cse20))) (.cse16 (<= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_#t~ret1201#1| 1)) (.cse17 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (or .cse5 (and (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse6)) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.offset| 0) .cse7 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse8 (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.base| 0)) (= .cse9 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse10 .cse11 .cse12 .cse13 .cse14 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.offset| 0) .cse15 .cse16 .cse17 (exists ((|v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8| Int)) (let ((.cse18 (select (select |#memory_int| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8|) 16))) (and (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.capacity| .cse18) (not (= (mod .cse18 18446744073709551616) 0)))))) (and .cse0 .cse1 .cse2 (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base| 0)) .cse3 .cse4 .cse7 .cse8 (or .cse5 (<= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.capacity| (+ 36028797018963967 (* 18446744073709551616 (div (+ (- 1) |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.capacity|) 18446744073709551616))))) (= .cse9 0) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17)))) [2022-11-25 15:48:07,975 INFO L895 garLoopResultBuilder]: At program point L7110(line 7110) the Hoare annotation is: (let ((.cse22 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse20 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse26 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 8))) (let ((.cse1 (= (select .cse20 .cse26) 0)) (.cse24 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.offset| 0)) (.cse25 (select .cse22 .cse26))) (let ((.cse2 (= .cse25 0)) (.cse18 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| 0)) (.cse9 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.offset| 0)) (.cse0 (and .cse1 .cse24 (= .cse25 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|)))) (and (= |ULTIMATE.start_assert_bytes_match_#t~mem585#1| |ULTIMATE.start_assert_bytes_match_#t~mem584#1|) (or .cse0 (and .cse1 .cse2)) (let ((.cse21 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 24)) (.cse23 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|))) (let ((.cse3 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.base| 0)) (.cse4 (= (select .cse23 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset|) 0)) (.cse5 (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base| 0))) (.cse6 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.capacity| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse7 (= (select .cse23 (+ 16 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset|)) |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse8 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.len| 0)) (.cse10 (= (select .cse22 .cse21) 0)) (.cse11 (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base| 0))) (.cse12 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.offset| 0)) (.cse13 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse14 (or (<= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| (* (div |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| 18446744073709551616) 18446744073709551616)) (<= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| (+ (* (div (+ (- 1) |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1|) 18446744073709551616) 18446744073709551616) 36028797018963967)))) (.cse15 (= 0 (select .cse20 .cse21))) (.cse16 (not (= |ULTIMATE.start_assert_bytes_match_~a#1.base| 0))) (.cse17 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 0))) (or (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse2 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (exists ((|v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8| Int)) (let ((.cse19 (select (select |#memory_int| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8|) 16))) (and (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.capacity| .cse19) (not (= (mod .cse19 18446744073709551616) 0))))))))) (= |ULTIMATE.start_assert_bytes_match_~b#1.offset| 0) (or (and .cse9 .cse18) (and (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse9)) .cse24 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) (= |ULTIMATE.start_assert_bytes_match_~b#1.base| |ULTIMATE.start_assert_bytes_match_~a#1.base|) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.offset| 0) (= |ULTIMATE.start_assert_bytes_match_~a#1.offset| 0) (or (and (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_#t~mem1205#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_#t~mem1205#1.base| 0)) .cse0))))) [2022-11-25 15:48:07,975 INFO L895 garLoopResultBuilder]: At program point L8231(lines 8218 8232) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.base| 0)) (.cse1 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.capacity| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse2 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.len| 0)) (.cse5 (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base| 0))) (.cse6 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.offset| 0)) (.cse7 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse8 (or (<= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| (* (div |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| 18446744073709551616) 18446744073709551616)) (<= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| (+ (* (div (+ (- 1) |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1|) 18446744073709551616) 18446744073709551616) 36028797018963967)))) (.cse9 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 0))) (or (and .cse0 (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base| 0)) .cse1 .cse2 (exists ((|v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_9| Int)) (let ((.cse3 (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_9|) 8)) (.cse4 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_9|) 8))) (and (= .cse3 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.offset| .cse3) (= .cse4 |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base|) (= .cse4 0)))) .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 (let ((.cse10 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.offset| 0))) (or (and .cse10 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| 0)) (and (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse10))) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse2 (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.base| 0)) .cse5 .cse6 .cse7 .cse8 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.offset| 0) .cse9 (exists ((|v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8| Int)) (let ((.cse11 (select (select |#memory_int| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8|) 16))) (and (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.capacity| .cse11) (not (= (mod .cse11 18446744073709551616) 0)))))))) [2022-11-25 15:48:07,975 INFO L899 garLoopResultBuilder]: For program point L8966-2(line 8966) no Hoare annotation was computed. [2022-11-25 15:48:07,976 INFO L895 garLoopResultBuilder]: At program point L7106(line 7106) the Hoare annotation is: (let ((.cse6 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse8 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse9 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 8))) (let ((.cse2 (= (select .cse8 .cse9) 0)) (.cse5 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.offset| 0)) (.cse3 (select .cse6 .cse9))) (let ((.cse0 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse7 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 24)) (.cse1 (and .cse2 .cse5 (= .cse3 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|)))) (and (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.base| 0) (= (select .cse0 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset|) 0) (or .cse1 (and .cse2 (= .cse3 0))) (= |ULTIMATE.start_assert_bytes_match_~b#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.capacity| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|) (let ((.cse4 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.offset| 0))) (or (and .cse4 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| 0)) (and (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse4))) .cse5 (= (select .cse0 (+ 16 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset|)) |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.len| 0) (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.base| 0)) (= (select .cse6 .cse7) 0) (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base| 0)) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|) (<= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| (+ (* (div (+ (- 1) |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1|) 18446744073709551616) 18446744073709551616) 36028797018963967)) (= |ULTIMATE.start_assert_bytes_match_~b#1.base| |ULTIMATE.start_assert_bytes_match_~a#1.base|) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.offset| 0) (= 0 (select .cse8 .cse7)) (not (= |ULTIMATE.start_assert_bytes_match_~a#1.base| 0)) (= |ULTIMATE.start_assert_bytes_match_~a#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 0) (or (and (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_#t~mem1205#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_#t~mem1205#1.base| 0)) .cse1))))) [2022-11-25 15:48:07,976 INFO L895 garLoopResultBuilder]: At program point L8968(line 8968) the Hoare annotation is: (let ((.cse19 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 24)) (.cse20 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse5 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.offset| 0)) (.cse18 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse21 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 8)) (.cse22 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|))) (let ((.cse0 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.base| 0)) (.cse1 (= (select .cse22 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset|) 0)) (.cse2 (= (select .cse18 .cse21) 0)) (.cse3 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.capacity| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse6 (= (select .cse22 (+ 16 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset|)) |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse7 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.len| 0)) (.cse8 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_#t~mem1203#1| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse4 (and .cse5 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| 0))) (.cse9 (select .cse20 .cse21)) (.cse10 (= (select .cse20 .cse19) 0)) (.cse11 (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base| 0))) (.cse12 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.offset| 0)) (.cse13 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse14 (or (<= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| (* (div |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| 18446744073709551616) 18446744073709551616)) (<= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| (+ (* (div (+ (- 1) |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1|) 18446744073709551616) 18446744073709551616) 36028797018963967)))) (.cse15 (= 0 (select .cse18 .cse19))) (.cse16 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 0))) (or (and .cse0 .cse1 .cse2 .cse3 (or .cse4 (and (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse5)) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.offset| 0) .cse6 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse7 .cse8 (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.base| 0)) (= .cse9 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse10 .cse11 .cse12 .cse13 .cse14 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.offset| 0) .cse15 .cse16 (exists ((|v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8| Int)) (let ((.cse17 (select (select |#memory_int| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8|) 16))) (and (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.capacity| .cse17) (not (= (mod .cse17 18446744073709551616) 0)))))) (and .cse0 .cse1 (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base| 0)) .cse2 .cse3 .cse6 .cse7 .cse8 (or .cse4 (<= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.capacity| (+ 36028797018963967 (* 18446744073709551616 (div (+ (- 1) |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.capacity|) 18446744073709551616))))) (= .cse9 0) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16)))) [2022-11-25 15:48:07,976 INFO L899 garLoopResultBuilder]: For program point L8968-1(line 8968) no Hoare annotation was computed. [2022-11-25 15:48:07,977 INFO L895 garLoopResultBuilder]: At program point L8966(line 8966) the Hoare annotation is: (let ((.cse21 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse23 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 8)) (.cse24 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse22 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 24)) (.cse25 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|))) (let ((.cse0 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.base| 0)) (.cse1 (= (select .cse25 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset|) 0)) (.cse2 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.capacity| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse3 (= (select .cse25 (+ 16 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset|)) |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse4 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.len| 0)) (.cse5 (= (select .cse24 .cse22) 0)) (.cse12 (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base| 0))) (.cse13 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.offset| 0)) (.cse14 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse15 (or (<= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| (* (div |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| 18446744073709551616) 18446744073709551616)) (<= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| (+ (* (div (+ (- 1) |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1|) 18446744073709551616) 18446744073709551616) 36028797018963967)))) (.cse8 (select .cse24 .cse23)) (.cse9 (select .cse21 .cse23)) (.cse16 (= 0 (select .cse21 .cse22))) (.cse17 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 0))) (or (and .cse0 .cse1 (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base| 0)) .cse2 .cse3 .cse4 .cse5 (exists ((|v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_9| Int)) (let ((.cse6 (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_9|) 8)) (.cse7 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_9|) 8))) (and (= .cse6 0) (= .cse7 .cse8) (= .cse6 .cse9) (= .cse7 0)))) (exists ((|v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_9| Int)) (let ((.cse10 (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_9|) 8)) (.cse11 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_9|) 8))) (and (= .cse10 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.offset| .cse10) (= .cse11 |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base|) (= .cse11 0)))) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 (let ((.cse18 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.offset| 0))) (or (and .cse18 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| 0)) (and (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse18))) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.offset| 0) .cse3 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse4 (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.base| 0)) .cse5 .cse12 .cse13 .cse14 .cse15 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.offset| 0) (let ((.cse19 (= .cse9 0))) (or (and .cse19 (= .cse8 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|)) (and .cse19 (= .cse8 0)))) .cse16 .cse17 (exists ((|v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8| Int)) (let ((.cse20 (select (select |#memory_int| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8|) 16))) (and (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.capacity| .cse20) (not (= (mod .cse20 18446744073709551616) 0))))))))) [2022-11-25 15:48:07,977 INFO L899 garLoopResultBuilder]: For program point L7110-1(line 7110) no Hoare annotation was computed. [2022-11-25 15:48:07,977 INFO L899 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2022-11-25 15:48:07,977 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 222 224) the Hoare annotation is: true [2022-11-25 15:48:07,978 INFO L899 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2022-11-25 15:48:07,978 INFO L899 garLoopResultBuilder]: For program point L223-3(lines 222 224) no Hoare annotation was computed. [2022-11-25 15:48:07,978 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 222 224) no Hoare annotation was computed. [2022-11-25 15:48:07,978 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2022-11-25 15:48:07,981 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] [2022-11-25 15:48:07,983 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 15:48:08,000 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-11-25 15:48:08,001 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-25 15:48:08,002 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_9,QUANTIFIED] [2022-11-25 15:48:08,002 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-11-25 15:48:08,003 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-25 15:48:08,003 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_9,QUANTIFIED] [2022-11-25 15:48:08,003 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 15:48:08,003 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_9,QUANTIFIED] [2022-11-25 15:48:08,004 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-11-25 15:48:08,004 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 15:48:08,004 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_9,QUANTIFIED] [2022-11-25 15:48:08,011 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-11-25 15:48:08,011 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-11-25 15:48:08,012 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-11-25 15:48:08,012 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-11-25 15:48:08,012 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-11-25 15:48:08,013 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-11-25 15:48:08,013 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-11-25 15:48:08,013 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] [2022-11-25 15:48:08,014 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] [2022-11-25 15:48:08,017 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-11-25 15:48:08,020 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-25 15:48:08,020 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_9,QUANTIFIED] [2022-11-25 15:48:08,020 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-11-25 15:48:08,021 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-25 15:48:08,021 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_9,QUANTIFIED] [2022-11-25 15:48:08,021 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 15:48:08,021 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_9,QUANTIFIED] [2022-11-25 15:48:08,022 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-11-25 15:48:08,022 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 15:48:08,022 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_9,QUANTIFIED] [2022-11-25 15:48:08,022 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-11-25 15:48:08,023 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-11-25 15:48:08,023 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-11-25 15:48:08,023 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-11-25 15:48:08,023 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-11-25 15:48:08,024 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-11-25 15:48:08,024 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-11-25 15:48:08,024 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] [2022-11-25 15:48:08,025 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] [2022-11-25 15:48:08,027 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 03:48:08 BoogieIcfgContainer [2022-11-25 15:48:08,028 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 15:48:08,028 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 15:48:08,028 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 15:48:08,029 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 15:48:08,029 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:46:46" (3/4) ... [2022-11-25 15:48:08,032 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-25 15:48:08,039 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure bounded_malloc [2022-11-25 15:48:08,039 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_uint64_t [2022-11-25 15:48:08,039 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_byte_buf_is_valid [2022-11-25 15:48:08,039 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2022-11-25 15:48:08,040 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2022-11-25 15:48:08,051 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 117 nodes and edges [2022-11-25 15:48:08,053 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 55 nodes and edges [2022-11-25 15:48:08,054 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 25 nodes and edges [2022-11-25 15:48:08,055 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2022-11-25 15:48:08,056 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2022-11-25 15:48:08,057 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-11-25 15:48:08,058 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-25 15:48:08,058 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-25 15:48:08,090 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((aws_byte_buf_from_empty_array_#res#1.allocator == 0 && !(array == 0)) && unknown-#res!capacity-unknown == capacity) && unknown-#res!len-unknown == 0) && (\exists v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_9 : int :: ((#memory_$Pointer$[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_9][8] == 0 && aws_byte_buf_from_empty_array_#res#1.buffer == #memory_$Pointer$[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_9][8]) && #memory_$Pointer$[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_9][8] == aws_byte_buf_from_empty_array_#res#1.buffer) && #memory_$Pointer$[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_9][8] == 0)) && !(buf == 0)) && aws_byte_buf_from_empty_array_#res#1.allocator == 0) && capacity == capacity) && (capacity <= capacity / 18446744073709551616 * 18446744073709551616 || capacity <= (-1 + capacity) / 18446744073709551616 * 18446744073709551616 + 36028797018963967)) && buf == 0) || (((((((((((((aws_byte_buf_from_empty_array_#res#1.allocator == 0 && unknown-#res!capacity-unknown == capacity) && ((aws_byte_buf_from_empty_array_#res#1.buffer == 0 && aws_byte_buf_from_empty_array_#res#1.buffer == 0) || (aws_byte_buf_from_empty_array_#res#1.buffer == array && aws_byte_buf_from_empty_array_#res#1.buffer == 0))) && array == 0) && bytes == array) && unknown-#res!len-unknown == 0) && !(bytes == 0)) && !(buf == 0)) && aws_byte_buf_from_empty_array_#res#1.allocator == 0) && capacity == capacity) && (capacity <= capacity / 18446744073709551616 * 18446744073709551616 || capacity <= (-1 + capacity) / 18446744073709551616 * 18446744073709551616 + 36028797018963967)) && bytes == 0) && buf == 0) && (\exists v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8 : int :: unknown-#res!capacity-unknown == unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8][16] && !(unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8][16] % 18446744073709551616 == 0))) [2022-11-25 15:48:08,497 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba5571e8-93c2-4fee-9bfe-87db15f63ae6/bin/uautomizer-ZsLfNo2U6R/witness.graphml [2022-11-25 15:48:08,497 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 15:48:08,498 INFO L158 Benchmark]: Toolchain (without parser) took 87798.72ms. Allocated memory was 169.9MB in the beginning and 1.1GB in the end (delta: 931.1MB). Free memory was 123.1MB in the beginning and 516.2MB in the end (delta: -393.0MB). Peak memory consumption was 537.7MB. Max. memory is 16.1GB. [2022-11-25 15:48:08,498 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 132.1MB. Free memory was 76.9MB in the beginning and 76.8MB in the end (delta: 117.7kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 15:48:08,499 INFO L158 Benchmark]: CACSL2BoogieTranslator took 3261.10ms. Allocated memory is still 169.9MB. Free memory was 122.5MB in the beginning and 65.3MB in the end (delta: 57.1MB). Peak memory consumption was 81.9MB. Max. memory is 16.1GB. [2022-11-25 15:48:08,499 INFO L158 Benchmark]: Boogie Procedure Inliner took 267.22ms. Allocated memory is still 169.9MB. Free memory was 65.3MB in the beginning and 107.5MB in the end (delta: -42.1MB). Peak memory consumption was 16.3MB. Max. memory is 16.1GB. [2022-11-25 15:48:08,499 INFO L158 Benchmark]: Boogie Preprocessor took 125.53ms. Allocated memory is still 169.9MB. Free memory was 107.5MB in the beginning and 101.0MB in the end (delta: 6.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-25 15:48:08,500 INFO L158 Benchmark]: RCFGBuilder took 1851.74ms. Allocated memory was 169.9MB in the beginning and 232.8MB in the end (delta: 62.9MB). Free memory was 101.0MB in the beginning and 160.2MB in the end (delta: -59.2MB). Peak memory consumption was 78.5MB. Max. memory is 16.1GB. [2022-11-25 15:48:08,500 INFO L158 Benchmark]: TraceAbstraction took 81815.39ms. Allocated memory was 232.8MB in the beginning and 1.1GB in the end (delta: 868.2MB). Free memory was 159.2MB in the beginning and 646.2MB in the end (delta: -487.0MB). Peak memory consumption was 649.7MB. Max. memory is 16.1GB. [2022-11-25 15:48:08,500 INFO L158 Benchmark]: Witness Printer took 469.29ms. Allocated memory is still 1.1GB. Free memory was 646.2MB in the beginning and 516.2MB in the end (delta: 130.0MB). Peak memory consumption was 127.9MB. Max. memory is 16.1GB. [2022-11-25 15:48:08,502 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.31ms. Allocated memory is still 132.1MB. Free memory was 76.9MB in the beginning and 76.8MB in the end (delta: 117.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 3261.10ms. Allocated memory is still 169.9MB. Free memory was 122.5MB in the beginning and 65.3MB in the end (delta: 57.1MB). Peak memory consumption was 81.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 267.22ms. Allocated memory is still 169.9MB. Free memory was 65.3MB in the beginning and 107.5MB in the end (delta: -42.1MB). Peak memory consumption was 16.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 125.53ms. Allocated memory is still 169.9MB. Free memory was 107.5MB in the beginning and 101.0MB in the end (delta: 6.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1851.74ms. Allocated memory was 169.9MB in the beginning and 232.8MB in the end (delta: 62.9MB). Free memory was 101.0MB in the beginning and 160.2MB in the end (delta: -59.2MB). Peak memory consumption was 78.5MB. Max. memory is 16.1GB. * TraceAbstraction took 81815.39ms. Allocated memory was 232.8MB in the beginning and 1.1GB in the end (delta: 868.2MB). Free memory was 159.2MB in the beginning and 646.2MB in the end (delta: -487.0MB). Peak memory consumption was 649.7MB. Max. memory is 16.1GB. * Witness Printer took 469.29ms. Allocated memory is still 1.1GB. Free memory was 646.2MB in the beginning and 516.2MB in the end (delta: 130.0MB). Peak memory consumption was 127.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 69 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 81.7s, OverallIterations: 25, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 28.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 7.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2 mSolverCounterUnknown, 2363 SdHoareTripleChecker+Valid, 20.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2291 mSDsluCounter, 4153 SdHoareTripleChecker+Invalid, 18.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3199 mSDsCounter, 758 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 12241 IncrementalHoareTripleChecker+Invalid, 13001 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 758 mSolverCounterUnsat, 954 mSDtfsCounter, 12241 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1037 GetRequests, 623 SyntacticMatches, 19 SemanticMatches, 395 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1957 ImplicationChecksByTransitivity, 12.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=212occurred in iteration=22, InterpolantAutomatonStates: 281, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 25 MinimizatonAttempts, 260 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 21 LocationsWithAnnotation, 222 PreInvPairs, 250 NumberOfFragments, 2914 HoareAnnotationTreeSize, 222 FomulaSimplifications, 928 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 21 FomulaSimplificationsInter, 10825 FormulaSimplificationTreeSizeReductionInter, 6.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 6.1s SatisfiabilityAnalysisTime, 36.9s InterpolantComputationTime, 1568 NumberOfCodeBlocks, 1568 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 1540 ConstructedInterpolants, 82 QuantifiedInterpolants, 9164 SizeOfPredicates, 40 NumberOfNonLiveVariables, 7547 ConjunctsInSsa, 112 ConjunctsInUnsatCore, 28 InterpolantComputations, 22 PerfectInterpolantSequences, 626/675 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 8976]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 8218]: Loop Invariant [2022-11-25 15:48:08,514 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-11-25 15:48:08,515 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-25 15:48:08,515 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_9,QUANTIFIED] [2022-11-25 15:48:08,515 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-11-25 15:48:08,515 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-25 15:48:08,516 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_9,QUANTIFIED] [2022-11-25 15:48:08,516 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 15:48:08,516 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_9,QUANTIFIED] [2022-11-25 15:48:08,516 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-11-25 15:48:08,516 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 15:48:08,517 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_9,QUANTIFIED] [2022-11-25 15:48:08,517 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-11-25 15:48:08,517 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-11-25 15:48:08,517 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-11-25 15:48:08,518 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-11-25 15:48:08,518 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-11-25 15:48:08,518 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-11-25 15:48:08,519 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-11-25 15:48:08,519 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] [2022-11-25 15:48:08,519 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] [2022-11-25 15:48:08,521 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-11-25 15:48:08,521 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-25 15:48:08,521 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_9,QUANTIFIED] [2022-11-25 15:48:08,521 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-11-25 15:48:08,522 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-25 15:48:08,522 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_9,QUANTIFIED] [2022-11-25 15:48:08,522 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 15:48:08,522 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_9,QUANTIFIED] [2022-11-25 15:48:08,523 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-11-25 15:48:08,523 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 15:48:08,523 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_9,QUANTIFIED] [2022-11-25 15:48:08,523 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-11-25 15:48:08,523 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-11-25 15:48:08,524 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-11-25 15:48:08,524 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-11-25 15:48:08,524 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-11-25 15:48:08,525 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-11-25 15:48:08,525 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-11-25 15:48:08,525 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] [2022-11-25 15:48:08,525 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8,QUANTIFIED] Derived loop invariant: (((((((((aws_byte_buf_from_empty_array_#res#1.allocator == 0 && !(array == 0)) && unknown-#res!capacity-unknown == capacity) && unknown-#res!len-unknown == 0) && (\exists v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_9 : int :: ((#memory_$Pointer$[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_9][8] == 0 && aws_byte_buf_from_empty_array_#res#1.buffer == #memory_$Pointer$[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_9][8]) && #memory_$Pointer$[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_9][8] == aws_byte_buf_from_empty_array_#res#1.buffer) && #memory_$Pointer$[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_9][8] == 0)) && !(buf == 0)) && aws_byte_buf_from_empty_array_#res#1.allocator == 0) && capacity == capacity) && (capacity <= capacity / 18446744073709551616 * 18446744073709551616 || capacity <= (-1 + capacity) / 18446744073709551616 * 18446744073709551616 + 36028797018963967)) && buf == 0) || (((((((((((((aws_byte_buf_from_empty_array_#res#1.allocator == 0 && unknown-#res!capacity-unknown == capacity) && ((aws_byte_buf_from_empty_array_#res#1.buffer == 0 && aws_byte_buf_from_empty_array_#res#1.buffer == 0) || (aws_byte_buf_from_empty_array_#res#1.buffer == array && aws_byte_buf_from_empty_array_#res#1.buffer == 0))) && array == 0) && bytes == array) && unknown-#res!len-unknown == 0) && !(bytes == 0)) && !(buf == 0)) && aws_byte_buf_from_empty_array_#res#1.allocator == 0) && capacity == capacity) && (capacity <= capacity / 18446744073709551616 * 18446744073709551616 || capacity <= (-1 + capacity) / 18446744073709551616 * 18446744073709551616 + 36028797018963967)) && bytes == 0) && buf == 0) && (\exists v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8 : int :: unknown-#res!capacity-unknown == unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8][16] && !(unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8][16] % 18446744073709551616 == 0))) RESULT: Ultimate proved your program to be correct! [2022-11-25 15:48:08,554 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba5571e8-93c2-4fee-9bfe-87db15f63ae6/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE