./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 8393723b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d01c404-b81e-4cba-a1ce-c27f4c26020e/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d01c404-b81e-4cba-a1ce-c27f4c26020e/bin/uautomizer-TMbwUNV5ro/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d01c404-b81e-4cba-a1ce-c27f4c26020e/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d01c404-b81e-4cba-a1ce-c27f4c26020e/bin/uautomizer-TMbwUNV5ro/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_4d01c404-b81e-4cba-a1ce-c27f4c26020e/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d01c404-b81e-4cba-a1ce-c27f4c26020e/bin/uautomizer-TMbwUNV5ro --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-8393723 [2022-11-18 19:43:23,441 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 19:43:23,444 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 19:43:23,485 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 19:43:23,486 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 19:43:23,490 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 19:43:23,495 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 19:43:23,503 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 19:43:23,506 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 19:43:23,513 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 19:43:23,515 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 19:43:23,516 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 19:43:23,516 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 19:43:23,518 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 19:43:23,519 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 19:43:23,521 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 19:43:23,522 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 19:43:23,526 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 19:43:23,528 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 19:43:23,541 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 19:43:23,544 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 19:43:23,546 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 19:43:23,550 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 19:43:23,551 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 19:43:23,562 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 19:43:23,563 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 19:43:23,563 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 19:43:23,566 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 19:43:23,567 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 19:43:23,568 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 19:43:23,569 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 19:43:23,571 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 19:43:23,573 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 19:43:23,575 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 19:43:23,578 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 19:43:23,578 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 19:43:23,579 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 19:43:23,580 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 19:43:23,580 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 19:43:23,581 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 19:43:23,582 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 19:43:23,583 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d01c404-b81e-4cba-a1ce-c27f4c26020e/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-11-18 19:43:23,635 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 19:43:23,635 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 19:43:23,636 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 19:43:23,637 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 19:43:23,638 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 19:43:23,638 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 19:43:23,639 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 19:43:23,639 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 19:43:23,640 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 19:43:23,640 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 19:43:23,642 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-18 19:43:23,642 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 19:43:23,642 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-18 19:43:23,643 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 19:43:23,643 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-18 19:43:23,643 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-18 19:43:23,644 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 19:43:23,644 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-18 19:43:23,644 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 19:43:23,645 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 19:43:23,645 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 19:43:23,645 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 19:43:23,646 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 19:43:23,646 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 19:43:23,646 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-18 19:43:23,646 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-18 19:43:23,647 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-18 19:43:23,647 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-18 19:43:23,648 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-18 19:43:23,648 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-18 19:43:23,648 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d01c404-b81e-4cba-a1ce-c27f4c26020e/bin/uautomizer-TMbwUNV5ro/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_4d01c404-b81e-4cba-a1ce-c27f4c26020e/bin/uautomizer-TMbwUNV5ro 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-18 19:43:24,078 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 19:43:24,116 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 19:43:24,120 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 19:43:24,121 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 19:43:24,122 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 19:43:24,124 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d01c404-b81e-4cba-a1ce-c27f4c26020e/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/aws-c-common/aws_byte_buf_from_empty_array_harness.i [2022-11-18 19:43:24,220 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d01c404-b81e-4cba-a1ce-c27f4c26020e/bin/uautomizer-TMbwUNV5ro/data/41ab866f6/9b8ffa7e18754b488c749e6e97d35385/FLAG594c01cc1 [2022-11-18 19:43:25,416 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 19:43:25,417 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d01c404-b81e-4cba-a1ce-c27f4c26020e/sv-benchmarks/c/aws-c-common/aws_byte_buf_from_empty_array_harness.i [2022-11-18 19:43:25,485 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d01c404-b81e-4cba-a1ce-c27f4c26020e/bin/uautomizer-TMbwUNV5ro/data/41ab866f6/9b8ffa7e18754b488c749e6e97d35385/FLAG594c01cc1 [2022-11-18 19:43:25,724 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d01c404-b81e-4cba-a1ce-c27f4c26020e/bin/uautomizer-TMbwUNV5ro/data/41ab866f6/9b8ffa7e18754b488c749e6e97d35385 [2022-11-18 19:43:25,729 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 19:43:25,731 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 19:43:25,735 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 19:43:25,736 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 19:43:25,740 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 19:43:25,741 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 07:43:25" (1/1) ... [2022-11-18 19:43:25,743 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1eb853d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:43:25, skipping insertion in model container [2022-11-18 19:43:25,743 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 07:43:25" (1/1) ... [2022-11-18 19:43:25,754 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 19:43:25,919 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 19:43:26,277 WARN L234 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_4d01c404-b81e-4cba-a1ce-c27f4c26020e/sv-benchmarks/c/aws-c-common/aws_byte_buf_from_empty_array_harness.i[4503,4516] [2022-11-18 19:43:26,287 WARN L234 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_4d01c404-b81e-4cba-a1ce-c27f4c26020e/sv-benchmarks/c/aws-c-common/aws_byte_buf_from_empty_array_harness.i[4563,4576] [2022-11-18 19:43:27,652 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 19:43:27,653 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 19:43:27,654 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 19:43:27,656 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 19:43:27,657 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 19:43:27,682 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 19:43:27,688 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 19:43:27,691 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 19:43:27,693 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 19:43:28,311 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-11-18 19:43:28,317 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-11-18 19:43:28,321 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-11-18 19:43:28,323 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-11-18 19:43:28,325 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-11-18 19:43:28,326 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-11-18 19:43:28,327 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-11-18 19:43:28,328 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-11-18 19:43:28,329 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-11-18 19:43:28,330 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-11-18 19:43:28,545 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-11-18 19:43:28,753 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 19:43:28,764 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 19:43:28,900 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 19:43:28,992 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 19:43:29,022 WARN L234 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_4d01c404-b81e-4cba-a1ce-c27f4c26020e/sv-benchmarks/c/aws-c-common/aws_byte_buf_from_empty_array_harness.i[4503,4516] [2022-11-18 19:43:29,029 WARN L234 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_4d01c404-b81e-4cba-a1ce-c27f4c26020e/sv-benchmarks/c/aws-c-common/aws_byte_buf_from_empty_array_harness.i[4563,4576] [2022-11-18 19:43:29,097 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 19:43:29,098 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 19:43:29,100 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 19:43:29,102 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 19:43:29,111 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 19:43:29,125 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 19:43:29,126 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 19:43:29,128 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 19:43:29,129 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 19:43:29,196 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-11-18 19:43:29,198 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-11-18 19:43:29,199 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-11-18 19:43:29,200 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-11-18 19:43:29,201 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-11-18 19:43:29,202 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-11-18 19:43:29,203 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-11-18 19:43:29,207 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-11-18 19:43:29,208 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-11-18 19:43:29,208 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-11-18 19:43:29,257 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-11-18 19:43:29,348 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 19:43:29,349 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-18 19:43:29,433 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 19:43:29,780 INFO L208 MainTranslator]: Completed translation [2022-11-18 19:43:29,781 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:43:29 WrapperNode [2022-11-18 19:43:29,781 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 19:43:29,782 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 19:43:29,783 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 19:43:29,783 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 19:43:29,793 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:43:29" (1/1) ... [2022-11-18 19:43:29,943 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:43:29" (1/1) ... [2022-11-18 19:43:30,069 INFO L138 Inliner]: procedures = 690, calls = 2613, calls flagged for inlining = 59, calls inlined = 5, statements flattened = 789 [2022-11-18 19:43:30,069 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 19:43:30,070 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 19:43:30,070 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 19:43:30,070 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 19:43:30,082 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:43:29" (1/1) ... [2022-11-18 19:43:30,083 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:43:29" (1/1) ... [2022-11-18 19:43:30,091 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:43:29" (1/1) ... [2022-11-18 19:43:30,094 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:43:29" (1/1) ... [2022-11-18 19:43:30,145 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:43:29" (1/1) ... [2022-11-18 19:43:30,149 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:43:29" (1/1) ... [2022-11-18 19:43:30,186 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:43:29" (1/1) ... [2022-11-18 19:43:30,190 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:43:29" (1/1) ... [2022-11-18 19:43:30,212 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 19:43:30,216 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 19:43:30,216 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 19:43:30,217 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 19:43:30,218 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:43:29" (1/1) ... [2022-11-18 19:43:30,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 19:43:30,240 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d01c404-b81e-4cba-a1ce-c27f4c26020e/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:43:30,260 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d01c404-b81e-4cba-a1ce-c27f4c26020e/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 19:43:30,270 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d01c404-b81e-4cba-a1ce-c27f4c26020e/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 19:43:30,326 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_buf_is_valid [2022-11-18 19:43:30,327 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_buf_is_valid [2022-11-18 19:43:30,327 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-18 19:43:30,327 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-18 19:43:30,328 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-18 19:43:30,328 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-18 19:43:30,328 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-18 19:43:30,328 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-18 19:43:30,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-18 19:43:30,329 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 19:43:30,330 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 19:43:30,331 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2022-11-18 19:43:30,331 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2022-11-18 19:43:30,332 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-11-18 19:43:30,332 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-11-18 19:43:30,332 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-18 19:43:30,332 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-18 19:43:30,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-18 19:43:30,333 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2022-11-18 19:43:30,333 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2022-11-18 19:43:30,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-18 19:43:30,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-18 19:43:30,792 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 19:43:30,794 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 19:43:32,439 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 19:43:32,449 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 19:43:32,449 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-18 19:43:32,452 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 07:43:32 BoogieIcfgContainer [2022-11-18 19:43:32,453 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 19:43:32,458 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 19:43:32,459 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 19:43:32,464 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 19:43:32,464 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 07:43:25" (1/3) ... [2022-11-18 19:43:32,465 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7df89de7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 07:43:32, skipping insertion in model container [2022-11-18 19:43:32,465 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:43:29" (2/3) ... [2022-11-18 19:43:32,466 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7df89de7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 07:43:32, skipping insertion in model container [2022-11-18 19:43:32,466 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 07:43:32" (3/3) ... [2022-11-18 19:43:32,468 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_byte_buf_from_empty_array_harness.i [2022-11-18 19:43:32,496 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 19:43:32,497 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-18 19:43:32,589 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 19:43:32,603 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;@7364de8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 19:43:32,604 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-18 19:43:32,610 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-18 19:43:32,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-18 19:43:32,624 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:43:32,625 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-18 19:43:32,625 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:43:32,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:43:32,635 INFO L85 PathProgramCache]: Analyzing trace with hash -1393308319, now seen corresponding path program 1 times [2022-11-18 19:43:32,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:43:32,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043034846] [2022-11-18 19:43:32,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:43:32,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:43:33,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:43:33,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 19:43:33,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:43:33,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 19:43:33,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:43:33,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 19:43:33,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:43:33,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-18 19:43:33,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:43:33,601 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-18 19:43:33,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:43:33,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043034846] [2022-11-18 19:43:33,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043034846] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:43:33,604 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:43:33,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 19:43:33,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476520392] [2022-11-18 19:43:33,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:43:33,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 19:43:33,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:43:33,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 19:43:33,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 19:43:33,666 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-18 19:43:34,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:43:34,040 INFO L93 Difference]: Finished difference Result 133 states and 180 transitions. [2022-11-18 19:43:34,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 19:43:34,045 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-18 19:43:34,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:43:34,071 INFO L225 Difference]: With dead ends: 133 [2022-11-18 19:43:34,074 INFO L226 Difference]: Without dead ends: 62 [2022-11-18 19:43:34,078 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-18 19:43:34,083 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 34 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 19:43:34,084 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-18 19:43:34,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-11-18 19:43:34,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2022-11-18 19:43:34,131 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-18 19:43:34,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 77 transitions. [2022-11-18 19:43:34,136 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 77 transitions. Word has length 29 [2022-11-18 19:43:34,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:43:34,137 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 77 transitions. [2022-11-18 19:43:34,138 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-18 19:43:34,138 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 77 transitions. [2022-11-18 19:43:34,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-18 19:43:34,140 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:43:34,141 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-18 19:43:34,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-18 19:43:34,142 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:43:34,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:43:34,143 INFO L85 PathProgramCache]: Analyzing trace with hash 85103393, now seen corresponding path program 1 times [2022-11-18 19:43:34,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:43:34,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263470253] [2022-11-18 19:43:34,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:43:34,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:43:34,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:43:35,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 19:43:35,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:43:35,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 19:43:35,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:43:35,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 19:43:35,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:43:35,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-18 19:43:35,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:43:35,288 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-18 19:43:35,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:43:35,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263470253] [2022-11-18 19:43:35,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263470253] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:43:35,289 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:43:35,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 19:43:35,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226453522] [2022-11-18 19:43:35,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:43:35,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 19:43:35,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:43:35,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 19:43:35,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-18 19:43:35,312 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-18 19:43:35,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:43:35,768 INFO L93 Difference]: Finished difference Result 115 states and 143 transitions. [2022-11-18 19:43:35,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 19:43:35,770 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-18 19:43:35,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:43:35,773 INFO L225 Difference]: With dead ends: 115 [2022-11-18 19:43:35,773 INFO L226 Difference]: Without dead ends: 65 [2022-11-18 19:43:35,774 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-18 19:43:35,775 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 57 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-18 19:43:35,776 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 135 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-18 19:43:35,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-11-18 19:43:35,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-11-18 19:43:35,790 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-18 19:43:35,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 80 transitions. [2022-11-18 19:43:35,799 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 80 transitions. Word has length 29 [2022-11-18 19:43:35,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:43:35,800 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 80 transitions. [2022-11-18 19:43:35,800 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-18 19:43:35,800 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 80 transitions. [2022-11-18 19:43:35,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-18 19:43:35,803 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:43:35,803 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-18 19:43:35,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-18 19:43:35,804 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:43:35,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:43:35,805 INFO L85 PathProgramCache]: Analyzing trace with hash -682621012, now seen corresponding path program 1 times [2022-11-18 19:43:35,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:43:35,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886770352] [2022-11-18 19:43:35,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:43:35,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:43:35,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:43:37,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 19:43:37,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:43:37,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 19:43:37,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:43:37,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 19:43:37,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:43:37,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-18 19:43:37,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:43:37,358 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-18 19:43:37,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:43:37,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886770352] [2022-11-18 19:43:37,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886770352] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:43:37,359 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:43:37,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-18 19:43:37,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418998091] [2022-11-18 19:43:37,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:43:37,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-18 19:43:37,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:43:37,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-18 19:43:37,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-18 19:43:37,368 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-18 19:43:37,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:43:37,975 INFO L93 Difference]: Finished difference Result 77 states and 93 transitions. [2022-11-18 19:43:37,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 19:43:37,976 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-18 19:43:37,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:43:37,978 INFO L225 Difference]: With dead ends: 77 [2022-11-18 19:43:37,978 INFO L226 Difference]: Without dead ends: 75 [2022-11-18 19:43:37,979 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2022-11-18 19:43:37,980 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 61 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2022-11-18 19:43:37,981 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.5s Time] [2022-11-18 19:43:37,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-11-18 19:43:37,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2022-11-18 19:43:37,993 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-18 19:43:37,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 90 transitions. [2022-11-18 19:43:37,995 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 90 transitions. Word has length 35 [2022-11-18 19:43:37,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:43:37,995 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 90 transitions. [2022-11-18 19:43:37,996 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-18 19:43:37,996 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 90 transitions. [2022-11-18 19:43:37,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-18 19:43:37,997 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:43:37,998 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-18 19:43:37,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-18 19:43:37,998 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:43:37,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:43:37,999 INFO L85 PathProgramCache]: Analyzing trace with hash 834697204, now seen corresponding path program 1 times [2022-11-18 19:43:37,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:43:37,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840598356] [2022-11-18 19:43:38,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:43:38,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:43:38,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:43:39,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 19:43:39,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:43:39,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 19:43:39,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:43:39,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 19:43:39,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:43:39,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-18 19:43:39,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:43:39,856 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-18 19:43:39,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:43:39,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840598356] [2022-11-18 19:43:39,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840598356] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:43:39,857 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:43:39,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 19:43:39,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240864510] [2022-11-18 19:43:39,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:43:39,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 19:43:39,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:43:39,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 19:43:39,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-18 19:43:39,861 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-18 19:43:40,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:43:40,490 INFO L93 Difference]: Finished difference Result 156 states and 195 transitions. [2022-11-18 19:43:40,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 19:43:40,494 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-18 19:43:40,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:43:40,495 INFO L225 Difference]: With dead ends: 156 [2022-11-18 19:43:40,495 INFO L226 Difference]: Without dead ends: 99 [2022-11-18 19:43:40,496 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2022-11-18 19:43:40,497 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 100 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-18 19:43:40,498 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 147 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-18 19:43:40,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-11-18 19:43:40,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 79. [2022-11-18 19:43:40,522 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-18 19:43:40,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 97 transitions. [2022-11-18 19:43:40,526 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 97 transitions. Word has length 39 [2022-11-18 19:43:40,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:43:40,528 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 97 transitions. [2022-11-18 19:43:40,528 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-18 19:43:40,528 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 97 transitions. [2022-11-18 19:43:40,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-18 19:43:40,530 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:43:40,531 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-18 19:43:40,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-18 19:43:40,531 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:43:40,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:43:40,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1092862642, now seen corresponding path program 1 times [2022-11-18 19:43:40,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:43:40,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158851617] [2022-11-18 19:43:40,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:43:40,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:43:41,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:43:45,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 19:43:46,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:43:46,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 19:43:46,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:43:46,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 19:43:46,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:43:46,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-18 19:43:46,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:43:47,599 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-18 19:43:47,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:43:47,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158851617] [2022-11-18 19:43:47,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158851617] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:43:47,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [872710737] [2022-11-18 19:43:47,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:43:47,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:43:47,601 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d01c404-b81e-4cba-a1ce-c27f4c26020e/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:43:47,607 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d01c404-b81e-4cba-a1ce-c27f4c26020e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 19:43:47,631 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d01c404-b81e-4cba-a1ce-c27f4c26020e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-18 19:43:48,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:43:48,330 INFO L263 TraceCheckSpWp]: Trace formula consists of 2409 conjuncts, 55 conjunts are in the unsatisfiable core [2022-11-18 19:43:48,343 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:43:48,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:43:48,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:43:48,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:43:48,602 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 35 [2022-11-18 19:43:48,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:43:48,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:43:48,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:43:48,625 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 35 [2022-11-18 19:43:48,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:43:48,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:43:48,645 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-18 19:43:50,614 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-18 19:43:50,614 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 19:43:50,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [872710737] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:43:50,615 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-18 19:43:50,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [17] total 28 [2022-11-18 19:43:50,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736637412] [2022-11-18 19:43:50,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:43:50,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-18 19:43:50,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:43:50,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-18 19:43:50,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=680, Unknown=0, NotChecked=0, Total=756 [2022-11-18 19:43:50,618 INFO L87 Difference]: Start difference. First operand 79 states and 97 transitions. Second operand has 13 states, 12 states have (on average 2.25) internal successors, (27), 11 states have internal predecessors, (27), 4 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-18 19:43:50,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:43:50,951 INFO L93 Difference]: Finished difference Result 165 states and 202 transitions. [2022-11-18 19:43:50,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-18 19:43:50,952 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.25) internal successors, (27), 11 states have internal predecessors, (27), 4 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 39 [2022-11-18 19:43:50,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:43:50,954 INFO L225 Difference]: With dead ends: 165 [2022-11-18 19:43:50,954 INFO L226 Difference]: Without dead ends: 95 [2022-11-18 19:43:50,955 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=86, Invalid=784, Unknown=0, NotChecked=0, Total=870 [2022-11-18 19:43:50,957 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 25 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 104 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 19:43:50,957 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 528 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 31 Invalid, 0 Unknown, 104 Unchecked, 0.2s Time] [2022-11-18 19:43:50,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-11-18 19:43:50,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2022-11-18 19:43:50,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 70 states have (on average 1.2) internal successors, (84), 73 states have internal predecessors, (84), 15 states have call successors, (15), 7 states have call predecessors, (15), 9 states have return successors, (18), 14 states have call predecessors, (18), 14 states have call successors, (18) [2022-11-18 19:43:50,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 117 transitions. [2022-11-18 19:43:50,972 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 117 transitions. Word has length 39 [2022-11-18 19:43:50,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:43:50,972 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 117 transitions. [2022-11-18 19:43:50,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.25) internal successors, (27), 11 states have internal predecessors, (27), 4 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-18 19:43:50,973 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 117 transitions. [2022-11-18 19:43:50,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-18 19:43:50,975 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:43:50,975 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-18 19:43:50,995 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d01c404-b81e-4cba-a1ce-c27f4c26020e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-18 19:43:51,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d01c404-b81e-4cba-a1ce-c27f4c26020e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:43:51,187 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:43:51,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:43:51,187 INFO L85 PathProgramCache]: Analyzing trace with hash -187001036, now seen corresponding path program 1 times [2022-11-18 19:43:51,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:43:51,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028078362] [2022-11-18 19:43:51,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:43:51,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:43:51,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:43:52,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 19:43:52,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:43:52,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 19:43:52,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:43:52,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 19:43:52,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:43:52,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-18 19:43:52,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:43:52,714 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-18 19:43:52,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:43:52,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028078362] [2022-11-18 19:43:52,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028078362] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:43:52,715 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:43:52,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-18 19:43:52,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110795483] [2022-11-18 19:43:52,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:43:52,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-18 19:43:52,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:43:52,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-18 19:43:52,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-18 19:43:52,718 INFO L87 Difference]: Start difference. First operand 95 states and 117 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-18 19:43:53,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:43:53,431 INFO L93 Difference]: Finished difference Result 187 states and 229 transitions. [2022-11-18 19:43:53,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 19:43:53,432 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-18 19:43:53,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:43:53,434 INFO L225 Difference]: With dead ends: 187 [2022-11-18 19:43:53,434 INFO L226 Difference]: Without dead ends: 114 [2022-11-18 19:43:53,435 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-18 19:43:53,436 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 122 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-18 19:43:53,436 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 163 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-18 19:43:53,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-11-18 19:43:53,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 98. [2022-11-18 19:43:53,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 74 states have (on average 1.2027027027027026) internal successors, (89), 76 states have internal predecessors, (89), 15 states have call successors, (15), 7 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-18 19:43:53,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 121 transitions. [2022-11-18 19:43:53,468 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 121 transitions. Word has length 39 [2022-11-18 19:43:53,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:43:53,469 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 121 transitions. [2022-11-18 19:43:53,469 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-18 19:43:53,469 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 121 transitions. [2022-11-18 19:43:53,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-18 19:43:53,476 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:43:53,477 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-18 19:43:53,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-18 19:43:53,477 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:43:53,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:43:53,479 INFO L85 PathProgramCache]: Analyzing trace with hash -753650698, now seen corresponding path program 1 times [2022-11-18 19:43:53,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:43:53,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763884887] [2022-11-18 19:43:53,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:43:53,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:43:53,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:43:53,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 19:43:53,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:43:53,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 19:43:53,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:43:53,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 19:43:53,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:43:53,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-18 19:43:53,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:43:53,871 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-18 19:43:53,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:43:53,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763884887] [2022-11-18 19:43:53,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763884887] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:43:53,872 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:43:53,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 19:43:53,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195385804] [2022-11-18 19:43:53,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:43:53,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 19:43:53,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:43:53,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 19:43:53,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-18 19:43:53,874 INFO L87 Difference]: Start difference. First operand 98 states and 121 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-18 19:43:54,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:43:54,226 INFO L93 Difference]: Finished difference Result 184 states and 230 transitions. [2022-11-18 19:43:54,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 19:43:54,227 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-18 19:43:54,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:43:54,228 INFO L225 Difference]: With dead ends: 184 [2022-11-18 19:43:54,228 INFO L226 Difference]: Without dead ends: 108 [2022-11-18 19:43:54,229 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-18 19:43:54,230 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 78 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 19:43:54,230 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 116 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-18 19:43:54,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-11-18 19:43:54,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 98. [2022-11-18 19:43:54,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 74 states have (on average 1.1891891891891893) internal successors, (88), 76 states have internal predecessors, (88), 15 states have call successors, (15), 7 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-18 19:43:54,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 120 transitions. [2022-11-18 19:43:54,256 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 120 transitions. Word has length 39 [2022-11-18 19:43:54,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:43:54,257 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 120 transitions. [2022-11-18 19:43:54,257 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-18 19:43:54,258 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 120 transitions. [2022-11-18 19:43:54,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-18 19:43:54,263 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:43:54,263 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-18 19:43:54,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-18 19:43:54,264 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:43:54,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:43:54,265 INFO L85 PathProgramCache]: Analyzing trace with hash -2033514376, now seen corresponding path program 1 times [2022-11-18 19:43:54,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:43:54,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089187630] [2022-11-18 19:43:54,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:43:54,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:43:54,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:43:55,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 19:43:55,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:43:55,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 19:43:55,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:43:55,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 19:43:55,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:43:55,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-18 19:43:55,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:43:55,631 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-18 19:43:55,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:43:55,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089187630] [2022-11-18 19:43:55,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089187630] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:43:55,632 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:43:55,637 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-18 19:43:55,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899495968] [2022-11-18 19:43:55,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:43:55,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-18 19:43:55,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:43:55,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-18 19:43:55,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-18 19:43:55,642 INFO L87 Difference]: Start difference. First operand 98 states and 120 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-18 19:43:56,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:43:56,295 INFO L93 Difference]: Finished difference Result 181 states and 222 transitions. [2022-11-18 19:43:56,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 19:43:56,296 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-18 19:43:56,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:43:56,297 INFO L225 Difference]: With dead ends: 181 [2022-11-18 19:43:56,298 INFO L226 Difference]: Without dead ends: 110 [2022-11-18 19:43:56,298 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2022-11-18 19:43:56,299 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 73 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-18 19:43:56,299 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 163 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-18 19:43:56,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-11-18 19:43:56,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 100. [2022-11-18 19:43:56,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 76 states have (on average 1.1973684210526316) internal successors, (91), 78 states have internal predecessors, (91), 15 states have call successors, (15), 7 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-18 19:43:56,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 123 transitions. [2022-11-18 19:43:56,322 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 123 transitions. Word has length 39 [2022-11-18 19:43:56,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:43:56,324 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 123 transitions. [2022-11-18 19:43:56,324 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-18 19:43:56,325 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 123 transitions. [2022-11-18 19:43:56,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-18 19:43:56,327 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:43:56,327 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-18 19:43:56,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-18 19:43:56,328 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:43:56,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:43:56,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1775348938, now seen corresponding path program 1 times [2022-11-18 19:43:56,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:43:56,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421385553] [2022-11-18 19:43:56,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:43:56,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:43:56,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:43:57,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 19:43:57,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:43:57,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 19:43:57,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:43:57,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 19:43:57,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:43:57,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-18 19:43:57,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:43:57,293 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-18 19:43:57,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:43:57,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421385553] [2022-11-18 19:43:57,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421385553] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:43:57,294 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:43:57,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 19:43:57,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524109497] [2022-11-18 19:43:57,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:43:57,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 19:43:57,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:43:57,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 19:43:57,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-18 19:43:57,297 INFO L87 Difference]: Start difference. First operand 100 states and 123 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-18 19:43:57,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:43:57,736 INFO L93 Difference]: Finished difference Result 189 states and 234 transitions. [2022-11-18 19:43:57,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 19:43:57,737 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-18 19:43:57,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:43:57,738 INFO L225 Difference]: With dead ends: 189 [2022-11-18 19:43:57,739 INFO L226 Difference]: Without dead ends: 116 [2022-11-18 19:43:57,739 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-18 19:43:57,740 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 67 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 111 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.4s IncrementalHoareTripleChecker+Time [2022-11-18 19:43:57,740 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 111 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-18 19:43:57,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-11-18 19:43:57,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 100. [2022-11-18 19:43:57,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 76 states have (on average 1.1842105263157894) internal successors, (90), 78 states have internal predecessors, (90), 15 states have call successors, (15), 7 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-18 19:43:57,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 122 transitions. [2022-11-18 19:43:57,752 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 122 transitions. Word has length 39 [2022-11-18 19:43:57,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:43:57,753 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 122 transitions. [2022-11-18 19:43:57,753 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-18 19:43:57,753 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 122 transitions. [2022-11-18 19:43:57,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-18 19:43:57,754 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:43:57,754 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-18 19:43:57,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-18 19:43:57,755 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:43:57,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:43:57,755 INFO L85 PathProgramCache]: Analyzing trace with hash 722260151, now seen corresponding path program 1 times [2022-11-18 19:43:57,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:43:57,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230343154] [2022-11-18 19:43:57,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:43:57,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:43:57,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:43:58,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 19:43:58,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:43:58,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 19:43:58,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:43:58,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 19:43:58,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:43:58,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-18 19:43:58,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:43:58,144 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-18 19:43:58,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:43:58,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230343154] [2022-11-18 19:43:58,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230343154] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:43:58,146 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:43:58,146 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 19:43:58,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693511314] [2022-11-18 19:43:58,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:43:58,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 19:43:58,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:43:58,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 19:43:58,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-18 19:43:58,148 INFO L87 Difference]: Start difference. First operand 100 states and 122 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 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-18 19:43:58,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:43:58,473 INFO L93 Difference]: Finished difference Result 179 states and 219 transitions. [2022-11-18 19:43:58,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 19:43:58,474 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 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-18 19:43:58,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:43:58,475 INFO L225 Difference]: With dead ends: 179 [2022-11-18 19:43:58,475 INFO L226 Difference]: Without dead ends: 103 [2022-11-18 19:43:58,476 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-18 19:43:58,476 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 42 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 19:43:58,477 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 116 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-18 19:43:58,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-11-18 19:43:58,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 95. [2022-11-18 19:43:58,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 71 states have (on average 1.1408450704225352) internal successors, (81), 73 states have internal predecessors, (81), 15 states have call successors, (15), 7 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-18 19:43:58,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 113 transitions. [2022-11-18 19:43:58,498 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 113 transitions. Word has length 41 [2022-11-18 19:43:58,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:43:58,499 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 113 transitions. [2022-11-18 19:43:58,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 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-18 19:43:58,499 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 113 transitions. [2022-11-18 19:43:58,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-18 19:43:58,502 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:43:58,502 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-18 19:43:58,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-18 19:43:58,503 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:43:58,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:43:58,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1543914243, now seen corresponding path program 1 times [2022-11-18 19:43:58,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:43:58,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547222201] [2022-11-18 19:43:58,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:43:58,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:43:58,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:43:59,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 19:43:59,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:43:59,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 19:43:59,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:43:59,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 19:43:59,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:43:59,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-18 19:43:59,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:43:59,739 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-18 19:43:59,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:43:59,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547222201] [2022-11-18 19:43:59,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547222201] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:43:59,740 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:43:59,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-18 19:43:59,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401884199] [2022-11-18 19:43:59,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:43:59,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-18 19:43:59,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:43:59,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-18 19:43:59,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-11-18 19:43:59,744 INFO L87 Difference]: Start difference. First operand 95 states and 113 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-18 19:44:00,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:44:00,481 INFO L93 Difference]: Finished difference Result 113 states and 132 transitions. [2022-11-18 19:44:00,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-18 19:44:00,482 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-18 19:44:00,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:44:00,483 INFO L225 Difference]: With dead ends: 113 [2022-11-18 19:44:00,483 INFO L226 Difference]: Without dead ends: 111 [2022-11-18 19:44:00,484 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2022-11-18 19:44:00,485 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 72 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-18 19:44:00,485 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 286 Invalid, 456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 439 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-18 19:44:00,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-11-18 19:44:00,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 97. [2022-11-18 19:44:00,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 73 states have (on average 1.1369863013698631) internal successors, (83), 75 states have internal predecessors, (83), 15 states have call successors, (15), 7 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-18 19:44:00,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 115 transitions. [2022-11-18 19:44:00,513 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 115 transitions. Word has length 41 [2022-11-18 19:44:00,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:44:00,513 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 115 transitions. [2022-11-18 19:44:00,514 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-18 19:44:00,514 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 115 transitions. [2022-11-18 19:44:00,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-18 19:44:00,515 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:44:00,515 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-18 19:44:00,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-18 19:44:00,516 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:44:00,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:44:00,517 INFO L85 PathProgramCache]: Analyzing trace with hash -842849665, now seen corresponding path program 1 times [2022-11-18 19:44:00,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:44:00,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206800334] [2022-11-18 19:44:00,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:44:00,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:44:00,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:44:01,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 19:44:01,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:44:01,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 19:44:01,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:44:01,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 19:44:01,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:44:01,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-18 19:44:01,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:44:01,953 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-18 19:44:01,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:44:01,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206800334] [2022-11-18 19:44:01,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206800334] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:44:01,954 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:44:01,955 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-18 19:44:01,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157078624] [2022-11-18 19:44:01,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:44:01,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-18 19:44:01,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:44:01,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-18 19:44:01,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-18 19:44:01,959 INFO L87 Difference]: Start difference. First operand 97 states and 115 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-18 19:44:02,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:44:02,505 INFO L93 Difference]: Finished difference Result 176 states and 206 transitions. [2022-11-18 19:44:02,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 19:44:02,506 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-18 19:44:02,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:44:02,507 INFO L225 Difference]: With dead ends: 176 [2022-11-18 19:44:02,507 INFO L226 Difference]: Without dead ends: 103 [2022-11-18 19:44:02,507 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-11-18 19:44:02,508 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 62 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-18 19:44:02,508 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 163 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-18 19:44:02,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-11-18 19:44:02,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 88. [2022-11-18 19:44:02,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 66 states have (on average 1.1515151515151516) internal successors, (76), 67 states have internal predecessors, (76), 14 states have call successors, (14), 7 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-18 19:44:02,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 104 transitions. [2022-11-18 19:44:02,517 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 104 transitions. Word has length 41 [2022-11-18 19:44:02,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:44:02,517 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 104 transitions. [2022-11-18 19:44:02,517 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-18 19:44:02,518 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 104 transitions. [2022-11-18 19:44:02,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-18 19:44:02,518 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:44:02,519 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-18 19:44:02,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-18 19:44:02,519 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:44:02,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:44:02,520 INFO L85 PathProgramCache]: Analyzing trace with hash -143563596, now seen corresponding path program 1 times [2022-11-18 19:44:02,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:44:02,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835564482] [2022-11-18 19:44:02,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:44:02,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:44:02,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:44:02,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 19:44:02,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:44:02,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 19:44:02,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:44:02,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 19:44:02,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:44:02,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-18 19:44:02,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:44:02,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-18 19:44:02,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:44:02,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-18 19:44:02,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:44:03,064 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-18 19:44:03,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:44:03,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835564482] [2022-11-18 19:44:03,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835564482] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:44:03,065 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:44:03,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 19:44:03,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097311396] [2022-11-18 19:44:03,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:44:03,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 19:44:03,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:44:03,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 19:44:03,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-18 19:44:03,068 INFO L87 Difference]: Start difference. First operand 88 states and 104 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-18 19:44:03,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:44:03,422 INFO L93 Difference]: Finished difference Result 120 states and 140 transitions. [2022-11-18 19:44:03,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 19:44:03,423 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-18 19:44:03,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:44:03,425 INFO L225 Difference]: With dead ends: 120 [2022-11-18 19:44:03,425 INFO L226 Difference]: Without dead ends: 88 [2022-11-18 19:44:03,426 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 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-18 19:44:03,426 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 63 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 19:44:03,427 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 105 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-18 19:44:03,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-11-18 19:44:03,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2022-11-18 19:44:03,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 66 states have (on average 1.1363636363636365) internal successors, (75), 67 states have internal predecessors, (75), 14 states have call successors, (14), 7 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-18 19:44:03,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 103 transitions. [2022-11-18 19:44:03,438 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 103 transitions. Word has length 48 [2022-11-18 19:44:03,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:44:03,440 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 103 transitions. [2022-11-18 19:44:03,440 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-18 19:44:03,440 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 103 transitions. [2022-11-18 19:44:03,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-11-18 19:44:03,441 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:44:03,441 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-18 19:44:03,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-18 19:44:03,442 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:44:03,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:44:03,443 INFO L85 PathProgramCache]: Analyzing trace with hash 1027849983, now seen corresponding path program 1 times [2022-11-18 19:44:03,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:44:03,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316858111] [2022-11-18 19:44:03,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:44:03,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:44:03,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:44:04,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 19:44:04,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:44:04,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 19:44:04,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:44:04,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 19:44:04,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:44:04,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-18 19:44:04,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:44:04,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-18 19:44:04,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:44:04,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-18 19:44:04,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:44:04,383 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-18 19:44:04,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:44:04,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316858111] [2022-11-18 19:44:04,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316858111] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:44:04,384 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:44:04,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-18 19:44:04,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785554111] [2022-11-18 19:44:04,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:44:04,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-18 19:44:04,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:44:04,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-18 19:44:04,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-18 19:44:04,387 INFO L87 Difference]: Start difference. First operand 88 states and 103 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-18 19:44:04,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:44:04,910 INFO L93 Difference]: Finished difference Result 104 states and 120 transitions. [2022-11-18 19:44:04,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 19:44:04,911 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-18 19:44:04,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:44:04,912 INFO L225 Difference]: With dead ends: 104 [2022-11-18 19:44:04,912 INFO L226 Difference]: Without dead ends: 102 [2022-11-18 19:44:04,913 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2022-11-18 19:44:04,913 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 59 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.4s IncrementalHoareTripleChecker+Time [2022-11-18 19:44:04,914 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.4s Time] [2022-11-18 19:44:04,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-11-18 19:44:04,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2022-11-18 19:44:04,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 75 states have (on average 1.12) internal successors, (84), 78 states have internal predecessors, (84), 15 states have call successors, (15), 8 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-18 19:44:04,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 117 transitions. [2022-11-18 19:44:04,923 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 117 transitions. Word has length 54 [2022-11-18 19:44:04,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:44:04,924 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 117 transitions. [2022-11-18 19:44:04,924 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-18 19:44:04,925 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 117 transitions. [2022-11-18 19:44:04,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-18 19:44:04,926 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:44:04,926 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-18 19:44:04,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-18 19:44:04,926 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:44:04,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:44:04,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1667671931, now seen corresponding path program 1 times [2022-11-18 19:44:04,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:44:04,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759559549] [2022-11-18 19:44:04,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:44:04,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:44:05,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:44:07,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 19:44:07,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:44:07,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 19:44:07,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:44:07,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 19:44:07,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:44:07,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-18 19:44:07,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:44:07,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-18 19:44:07,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:44:07,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-18 19:44:07,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:44:08,304 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-18 19:44:08,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:44:08,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759559549] [2022-11-18 19:44:08,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759559549] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:44:08,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [569400732] [2022-11-18 19:44:08,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:44:08,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:44:08,305 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d01c404-b81e-4cba-a1ce-c27f4c26020e/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:44:08,308 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d01c404-b81e-4cba-a1ce-c27f4c26020e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 19:44:08,343 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d01c404-b81e-4cba-a1ce-c27f4c26020e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-18 19:44:09,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:44:09,068 INFO L263 TraceCheckSpWp]: Trace formula consists of 2479 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-18 19:44:09,075 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:44:09,092 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-18 19:44:09,096 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-18 19:44:10,288 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-18 19:44:10,290 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:44:11,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [569400732] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:44:11,140 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 19:44:11,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 24 [2022-11-18 19:44:11,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130936416] [2022-11-18 19:44:11,143 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 19:44:11,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-18 19:44:11,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:44:11,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-18 19:44:11,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=825, Unknown=0, NotChecked=0, Total=930 [2022-11-18 19:44:11,145 INFO L87 Difference]: Start difference. First operand 101 states and 117 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-18 19:44:13,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:44:13,497 INFO L93 Difference]: Finished difference Result 185 states and 221 transitions. [2022-11-18 19:44:13,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-18 19:44:13,498 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-18 19:44:13,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:44:13,499 INFO L225 Difference]: With dead ends: 185 [2022-11-18 19:44:13,499 INFO L226 Difference]: Without dead ends: 148 [2022-11-18 19:44:13,502 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 73 SyntacticMatches, 3 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 578 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=297, Invalid=1959, Unknown=0, NotChecked=0, Total=2256 [2022-11-18 19:44:13,503 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 117 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 647 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 647 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 303 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-18 19:44:13,503 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 323 Invalid, 985 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 647 Invalid, 0 Unknown, 303 Unchecked, 1.0s Time] [2022-11-18 19:44:13,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2022-11-18 19:44:13,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 122. [2022-11-18 19:44:13,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 92 states have (on average 1.1195652173913044) internal successors, (103), 95 states have internal predecessors, (103), 17 states have call successors, (17), 10 states have call predecessors, (17), 12 states have return successors, (24), 16 states have call predecessors, (24), 16 states have call successors, (24) [2022-11-18 19:44:13,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 144 transitions. [2022-11-18 19:44:13,517 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 144 transitions. Word has length 58 [2022-11-18 19:44:13,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:44:13,518 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 144 transitions. [2022-11-18 19:44:13,518 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-18 19:44:13,519 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 144 transitions. [2022-11-18 19:44:13,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-18 19:44:13,520 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:44:13,520 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-18 19:44:13,538 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d01c404-b81e-4cba-a1ce-c27f4c26020e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-18 19:44:13,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d01c404-b81e-4cba-a1ce-c27f4c26020e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-18 19:44:13,739 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:44:13,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:44:13,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1347431687, now seen corresponding path program 1 times [2022-11-18 19:44:13,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:44:13,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252686055] [2022-11-18 19:44:13,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:44:13,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:44:13,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:44:15,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 19:44:15,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:44:15,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 19:44:15,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:44:15,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 19:44:15,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:44:15,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-18 19:44:15,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:44:15,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-18 19:44:15,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:44:15,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-18 19:44:15,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:44:15,571 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-18 19:44:15,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:44:15,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252686055] [2022-11-18 19:44:15,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252686055] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:44:15,572 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:44:15,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-18 19:44:15,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268552044] [2022-11-18 19:44:15,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:44:15,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-18 19:44:15,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:44:15,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-18 19:44:15,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-11-18 19:44:15,574 INFO L87 Difference]: Start difference. First operand 122 states and 144 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-18 19:44:16,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:44:16,295 INFO L93 Difference]: Finished difference Result 163 states and 190 transitions. [2022-11-18 19:44:16,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-18 19:44:16,296 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-18 19:44:16,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:44:16,297 INFO L225 Difference]: With dead ends: 163 [2022-11-18 19:44:16,297 INFO L226 Difference]: Without dead ends: 115 [2022-11-18 19:44:16,298 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2022-11-18 19:44:16,299 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 105 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-18 19:44:16,299 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 101 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-18 19:44:16,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-11-18 19:44:16,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 108. [2022-11-18 19:44:16,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 79 states have (on average 1.0886075949367089) internal successors, (86), 82 states have internal predecessors, (86), 17 states have call successors, (17), 9 states have call predecessors, (17), 11 states have return successors, (22), 16 states have call predecessors, (22), 16 states have call successors, (22) [2022-11-18 19:44:16,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 125 transitions. [2022-11-18 19:44:16,313 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 125 transitions. Word has length 58 [2022-11-18 19:44:16,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:44:16,313 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 125 transitions. [2022-11-18 19:44:16,314 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-18 19:44:16,314 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 125 transitions. [2022-11-18 19:44:16,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-18 19:44:16,315 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:44:16,315 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-18 19:44:16,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-18 19:44:16,316 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:44:16,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:44:16,317 INFO L85 PathProgramCache]: Analyzing trace with hash -499081653, now seen corresponding path program 1 times [2022-11-18 19:44:16,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:44:16,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856255648] [2022-11-18 19:44:16,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:44:16,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:44:16,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:44:17,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 19:44:17,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:44:17,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 19:44:17,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:44:17,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 19:44:17,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:44:17,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-18 19:44:17,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:44:17,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-18 19:44:17,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:44:17,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-18 19:44:17,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:44:18,009 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-18 19:44:18,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:44:18,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856255648] [2022-11-18 19:44:18,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856255648] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:44:18,010 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:44:18,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-18 19:44:18,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170816425] [2022-11-18 19:44:18,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:44:18,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-18 19:44:18,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:44:18,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-18 19:44:18,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-11-18 19:44:18,014 INFO L87 Difference]: Start difference. First operand 108 states and 125 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-18 19:44:18,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:44:18,754 INFO L93 Difference]: Finished difference Result 142 states and 164 transitions. [2022-11-18 19:44:18,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-18 19:44:18,755 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-18 19:44:18,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:44:18,757 INFO L225 Difference]: With dead ends: 142 [2022-11-18 19:44:18,757 INFO L226 Difference]: Without dead ends: 108 [2022-11-18 19:44:18,757 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2022-11-18 19:44:18,758 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 93 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-18 19:44:18,759 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 121 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 464 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-18 19:44:18,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-11-18 19:44:18,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2022-11-18 19:44:18,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 79 states have (on average 1.0759493670886076) internal successors, (85), 82 states have internal predecessors, (85), 17 states have call successors, (17), 9 states have call predecessors, (17), 11 states have return successors, (22), 16 states have call predecessors, (22), 16 states have call successors, (22) [2022-11-18 19:44:18,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 124 transitions. [2022-11-18 19:44:18,775 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 124 transitions. Word has length 58 [2022-11-18 19:44:18,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:44:18,776 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 124 transitions. [2022-11-18 19:44:18,777 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-18 19:44:18,777 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 124 transitions. [2022-11-18 19:44:18,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-11-18 19:44:18,778 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:44:18,778 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-18 19:44:18,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-18 19:44:18,779 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:44:18,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:44:18,780 INFO L85 PathProgramCache]: Analyzing trace with hash 592257393, now seen corresponding path program 1 times [2022-11-18 19:44:18,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:44:18,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968282672] [2022-11-18 19:44:18,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:44:18,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:44:18,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:44:20,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 19:44:20,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:44:20,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 19:44:20,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:44:20,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 19:44:20,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:44:20,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-18 19:44:20,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:44:20,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-18 19:44:20,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:44:20,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-18 19:44:20,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:44:20,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-18 19:44:20,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:44:20,290 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-18 19:44:20,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:44:20,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968282672] [2022-11-18 19:44:20,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968282672] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:44:20,291 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:44:20,292 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-18 19:44:20,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226123430] [2022-11-18 19:44:20,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:44:20,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-18 19:44:20,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:44:20,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-18 19:44:20,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-18 19:44:20,294 INFO L87 Difference]: Start difference. First operand 108 states and 124 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-18 19:44:20,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:44:20,859 INFO L93 Difference]: Finished difference Result 114 states and 129 transitions. [2022-11-18 19:44:20,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 19:44:20,860 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-18 19:44:20,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:44:20,862 INFO L225 Difference]: With dead ends: 114 [2022-11-18 19:44:20,862 INFO L226 Difference]: Without dead ends: 112 [2022-11-18 19:44:20,863 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-18 19:44:20,863 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.5s IncrementalHoareTripleChecker+Time [2022-11-18 19:44:20,864 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.5s Time] [2022-11-18 19:44:20,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-11-18 19:44:20,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2022-11-18 19:44:20,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 82 states have (on average 1.0731707317073171) internal successors, (88), 85 states have internal predecessors, (88), 17 states have call successors, (17), 10 states have call predecessors, (17), 12 states have return successors, (22), 16 states have call predecessors, (22), 16 states have call successors, (22) [2022-11-18 19:44:20,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 127 transitions. [2022-11-18 19:44:20,877 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 127 transitions. Word has length 60 [2022-11-18 19:44:20,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:44:20,878 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 127 transitions. [2022-11-18 19:44:20,878 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-18 19:44:20,879 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 127 transitions. [2022-11-18 19:44:20,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-11-18 19:44:20,879 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:44:20,880 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-18 19:44:20,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-18 19:44:20,880 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:44:20,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:44:20,881 INFO L85 PathProgramCache]: Analyzing trace with hash 506399248, now seen corresponding path program 1 times [2022-11-18 19:44:20,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:44:20,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206022495] [2022-11-18 19:44:20,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:44:20,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:44:20,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:44:21,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 19:44:21,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:44:21,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 19:44:21,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:44:21,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 19:44:21,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:44:21,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-18 19:44:21,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:44:21,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-18 19:44:21,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:44:21,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-18 19:44:21,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:44:21,887 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-18 19:44:21,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:44:21,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206022495] [2022-11-18 19:44:21,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206022495] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:44:21,888 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:44:21,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-18 19:44:21,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239363821] [2022-11-18 19:44:21,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:44:21,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-18 19:44:21,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:44:21,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-18 19:44:21,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-11-18 19:44:21,892 INFO L87 Difference]: Start difference. First operand 112 states and 127 transitions. Second operand has 11 states, 10 states have (on average 4.0) internal successors, (40), 8 states have internal predecessors, (40), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-11-18 19:44:22,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:44:22,552 INFO L93 Difference]: Finished difference Result 120 states and 135 transitions. [2022-11-18 19:44:22,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-18 19:44:22,553 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-18 19:44:22,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:44:22,554 INFO L225 Difference]: With dead ends: 120 [2022-11-18 19:44:22,554 INFO L226 Difference]: Without dead ends: 118 [2022-11-18 19:44:22,555 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-18 19:44:22,556 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 70 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-18 19:44:22,556 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 303 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 456 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-18 19:44:22,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-11-18 19:44:22,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 112. [2022-11-18 19:44:22,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 82 states have (on average 1.0731707317073171) internal successors, (88), 85 states have internal predecessors, (88), 17 states have call successors, (17), 10 states have call predecessors, (17), 12 states have return successors, (22), 16 states have call predecessors, (22), 16 states have call successors, (22) [2022-11-18 19:44:22,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 127 transitions. [2022-11-18 19:44:22,570 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 127 transitions. Word has length 60 [2022-11-18 19:44:22,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:44:22,570 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 127 transitions. [2022-11-18 19:44:22,571 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-18 19:44:22,571 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 127 transitions. [2022-11-18 19:44:22,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-11-18 19:44:22,572 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:44:22,572 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-18 19:44:22,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-18 19:44:22,573 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:44:22,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:44:22,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1207463826, now seen corresponding path program 1 times [2022-11-18 19:44:22,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:44:22,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607272929] [2022-11-18 19:44:22,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:44:22,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:44:22,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:44:23,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 19:44:23,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:44:23,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 19:44:23,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:44:23,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 19:44:23,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:44:23,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-18 19:44:23,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:44:23,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-18 19:44:23,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:44:23,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-18 19:44:23,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:44:24,101 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-18 19:44:24,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:44:24,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607272929] [2022-11-18 19:44:24,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607272929] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:44:24,102 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:44:24,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-18 19:44:24,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749069152] [2022-11-18 19:44:24,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:44:24,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-18 19:44:24,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:44:24,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-18 19:44:24,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-11-18 19:44:24,104 INFO L87 Difference]: Start difference. First operand 112 states and 127 transitions. Second operand has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-18 19:44:24,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:44:24,790 INFO L93 Difference]: Finished difference Result 145 states and 163 transitions. [2022-11-18 19:44:24,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 19:44:24,792 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-18 19:44:24,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:44:24,793 INFO L225 Difference]: With dead ends: 145 [2022-11-18 19:44:24,793 INFO L226 Difference]: Without dead ends: 106 [2022-11-18 19:44:24,794 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-18 19:44:24,794 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 93 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-18 19:44:24,795 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 100 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-18 19:44:24,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-11-18 19:44:24,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2022-11-18 19:44:24,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 77 states have (on average 1.0649350649350648) internal successors, (82), 79 states have internal predecessors, (82), 17 states have call successors, (17), 10 states have call predecessors, (17), 11 states have return successors, (20), 16 states have call predecessors, (20), 16 states have call successors, (20) [2022-11-18 19:44:24,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 119 transitions. [2022-11-18 19:44:24,813 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 119 transitions. Word has length 60 [2022-11-18 19:44:24,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:44:24,816 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 119 transitions. [2022-11-18 19:44:24,816 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-18 19:44:24,816 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 119 transitions. [2022-11-18 19:44:24,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-11-18 19:44:24,817 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:44:24,818 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-18 19:44:24,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-18 19:44:24,818 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:44:24,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:44:24,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1397895009, now seen corresponding path program 1 times [2022-11-18 19:44:24,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:44:24,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525844531] [2022-11-18 19:44:24,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:44:24,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:44:25,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:44:26,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 19:44:26,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:44:26,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 19:44:26,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:44:26,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 19:44:26,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:44:26,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-18 19:44:26,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:44:26,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-18 19:44:26,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:44:26,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-18 19:44:26,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:44:26,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-18 19:44:26,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:44:26,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-18 19:44:26,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:44:26,647 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-18 19:44:26,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:44:26,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525844531] [2022-11-18 19:44:26,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525844531] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:44:26,648 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:44:26,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-18 19:44:26,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26726770] [2022-11-18 19:44:26,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:44:26,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-18 19:44:26,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:44:26,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-18 19:44:26,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-11-18 19:44:26,654 INFO L87 Difference]: Start difference. First operand 106 states and 119 transitions. Second operand has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 5 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-11-18 19:44:27,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:44:27,328 INFO L93 Difference]: Finished difference Result 112 states and 124 transitions. [2022-11-18 19:44:27,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-18 19:44:27,329 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-18 19:44:27,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:44:27,330 INFO L225 Difference]: With dead ends: 112 [2022-11-18 19:44:27,331 INFO L226 Difference]: Without dead ends: 110 [2022-11-18 19:44:27,331 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2022-11-18 19:44:27,332 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 64 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-18 19:44:27,332 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 118 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 464 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-18 19:44:27,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-11-18 19:44:27,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2022-11-18 19:44:27,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 80 states have (on average 1.0625) internal successors, (85), 82 states have internal predecessors, (85), 17 states have call successors, (17), 11 states have call predecessors, (17), 12 states have return successors, (20), 16 states have call predecessors, (20), 16 states have call successors, (20) [2022-11-18 19:44:27,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 122 transitions. [2022-11-18 19:44:27,347 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 122 transitions. Word has length 66 [2022-11-18 19:44:27,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:44:27,348 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 122 transitions. [2022-11-18 19:44:27,348 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-18 19:44:27,348 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 122 transitions. [2022-11-18 19:44:27,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-11-18 19:44:27,349 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:44:27,349 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-18 19:44:27,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-18 19:44:27,350 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:44:27,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:44:27,351 INFO L85 PathProgramCache]: Analyzing trace with hash 2018654228, now seen corresponding path program 1 times [2022-11-18 19:44:27,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:44:27,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272134047] [2022-11-18 19:44:27,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:44:27,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:44:27,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:44:31,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 19:44:31,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:44:31,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 19:44:31,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:44:31,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 19:44:31,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:44:31,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-18 19:44:32,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:44:32,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-18 19:44:32,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:44:32,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-18 19:44:32,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:44:32,868 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-18 19:44:32,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:44:32,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272134047] [2022-11-18 19:44:32,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272134047] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:44:32,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [610404001] [2022-11-18 19:44:32,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:44:32,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:44:32,869 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d01c404-b81e-4cba-a1ce-c27f4c26020e/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:44:32,872 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d01c404-b81e-4cba-a1ce-c27f4c26020e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 19:44:32,891 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d01c404-b81e-4cba-a1ce-c27f4c26020e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-18 19:44:34,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:44:34,134 INFO L263 TraceCheckSpWp]: Trace formula consists of 2488 conjuncts, 40 conjunts are in the unsatisfiable core [2022-11-18 19:44:34,142 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:44:34,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:44:34,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:44:34,202 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-18 19:44:35,684 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-18 19:44:35,684 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:44:36,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [610404001] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:44:36,373 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 19:44:36,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 14] total 31 [2022-11-18 19:44:36,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373435858] [2022-11-18 19:44:36,374 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 19:44:36,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-18 19:44:36,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:44:36,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-18 19:44:36,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=1219, Unknown=0, NotChecked=0, Total=1332 [2022-11-18 19:44:36,377 INFO L87 Difference]: Start difference. First operand 110 states and 122 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-18 19:44:40,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:44:40,401 INFO L93 Difference]: Finished difference Result 203 states and 227 transitions. [2022-11-18 19:44:40,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-11-18 19:44:40,405 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-18 19:44:40,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:44:40,407 INFO L225 Difference]: With dead ends: 203 [2022-11-18 19:44:40,407 INFO L226 Difference]: Without dead ends: 158 [2022-11-18 19:44:40,409 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 84 SyntacticMatches, 2 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 874 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=339, Invalid=3693, Unknown=0, NotChecked=0, Total=4032 [2022-11-18 19:44:40,410 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 181 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 1091 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 1449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 1091 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 281 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-18 19:44:40,410 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 503 Invalid, 1449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 1091 Invalid, 0 Unknown, 281 Unchecked, 1.7s Time] [2022-11-18 19:44:40,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2022-11-18 19:44:40,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 115. [2022-11-18 19:44:40,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 86 states have (on average 1.058139534883721) internal successors, (91), 88 states have internal predecessors, (91), 16 states have call successors, (16), 11 states have call predecessors, (16), 12 states have return successors, (17), 15 states have call predecessors, (17), 15 states have call successors, (17) [2022-11-18 19:44:40,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 124 transitions. [2022-11-18 19:44:40,438 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 124 transitions. Word has length 64 [2022-11-18 19:44:40,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:44:40,438 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 124 transitions. [2022-11-18 19:44:40,439 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-18 19:44:40,439 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 124 transitions. [2022-11-18 19:44:40,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-11-18 19:44:40,447 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:44:40,448 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-18 19:44:40,463 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d01c404-b81e-4cba-a1ce-c27f4c26020e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-11-18 19:44:40,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d01c404-b81e-4cba-a1ce-c27f4c26020e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:44:40,648 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:44:40,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:44:40,649 INFO L85 PathProgramCache]: Analyzing trace with hash -134753713, now seen corresponding path program 1 times [2022-11-18 19:44:40,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:44:40,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474782564] [2022-11-18 19:44:40,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:44:40,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:44:40,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:44:41,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 19:44:41,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:44:41,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 19:44:41,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:44:41,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 19:44:41,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:44:41,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-18 19:44:41,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:44:41,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-18 19:44:41,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:44:41,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-18 19:44:41,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:44:41,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-18 19:44:41,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:44:41,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-18 19:44:41,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:44:41,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-18 19:44:41,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:44:41,902 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-18 19:44:41,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:44:41,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474782564] [2022-11-18 19:44:41,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474782564] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:44:41,904 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:44:41,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-18 19:44:41,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274138436] [2022-11-18 19:44:41,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:44:41,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-18 19:44:41,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:44:41,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-18 19:44:41,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-18 19:44:41,906 INFO L87 Difference]: Start difference. First operand 115 states and 124 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-18 19:44:42,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:44:42,494 INFO L93 Difference]: Finished difference Result 121 states and 129 transitions. [2022-11-18 19:44:42,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 19:44:42,495 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-18 19:44:42,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:44:42,495 INFO L225 Difference]: With dead ends: 121 [2022-11-18 19:44:42,495 INFO L226 Difference]: Without dead ends: 119 [2022-11-18 19:44:42,496 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2022-11-18 19:44:42,497 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 50 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2022-11-18 19:44:42,497 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.5s Time] [2022-11-18 19:44:42,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-11-18 19:44:42,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2022-11-18 19:44:42,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 89 states have (on average 1.0561797752808988) internal successors, (94), 91 states have internal predecessors, (94), 16 states have call successors, (16), 12 states have call predecessors, (16), 13 states have return successors, (17), 15 states have call predecessors, (17), 15 states have call successors, (17) [2022-11-18 19:44:42,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 127 transitions. [2022-11-18 19:44:42,524 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 127 transitions. Word has length 72 [2022-11-18 19:44:42,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:44:42,524 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 127 transitions. [2022-11-18 19:44:42,525 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-18 19:44:42,525 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 127 transitions. [2022-11-18 19:44:42,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-11-18 19:44:42,526 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:44:42,526 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-18 19:44:42,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-18 19:44:42,527 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:44:42,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:44:42,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1256277667, now seen corresponding path program 1 times [2022-11-18 19:44:42,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:44:42,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692226486] [2022-11-18 19:44:42,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:44:42,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:44:42,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:44:43,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 19:44:43,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:44:43,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 19:44:43,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:44:43,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 19:44:43,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:44:43,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-18 19:44:43,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:44:43,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-18 19:44:43,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:44:43,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-18 19:44:43,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:44:43,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-18 19:44:43,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:44:43,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-18 19:44:43,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:44:43,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-18 19:44:43,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:44:44,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-18 19:44:44,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:44:44,012 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-18 19:44:44,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:44:44,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692226486] [2022-11-18 19:44:44,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692226486] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:44:44,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1394357248] [2022-11-18 19:44:44,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:44:44,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:44:44,014 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d01c404-b81e-4cba-a1ce-c27f4c26020e/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:44:44,015 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d01c404-b81e-4cba-a1ce-c27f4c26020e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 19:44:44,043 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d01c404-b81e-4cba-a1ce-c27f4c26020e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-18 19:44:44,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:44:44,775 INFO L263 TraceCheckSpWp]: Trace formula consists of 2545 conjuncts, 31 conjunts are in the unsatisfiable core [2022-11-18 19:44:44,780 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:44:44,789 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-18 19:44:46,279 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-18 19:44:46,280 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-18 19:44:46,285 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-18 19:44:46,286 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-18 19:44:46,293 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 11 proven. 10 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-11-18 19:44:46,293 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:44:46,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1394357248] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:44:46,648 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 19:44:46,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 17 [2022-11-18 19:44:46,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90802194] [2022-11-18 19:44:46,648 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 19:44:46,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-18 19:44:46,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:44:46,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-18 19:44:46,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2022-11-18 19:44:46,650 INFO L87 Difference]: Start difference. First operand 119 states and 127 transitions. Second operand has 17 states, 16 states have (on average 4.125) internal successors, (66), 15 states have internal predecessors, (66), 6 states have call successors, (18), 4 states have call predecessors, (18), 3 states have return successors, (16), 4 states have call predecessors, (16), 5 states have call successors, (16) [2022-11-18 19:44:47,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:44:47,759 INFO L93 Difference]: Finished difference Result 248 states and 262 transitions. [2022-11-18 19:44:47,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-18 19:44:47,760 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 4.125) internal successors, (66), 15 states have internal predecessors, (66), 6 states have call successors, (18), 4 states have call predecessors, (18), 3 states have return successors, (16), 4 states have call predecessors, (16), 5 states have call successors, (16) Word has length 79 [2022-11-18 19:44:47,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:44:47,761 INFO L225 Difference]: With dead ends: 248 [2022-11-18 19:44:47,761 INFO L226 Difference]: Without dead ends: 99 [2022-11-18 19:44:47,762 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 129 SyntacticMatches, 11 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=148, Invalid=844, Unknown=0, NotChecked=0, Total=992 [2022-11-18 19:44:47,763 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 108 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 150 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-18 19:44:47,764 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 420 Invalid, 477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 308 Invalid, 0 Unknown, 150 Unchecked, 0.5s Time] [2022-11-18 19:44:47,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-11-18 19:44:47,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2022-11-18 19:44:47,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 73 states have (on average 1.0136986301369864) internal successors, (74), 74 states have internal predecessors, (74), 14 states have call successors, (14), 11 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-18 19:44:47,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 101 transitions. [2022-11-18 19:44:47,786 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 101 transitions. Word has length 79 [2022-11-18 19:44:47,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:44:47,787 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 101 transitions. [2022-11-18 19:44:47,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 4.125) internal successors, (66), 15 states have internal predecessors, (66), 6 states have call successors, (18), 4 states have call predecessors, (18), 3 states have return successors, (16), 4 states have call predecessors, (16), 5 states have call successors, (16) [2022-11-18 19:44:47,788 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 101 transitions. [2022-11-18 19:44:47,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-11-18 19:44:47,789 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:44:47,789 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:44:47,804 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d01c404-b81e-4cba-a1ce-c27f4c26020e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-18 19:44:48,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d01c404-b81e-4cba-a1ce-c27f4c26020e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-11-18 19:44:48,000 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:44:48,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:44:48,001 INFO L85 PathProgramCache]: Analyzing trace with hash -1365917757, now seen corresponding path program 1 times [2022-11-18 19:44:48,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:44:48,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137482204] [2022-11-18 19:44:48,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:44:48,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:44:48,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:44:49,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 19:44:49,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:44:49,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 19:44:49,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:44:49,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 19:44:49,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:44:49,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-18 19:44:49,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:44:49,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-18 19:44:49,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:44:49,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-18 19:44:49,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:44:49,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-18 19:44:49,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:44:49,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-18 19:44:49,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:44:49,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-11-18 19:44:49,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:44:49,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-11-18 19:44:49,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:44:49,677 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-11-18 19:44:49,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:44:49,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137482204] [2022-11-18 19:44:49,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137482204] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:44:49,677 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:44:49,677 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-18 19:44:49,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758877809] [2022-11-18 19:44:49,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:44:49,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-18 19:44:49,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:44:49,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-18 19:44:49,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-11-18 19:44:49,679 INFO L87 Difference]: Start difference. First operand 99 states and 101 transitions. Second operand has 10 states, 9 states have (on average 4.333333333333333) internal successors, (39), 7 states have internal predecessors, (39), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-18 19:44:50,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:44:50,233 INFO L93 Difference]: Finished difference Result 105 states and 106 transitions. [2022-11-18 19:44:50,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-18 19:44:50,233 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.333333333333333) internal successors, (39), 7 states have internal predecessors, (39), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) Word has length 91 [2022-11-18 19:44:50,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:44:50,234 INFO L225 Difference]: With dead ends: 105 [2022-11-18 19:44:50,235 INFO L226 Difference]: Without dead ends: 101 [2022-11-18 19:44:50,235 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-11-18 19:44:50,237 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 40 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-18 19:44:50,238 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 198 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-18 19:44:50,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-11-18 19:44:50,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2022-11-18 19:44:50,259 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-18 19:44:50,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 102 transitions. [2022-11-18 19:44:50,260 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 102 transitions. Word has length 91 [2022-11-18 19:44:50,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:44:50,261 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 102 transitions. [2022-11-18 19:44:50,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.333333333333333) internal successors, (39), 7 states have internal predecessors, (39), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-18 19:44:50,262 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 102 transitions. [2022-11-18 19:44:50,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-11-18 19:44:50,263 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:44:50,264 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-18 19:44:50,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-18 19:44:50,264 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 19:44:50,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:44:50,265 INFO L85 PathProgramCache]: Analyzing trace with hash -1936668706, now seen corresponding path program 1 times [2022-11-18 19:44:50,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:44:50,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299699803] [2022-11-18 19:44:50,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:44:50,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:44:51,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:44:54,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 19:44:54,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:44:55,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 19:44:55,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:44:55,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-18 19:44:55,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:44:55,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-18 19:44:55,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:44:55,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-18 19:44:55,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:44:55,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-18 19:44:55,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:44:55,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-18 19:44:55,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:44:55,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-18 19:44:55,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:44:55,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-11-18 19:44:55,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:44:55,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-11-18 19:44:55,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:44:55,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-11-18 19:44:55,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:44:55,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-18 19:44:55,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:44:55,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-11-18 19:44:55,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:44:55,257 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-18 19:44:55,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:44:55,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299699803] [2022-11-18 19:44:55,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299699803] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:44:55,258 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:44:55,259 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-18 19:44:55,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544592315] [2022-11-18 19:44:55,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:44:55,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-18 19:44:55,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:44:55,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-18 19:44:55,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2022-11-18 19:44:55,261 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-18 19:44:56,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:44:56,682 INFO L93 Difference]: Finished difference Result 101 states and 102 transitions. [2022-11-18 19:44:56,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-18 19:44:56,683 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-18 19:44:56,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:44:56,684 INFO L225 Difference]: With dead ends: 101 [2022-11-18 19:44:56,684 INFO L226 Difference]: Without dead ends: 0 [2022-11-18 19:44:56,685 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=79, Invalid=383, Unknown=0, NotChecked=0, Total=462 [2022-11-18 19:44:56,686 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 59 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 636 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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.8s IncrementalHoareTripleChecker+Time [2022-11-18 19:44:56,686 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.8s Time] [2022-11-18 19:44:56,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-18 19:44:56,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-18 19:44:56,687 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-18 19:44:56,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-18 19:44:56,688 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 108 [2022-11-18 19:44:56,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:44:56,688 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-18 19:44:56,689 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-18 19:44:56,689 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-18 19:44:56,689 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-18 19:44:56,692 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-18 19:44:56,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-18 19:44:56,695 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-18 19:45:02,123 INFO L895 garLoopResultBuilder]: At program point bounded_mallocENTRY(lines 6882 6887) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) [2022-11-18 19:45:02,123 INFO L899 garLoopResultBuilder]: For program point bounded_mallocFINAL(lines 6882 6887) no Hoare annotation was computed. [2022-11-18 19:45:02,123 INFO L899 garLoopResultBuilder]: For program point bounded_mallocEXIT(lines 6882 6887) no Hoare annotation was computed. [2022-11-18 19:45:02,124 INFO L899 garLoopResultBuilder]: For program point L6883-1(lines 6883 6885) no Hoare annotation was computed. [2022-11-18 19:45:02,124 INFO L895 garLoopResultBuilder]: At program point L6883(lines 6883 6885) the Hoare annotation is: (and (= |bounded_malloc_#in~size| bounded_malloc_~size) (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) [2022-11-18 19:45:02,124 INFO L902 garLoopResultBuilder]: At program point aws_byte_buf_is_validENTRY(lines 7375 7381) the Hoare annotation is: true [2022-11-18 19:45:02,124 INFO L899 garLoopResultBuilder]: For program point L7377-3(line 7377) no Hoare annotation was computed. [2022-11-18 19:45:02,124 INFO L899 garLoopResultBuilder]: For program point L7377-1(line 7377) no Hoare annotation was computed. [2022-11-18 19:45:02,124 INFO L899 garLoopResultBuilder]: For program point L7377(lines 7377 7380) no Hoare annotation was computed. [2022-11-18 19:45:02,124 INFO L899 garLoopResultBuilder]: For program point L7377-7(lines 7377 7380) no Hoare annotation was computed. [2022-11-18 19:45:02,124 INFO L899 garLoopResultBuilder]: For program point L7377-6(lines 7377 7378) no Hoare annotation was computed. [2022-11-18 19:45:02,124 INFO L899 garLoopResultBuilder]: For program point L7377-4(lines 7377 7378) no Hoare annotation was computed. [2022-11-18 19:45:02,125 INFO L899 garLoopResultBuilder]: For program point L7377-11(lines 7377 7380) no Hoare annotation was computed. [2022-11-18 19:45:02,125 INFO L899 garLoopResultBuilder]: For program point L7377-9(lines 7377 7380) no Hoare annotation was computed. [2022-11-18 19:45:02,125 INFO L899 garLoopResultBuilder]: For program point aws_byte_buf_is_validFINAL(lines 7375 7381) no Hoare annotation was computed. [2022-11-18 19:45:02,125 INFO L899 garLoopResultBuilder]: For program point aws_byte_buf_is_validEXIT(lines 7375 7381) no Hoare annotation was computed. [2022-11-18 19:45:02,125 INFO L899 garLoopResultBuilder]: For program point L7380-2(line 7380) no Hoare annotation was computed. [2022-11-18 19:45:02,125 INFO L899 garLoopResultBuilder]: For program point L7380(line 7380) no Hoare annotation was computed. [2022-11-18 19:45:02,125 INFO L899 garLoopResultBuilder]: For program point L7380-6(line 7380) no Hoare annotation was computed. [2022-11-18 19:45:02,125 INFO L899 garLoopResultBuilder]: For program point L7380-4(line 7380) no Hoare annotation was computed. [2022-11-18 19:45:02,125 INFO L899 garLoopResultBuilder]: For program point L7380-3(line 7380) no Hoare annotation was computed. [2022-11-18 19:45:02,125 INFO L899 garLoopResultBuilder]: For program point L7380-8(line 7380) no Hoare annotation was computed. [2022-11-18 19:45:02,126 INFO L899 garLoopResultBuilder]: For program point L211-2(lines 210 212) no Hoare annotation was computed. [2022-11-18 19:45:02,126 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 210 212) the Hoare annotation is: true [2022-11-18 19:45:02,126 INFO L899 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2022-11-18 19:45:02,126 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 210 212) no Hoare annotation was computed. [2022-11-18 19:45:02,126 INFO L899 garLoopResultBuilder]: For program point nondet_uint64_tEXIT(line 266) no Hoare annotation was computed. [2022-11-18 19:45:02,126 INFO L902 garLoopResultBuilder]: At program point nondet_uint64_tENTRY(line 266) the Hoare annotation is: true [2022-11-18 19:45:02,126 INFO L899 garLoopResultBuilder]: For program point nondet_uint64_tFINAL(line 266) no Hoare annotation was computed. [2022-11-18 19:45:02,126 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-18 19:45:02,126 INFO L899 garLoopResultBuilder]: For program point L7106-1(line 7106) no Hoare annotation was computed. [2022-11-18 19:45:02,127 INFO L899 garLoopResultBuilder]: For program point L8219-1(line 8219) no Hoare annotation was computed. [2022-11-18 19:45:02,127 INFO L895 garLoopResultBuilder]: At program point L8219(line 8219) the Hoare annotation is: (and (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base| 0)) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base| 0)) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|) (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-18 19:45:02,127 INFO L899 garLoopResultBuilder]: For program point L7100-1(lines 7099 7112) no Hoare annotation was computed. [2022-11-18 19:45:02,127 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|)) (.cse1 (and .cse2 .cse5 (= .cse3 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|))) (.cse7 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 24))) (and (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.base| 0) (= (select .cse0 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset|) 0) (or .cse1 (and .cse2 (= .cse3 0))) (= |ULTIMATE.start_assert_bytes_match_~b#1.offset| 0) (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base| 0)) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.capacity| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|) (let ((.cse4 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.offset| 0))) (or (and .cse4 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| 0)) (and (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse4))) .cse5 (= (select .cse0 (+ 16 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset|)) |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.len| 0) (or (and (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_#t~mem1204#1.base| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_#t~mem1204#1.offset| 0)) .cse1) (= (select .cse6 .cse7) 0) (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base| 0)) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|) (= |ULTIMATE.start_assert_bytes_match_~b#1.base| |ULTIMATE.start_assert_bytes_match_~a#1.base|) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.offset| 0) (= 0 (select .cse8 .cse7)) (= |ULTIMATE.start_assert_bytes_match_~a#1.offset| 0))))) [2022-11-18 19:45:02,128 INFO L895 garLoopResultBuilder]: At program point L8230(line 8230) the Hoare annotation is: (let ((.cse0 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base|)) (.cse7 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset| 8))) (let ((.cse2 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base|)) (.cse3 (select .cse0 .cse7))) (let ((.cse1 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset| 24)) (.cse4 (= .cse3 0)) (.cse6 (select .cse2 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset| 16))) (.cse5 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base|))) (and (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base| 0)) (= 0 (select .cse0 .cse1)) (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base| 0)) (= (select .cse2 |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset|) 0) (or (= .cse3 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse4) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) (= (select .cse5 .cse1) 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 .cse4 (< 0 (mod .cse6 18446744073709551616))) (= .cse6 |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) (= (select .cse5 .cse7) 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-18 19:45:02,128 INFO L902 garLoopResultBuilder]: At program point L8963(line 8963) the Hoare annotation is: true [2022-11-18 19:45:02,128 INFO L899 garLoopResultBuilder]: For program point L8963-1(line 8963) no Hoare annotation was computed. [2022-11-18 19:45:02,128 INFO L895 garLoopResultBuilder]: At program point L8969(lines 8969 8971) the Hoare annotation is: (let ((.cse16 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 24)) (.cse17 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse15 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse18 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 8)) (.cse19 (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 .cse19 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset|) 0)) (.cse2 (= (select .cse15 .cse18) 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|)) (.cse4 (= (select .cse19 (+ 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)) (.cse6 (select .cse17 .cse18)) (.cse7 (= (select .cse17 .cse16) 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_#res#1.allocator.offset| 0)) (.cse10 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse11 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_#t~mem1203#1.offset| 0)) (.cse12 (= 0 (select .cse15 .cse16))) (.cse13 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_#t~mem1203#1.base| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= .cse6 0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 (let ((.cse14 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.offset| 0))) (or (and .cse14 (= |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|) .cse14))) (= |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 (= .cse6 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse7 .cse8 .cse9 .cse10 .cse11 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.offset| 0) .cse12 .cse13)))) [2022-11-18 19:45:02,128 INFO L899 garLoopResultBuilder]: For program point L7107-1(lines 7107 7109) no Hoare annotation was computed. [2022-11-18 19:45:02,129 INFO L899 garLoopResultBuilder]: For program point L8969-1(lines 8969 8971) no Hoare annotation was computed. [2022-11-18 19:45:02,129 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|)) (.cse1 (and .cse2 .cse5 (= .cse3 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|))) (.cse7 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 24))) (and (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.base| 0) (= (select .cse0 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset|) 0) (or .cse1 (and .cse2 (= .cse3 0))) (= |ULTIMATE.start_assert_bytes_match_~b#1.offset| 0) (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base| 0)) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.capacity| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|) (let ((.cse4 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.offset| 0))) (or (and .cse4 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| 0)) (and (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse4))) .cse5 (= (select .cse0 (+ 16 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset|)) |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.len| 0) (or (and (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_#t~mem1204#1.base| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_#t~mem1204#1.offset| 0)) .cse1) (= (select .cse6 .cse7) 0) (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base| 0)) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|) (= |ULTIMATE.start_assert_bytes_match_~b#1.base| |ULTIMATE.start_assert_bytes_match_~a#1.base|) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.offset| 0) (= 0 (select .cse8 .cse7)) (= |ULTIMATE.start_assert_bytes_match_~a#1.offset| 0))))) [2022-11-18 19:45:02,129 INFO L899 garLoopResultBuilder]: For program point L8230-2(line 8230) no Hoare annotation was computed. [2022-11-18 19:45:02,129 INFO L895 garLoopResultBuilder]: At program point L8967(line 8967) the Hoare annotation is: (let ((.cse15 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 24)) (.cse16 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse14 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse17 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 8)) (.cse18 (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 .cse18 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset|) 0)) (.cse2 (= (select .cse14 .cse17) 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|)) (.cse5 (= (select .cse18 (+ 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|)) (.cse6 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.len| 0)) (.cse7 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_#t~mem1201#1| 0)) (.cse8 (select .cse16 .cse17)) (.cse9 (= (select .cse16 .cse15) 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 (= 0 (select .cse14 .cse15)))) (or (and .cse0 .cse1 .cse2 .cse3 (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))) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.offset| 0) .cse5 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse6 .cse7 (= .cse8 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse9 .cse10 .cse11 .cse12 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.offset| 0) .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 (= .cse8 0) .cse9 .cse10 .cse11 .cse12 .cse13)))) [2022-11-18 19:45:02,130 INFO L895 garLoopResultBuilder]: At program point L8230-1(line 8230) the Hoare annotation is: (let ((.cse19 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base|))) (let ((.cse15 (select .cse19 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset| 16))) (.cse16 (select |#memory_$Pointer$.offset| |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| 8)) (.cse20 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base|)) (.cse18 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset| 24))) (let ((.cse0 (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base| 0))) (.cse1 (= 0 (select .cse20 .cse18))) (.cse4 (select .cse20 .cse17)) (.cse2 (<= |ULTIMATE.start_aws_byte_buf_from_empty_array_#t~ret1050#1| 1)) (.cse3 (<= 1 |ULTIMATE.start_aws_byte_buf_from_empty_array_#t~ret1050#1|)) (.cse5 (= (select .cse19 |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset|) 0)) (.cse6 (= (select .cse16 .cse18) 0)) (.cse7 (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base| 0))) (.cse8 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse9 (= .cse15 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse10 (or (<= |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)))) (.cse11 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.offset| 0)) (.cse12 (= (select .cse16 .cse17) 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 .cse1 .cse2 .cse3 (= .cse4 0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 (not (= (mod .cse15 18446744073709551616) 0)) .cse1 (= .cse4 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse2 .cse3 .cse5 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14))))) [2022-11-18 19:45:02,130 INFO L899 garLoopResultBuilder]: For program point L8967-1(line 8967) no Hoare annotation was computed. [2022-11-18 19:45:02,130 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-18 19:45:02,130 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-18 19:45:02,130 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-11-18 19:45:02,130 INFO L899 garLoopResultBuilder]: For program point L7099(lines 7099 7112) no Hoare annotation was computed. [2022-11-18 19:45:02,130 INFO L899 garLoopResultBuilder]: For program point L8959(lines 8959 8975) no Hoare annotation was computed. [2022-11-18 19:45:02,130 INFO L899 garLoopResultBuilder]: For program point L8972(lines 8972 8974) no Hoare annotation was computed. [2022-11-18 19:45:02,130 INFO L899 garLoopResultBuilder]: For program point L8972-2(lines 8972 8974) no Hoare annotation was computed. [2022-11-18 19:45:02,131 INFO L902 garLoopResultBuilder]: At program point L8976(line 8976) the Hoare annotation is: true [2022-11-18 19:45:02,131 INFO L895 garLoopResultBuilder]: At program point L8966-1(line 8966) the Hoare annotation is: (let ((.cse21 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|))) (let ((.cse17 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 24)) (.cse18 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse19 (select .cse21 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset|)) (.cse16 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse20 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 8))) (let ((.cse0 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.base| 0)) (.cse1 (<= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_#t~ret1200#1| 1)) (.cse2 (= (select .cse16 .cse20) 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|)) (.cse4 (= (select .cse21 (+ 16 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset|)) |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse5 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.len| 0)) (.cse6 (<= .cse19 0)) (.cse7 (select .cse18 .cse20)) (.cse8 (<= 0 .cse19)) (.cse9 (= (select .cse18 .cse17) 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 (<= 1 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_#t~ret1200#1|)) (.cse14 (= 0 (select .cse16 .cse17)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= .cse7 0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 (let ((.cse15 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.offset| 0))) (or (and .cse15 (= |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|) .cse15))) (= |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 .cse6 (= .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))))) [2022-11-18 19:45:02,131 INFO L895 garLoopResultBuilder]: At program point L7110(line 7110) the Hoare annotation is: (let ((.cse6 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse8 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse9 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 8))) (let ((.cse2 (= (select .cse8 .cse9) 0)) (.cse5 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.offset| 0)) (.cse3 (select .cse6 .cse9))) (let ((.cse0 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse1 (and .cse2 .cse5 (= .cse3 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|))) (.cse7 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 24))) (and (= |ULTIMATE.start_assert_bytes_match_#t~mem585#1| |ULTIMATE.start_assert_bytes_match_#t~mem584#1|) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.base| 0) (= (select .cse0 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset|) 0) (or .cse1 (and .cse2 (= .cse3 0))) (= |ULTIMATE.start_assert_bytes_match_~b#1.offset| 0) (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base| 0)) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.capacity| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|) (let ((.cse4 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.offset| 0))) (or (and .cse4 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| 0)) (and (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse4))) .cse5 (= (select .cse0 (+ 16 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset|)) |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.len| 0) (or (and (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_#t~mem1204#1.base| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_#t~mem1204#1.offset| 0)) .cse1) (= (select .cse6 .cse7) 0) (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base| 0)) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|) (= |ULTIMATE.start_assert_bytes_match_~b#1.base| |ULTIMATE.start_assert_bytes_match_~a#1.base|) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.offset| 0) (= 0 (select .cse8 .cse7)) (= |ULTIMATE.start_assert_bytes_match_~a#1.offset| 0))))) [2022-11-18 19:45:02,132 INFO L895 garLoopResultBuilder]: At program point L8231(lines 8218 8232) the Hoare annotation is: (let ((.cse4 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.offset| 0))) (let ((.cse3 (and .cse4 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| 0)))) (let ((.cse1 (or (exists ((|v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1| Int)) (and (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1|) 8) 0) (< 0 (mod (select (select |#memory_int| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1|) 16) 18446744073709551616)))) (exists ((|v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1| Int)) (and (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1|) 8) 0) (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1|) 8) 0))))) (.cse6 (or .cse3 (<= |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)))))) (.cse12 (exists ((|v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8| Int)) (let ((.cse16 (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| .cse16) (not (= (mod .cse16 18446744073709551616) 0)))))) (.cse0 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.base| 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|)) (.cse5 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.len| 0)) (.cse13 (exists ((|v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_9| Int)) (let ((.cse14 (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_9|) 8)) (.cse15 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_9|) 8))) (and (= .cse14 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.offset| .cse14) (= .cse15 |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base|) (= .cse15 0))))) (.cse7 (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base| 0))) (.cse8 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.offset| 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 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.offset| 0)) (.cse11 (= |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 (or .cse3 (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)) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse5 .cse6 .cse13 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse2 .cse5 .cse13 .cse7 .cse8 .cse9 (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))) .cse10 .cse11))))) [2022-11-18 19:45:02,132 INFO L899 garLoopResultBuilder]: For program point L8966-2(line 8966) no Hoare annotation was computed. [2022-11-18 19:45:02,133 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|)) (.cse1 (and .cse2 .cse5 (= .cse3 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|))) (.cse7 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 24))) (and (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.base| 0) (= (select .cse0 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset|) 0) (or .cse1 (and .cse2 (= .cse3 0))) (= |ULTIMATE.start_assert_bytes_match_~b#1.offset| 0) (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base| 0)) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.capacity| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|) (let ((.cse4 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.offset| 0))) (or (and .cse4 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| 0)) (and (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse4))) .cse5 (= (select .cse0 (+ 16 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset|)) |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.len| 0) (or (and (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_#t~mem1204#1.base| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_#t~mem1204#1.offset| 0)) .cse1) (= (select .cse6 .cse7) 0) (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base| 0)) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|) (= |ULTIMATE.start_assert_bytes_match_~b#1.base| |ULTIMATE.start_assert_bytes_match_~a#1.base|) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.offset| 0) (= 0 (select .cse8 .cse7)) (= |ULTIMATE.start_assert_bytes_match_~a#1.offset| 0))))) [2022-11-18 19:45:02,133 INFO L895 garLoopResultBuilder]: At program point L8968(line 8968) the Hoare annotation is: (let ((.cse15 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 24)) (.cse16 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse14 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse17 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 8)) (.cse18 (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 .cse18 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset|) 0)) (.cse2 (= (select .cse14 .cse17) 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|)) (.cse4 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_#t~mem1202#1| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse5 (= (select .cse18 (+ 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|)) (.cse6 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.len| 0)) (.cse7 (select .cse16 .cse17)) (.cse8 (= (select .cse16 .cse15) 0)) (.cse9 (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base| 0))) (.cse10 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.offset| 0)) (.cse11 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse12 (= 0 (select .cse14 .cse15)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= .cse7 0) .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 (let ((.cse13 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.offset| 0))) (or (and .cse13 (= |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|) .cse13))) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.offset| 0) .cse5 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse6 (= .cse7 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse8 .cse9 .cse10 .cse11 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.offset| 0) .cse12)))) [2022-11-18 19:45:02,133 INFO L899 garLoopResultBuilder]: For program point L8968-1(line 8968) no Hoare annotation was computed. [2022-11-18 19:45:02,134 INFO L895 garLoopResultBuilder]: At program point L8966(line 8966) the Hoare annotation is: (let ((.cse18 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse27 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 8))) (let ((.cse25 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse23 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse22 (select .cse18 .cse27))) (let ((.cse19 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 24)) (.cse14 (= .cse22 0)) (.cse17 (select .cse23 .cse27)) (.cse24 (select .cse25 (+ 16 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset|)))) (let ((.cse3 (exists ((|v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8| Int)) (let ((.cse26 (select (select |#memory_int| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8|) 16))) (and (= .cse26 .cse24) (not (= (mod .cse26 18446744073709551616) 0)))))) (.cse11 (or (<= .cse24 (+ 36028797018963967 (* 18446744073709551616 (div (+ (- 1) .cse24) 18446744073709551616)))) (and .cse14 (= .cse17 0)))) (.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|)) (.cse4 (= .cse24 |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)) (.cse15 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.offset| 0)) (.cse6 (= (select .cse23 .cse19) 0)) (.cse7 (exists ((|v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_9| Int)) (let ((.cse20 (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_9|) 8)) (.cse21 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_9|) 8))) (and (= .cse20 0) (= .cse21 .cse17) (= .cse20 .cse22) (= .cse21 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_#res#1.allocator.offset| 0)) (.cse10 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse12 (= 0 (select .cse18 .cse19))) (.cse13 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 0)) (.cse16 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse14 .cse2 .cse3 (or (and .cse15 .cse16) (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|) .cse15)) (= |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 (= .cse17 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse6 .cse8 .cse9 .cse10 .cse11 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.offset| 0) .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse15 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse16)))))) [2022-11-18 19:45:02,134 INFO L899 garLoopResultBuilder]: For program point L7110-1(line 7110) no Hoare annotation was computed. [2022-11-18 19:45:02,134 INFO L899 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2022-11-18 19:45:02,134 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 222 224) the Hoare annotation is: true [2022-11-18 19:45:02,135 INFO L899 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2022-11-18 19:45:02,135 INFO L899 garLoopResultBuilder]: For program point L223-3(lines 222 224) no Hoare annotation was computed. [2022-11-18 19:45:02,135 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 222 224) no Hoare annotation was computed. [2022-11-18 19:45:02,135 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2022-11-18 19:45:02,139 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:45:02,141 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-18 19:45:02,163 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-18 19:45:02,164 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-18 19:45:02,165 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_BEFORE_CALL_1,QUANTIFIED] [2022-11-18 19:45:02,174 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_BEFORE_CALL_1,QUANTIFIED] [2022-11-18 19:45:02,174 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-18 19:45:02,175 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_BEFORE_CALL_1,QUANTIFIED] [2022-11-18 19:45:02,175 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 19:45:02,175 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_BEFORE_CALL_1,QUANTIFIED] [2022-11-18 19:45:02,176 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-18 19:45:02,176 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-18 19:45:02,176 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-18 19:45:02,177 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-18 19:45:02,177 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-18 19:45:02,177 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-18 19:45:02,178 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-18 19:45:02,178 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-18 19:45:02,179 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-18 19:45:02,180 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-18 19:45:02,181 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-18 19:45:02,182 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_BEFORE_CALL_1,QUANTIFIED] [2022-11-18 19:45:02,183 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_BEFORE_CALL_1,QUANTIFIED] [2022-11-18 19:45:02,183 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-18 19:45:02,183 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_BEFORE_CALL_1,QUANTIFIED] [2022-11-18 19:45:02,184 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 19:45:02,184 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_BEFORE_CALL_1,QUANTIFIED] [2022-11-18 19:45:02,184 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-18 19:45:02,185 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-18 19:45:02,185 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-18 19:45:02,185 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-18 19:45:02,186 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-18 19:45:02,186 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-18 19:45:02,186 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-18 19:45:02,187 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 19:45:02,187 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-18 19:45:02,187 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-18 19:45:02,187 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 19:45:02,188 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-18 19:45:02,191 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-18 19:45:02,196 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-18 19:45:02,197 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-18 19:45:02,197 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-18 19:45:02,197 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-18 19:45:02,197 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-18 19:45:02,198 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-18 19:45:02,198 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-18 19:45:02,198 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-18 19:45:02,199 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 19:45:02,199 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-18 19:45:02,199 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-18 19:45:02,200 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 19:45:02,200 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-18 19:45:02,200 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-18 19:45:02,211 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-18 19:45:02,211 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-18 19:45:02,211 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_BEFORE_CALL_1,QUANTIFIED] [2022-11-18 19:45:02,212 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_BEFORE_CALL_1,QUANTIFIED] [2022-11-18 19:45:02,212 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-18 19:45:02,212 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_BEFORE_CALL_1,QUANTIFIED] [2022-11-18 19:45:02,213 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 19:45:02,213 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_BEFORE_CALL_1,QUANTIFIED] [2022-11-18 19:45:02,213 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-18 19:45:02,214 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-18 19:45:02,214 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-18 19:45:02,214 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-18 19:45:02,215 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-18 19:45:02,215 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-18 19:45:02,215 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-18 19:45:02,216 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-18 19:45:02,216 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-18 19:45:02,216 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-18 19:45:02,216 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-18 19:45:02,217 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_BEFORE_CALL_1,QUANTIFIED] [2022-11-18 19:45:02,217 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_BEFORE_CALL_1,QUANTIFIED] [2022-11-18 19:45:02,217 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-18 19:45:02,218 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_BEFORE_CALL_1,QUANTIFIED] [2022-11-18 19:45:02,218 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 19:45:02,218 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_BEFORE_CALL_1,QUANTIFIED] [2022-11-18 19:45:02,219 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-18 19:45:02,219 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-18 19:45:02,219 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-18 19:45:02,220 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-18 19:45:02,220 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-18 19:45:02,220 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-18 19:45:02,221 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-18 19:45:02,221 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 19:45:02,221 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-18 19:45:02,222 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-18 19:45:02,222 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 19:45:02,222 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-18 19:45:02,222 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-18 19:45:02,223 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-18 19:45:02,223 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-18 19:45:02,223 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-18 19:45:02,224 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-18 19:45:02,224 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-18 19:45:02,224 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-18 19:45:02,225 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-18 19:45:02,225 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-18 19:45:02,225 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 19:45:02,225 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-18 19:45:02,226 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-18 19:45:02,226 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 19:45:02,226 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-18 19:45:02,227 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-18 19:45:02,231 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 07:45:02 BoogieIcfgContainer [2022-11-18 19:45:02,231 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-18 19:45:02,232 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-18 19:45:02,232 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-18 19:45:02,232 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-18 19:45:02,233 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 07:43:32" (3/4) ... [2022-11-18 19:45:02,237 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-18 19:45:02,245 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure bounded_malloc [2022-11-18 19:45:02,245 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_uint64_t [2022-11-18 19:45:02,245 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_byte_buf_is_valid [2022-11-18 19:45:02,246 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2022-11-18 19:45:02,246 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2022-11-18 19:45:02,273 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 117 nodes and edges [2022-11-18 19:45:02,277 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 55 nodes and edges [2022-11-18 19:45:02,279 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 25 nodes and edges [2022-11-18 19:45:02,281 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2022-11-18 19:45:02,282 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2022-11-18 19:45:02,283 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-11-18 19:45:02,284 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-18 19:45:02,286 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-18 19:45:02,326 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((aws_byte_buf_from_empty_array_#res#1.allocator == 0 && !(array == 0)) && ((\exists v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1 : int :: #memory_$Pointer$[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1][8] == 0 && 0 < unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1][16] % 18446744073709551616) || (\exists v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1 : int :: #memory_$Pointer$[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1][8] == 0 && #memory_$Pointer$[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1][8] == 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) && ((aws_byte_buf_from_empty_array_#res#1.buffer == 0 && aws_byte_buf_from_empty_array_#res#1.buffer == 0) || unknown-#res!capacity-unknown <= 36028797018963967 + 18446744073709551616 * ((-1 + unknown-#res!capacity-unknown) / 18446744073709551616))) && !(buf == 0)) && aws_byte_buf_from_empty_array_#res#1.allocator == 0) && capacity == capacity) && 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))) || (((((((((((aws_byte_buf_from_empty_array_#res#1.allocator == 0 && ((\exists v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1 : int :: #memory_$Pointer$[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1][8] == 0 && 0 < unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1][16] % 18446744073709551616) || (\exists v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1 : int :: #memory_$Pointer$[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1][8] == 0 && #memory_$Pointer$[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1][8] == 0))) && unknown-#res!capacity-unknown == capacity) && unknown-#res!len-unknown == 0) && ((aws_byte_buf_from_empty_array_#res#1.buffer == 0 && aws_byte_buf_from_empty_array_#res#1.buffer == 0) || unknown-#res!capacity-unknown <= 36028797018963967 + 18446744073709551616 * ((-1 + unknown-#res!capacity-unknown) / 18446744073709551616))) && (\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) && 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)))) || (((((((((aws_byte_buf_from_empty_array_#res#1.allocator == 0 && unknown-#res!capacity-unknown == capacity) && unknown-#res!len-unknown == 0) && (\exists v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_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)) && bytes == 0) && buf == 0) [2022-11-18 19:45:02,903 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d01c404-b81e-4cba-a1ce-c27f4c26020e/bin/uautomizer-TMbwUNV5ro/witness.graphml [2022-11-18 19:45:02,903 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-18 19:45:02,904 INFO L158 Benchmark]: Toolchain (without parser) took 97173.82ms. Allocated memory was 109.1MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 70.0MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 190.9MB. Max. memory is 16.1GB. [2022-11-18 19:45:02,905 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 109.1MB. Free memory is still 63.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-18 19:45:02,905 INFO L158 Benchmark]: CACSL2BoogieTranslator took 4045.95ms. Allocated memory was 109.1MB in the beginning and 176.2MB in the end (delta: 67.1MB). Free memory was 69.6MB in the beginning and 96.6MB in the end (delta: -27.0MB). Peak memory consumption was 55.0MB. Max. memory is 16.1GB. [2022-11-18 19:45:02,906 INFO L158 Benchmark]: Boogie Procedure Inliner took 287.10ms. Allocated memory is still 176.2MB. Free memory was 95.7MB in the beginning and 85.3MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-18 19:45:02,906 INFO L158 Benchmark]: Boogie Preprocessor took 144.71ms. Allocated memory is still 176.2MB. Free memory was 85.3MB in the beginning and 122.3MB in the end (delta: -37.1MB). Peak memory consumption was 10.0MB. Max. memory is 16.1GB. [2022-11-18 19:45:02,907 INFO L158 Benchmark]: RCFGBuilder took 2237.56ms. Allocated memory is still 176.2MB. Free memory was 122.3MB in the beginning and 110.3MB in the end (delta: 12.0MB). Peak memory consumption was 71.8MB. Max. memory is 16.1GB. [2022-11-18 19:45:02,907 INFO L158 Benchmark]: TraceAbstraction took 89773.36ms. Allocated memory was 176.2MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 110.3MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 792.3MB. Max. memory is 16.1GB. [2022-11-18 19:45:02,908 INFO L158 Benchmark]: Witness Printer took 672.01ms. Allocated memory is still 1.3GB. Free memory was 1.2GB in the beginning and 1.1GB in the end (delta: 130.0MB). Peak memory consumption was 130.0MB. Max. memory is 16.1GB. [2022-11-18 19:45:02,910 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.28ms. Allocated memory is still 109.1MB. Free memory is still 63.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 4045.95ms. Allocated memory was 109.1MB in the beginning and 176.2MB in the end (delta: 67.1MB). Free memory was 69.6MB in the beginning and 96.6MB in the end (delta: -27.0MB). Peak memory consumption was 55.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 287.10ms. Allocated memory is still 176.2MB. Free memory was 95.7MB in the beginning and 85.3MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 144.71ms. Allocated memory is still 176.2MB. Free memory was 85.3MB in the beginning and 122.3MB in the end (delta: -37.1MB). Peak memory consumption was 10.0MB. Max. memory is 16.1GB. * RCFGBuilder took 2237.56ms. Allocated memory is still 176.2MB. Free memory was 122.3MB in the beginning and 110.3MB in the end (delta: 12.0MB). Peak memory consumption was 71.8MB. Max. memory is 16.1GB. * TraceAbstraction took 89773.36ms. Allocated memory was 176.2MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 110.3MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 792.3MB. Max. memory is 16.1GB. * Witness Printer took 672.01ms. Allocated memory is still 1.3GB. Free memory was 1.2GB in the beginning and 1.1GB in the end (delta: 130.0MB). Peak memory consumption was 130.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: 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_BEFORE_CALL_1,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_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1,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_BEFORE_CALL_1,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_BEFORE_CALL_1,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_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1,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_BEFORE_CALL_1,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: 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 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: 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_BEFORE_CALL_1,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_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1,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_BEFORE_CALL_1,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_BEFORE_CALL_1,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_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1,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_BEFORE_CALL_1,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: 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 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 * 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: 89.6s, OverallIterations: 26, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 21.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 5.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2012 SdHoareTripleChecker+Valid, 13.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1950 mSDsluCounter, 5151 SdHoareTripleChecker+Invalid, 11.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 838 IncrementalHoareTripleChecker+Unchecked, 4069 mSDsCounter, 575 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9422 IncrementalHoareTripleChecker+Invalid, 10835 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 575 mSolverCounterUnsat, 1082 mSDtfsCounter, 9422 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1041 GetRequests, 620 SyntacticMatches, 19 SemanticMatches, 402 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1939 ImplicationChecksByTransitivity, 14.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=122occurred in iteration=15, InterpolantAutomatonStates: 288, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 26 MinimizatonAttempts, 193 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 21 LocationsWithAnnotation, 199 PreInvPairs, 227 NumberOfFragments, 2564 HoareAnnotationTreeSize, 199 FomulaSimplifications, 1849 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 21 FomulaSimplificationsInter, 5978 FormulaSimplificationTreeSizeReductionInter, 5.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 7.5s SatisfiabilityAnalysisTime, 51.1s InterpolantComputationTime, 1626 NumberOfCodeBlocks, 1626 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 1596 ConstructedInterpolants, 97 QuantifiedInterpolants, 10302 SizeOfPredicates, 57 NumberOfNonLiveVariables, 9921 ConjunctsInSsa, 172 ConjunctsInUnsatCore, 30 InterpolantComputations, 23 PerfectInterpolantSequences, 577/629 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-18 19:45:02,952 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-18 19:45:02,952 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-18 19:45:02,953 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_BEFORE_CALL_1,QUANTIFIED] [2022-11-18 19:45:02,953 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_BEFORE_CALL_1,QUANTIFIED] [2022-11-18 19:45:02,953 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-18 19:45:02,953 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_BEFORE_CALL_1,QUANTIFIED] [2022-11-18 19:45:02,953 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 19:45:02,953 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_BEFORE_CALL_1,QUANTIFIED] [2022-11-18 19:45:02,954 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-18 19:45:02,954 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-18 19:45:02,954 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-18 19:45:02,954 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-18 19:45:02,954 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-18 19:45:02,955 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-18 19:45:02,955 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-18 19:45:02,955 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-18 19:45:02,955 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-18 19:45:02,956 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-18 19:45:02,956 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-18 19:45:02,956 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_BEFORE_CALL_1,QUANTIFIED] [2022-11-18 19:45:02,956 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_BEFORE_CALL_1,QUANTIFIED] [2022-11-18 19:45:02,957 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-18 19:45:02,957 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_BEFORE_CALL_1,QUANTIFIED] [2022-11-18 19:45:02,957 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 19:45:02,958 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_BEFORE_CALL_1,QUANTIFIED] [2022-11-18 19:45:02,958 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-18 19:45:02,958 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-18 19:45:02,959 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-18 19:45:02,959 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-18 19:45:02,959 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-18 19:45:02,959 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-18 19:45:02,960 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-18 19:45:02,960 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 19:45:02,960 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-18 19:45:02,960 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-18 19:45:02,961 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 19:45:02,961 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-18 19:45:02,961 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-18 19:45:02,962 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-18 19:45:02,962 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-18 19:45:02,962 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-18 19:45:02,962 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-18 19:45:02,963 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-18 19:45:02,963 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-18 19:45:02,963 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-18 19:45:02,964 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-18 19:45:02,964 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 19:45:02,964 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-18 19:45:02,964 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-18 19:45:02,965 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 19:45:02,965 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-18 19:45:02,965 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-18 19:45:02,968 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-18 19:45:02,969 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-18 19:45:02,969 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_BEFORE_CALL_1,QUANTIFIED] [2022-11-18 19:45:02,969 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_BEFORE_CALL_1,QUANTIFIED] [2022-11-18 19:45:02,970 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-18 19:45:02,970 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_BEFORE_CALL_1,QUANTIFIED] [2022-11-18 19:45:02,970 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 19:45:02,970 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_BEFORE_CALL_1,QUANTIFIED] [2022-11-18 19:45:02,971 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-18 19:45:02,971 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-18 19:45:02,971 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-18 19:45:02,972 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-18 19:45:02,972 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-18 19:45:02,972 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-18 19:45:02,973 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-18 19:45:02,973 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-18 19:45:02,973 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-18 19:45:02,973 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-18 19:45:02,974 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-18 19:45:02,980 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_BEFORE_CALL_1,QUANTIFIED] [2022-11-18 19:45:02,981 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_BEFORE_CALL_1,QUANTIFIED] [2022-11-18 19:45:02,981 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-18 19:45:02,981 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_BEFORE_CALL_1,QUANTIFIED] [2022-11-18 19:45:02,982 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 19:45:02,982 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_BEFORE_CALL_1,QUANTIFIED] [2022-11-18 19:45:02,982 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-18 19:45:02,982 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-18 19:45:02,983 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-18 19:45:02,983 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-18 19:45:02,983 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-18 19:45:02,984 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-18 19:45:02,984 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-18 19:45:02,984 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 19:45:02,984 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-18 19:45:02,985 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-18 19:45:02,985 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 19:45:02,985 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-18 19:45:02,986 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-18 19:45:02,986 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-18 19:45:02,986 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-18 19:45:02,986 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-18 19:45:02,987 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-18 19:45:02,987 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-18 19:45:02,987 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-18 19:45:02,988 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-18 19:45:02,991 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-18 19:45:02,991 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 19:45:02,992 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-18 19:45:02,992 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2022-11-18 19:45:02,992 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-18 19:45:02,992 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-18 19:45:02,993 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_empty_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled Derived loop invariant: (((((((((((((((aws_byte_buf_from_empty_array_#res#1.allocator == 0 && !(array == 0)) && ((\exists v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1 : int :: #memory_$Pointer$[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1][8] == 0 && 0 < unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1][16] % 18446744073709551616) || (\exists v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1 : int :: #memory_$Pointer$[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1][8] == 0 && #memory_$Pointer$[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1][8] == 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) && ((aws_byte_buf_from_empty_array_#res#1.buffer == 0 && aws_byte_buf_from_empty_array_#res#1.buffer == 0) || unknown-#res!capacity-unknown <= 36028797018963967 + 18446744073709551616 * ((-1 + unknown-#res!capacity-unknown) / 18446744073709551616))) && !(buf == 0)) && aws_byte_buf_from_empty_array_#res#1.allocator == 0) && capacity == capacity) && 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))) || (((((((((((aws_byte_buf_from_empty_array_#res#1.allocator == 0 && ((\exists v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1 : int :: #memory_$Pointer$[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1][8] == 0 && 0 < unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1][16] % 18446744073709551616) || (\exists v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1 : int :: #memory_$Pointer$[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1][8] == 0 && #memory_$Pointer$[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1][8] == 0))) && unknown-#res!capacity-unknown == capacity) && unknown-#res!len-unknown == 0) && ((aws_byte_buf_from_empty_array_#res#1.buffer == 0 && aws_byte_buf_from_empty_array_#res#1.buffer == 0) || unknown-#res!capacity-unknown <= 36028797018963967 + 18446744073709551616 * ((-1 + unknown-#res!capacity-unknown) / 18446744073709551616))) && (\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) && 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)))) || (((((((((aws_byte_buf_from_empty_array_#res#1.allocator == 0 && unknown-#res!capacity-unknown == capacity) && unknown-#res!len-unknown == 0) && (\exists v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_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)) && bytes == 0) && buf == 0) RESULT: Ultimate proved your program to be correct! [2022-11-18 19:45:03,018 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d01c404-b81e-4cba-a1ce-c27f4c26020e/bin/uautomizer-TMbwUNV5ro/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