./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/aws-c-common/aws_byte_buf_init_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 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_d19267b5-2e5c-4b70-b9fe-6dc0c303275a/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d19267b5-2e5c-4b70-b9fe-6dc0c303275a/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d19267b5-2e5c-4b70-b9fe-6dc0c303275a/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d19267b5-2e5c-4b70-b9fe-6dc0c303275a/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/aws-c-common/aws_byte_buf_init_harness.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d19267b5-2e5c-4b70-b9fe-6dc0c303275a/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d19267b5-2e5c-4b70-b9fe-6dc0c303275a/bin/uautomizer-uyxdKDjOR8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 7d8c1ced61af2c61b36782af6d28a32546abe33f0c852d8f862ae04f74aae5e5 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-13 21:16:08,350 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 21:16:08,351 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 21:16:08,371 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 21:16:08,372 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 21:16:08,373 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 21:16:08,374 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 21:16:08,376 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 21:16:08,377 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 21:16:08,378 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 21:16:08,379 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 21:16:08,380 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 21:16:08,381 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 21:16:08,382 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 21:16:08,383 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 21:16:08,384 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 21:16:08,385 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 21:16:08,386 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 21:16:08,388 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 21:16:08,390 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 21:16:08,391 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 21:16:08,392 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 21:16:08,394 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 21:16:08,394 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 21:16:08,398 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 21:16:08,399 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 21:16:08,399 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 21:16:08,400 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 21:16:08,400 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 21:16:08,401 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 21:16:08,402 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 21:16:08,402 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 21:16:08,403 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 21:16:08,404 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 21:16:08,405 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 21:16:08,405 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 21:16:08,406 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 21:16:08,406 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 21:16:08,406 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 21:16:08,407 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 21:16:08,407 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 21:16:08,408 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d19267b5-2e5c-4b70-b9fe-6dc0c303275a/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-12-13 21:16:08,429 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 21:16:08,430 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 21:16:08,430 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 21:16:08,430 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 21:16:08,431 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 21:16:08,431 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 21:16:08,432 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 21:16:08,432 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 21:16:08,432 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 21:16:08,432 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 21:16:08,432 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 21:16:08,433 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 21:16:08,433 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 21:16:08,433 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 21:16:08,433 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 21:16:08,433 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 21:16:08,434 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 21:16:08,434 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 21:16:08,434 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 21:16:08,434 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 21:16:08,434 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 21:16:08,434 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 21:16:08,435 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 21:16:08,435 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 21:16:08,435 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 21:16:08,435 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 21:16:08,435 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 21:16:08,436 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 21:16:08,436 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 21:16:08,436 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 21:16:08,436 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 21:16:08,436 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 21:16:08,436 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d19267b5-2e5c-4b70-b9fe-6dc0c303275a/bin/uautomizer-uyxdKDjOR8/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d19267b5-2e5c-4b70-b9fe-6dc0c303275a/bin/uautomizer-uyxdKDjOR8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7d8c1ced61af2c61b36782af6d28a32546abe33f0c852d8f862ae04f74aae5e5 [2022-12-13 21:16:08,623 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 21:16:08,638 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 21:16:08,640 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 21:16:08,640 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 21:16:08,641 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 21:16:08,642 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d19267b5-2e5c-4b70-b9fe-6dc0c303275a/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/aws-c-common/aws_byte_buf_init_harness.i [2022-12-13 21:16:11,281 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 21:16:11,565 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 21:16:11,565 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d19267b5-2e5c-4b70-b9fe-6dc0c303275a/sv-benchmarks/c/aws-c-common/aws_byte_buf_init_harness.i [2022-12-13 21:16:11,587 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d19267b5-2e5c-4b70-b9fe-6dc0c303275a/bin/uautomizer-uyxdKDjOR8/data/d0635b6c1/c4990ab7991642fc9706f82f7e6561f8/FLAG6271f758a [2022-12-13 21:16:11,598 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d19267b5-2e5c-4b70-b9fe-6dc0c303275a/bin/uautomizer-uyxdKDjOR8/data/d0635b6c1/c4990ab7991642fc9706f82f7e6561f8 [2022-12-13 21:16:11,600 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 21:16:11,601 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 21:16:11,602 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 21:16:11,602 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 21:16:11,604 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 21:16:11,605 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:16:11" (1/1) ... [2022-12-13 21:16:11,606 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27ed6369 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:16:11, skipping insertion in model container [2022-12-13 21:16:11,606 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:16:11" (1/1) ... [2022-12-13 21:16:11,611 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 21:16:11,666 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 21:16:11,845 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d19267b5-2e5c-4b70-b9fe-6dc0c303275a/sv-benchmarks/c/aws-c-common/aws_byte_buf_init_harness.i[4491,4504] [2022-12-13 21:16:11,852 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d19267b5-2e5c-4b70-b9fe-6dc0c303275a/sv-benchmarks/c/aws-c-common/aws_byte_buf_init_harness.i[4551,4564] [2022-12-13 21:16:12,421 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 21:16:12,422 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 21:16:12,422 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 21:16:12,423 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 21:16:12,424 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 21:16:12,433 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 21:16:12,434 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 21:16:12,435 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 21:16:12,436 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 21:16:12,488 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-12-13 21:16:12,489 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-12-13 21:16:12,489 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-12-13 21:16:12,493 WARN L623 FunctionHandler]: Unknown extern function ntohl [2022-12-13 21:16:12,494 WARN L623 FunctionHandler]: Unknown extern function htons [2022-12-13 21:16:12,495 WARN L623 FunctionHandler]: Unknown extern function ntohs [2022-12-13 21:16:12,696 WARN L623 FunctionHandler]: Unknown extern function my_abort [2022-12-13 21:16:12,697 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-12-13 21:16:12,698 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-12-13 21:16:12,699 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-12-13 21:16:12,700 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-12-13 21:16:12,701 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-12-13 21:16:12,702 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-12-13 21:16:12,702 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-12-13 21:16:12,703 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-12-13 21:16:12,703 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-12-13 21:16:12,703 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-12-13 21:16:12,817 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-12-13 21:16:12,836 WARN L623 FunctionHandler]: Unknown extern function memchr [2022-12-13 21:16:12,844 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-12-13 21:16:12,866 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-12-13 21:16:12,872 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 21:16:12,872 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 21:16:12,912 WARN L623 FunctionHandler]: Unknown extern function fprintf [2022-12-13 21:16:12,916 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 21:16:12,944 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 21:16:12,954 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d19267b5-2e5c-4b70-b9fe-6dc0c303275a/sv-benchmarks/c/aws-c-common/aws_byte_buf_init_harness.i[4491,4504] [2022-12-13 21:16:12,955 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d19267b5-2e5c-4b70-b9fe-6dc0c303275a/sv-benchmarks/c/aws-c-common/aws_byte_buf_init_harness.i[4551,4564] [2022-12-13 21:16:12,978 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 21:16:12,978 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 21:16:12,979 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 21:16:12,979 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 21:16:12,979 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 21:16:12,984 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 21:16:12,984 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 21:16:12,985 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 21:16:12,985 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 21:16:12,989 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-12-13 21:16:12,989 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-12-13 21:16:12,990 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-12-13 21:16:12,992 WARN L623 FunctionHandler]: Unknown extern function ntohl [2022-12-13 21:16:12,992 WARN L623 FunctionHandler]: Unknown extern function htons [2022-12-13 21:16:12,993 WARN L623 FunctionHandler]: Unknown extern function ntohs [2022-12-13 21:16:13,006 WARN L623 FunctionHandler]: Unknown extern function my_abort [2022-12-13 21:16:13,007 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-12-13 21:16:13,007 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-12-13 21:16:13,008 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-12-13 21:16:13,008 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-12-13 21:16:13,009 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-12-13 21:16:13,009 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-12-13 21:16:13,009 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-12-13 21:16:13,010 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-12-13 21:16:13,010 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-12-13 21:16:13,010 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-12-13 21:16:13,034 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-12-13 21:16:13,045 WARN L623 FunctionHandler]: Unknown extern function memchr [2022-12-13 21:16:13,049 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-12-13 21:16:13,060 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-12-13 21:16:13,065 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 21:16:13,065 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 21:16:13,081 WARN L623 FunctionHandler]: Unknown extern function fprintf [2022-12-13 21:16:13,083 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 21:16:13,217 INFO L208 MainTranslator]: Completed translation [2022-12-13 21:16:13,217 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:16:13 WrapperNode [2022-12-13 21:16:13,217 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 21:16:13,218 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 21:16:13,218 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 21:16:13,218 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 21:16:13,223 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:16:13" (1/1) ... [2022-12-13 21:16:13,273 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:16:13" (1/1) ... [2022-12-13 21:16:13,310 INFO L138 Inliner]: procedures = 690, calls = 2495, calls flagged for inlining = 54, calls inlined = 5, statements flattened = 778 [2022-12-13 21:16:13,311 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 21:16:13,311 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 21:16:13,311 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 21:16:13,311 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 21:16:13,318 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:16:13" (1/1) ... [2022-12-13 21:16:13,319 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:16:13" (1/1) ... [2022-12-13 21:16:13,324 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:16:13" (1/1) ... [2022-12-13 21:16:13,324 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:16:13" (1/1) ... [2022-12-13 21:16:13,341 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:16:13" (1/1) ... [2022-12-13 21:16:13,344 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:16:13" (1/1) ... [2022-12-13 21:16:13,347 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:16:13" (1/1) ... [2022-12-13 21:16:13,350 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:16:13" (1/1) ... [2022-12-13 21:16:13,356 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 21:16:13,356 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 21:16:13,356 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 21:16:13,357 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 21:16:13,357 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:16:13" (1/1) ... [2022-12-13 21:16:13,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 21:16:13,370 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d19267b5-2e5c-4b70-b9fe-6dc0c303275a/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 21:16:13,381 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d19267b5-2e5c-4b70-b9fe-6dc0c303275a/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 21:16:13,383 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d19267b5-2e5c-4b70-b9fe-6dc0c303275a/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 21:16:13,417 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_buf_is_valid [2022-12-13 21:16:13,417 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_buf_is_valid [2022-12-13 21:16:13,417 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 21:16:13,417 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2022-12-13 21:16:13,417 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2022-12-13 21:16:13,417 INFO L130 BoogieDeclarations]: Found specification of procedure aws_allocator_is_valid [2022-12-13 21:16:13,418 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_allocator_is_valid [2022-12-13 21:16:13,418 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 21:16:13,418 INFO L130 BoogieDeclarations]: Found specification of procedure aws_raise_error [2022-12-13 21:16:13,418 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_raise_error [2022-12-13 21:16:13,418 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-12-13 21:16:13,418 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-12-13 21:16:13,418 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-13 21:16:13,418 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 21:16:13,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-12-13 21:16:13,419 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 21:16:13,419 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 21:16:13,419 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2022-12-13 21:16:13,419 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2022-12-13 21:16:13,419 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_malloc [2022-12-13 21:16:13,419 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_malloc [2022-12-13 21:16:13,419 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-12-13 21:16:13,419 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-12-13 21:16:13,419 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mem_acquire [2022-12-13 21:16:13,419 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mem_acquire [2022-12-13 21:16:13,420 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 21:16:13,420 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-12-13 21:16:13,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-12-13 21:16:13,420 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2022-12-13 21:16:13,420 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2022-12-13 21:16:13,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 21:16:13,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 21:16:13,615 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 21:16:13,617 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 21:16:14,314 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 21:16:14,318 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 21:16:14,319 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 21:16:14,320 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:16:14 BoogieIcfgContainer [2022-12-13 21:16:14,321 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 21:16:14,322 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 21:16:14,322 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 21:16:14,324 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 21:16:14,325 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 09:16:11" (1/3) ... [2022-12-13 21:16:14,325 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@395a9a08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:16:14, skipping insertion in model container [2022-12-13 21:16:14,325 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:16:13" (2/3) ... [2022-12-13 21:16:14,326 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@395a9a08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:16:14, skipping insertion in model container [2022-12-13 21:16:14,326 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:16:14" (3/3) ... [2022-12-13 21:16:14,327 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_byte_buf_init_harness.i [2022-12-13 21:16:14,340 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 21:16:14,341 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 21:16:14,376 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 21:16:14,381 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;@3fee9bda, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 21:16:14,381 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-12-13 21:16:14,384 INFO L276 IsEmpty]: Start isEmpty. Operand has 99 states, 67 states have (on average 1.2388059701492538) internal successors, (83), 68 states have internal predecessors, (83), 20 states have call successors, (20), 10 states have call predecessors, (20), 10 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-12-13 21:16:14,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-12-13 21:16:14,391 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:16:14,392 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] [2022-12-13 21:16:14,392 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:16:14,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:16:14,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1013294361, now seen corresponding path program 1 times [2022-12-13 21:16:14,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:16:14,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777663608] [2022-12-13 21:16:14,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:16:14,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:16:14,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:14,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 21:16:14,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:14,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 21:16:14,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:14,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 21:16:14,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:14,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 21:16:14,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:14,761 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 21:16:14,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:16:14,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777663608] [2022-12-13 21:16:14,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777663608] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:16:14,762 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:16:14,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 21:16:14,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727785128] [2022-12-13 21:16:14,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:16:14,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 21:16:14,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:16:14,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 21:16:14,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 21:16:14,797 INFO L87 Difference]: Start difference. First operand has 99 states, 67 states have (on average 1.2388059701492538) internal successors, (83), 68 states have internal predecessors, (83), 20 states have call successors, (20), 10 states have call predecessors, (20), 10 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-12-13 21:16:14,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:16:14,820 INFO L93 Difference]: Finished difference Result 193 states and 252 transitions. [2022-12-13 21:16:14,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 21:16:14,822 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (5), 2 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 31 [2022-12-13 21:16:14,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:16:14,828 INFO L225 Difference]: With dead ends: 193 [2022-12-13 21:16:14,828 INFO L226 Difference]: Without dead ends: 93 [2022-12-13 21:16:14,830 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 21:16:14,833 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 21:16:14,833 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 21:16:14,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-12-13 21:16:14,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2022-12-13 21:16:14,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 62 states have (on average 1.2096774193548387) internal successors, (75), 63 states have internal predecessors, (75), 20 states have call successors, (20), 10 states have call predecessors, (20), 10 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-12-13 21:16:14,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 114 transitions. [2022-12-13 21:16:14,863 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 114 transitions. Word has length 31 [2022-12-13 21:16:14,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:16:14,864 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 114 transitions. [2022-12-13 21:16:14,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-12-13 21:16:14,865 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 114 transitions. [2022-12-13 21:16:14,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-12-13 21:16:14,866 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:16:14,866 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] [2022-12-13 21:16:14,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 21:16:14,867 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:16:14,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:16:14,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1912179751, now seen corresponding path program 1 times [2022-12-13 21:16:14,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:16:14,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810112629] [2022-12-13 21:16:14,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:16:14,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:16:14,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:15,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 21:16:15,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:15,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 21:16:15,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:15,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 21:16:15,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:15,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 21:16:15,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:15,122 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 21:16:15,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:16:15,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810112629] [2022-12-13 21:16:15,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810112629] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:16:15,123 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:16:15,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 21:16:15,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479121561] [2022-12-13 21:16:15,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:16:15,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 21:16:15,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:16:15,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 21:16:15,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 21:16:15,125 INFO L87 Difference]: Start difference. First operand 93 states and 114 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-12-13 21:16:15,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:16:15,189 INFO L93 Difference]: Finished difference Result 147 states and 189 transitions. [2022-12-13 21:16:15,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 21:16:15,190 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 31 [2022-12-13 21:16:15,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:16:15,192 INFO L225 Difference]: With dead ends: 147 [2022-12-13 21:16:15,192 INFO L226 Difference]: Without dead ends: 110 [2022-12-13 21:16:15,193 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 21:16:15,194 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 10 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 21:16:15,194 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 339 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 21:16:15,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-12-13 21:16:15,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 96. [2022-12-13 21:16:15,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 65 states have (on average 1.2) internal successors, (78), 66 states have internal predecessors, (78), 20 states have call successors, (20), 10 states have call predecessors, (20), 10 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-12-13 21:16:15,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 117 transitions. [2022-12-13 21:16:15,203 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 117 transitions. Word has length 31 [2022-12-13 21:16:15,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:16:15,203 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 117 transitions. [2022-12-13 21:16:15,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-12-13 21:16:15,204 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 117 transitions. [2022-12-13 21:16:15,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-12-13 21:16:15,204 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:16:15,205 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] [2022-12-13 21:16:15,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 21:16:15,205 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:16:15,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:16:15,205 INFO L85 PathProgramCache]: Analyzing trace with hash -2124622107, now seen corresponding path program 1 times [2022-12-13 21:16:15,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:16:15,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868988263] [2022-12-13 21:16:15,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:16:15,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:16:15,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:15,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 21:16:15,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:15,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 21:16:15,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:15,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 21:16:15,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:15,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 21:16:15,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:15,595 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 21:16:15,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:16:15,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868988263] [2022-12-13 21:16:15,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868988263] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:16:15,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:16:15,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 21:16:15,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58823992] [2022-12-13 21:16:15,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:16:15,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 21:16:15,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:16:15,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 21:16:15,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 21:16:15,597 INFO L87 Difference]: Start difference. First operand 96 states and 117 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-12-13 21:16:15,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:16:15,673 INFO L93 Difference]: Finished difference Result 134 states and 166 transitions. [2022-12-13 21:16:15,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 21:16:15,674 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 31 [2022-12-13 21:16:15,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:16:15,674 INFO L225 Difference]: With dead ends: 134 [2022-12-13 21:16:15,675 INFO L226 Difference]: Without dead ends: 96 [2022-12-13 21:16:15,675 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-13 21:16:15,676 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 43 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 21:16:15,676 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 456 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 21:16:15,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-12-13 21:16:15,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2022-12-13 21:16:15,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 65 states have (on average 1.1846153846153846) internal successors, (77), 66 states have internal predecessors, (77), 20 states have call successors, (20), 10 states have call predecessors, (20), 10 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-12-13 21:16:15,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 116 transitions. [2022-12-13 21:16:15,683 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 116 transitions. Word has length 31 [2022-12-13 21:16:15,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:16:15,683 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 116 transitions. [2022-12-13 21:16:15,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-12-13 21:16:15,683 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 116 transitions. [2022-12-13 21:16:15,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-12-13 21:16:15,684 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:16:15,684 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] [2022-12-13 21:16:15,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 21:16:15,684 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:16:15,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:16:15,685 INFO L85 PathProgramCache]: Analyzing trace with hash 966724818, now seen corresponding path program 1 times [2022-12-13 21:16:15,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:16:15,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778793350] [2022-12-13 21:16:15,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:16:15,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:16:15,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:15,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 21:16:15,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:15,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 21:16:15,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:15,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 21:16:15,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:15,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 21:16:15,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:15,945 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 21:16:15,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:16:15,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778793350] [2022-12-13 21:16:15,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778793350] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:16:15,946 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:16:15,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 21:16:15,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297319393] [2022-12-13 21:16:15,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:16:15,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 21:16:15,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:16:15,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 21:16:15,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 21:16:15,948 INFO L87 Difference]: Start difference. First operand 96 states and 116 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-12-13 21:16:15,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:16:15,973 INFO L93 Difference]: Finished difference Result 141 states and 176 transitions. [2022-12-13 21:16:15,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 21:16:15,974 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 37 [2022-12-13 21:16:15,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:16:15,975 INFO L225 Difference]: With dead ends: 141 [2022-12-13 21:16:15,975 INFO L226 Difference]: Without dead ends: 106 [2022-12-13 21:16:15,975 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 21:16:15,976 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 29 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 21:16:15,976 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 320 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 21:16:15,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-12-13 21:16:15,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 98. [2022-12-13 21:16:15,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 67 states have (on average 1.1791044776119404) internal successors, (79), 68 states have internal predecessors, (79), 20 states have call successors, (20), 10 states have call predecessors, (20), 10 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-12-13 21:16:15,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 118 transitions. [2022-12-13 21:16:15,983 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 118 transitions. Word has length 37 [2022-12-13 21:16:15,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:16:15,983 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 118 transitions. [2022-12-13 21:16:15,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-12-13 21:16:15,983 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 118 transitions. [2022-12-13 21:16:15,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-12-13 21:16:15,984 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:16:15,984 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] [2022-12-13 21:16:15,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 21:16:15,984 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:16:15,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:16:15,985 INFO L85 PathProgramCache]: Analyzing trace with hash 265660240, now seen corresponding path program 1 times [2022-12-13 21:16:15,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:16:15,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800945783] [2022-12-13 21:16:15,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:16:15,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:16:16,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:16,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 21:16:16,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:16,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 21:16:16,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:16,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 21:16:16,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:16,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 21:16:16,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:16,692 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 21:16:16,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:16:16,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800945783] [2022-12-13 21:16:16,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800945783] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:16:16,693 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:16:16,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 21:16:16,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486360301] [2022-12-13 21:16:16,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:16:16,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 21:16:16,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:16:16,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 21:16:16,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 21:16:16,694 INFO L87 Difference]: Start difference. First operand 98 states and 118 transitions. Second operand has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-12-13 21:16:16,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:16:16,752 INFO L93 Difference]: Finished difference Result 110 states and 131 transitions. [2022-12-13 21:16:16,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 21:16:16,753 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 37 [2022-12-13 21:16:16,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:16:16,755 INFO L225 Difference]: With dead ends: 110 [2022-12-13 21:16:16,755 INFO L226 Difference]: Without dead ends: 108 [2022-12-13 21:16:16,755 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-12-13 21:16:16,756 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 23 mSDsluCounter, 617 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 726 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 21:16:16,756 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 726 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 21:16:16,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-12-13 21:16:16,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2022-12-13 21:16:16,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 73 states have (on average 1.1643835616438356) internal successors, (85), 75 states have internal predecessors, (85), 21 states have call successors, (21), 11 states have call predecessors, (21), 12 states have return successors, (22), 20 states have call predecessors, (22), 20 states have call successors, (22) [2022-12-13 21:16:16,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 128 transitions. [2022-12-13 21:16:16,762 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 128 transitions. Word has length 37 [2022-12-13 21:16:16,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:16:16,762 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 128 transitions. [2022-12-13 21:16:16,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-12-13 21:16:16,763 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 128 transitions. [2022-12-13 21:16:16,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-12-13 21:16:16,763 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:16:16,764 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-12-13 21:16:16,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 21:16:16,764 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:16:16,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:16:16,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1062822234, now seen corresponding path program 1 times [2022-12-13 21:16:16,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:16:16,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681657037] [2022-12-13 21:16:16,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:16:16,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:16:16,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:17,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 21:16:17,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:17,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 21:16:17,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:17,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 21:16:17,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:17,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 21:16:17,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:17,760 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 21:16:17,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:16:17,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681657037] [2022-12-13 21:16:17,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681657037] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:16:17,761 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:16:17,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 21:16:17,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972180665] [2022-12-13 21:16:17,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:16:17,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 21:16:17,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:16:17,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 21:16:17,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-13 21:16:17,762 INFO L87 Difference]: Start difference. First operand 107 states and 128 transitions. Second operand has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 8 states have internal predecessors, (29), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-12-13 21:16:17,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:16:17,985 INFO L93 Difference]: Finished difference Result 184 states and 229 transitions. [2022-12-13 21:16:17,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 21:16:17,986 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 8 states have internal predecessors, (29), 3 states have call successors, (5), 2 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-12-13 21:16:17,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:16:17,987 INFO L225 Difference]: With dead ends: 184 [2022-12-13 21:16:17,987 INFO L226 Difference]: Without dead ends: 143 [2022-12-13 21:16:17,987 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-12-13 21:16:17,988 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 69 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 633 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 21:16:17,988 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 633 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 21:16:17,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-12-13 21:16:17,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 121. [2022-12-13 21:16:17,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 86 states have (on average 1.186046511627907) internal successors, (102), 89 states have internal predecessors, (102), 21 states have call successors, (21), 11 states have call predecessors, (21), 13 states have return successors, (23), 20 states have call predecessors, (23), 20 states have call successors, (23) [2022-12-13 21:16:17,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 146 transitions. [2022-12-13 21:16:17,995 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 146 transitions. Word has length 41 [2022-12-13 21:16:17,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:16:17,996 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 146 transitions. [2022-12-13 21:16:17,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 8 states have internal predecessors, (29), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-12-13 21:16:17,996 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 146 transitions. [2022-12-13 21:16:17,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-12-13 21:16:17,997 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:16:17,997 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-12-13 21:16:17,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 21:16:17,997 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:16:17,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:16:17,997 INFO L85 PathProgramCache]: Analyzing trace with hash -1952281384, now seen corresponding path program 1 times [2022-12-13 21:16:17,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:16:17,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326622032] [2022-12-13 21:16:17,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:16:17,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:16:18,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:18,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 21:16:18,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:18,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 21:16:18,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:18,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 21:16:18,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:18,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 21:16:18,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:18,763 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 21:16:18,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:16:18,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326622032] [2022-12-13 21:16:18,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326622032] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:16:18,764 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:16:18,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 21:16:18,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943343994] [2022-12-13 21:16:18,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:16:18,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 21:16:18,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:16:18,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 21:16:18,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-13 21:16:18,765 INFO L87 Difference]: Start difference. First operand 121 states and 146 transitions. Second operand has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 8 states have internal predecessors, (29), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-12-13 21:16:18,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:16:18,981 INFO L93 Difference]: Finished difference Result 210 states and 261 transitions. [2022-12-13 21:16:18,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 21:16:18,982 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 8 states have internal predecessors, (29), 3 states have call successors, (5), 2 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-12-13 21:16:18,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:16:18,983 INFO L225 Difference]: With dead ends: 210 [2022-12-13 21:16:18,983 INFO L226 Difference]: Without dead ends: 155 [2022-12-13 21:16:18,984 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2022-12-13 21:16:18,985 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 45 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 21:16:18,985 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 622 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 21:16:18,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-12-13 21:16:19,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 123. [2022-12-13 21:16:19,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 88 states have (on average 1.1931818181818181) internal successors, (105), 91 states have internal predecessors, (105), 21 states have call successors, (21), 11 states have call predecessors, (21), 13 states have return successors, (23), 20 states have call predecessors, (23), 20 states have call successors, (23) [2022-12-13 21:16:19,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 149 transitions. [2022-12-13 21:16:19,004 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 149 transitions. Word has length 41 [2022-12-13 21:16:19,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:16:19,004 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 149 transitions. [2022-12-13 21:16:19,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 8 states have internal predecessors, (29), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-12-13 21:16:19,005 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 149 transitions. [2022-12-13 21:16:19,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-12-13 21:16:19,006 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:16:19,006 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-12-13 21:16:19,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 21:16:19,007 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:16:19,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:16:19,007 INFO L85 PathProgramCache]: Analyzing trace with hash -1694115946, now seen corresponding path program 1 times [2022-12-13 21:16:19,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:16:19,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295763747] [2022-12-13 21:16:19,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:16:19,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:16:19,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:20,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 21:16:20,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:20,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 21:16:20,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:20,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 21:16:20,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:20,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 21:16:20,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:20,665 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 21:16:20,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:16:20,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295763747] [2022-12-13 21:16:20,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295763747] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:16:20,666 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:16:20,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-13 21:16:20,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113099753] [2022-12-13 21:16:20,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:16:20,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 21:16:20,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:16:20,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 21:16:20,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2022-12-13 21:16:20,668 INFO L87 Difference]: Start difference. First operand 123 states and 149 transitions. Second operand has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-12-13 21:16:21,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:16:21,217 INFO L93 Difference]: Finished difference Result 212 states and 270 transitions. [2022-12-13 21:16:21,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 21:16:21,218 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 41 [2022-12-13 21:16:21,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:16:21,219 INFO L225 Difference]: With dead ends: 212 [2022-12-13 21:16:21,219 INFO L226 Difference]: Without dead ends: 155 [2022-12-13 21:16:21,220 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2022-12-13 21:16:21,221 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 240 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 568 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 21:16:21,221 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 568 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 21:16:21,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-12-13 21:16:21,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 137. [2022-12-13 21:16:21,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 100 states have (on average 1.21) internal successors, (121), 105 states have internal predecessors, (121), 22 states have call successors, (22), 11 states have call predecessors, (22), 14 states have return successors, (27), 20 states have call predecessors, (27), 21 states have call successors, (27) [2022-12-13 21:16:21,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 170 transitions. [2022-12-13 21:16:21,240 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 170 transitions. Word has length 41 [2022-12-13 21:16:21,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:16:21,241 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 170 transitions. [2022-12-13 21:16:21,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-12-13 21:16:21,241 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 170 transitions. [2022-12-13 21:16:21,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-12-13 21:16:21,242 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:16:21,243 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-12-13 21:16:21,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 21:16:21,243 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:16:21,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:16:21,244 INFO L85 PathProgramCache]: Analyzing trace with hash -267360230, now seen corresponding path program 1 times [2022-12-13 21:16:21,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:16:21,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550694764] [2022-12-13 21:16:21,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:16:21,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:16:21,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:21,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 21:16:21,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:21,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 21:16:21,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:21,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 21:16:21,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:21,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 21:16:21,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:21,649 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 21:16:21,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:16:21,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550694764] [2022-12-13 21:16:21,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550694764] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:16:21,650 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:16:21,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 21:16:21,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911439114] [2022-12-13 21:16:21,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:16:21,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 21:16:21,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:16:21,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 21:16:21,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 21:16:21,651 INFO L87 Difference]: Start difference. First operand 137 states and 170 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-12-13 21:16:21,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:16:21,743 INFO L93 Difference]: Finished difference Result 225 states and 287 transitions. [2022-12-13 21:16:21,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 21:16:21,743 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 41 [2022-12-13 21:16:21,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:16:21,744 INFO L225 Difference]: With dead ends: 225 [2022-12-13 21:16:21,745 INFO L226 Difference]: Without dead ends: 156 [2022-12-13 21:16:21,745 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-12-13 21:16:21,746 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 28 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 21:16:21,746 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 340 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 21:16:21,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2022-12-13 21:16:21,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 138. [2022-12-13 21:16:21,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 101 states have (on average 1.198019801980198) internal successors, (121), 106 states have internal predecessors, (121), 22 states have call successors, (22), 11 states have call predecessors, (22), 14 states have return successors, (27), 20 states have call predecessors, (27), 21 states have call successors, (27) [2022-12-13 21:16:21,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 170 transitions. [2022-12-13 21:16:21,760 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 170 transitions. Word has length 41 [2022-12-13 21:16:21,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:16:21,761 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 170 transitions. [2022-12-13 21:16:21,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-12-13 21:16:21,761 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 170 transitions. [2022-12-13 21:16:21,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-12-13 21:16:21,762 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:16:21,762 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:16:21,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 21:16:21,763 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:16:21,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:16:21,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1627279489, now seen corresponding path program 1 times [2022-12-13 21:16:21,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:16:21,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166465747] [2022-12-13 21:16:21,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:16:21,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:16:21,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:22,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 21:16:22,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:22,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 21:16:22,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:22,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 21:16:22,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:22,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 21:16:22,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:22,390 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 21:16:22,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:16:22,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166465747] [2022-12-13 21:16:22,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166465747] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:16:22,390 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:16:22,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 21:16:22,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834904586] [2022-12-13 21:16:22,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:16:22,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 21:16:22,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:16:22,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 21:16:22,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-12-13 21:16:22,392 INFO L87 Difference]: Start difference. First operand 138 states and 170 transitions. Second operand has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-12-13 21:16:22,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:16:22,484 INFO L93 Difference]: Finished difference Result 164 states and 199 transitions. [2022-12-13 21:16:22,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 21:16:22,484 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 43 [2022-12-13 21:16:22,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:16:22,485 INFO L225 Difference]: With dead ends: 164 [2022-12-13 21:16:22,486 INFO L226 Difference]: Without dead ends: 162 [2022-12-13 21:16:22,486 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-12-13 21:16:22,486 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 31 mSDsluCounter, 817 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 925 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 21:16:22,486 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 925 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 21:16:22,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2022-12-13 21:16:22,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 146. [2022-12-13 21:16:22,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 108 states have (on average 1.1851851851851851) internal successors, (128), 114 states have internal predecessors, (128), 22 states have call successors, (22), 11 states have call predecessors, (22), 15 states have return successors, (29), 20 states have call predecessors, (29), 21 states have call successors, (29) [2022-12-13 21:16:22,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 179 transitions. [2022-12-13 21:16:22,495 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 179 transitions. Word has length 43 [2022-12-13 21:16:22,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:16:22,495 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 179 transitions. [2022-12-13 21:16:22,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-12-13 21:16:22,495 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 179 transitions. [2022-12-13 21:16:22,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-12-13 21:16:22,496 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:16:22,496 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, 1, 1] [2022-12-13 21:16:22,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 21:16:22,496 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:16:22,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:16:22,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1966623229, now seen corresponding path program 1 times [2022-12-13 21:16:22,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:16:22,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385187645] [2022-12-13 21:16:22,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:16:22,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:16:22,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:23,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 21:16:23,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:23,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 21:16:23,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:23,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 21:16:23,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:23,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 21:16:23,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:23,188 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 21:16:23,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:16:23,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385187645] [2022-12-13 21:16:23,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385187645] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:16:23,189 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:16:23,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 21:16:23,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906882524] [2022-12-13 21:16:23,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:16:23,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 21:16:23,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:16:23,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 21:16:23,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 21:16:23,190 INFO L87 Difference]: Start difference. First operand 146 states and 179 transitions. Second operand has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 7 states have internal predecessors, (31), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-12-13 21:16:23,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:16:23,370 INFO L93 Difference]: Finished difference Result 250 states and 311 transitions. [2022-12-13 21:16:23,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 21:16:23,371 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 7 states have internal predecessors, (31), 3 states have call successors, (5), 2 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 43 [2022-12-13 21:16:23,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:16:23,372 INFO L225 Difference]: With dead ends: 250 [2022-12-13 21:16:23,372 INFO L226 Difference]: Without dead ends: 172 [2022-12-13 21:16:23,373 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-12-13 21:16:23,373 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 40 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 21:16:23,373 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 458 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 21:16:23,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2022-12-13 21:16:23,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 139. [2022-12-13 21:16:23,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 102 states have (on average 1.196078431372549) internal successors, (122), 107 states have internal predecessors, (122), 22 states have call successors, (22), 11 states have call predecessors, (22), 14 states have return successors, (26), 20 states have call predecessors, (26), 21 states have call successors, (26) [2022-12-13 21:16:23,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 170 transitions. [2022-12-13 21:16:23,382 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 170 transitions. Word has length 43 [2022-12-13 21:16:23,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:16:23,383 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 170 transitions. [2022-12-13 21:16:23,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 7 states have internal predecessors, (31), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-12-13 21:16:23,383 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 170 transitions. [2022-12-13 21:16:23,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-12-13 21:16:23,384 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:16:23,384 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] [2022-12-13 21:16:23,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 21:16:23,384 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:16:23,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:16:23,385 INFO L85 PathProgramCache]: Analyzing trace with hash 598348136, now seen corresponding path program 1 times [2022-12-13 21:16:23,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:16:23,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709772331] [2022-12-13 21:16:23,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:16:23,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:16:23,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:23,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 21:16:23,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:23,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 21:16:23,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:23,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 21:16:23,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:23,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 21:16:23,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:23,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-12-13 21:16:23,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:23,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-12-13 21:16:23,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:23,882 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-12-13 21:16:23,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:16:23,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709772331] [2022-12-13 21:16:23,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709772331] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:16:23,883 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:16:23,883 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 21:16:23,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994525049] [2022-12-13 21:16:23,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:16:23,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 21:16:23,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:16:23,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 21:16:23,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 21:16:23,884 INFO L87 Difference]: Start difference. First operand 139 states and 170 transitions. Second operand has 8 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-12-13 21:16:23,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:16:23,947 INFO L93 Difference]: Finished difference Result 151 states and 184 transitions. [2022-12-13 21:16:23,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 21:16:23,947 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (7), 2 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 57 [2022-12-13 21:16:23,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:16:23,948 INFO L225 Difference]: With dead ends: 151 [2022-12-13 21:16:23,948 INFO L226 Difference]: Without dead ends: 149 [2022-12-13 21:16:23,949 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-12-13 21:16:23,949 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 23 mSDsluCounter, 629 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 741 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 21:16:23,949 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 741 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 21:16:23,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2022-12-13 21:16:23,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 148. [2022-12-13 21:16:23,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 108 states have (on average 1.1851851851851851) internal successors, (128), 114 states have internal predecessors, (128), 23 states have call successors, (23), 12 states have call predecessors, (23), 16 states have return successors, (30), 21 states have call predecessors, (30), 22 states have call successors, (30) [2022-12-13 21:16:23,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 181 transitions. [2022-12-13 21:16:23,956 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 181 transitions. Word has length 57 [2022-12-13 21:16:23,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:16:23,956 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 181 transitions. [2022-12-13 21:16:23,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-12-13 21:16:23,957 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 181 transitions. [2022-12-13 21:16:23,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-12-13 21:16:23,957 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:16:23,957 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, 1, 1, 1] [2022-12-13 21:16:23,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 21:16:23,958 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:16:23,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:16:23,958 INFO L85 PathProgramCache]: Analyzing trace with hash 803127154, now seen corresponding path program 1 times [2022-12-13 21:16:23,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:16:23,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233558843] [2022-12-13 21:16:23,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:16:23,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:16:24,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:24,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 21:16:24,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:24,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 21:16:24,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:24,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 21:16:24,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:24,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 21:16:24,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:24,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-12-13 21:16:24,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:24,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-12-13 21:16:24,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:24,641 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 21:16:24,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:16:24,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233558843] [2022-12-13 21:16:24,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233558843] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:16:24,642 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:16:24,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 21:16:24,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108747972] [2022-12-13 21:16:24,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:16:24,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 21:16:24,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:16:24,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 21:16:24,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-12-13 21:16:24,643 INFO L87 Difference]: Start difference. First operand 148 states and 181 transitions. Second operand has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-12-13 21:16:24,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:16:24,890 INFO L93 Difference]: Finished difference Result 191 states and 238 transitions. [2022-12-13 21:16:24,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 21:16:24,891 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 61 [2022-12-13 21:16:24,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:16:24,892 INFO L225 Difference]: With dead ends: 191 [2022-12-13 21:16:24,892 INFO L226 Difference]: Without dead ends: 178 [2022-12-13 21:16:24,893 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-12-13 21:16:24,894 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 120 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 21:16:24,894 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 603 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 21:16:24,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2022-12-13 21:16:24,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 157. [2022-12-13 21:16:24,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 115 states have (on average 1.173913043478261) internal successors, (135), 123 states have internal predecessors, (135), 24 states have call successors, (24), 12 states have call predecessors, (24), 17 states have return successors, (36), 21 states have call predecessors, (36), 23 states have call successors, (36) [2022-12-13 21:16:24,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 195 transitions. [2022-12-13 21:16:24,903 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 195 transitions. Word has length 61 [2022-12-13 21:16:24,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:16:24,903 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 195 transitions. [2022-12-13 21:16:24,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-12-13 21:16:24,904 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 195 transitions. [2022-12-13 21:16:24,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-12-13 21:16:24,904 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:16:24,904 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:16:24,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 21:16:24,905 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:16:24,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:16:24,905 INFO L85 PathProgramCache]: Analyzing trace with hash 2082990832, now seen corresponding path program 1 times [2022-12-13 21:16:24,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:16:24,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319614075] [2022-12-13 21:16:24,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:16:24,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:16:24,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:25,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 21:16:25,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:25,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 21:16:25,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:25,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 21:16:25,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:25,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 21:16:25,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:25,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-12-13 21:16:25,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:25,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-12-13 21:16:25,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:25,575 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 21:16:25,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:16:25,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319614075] [2022-12-13 21:16:25,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319614075] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:16:25,576 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:16:25,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 21:16:25,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758882652] [2022-12-13 21:16:25,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:16:25,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 21:16:25,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:16:25,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 21:16:25,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-12-13 21:16:25,577 INFO L87 Difference]: Start difference. First operand 157 states and 195 transitions. Second operand has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-12-13 21:16:25,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:16:25,778 INFO L93 Difference]: Finished difference Result 204 states and 252 transitions. [2022-12-13 21:16:25,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 21:16:25,779 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 61 [2022-12-13 21:16:25,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:16:25,780 INFO L225 Difference]: With dead ends: 204 [2022-12-13 21:16:25,780 INFO L226 Difference]: Without dead ends: 191 [2022-12-13 21:16:25,781 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2022-12-13 21:16:25,781 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 54 mSDsluCounter, 650 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 752 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 21:16:25,782 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 752 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 21:16:25,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2022-12-13 21:16:25,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 157. [2022-12-13 21:16:25,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 115 states have (on average 1.173913043478261) internal successors, (135), 123 states have internal predecessors, (135), 24 states have call successors, (24), 12 states have call predecessors, (24), 17 states have return successors, (36), 21 states have call predecessors, (36), 23 states have call successors, (36) [2022-12-13 21:16:25,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 195 transitions. [2022-12-13 21:16:25,795 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 195 transitions. Word has length 61 [2022-12-13 21:16:25,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:16:25,796 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 195 transitions. [2022-12-13 21:16:25,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-12-13 21:16:25,796 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 195 transitions. [2022-12-13 21:16:25,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-12-13 21:16:25,797 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:16:25,797 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:16:25,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 21:16:25,798 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:16:25,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:16:25,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1953811026, now seen corresponding path program 1 times [2022-12-13 21:16:25,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:16:25,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233198986] [2022-12-13 21:16:25,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:16:25,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:16:25,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:26,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 21:16:26,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:26,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 21:16:26,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:26,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 21:16:26,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:26,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 21:16:26,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:26,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-12-13 21:16:26,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:26,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-12-13 21:16:26,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:26,973 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-13 21:16:26,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:16:26,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233198986] [2022-12-13 21:16:26,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233198986] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 21:16:26,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [707653872] [2022-12-13 21:16:26,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:16:26,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 21:16:26,974 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d19267b5-2e5c-4b70-b9fe-6dc0c303275a/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 21:16:26,975 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d19267b5-2e5c-4b70-b9fe-6dc0c303275a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 21:16:26,976 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d19267b5-2e5c-4b70-b9fe-6dc0c303275a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 21:16:27,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:27,342 INFO L263 TraceCheckSpWp]: Trace formula consists of 2455 conjuncts, 40 conjunts are in the unsatisfiable core [2022-12-13 21:16:27,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:16:28,105 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 21:16:28,105 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 21:16:28,446 INFO L321 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-12-13 21:16:28,446 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 25 [2022-12-13 21:16:28,453 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-13 21:16:28,453 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 24 treesize of output 12 [2022-12-13 21:16:28,545 INFO L321 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-12-13 21:16:28,546 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 25 [2022-12-13 21:16:28,553 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-13 21:16:28,553 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 24 treesize of output 12 [2022-12-13 21:16:28,579 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 21:16:28,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [707653872] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 21:16:28,579 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 21:16:28,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 12] total 31 [2022-12-13 21:16:28,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126818422] [2022-12-13 21:16:28,580 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 21:16:28,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-12-13 21:16:28,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:16:28,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-12-13 21:16:28,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=823, Unknown=0, NotChecked=0, Total=930 [2022-12-13 21:16:28,581 INFO L87 Difference]: Start difference. First operand 157 states and 195 transitions. Second operand has 31 states, 30 states have (on average 3.2) internal successors, (96), 31 states have internal predecessors, (96), 8 states have call successors, (16), 3 states have call predecessors, (16), 7 states have return successors, (16), 7 states have call predecessors, (16), 7 states have call successors, (16) [2022-12-13 21:16:30,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:16:30,122 INFO L93 Difference]: Finished difference Result 277 states and 332 transitions. [2022-12-13 21:16:30,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-13 21:16:30,122 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 3.2) internal successors, (96), 31 states have internal predecessors, (96), 8 states have call successors, (16), 3 states have call predecessors, (16), 7 states have return successors, (16), 7 states have call predecessors, (16), 7 states have call successors, (16) Word has length 61 [2022-12-13 21:16:30,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:16:30,123 INFO L225 Difference]: With dead ends: 277 [2022-12-13 21:16:30,123 INFO L226 Difference]: Without dead ends: 223 [2022-12-13 21:16:30,124 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 113 SyntacticMatches, 3 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 510 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=376, Invalid=1880, Unknown=0, NotChecked=0, Total=2256 [2022-12-13 21:16:30,125 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 392 mSDsluCounter, 1427 mSDsCounter, 0 mSdLazyCounter, 885 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 1533 SdHoareTripleChecker+Invalid, 983 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 885 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-12-13 21:16:30,125 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 1533 Invalid, 983 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 885 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-12-13 21:16:30,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2022-12-13 21:16:30,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 202. [2022-12-13 21:16:30,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 150 states have (on average 1.16) internal successors, (174), 159 states have internal predecessors, (174), 30 states have call successors, (30), 15 states have call predecessors, (30), 21 states have return successors, (42), 27 states have call predecessors, (42), 28 states have call successors, (42) [2022-12-13 21:16:30,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 246 transitions. [2022-12-13 21:16:30,136 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 246 transitions. Word has length 61 [2022-12-13 21:16:30,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:16:30,136 INFO L495 AbstractCegarLoop]: Abstraction has 202 states and 246 transitions. [2022-12-13 21:16:30,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 3.2) internal successors, (96), 31 states have internal predecessors, (96), 8 states have call successors, (16), 3 states have call predecessors, (16), 7 states have return successors, (16), 7 states have call predecessors, (16), 7 states have call successors, (16) [2022-12-13 21:16:30,136 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 246 transitions. [2022-12-13 21:16:30,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-12-13 21:16:30,137 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:16:30,137 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, 1, 1, 1] [2022-12-13 21:16:30,147 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d19267b5-2e5c-4b70-b9fe-6dc0c303275a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 21:16:30,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d19267b5-2e5c-4b70-b9fe-6dc0c303275a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-13 21:16:30,340 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:16:30,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:16:30,341 INFO L85 PathProgramCache]: Analyzing trace with hash 151989603, now seen corresponding path program 1 times [2022-12-13 21:16:30,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:16:30,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204526798] [2022-12-13 21:16:30,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:16:30,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:16:30,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:31,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 21:16:31,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:31,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 21:16:31,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:31,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 21:16:31,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:31,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 21:16:31,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:31,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-12-13 21:16:31,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:31,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-12-13 21:16:31,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:31,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-12-13 21:16:31,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:31,184 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-12-13 21:16:31,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:16:31,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204526798] [2022-12-13 21:16:31,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204526798] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:16:31,185 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:16:31,185 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 21:16:31,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883661392] [2022-12-13 21:16:31,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:16:31,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 21:16:31,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:16:31,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 21:16:31,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-12-13 21:16:31,186 INFO L87 Difference]: Start difference. First operand 202 states and 246 transitions. Second operand has 9 states, 7 states have (on average 4.571428571428571) internal successors, (32), 8 states have internal predecessors, (32), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2022-12-13 21:16:31,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:16:31,374 INFO L93 Difference]: Finished difference Result 226 states and 275 transitions. [2022-12-13 21:16:31,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 21:16:31,375 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 4.571428571428571) internal successors, (32), 8 states have internal predecessors, (32), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) Word has length 63 [2022-12-13 21:16:31,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:16:31,376 INFO L225 Difference]: With dead ends: 226 [2022-12-13 21:16:31,376 INFO L226 Difference]: Without dead ends: 224 [2022-12-13 21:16:31,376 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-12-13 21:16:31,377 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 36 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 21:16:31,377 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 645 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 21:16:31,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2022-12-13 21:16:31,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 216. [2022-12-13 21:16:31,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 158 states have (on average 1.1518987341772151) internal successors, (182), 167 states have internal predecessors, (182), 34 states have call successors, (34), 17 states have call predecessors, (34), 23 states have return successors, (46), 31 states have call predecessors, (46), 32 states have call successors, (46) [2022-12-13 21:16:31,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 262 transitions. [2022-12-13 21:16:31,388 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 262 transitions. Word has length 63 [2022-12-13 21:16:31,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:16:31,389 INFO L495 AbstractCegarLoop]: Abstraction has 216 states and 262 transitions. [2022-12-13 21:16:31,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 4.571428571428571) internal successors, (32), 8 states have internal predecessors, (32), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2022-12-13 21:16:31,389 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 262 transitions. [2022-12-13 21:16:31,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-12-13 21:16:31,390 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:16:31,390 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, 1, 1, 1] [2022-12-13 21:16:31,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-13 21:16:31,390 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:16:31,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:16:31,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1802659993, now seen corresponding path program 1 times [2022-12-13 21:16:31,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:16:31,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132442151] [2022-12-13 21:16:31,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:16:31,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:16:31,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:31,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 21:16:31,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:31,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 21:16:31,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:31,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 21:16:31,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:31,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 21:16:31,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:31,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-12-13 21:16:31,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:31,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-12-13 21:16:31,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:31,842 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-12-13 21:16:31,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:16:31,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132442151] [2022-12-13 21:16:31,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132442151] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:16:31,843 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:16:31,843 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 21:16:31,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511940886] [2022-12-13 21:16:31,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:16:31,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 21:16:31,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:16:31,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 21:16:31,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-12-13 21:16:31,845 INFO L87 Difference]: Start difference. First operand 216 states and 262 transitions. Second operand has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 8 states have internal predecessors, (43), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-12-13 21:16:31,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:16:31,944 INFO L93 Difference]: Finished difference Result 244 states and 292 transitions. [2022-12-13 21:16:31,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 21:16:31,944 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 8 states have internal predecessors, (43), 2 states have call successors, (7), 2 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 63 [2022-12-13 21:16:31,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:16:31,945 INFO L225 Difference]: With dead ends: 244 [2022-12-13 21:16:31,945 INFO L226 Difference]: Without dead ends: 242 [2022-12-13 21:16:31,946 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-12-13 21:16:31,946 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 31 mSDsluCounter, 835 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 946 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 21:16:31,946 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 946 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 21:16:31,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2022-12-13 21:16:31,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 239. [2022-12-13 21:16:31,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 174 states have (on average 1.1379310344827587) internal successors, (198), 185 states have internal predecessors, (198), 37 states have call successors, (37), 19 states have call predecessors, (37), 27 states have return successors, (51), 34 states have call predecessors, (51), 35 states have call successors, (51) [2022-12-13 21:16:31,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 286 transitions. [2022-12-13 21:16:31,958 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 286 transitions. Word has length 63 [2022-12-13 21:16:31,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:16:31,959 INFO L495 AbstractCegarLoop]: Abstraction has 239 states and 286 transitions. [2022-12-13 21:16:31,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 8 states have internal predecessors, (43), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-12-13 21:16:31,959 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 286 transitions. [2022-12-13 21:16:31,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-12-13 21:16:31,960 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:16:31,960 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, 1, 1, 1] [2022-12-13 21:16:31,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-13 21:16:31,960 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:16:31,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:16:31,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1791242725, now seen corresponding path program 1 times [2022-12-13 21:16:31,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:16:31,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099987150] [2022-12-13 21:16:31,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:16:31,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:16:31,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:32,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 21:16:32,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:32,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 21:16:32,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:32,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 21:16:32,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:32,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 21:16:32,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:32,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-12-13 21:16:32,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:32,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-12-13 21:16:32,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:32,514 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 21:16:32,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:16:32,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099987150] [2022-12-13 21:16:32,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099987150] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:16:32,514 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:16:32,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 21:16:32,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530843268] [2022-12-13 21:16:32,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:16:32,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 21:16:32,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:16:32,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 21:16:32,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-12-13 21:16:32,515 INFO L87 Difference]: Start difference. First operand 239 states and 286 transitions. Second operand has 9 states, 8 states have (on average 5.875) internal successors, (47), 9 states have internal predecessors, (47), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-12-13 21:16:32,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:16:32,679 INFO L93 Difference]: Finished difference Result 283 states and 334 transitions. [2022-12-13 21:16:32,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 21:16:32,680 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.875) internal successors, (47), 9 states have internal predecessors, (47), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 63 [2022-12-13 21:16:32,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:16:32,681 INFO L225 Difference]: With dead ends: 283 [2022-12-13 21:16:32,681 INFO L226 Difference]: Without dead ends: 245 [2022-12-13 21:16:32,681 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-12-13 21:16:32,681 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 36 mSDsluCounter, 582 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 21:16:32,682 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 689 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 21:16:32,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2022-12-13 21:16:32,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 226. [2022-12-13 21:16:32,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 164 states have (on average 1.1402439024390243) internal successors, (187), 173 states have internal predecessors, (187), 36 states have call successors, (36), 19 states have call predecessors, (36), 25 states have return successors, (47), 33 states have call predecessors, (47), 34 states have call successors, (47) [2022-12-13 21:16:32,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 270 transitions. [2022-12-13 21:16:32,695 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 270 transitions. Word has length 63 [2022-12-13 21:16:32,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:16:32,695 INFO L495 AbstractCegarLoop]: Abstraction has 226 states and 270 transitions. [2022-12-13 21:16:32,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.875) internal successors, (47), 9 states have internal predecessors, (47), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-12-13 21:16:32,695 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 270 transitions. [2022-12-13 21:16:32,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-12-13 21:16:32,696 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:16:32,696 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, 1, 1, 1] [2022-12-13 21:16:32,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-13 21:16:32,696 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:16:32,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:16:32,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1204360676, now seen corresponding path program 1 times [2022-12-13 21:16:32,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:16:32,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382772753] [2022-12-13 21:16:32,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:16:32,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:16:32,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:33,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 21:16:33,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:33,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 21:16:33,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:33,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 21:16:33,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:33,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 21:16:33,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:33,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-12-13 21:16:33,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:33,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-12-13 21:16:33,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:33,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-12-13 21:16:33,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:33,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-12-13 21:16:33,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:33,386 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-12-13 21:16:33,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:16:33,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382772753] [2022-12-13 21:16:33,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382772753] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:16:33,387 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:16:33,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 21:16:33,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260967566] [2022-12-13 21:16:33,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:16:33,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 21:16:33,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:16:33,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 21:16:33,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 21:16:33,388 INFO L87 Difference]: Start difference. First operand 226 states and 270 transitions. Second operand has 8 states, 6 states have (on average 5.5) internal successors, (33), 7 states have internal predecessors, (33), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2022-12-13 21:16:33,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:16:33,512 INFO L93 Difference]: Finished difference Result 244 states and 289 transitions. [2022-12-13 21:16:33,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 21:16:33,513 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 5.5) internal successors, (33), 7 states have internal predecessors, (33), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) Word has length 69 [2022-12-13 21:16:33,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:16:33,514 INFO L225 Difference]: With dead ends: 244 [2022-12-13 21:16:33,514 INFO L226 Difference]: Without dead ends: 242 [2022-12-13 21:16:33,514 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-12-13 21:16:33,514 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 20 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 670 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 21:16:33,515 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 670 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 21:16:33,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2022-12-13 21:16:33,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 238. [2022-12-13 21:16:33,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 172 states have (on average 1.1337209302325582) internal successors, (195), 181 states have internal predecessors, (195), 38 states have call successors, (38), 21 states have call predecessors, (38), 27 states have return successors, (49), 35 states have call predecessors, (49), 36 states have call successors, (49) [2022-12-13 21:16:33,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 282 transitions. [2022-12-13 21:16:33,529 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 282 transitions. Word has length 69 [2022-12-13 21:16:33,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:16:33,529 INFO L495 AbstractCegarLoop]: Abstraction has 238 states and 282 transitions. [2022-12-13 21:16:33,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 5.5) internal successors, (33), 7 states have internal predecessors, (33), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2022-12-13 21:16:33,529 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 282 transitions. [2022-12-13 21:16:33,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-12-13 21:16:33,530 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:16:33,530 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, 1, 1, 1] [2022-12-13 21:16:33,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-13 21:16:33,530 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:16:33,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:16:33,531 INFO L85 PathProgramCache]: Analyzing trace with hash 348625887, now seen corresponding path program 1 times [2022-12-13 21:16:33,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:16:33,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541174775] [2022-12-13 21:16:33,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:16:33,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:16:33,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:34,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 21:16:34,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:34,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 21:16:34,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:34,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 21:16:34,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:34,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 21:16:34,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:34,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-12-13 21:16:34,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:34,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-12-13 21:16:34,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:34,957 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 21:16:34,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:16:34,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541174775] [2022-12-13 21:16:34,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541174775] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:16:34,957 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:16:34,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-13 21:16:34,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928120456] [2022-12-13 21:16:34,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:16:34,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 21:16:34,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:16:34,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 21:16:34,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-12-13 21:16:34,958 INFO L87 Difference]: Start difference. First operand 238 states and 282 transitions. Second operand has 13 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-12-13 21:16:35,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:16:35,593 INFO L93 Difference]: Finished difference Result 295 states and 354 transitions. [2022-12-13 21:16:35,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 21:16:35,593 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 67 [2022-12-13 21:16:35,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:16:35,594 INFO L225 Difference]: With dead ends: 295 [2022-12-13 21:16:35,594 INFO L226 Difference]: Without dead ends: 269 [2022-12-13 21:16:35,595 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2022-12-13 21:16:35,595 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 176 mSDsluCounter, 621 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 716 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 21:16:35,596 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 716 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 21:16:35,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2022-12-13 21:16:35,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 243. [2022-12-13 21:16:35,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 175 states have (on average 1.1314285714285715) internal successors, (198), 184 states have internal predecessors, (198), 40 states have call successors, (40), 21 states have call predecessors, (40), 27 states have return successors, (52), 37 states have call predecessors, (52), 38 states have call successors, (52) [2022-12-13 21:16:35,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 290 transitions. [2022-12-13 21:16:35,612 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 290 transitions. Word has length 67 [2022-12-13 21:16:35,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:16:35,612 INFO L495 AbstractCegarLoop]: Abstraction has 243 states and 290 transitions. [2022-12-13 21:16:35,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-12-13 21:16:35,612 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 290 transitions. [2022-12-13 21:16:35,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-12-13 21:16:35,613 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:16:35,613 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, 1, 1, 1] [2022-12-13 21:16:35,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-13 21:16:35,613 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:16:35,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:16:35,613 INFO L85 PathProgramCache]: Analyzing trace with hash 2139701523, now seen corresponding path program 1 times [2022-12-13 21:16:35,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:16:35,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706675964] [2022-12-13 21:16:35,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:16:35,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:16:35,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:36,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 21:16:36,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:36,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 21:16:36,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:36,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 21:16:36,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:36,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 21:16:36,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:36,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-12-13 21:16:36,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:36,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-12-13 21:16:36,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:36,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-12-13 21:16:36,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:36,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-12-13 21:16:36,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:36,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 21:16:36,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:36,952 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-12-13 21:16:36,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:16:36,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706675964] [2022-12-13 21:16:36,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706675964] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:16:36,952 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:16:36,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-13 21:16:36,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415890661] [2022-12-13 21:16:36,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:16:36,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 21:16:36,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:16:36,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 21:16:36,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-12-13 21:16:36,954 INFO L87 Difference]: Start difference. First operand 243 states and 290 transitions. Second operand has 11 states, 8 states have (on average 4.25) internal successors, (34), 9 states have internal predecessors, (34), 5 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2022-12-13 21:16:37,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:16:37,271 INFO L93 Difference]: Finished difference Result 257 states and 303 transitions. [2022-12-13 21:16:37,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 21:16:37,272 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 4.25) internal successors, (34), 9 states have internal predecessors, (34), 5 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) Word has length 75 [2022-12-13 21:16:37,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:16:37,272 INFO L225 Difference]: With dead ends: 257 [2022-12-13 21:16:37,273 INFO L226 Difference]: Without dead ends: 169 [2022-12-13 21:16:37,273 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2022-12-13 21:16:37,273 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 156 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 653 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 21:16:37,274 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 653 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 21:16:37,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2022-12-13 21:16:37,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 159. [2022-12-13 21:16:37,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 112 states have (on average 1.1607142857142858) internal successors, (130), 118 states have internal predecessors, (130), 28 states have call successors, (28), 14 states have call predecessors, (28), 18 states have return successors, (30), 26 states have call predecessors, (30), 25 states have call successors, (30) [2022-12-13 21:16:37,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 188 transitions. [2022-12-13 21:16:37,289 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 188 transitions. Word has length 75 [2022-12-13 21:16:37,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:16:37,289 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 188 transitions. [2022-12-13 21:16:37,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 4.25) internal successors, (34), 9 states have internal predecessors, (34), 5 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2022-12-13 21:16:37,289 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 188 transitions. [2022-12-13 21:16:37,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-12-13 21:16:37,290 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:16:37,290 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:16:37,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-13 21:16:37,291 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:16:37,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:16:37,291 INFO L85 PathProgramCache]: Analyzing trace with hash 35307555, now seen corresponding path program 1 times [2022-12-13 21:16:37,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:16:37,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996790913] [2022-12-13 21:16:37,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:16:37,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:16:37,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:37,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 21:16:37,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:37,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 21:16:37,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:37,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 21:16:37,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:37,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 21:16:37,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:37,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 21:16:37,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:37,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 21:16:37,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:37,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 21:16:37,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:37,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 21:16:37,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:37,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 21:16:37,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:37,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 21:16:37,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:37,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-12-13 21:16:37,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:37,606 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-12-13 21:16:37,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:16:37,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996790913] [2022-12-13 21:16:37,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996790913] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:16:37,606 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:16:37,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 21:16:37,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114044229] [2022-12-13 21:16:37,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:16:37,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 21:16:37,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:16:37,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 21:16:37,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-13 21:16:37,607 INFO L87 Difference]: Start difference. First operand 159 states and 188 transitions. Second operand has 8 states, 8 states have (on average 5.625) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2022-12-13 21:16:37,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:16:37,902 INFO L93 Difference]: Finished difference Result 281 states and 334 transitions. [2022-12-13 21:16:37,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 21:16:37,902 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) Word has length 79 [2022-12-13 21:16:37,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:16:37,903 INFO L225 Difference]: With dead ends: 281 [2022-12-13 21:16:37,903 INFO L226 Difference]: Without dead ends: 172 [2022-12-13 21:16:37,903 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2022-12-13 21:16:37,904 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 108 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 21:16:37,904 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 237 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 21:16:37,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2022-12-13 21:16:37,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 164. [2022-12-13 21:16:37,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 116 states have (on average 1.1551724137931034) internal successors, (134), 122 states have internal predecessors, (134), 28 states have call successors, (28), 14 states have call predecessors, (28), 19 states have return successors, (31), 27 states have call predecessors, (31), 25 states have call successors, (31) [2022-12-13 21:16:37,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 193 transitions. [2022-12-13 21:16:37,920 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 193 transitions. Word has length 79 [2022-12-13 21:16:37,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:16:37,920 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 193 transitions. [2022-12-13 21:16:37,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2022-12-13 21:16:37,920 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 193 transitions. [2022-12-13 21:16:37,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-12-13 21:16:37,921 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:16:37,921 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:16:37,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-13 21:16:37,921 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:16:37,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:16:37,921 INFO L85 PathProgramCache]: Analyzing trace with hash -277501736, now seen corresponding path program 1 times [2022-12-13 21:16:37,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:16:37,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109193995] [2022-12-13 21:16:37,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:16:37,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:16:37,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:38,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 21:16:38,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:38,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 21:16:38,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:38,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 21:16:38,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:38,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 21:16:38,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:38,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 21:16:38,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:38,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 21:16:38,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:38,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 21:16:38,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:38,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 21:16:38,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:38,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 21:16:38,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:38,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 21:16:38,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:38,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-12-13 21:16:38,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:38,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 21:16:38,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:38,594 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-12-13 21:16:38,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:16:38,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109193995] [2022-12-13 21:16:38,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109193995] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:16:38,595 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:16:38,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-13 21:16:38,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834273924] [2022-12-13 21:16:38,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:16:38,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 21:16:38,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:16:38,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 21:16:38,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-12-13 21:16:38,596 INFO L87 Difference]: Start difference. First operand 164 states and 193 transitions. Second operand has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 7 states have internal predecessors, (49), 3 states have call successors, (13), 5 states have call predecessors, (13), 2 states have return successors, (12), 4 states have call predecessors, (12), 3 states have call successors, (12) [2022-12-13 21:16:39,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:16:39,118 INFO L93 Difference]: Finished difference Result 274 states and 333 transitions. [2022-12-13 21:16:39,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 21:16:39,118 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 7 states have internal predecessors, (49), 3 states have call successors, (13), 5 states have call predecessors, (13), 2 states have return successors, (12), 4 states have call predecessors, (12), 3 states have call successors, (12) Word has length 85 [2022-12-13 21:16:39,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:16:39,119 INFO L225 Difference]: With dead ends: 274 [2022-12-13 21:16:39,119 INFO L226 Difference]: Without dead ends: 203 [2022-12-13 21:16:39,120 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2022-12-13 21:16:39,120 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 172 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 654 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 654 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 21:16:39,120 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 275 Invalid, 750 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 654 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 21:16:39,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2022-12-13 21:16:39,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 171. [2022-12-13 21:16:39,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 122 states have (on average 1.1557377049180328) internal successors, (141), 128 states have internal predecessors, (141), 28 states have call successors, (28), 14 states have call predecessors, (28), 20 states have return successors, (32), 28 states have call predecessors, (32), 25 states have call successors, (32) [2022-12-13 21:16:39,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 201 transitions. [2022-12-13 21:16:39,131 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 201 transitions. Word has length 85 [2022-12-13 21:16:39,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:16:39,131 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 201 transitions. [2022-12-13 21:16:39,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 7 states have internal predecessors, (49), 3 states have call successors, (13), 5 states have call predecessors, (13), 2 states have return successors, (12), 4 states have call predecessors, (12), 3 states have call successors, (12) [2022-12-13 21:16:39,131 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 201 transitions. [2022-12-13 21:16:39,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-12-13 21:16:39,132 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:16:39,132 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:16:39,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-12-13 21:16:39,132 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:16:39,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:16:39,132 INFO L85 PathProgramCache]: Analyzing trace with hash -58647018, now seen corresponding path program 1 times [2022-12-13 21:16:39,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:16:39,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423902232] [2022-12-13 21:16:39,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:16:39,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:16:39,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:39,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 21:16:39,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:39,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 21:16:39,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:39,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 21:16:39,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:39,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 21:16:39,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:39,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 21:16:39,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:39,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 21:16:39,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:39,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 21:16:39,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:39,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 21:16:39,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:39,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 21:16:39,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:39,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 21:16:39,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:39,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-12-13 21:16:39,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:39,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 21:16:39,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:39,320 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-12-13 21:16:39,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:16:39,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423902232] [2022-12-13 21:16:39,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423902232] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:16:39,320 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:16:39,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 21:16:39,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446633038] [2022-12-13 21:16:39,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:16:39,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 21:16:39,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:16:39,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 21:16:39,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-13 21:16:39,321 INFO L87 Difference]: Start difference. First operand 171 states and 201 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 4 states have internal predecessors, (49), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-12-13 21:16:39,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:16:39,524 INFO L93 Difference]: Finished difference Result 247 states and 288 transitions. [2022-12-13 21:16:39,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 21:16:39,525 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 4 states have internal predecessors, (49), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 85 [2022-12-13 21:16:39,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:16:39,525 INFO L225 Difference]: With dead ends: 247 [2022-12-13 21:16:39,525 INFO L226 Difference]: Without dead ends: 175 [2022-12-13 21:16:39,526 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-13 21:16:39,526 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 121 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 21:16:39,526 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 151 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 21:16:39,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2022-12-13 21:16:39,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 170. [2022-12-13 21:16:39,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 121 states have (on average 1.140495867768595) internal successors, (138), 127 states have internal predecessors, (138), 28 states have call successors, (28), 14 states have call predecessors, (28), 20 states have return successors, (32), 28 states have call predecessors, (32), 25 states have call successors, (32) [2022-12-13 21:16:39,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 198 transitions. [2022-12-13 21:16:39,537 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 198 transitions. Word has length 85 [2022-12-13 21:16:39,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:16:39,537 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 198 transitions. [2022-12-13 21:16:39,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 4 states have internal predecessors, (49), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-12-13 21:16:39,537 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 198 transitions. [2022-12-13 21:16:39,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-12-13 21:16:39,538 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:16:39,538 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:16:39,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-12-13 21:16:39,538 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:16:39,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:16:39,538 INFO L85 PathProgramCache]: Analyzing trace with hash 2136981433, now seen corresponding path program 1 times [2022-12-13 21:16:39,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:16:39,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031445806] [2022-12-13 21:16:39,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:16:39,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:16:39,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:39,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 21:16:39,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:39,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 21:16:39,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:39,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 21:16:39,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:39,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 21:16:39,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:39,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 21:16:39,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:39,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 21:16:39,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:39,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 21:16:39,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:39,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 21:16:39,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:39,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 21:16:39,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:39,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 21:16:39,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:39,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-12-13 21:16:39,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:39,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-12-13 21:16:39,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:39,701 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-12-13 21:16:39,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:16:39,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031445806] [2022-12-13 21:16:39,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031445806] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:16:39,702 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:16:39,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 21:16:39,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107624400] [2022-12-13 21:16:39,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:16:39,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 21:16:39,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:16:39,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 21:16:39,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-13 21:16:39,703 INFO L87 Difference]: Start difference. First operand 170 states and 198 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-12-13 21:16:39,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:16:39,866 INFO L93 Difference]: Finished difference Result 234 states and 269 transitions. [2022-12-13 21:16:39,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 21:16:39,866 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 87 [2022-12-13 21:16:39,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:16:39,867 INFO L225 Difference]: With dead ends: 234 [2022-12-13 21:16:39,867 INFO L226 Difference]: Without dead ends: 100 [2022-12-13 21:16:39,868 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-13 21:16:39,868 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 65 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 21:16:39,868 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 157 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 21:16:39,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-12-13 21:16:39,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 98. [2022-12-13 21:16:39,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 69 states have (on average 1.0724637681159421) internal successors, (74), 71 states have internal predecessors, (74), 17 states have call successors, (17), 10 states have call predecessors, (17), 11 states have return successors, (17), 16 states have call predecessors, (17), 16 states have call successors, (17) [2022-12-13 21:16:39,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 108 transitions. [2022-12-13 21:16:39,873 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 108 transitions. Word has length 87 [2022-12-13 21:16:39,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:16:39,874 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 108 transitions. [2022-12-13 21:16:39,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-12-13 21:16:39,874 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 108 transitions. [2022-12-13 21:16:39,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-12-13 21:16:39,874 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:16:39,874 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:16:39,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-12-13 21:16:39,875 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:16:39,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:16:39,875 INFO L85 PathProgramCache]: Analyzing trace with hash -1322477714, now seen corresponding path program 1 times [2022-12-13 21:16:39,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:16:39,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125908901] [2022-12-13 21:16:39,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:16:39,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:16:40,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:40,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 21:16:40,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:40,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 21:16:40,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:40,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 21:16:40,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:40,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 21:16:40,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:40,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 21:16:40,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:40,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 21:16:40,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:40,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 21:16:40,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:40,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 21:16:40,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:40,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 21:16:40,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:40,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 21:16:40,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:40,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 21:16:40,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:40,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 21:16:40,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:40,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-12-13 21:16:40,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:41,037 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-12-13 21:16:41,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:16:41,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125908901] [2022-12-13 21:16:41,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125908901] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:16:41,038 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:16:41,038 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-12-13 21:16:41,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348590134] [2022-12-13 21:16:41,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:16:41,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 21:16:41,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:16:41,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 21:16:41,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-12-13 21:16:41,040 INFO L87 Difference]: Start difference. First operand 98 states and 108 transitions. Second operand has 14 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 6 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-12-13 21:16:41,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:16:41,589 INFO L93 Difference]: Finished difference Result 152 states and 164 transitions. [2022-12-13 21:16:41,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 21:16:41,590 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 6 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) Word has length 90 [2022-12-13 21:16:41,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:16:41,590 INFO L225 Difference]: With dead ends: 152 [2022-12-13 21:16:41,590 INFO L226 Difference]: Without dead ends: 95 [2022-12-13 21:16:41,591 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=329, Unknown=0, NotChecked=0, Total=420 [2022-12-13 21:16:41,591 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 183 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 597 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 658 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 21:16:41,591 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 191 Invalid, 658 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 597 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 21:16:41,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-12-13 21:16:41,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2022-12-13 21:16:41,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 68 states have (on average 1.0294117647058822) internal successors, (70), 69 states have internal predecessors, (70), 16 states have call successors, (16), 10 states have call predecessors, (16), 10 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-12-13 21:16:41,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 101 transitions. [2022-12-13 21:16:41,597 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 101 transitions. Word has length 90 [2022-12-13 21:16:41,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:16:41,597 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 101 transitions. [2022-12-13 21:16:41,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 6 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-12-13 21:16:41,597 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 101 transitions. [2022-12-13 21:16:41,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-12-13 21:16:41,598 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:16:41,598 INFO L195 NwaCegarLoop]: trace histogram [5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:16:41,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-12-13 21:16:41,598 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:16:41,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:16:41,598 INFO L85 PathProgramCache]: Analyzing trace with hash -11289161, now seen corresponding path program 1 times [2022-12-13 21:16:41,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:16:41,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077969519] [2022-12-13 21:16:41,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:16:41,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:16:41,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:42,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 21:16:42,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:42,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 21:16:42,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:42,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 21:16:42,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:42,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 21:16:42,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:42,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 21:16:42,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:42,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 21:16:42,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:42,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 21:16:42,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:42,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 21:16:42,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:42,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 21:16:42,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:42,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 21:16:42,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:42,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 21:16:42,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:42,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 21:16:42,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:42,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-12-13 21:16:42,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:43,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-12-13 21:16:43,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:43,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-12-13 21:16:43,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:43,498 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-12-13 21:16:43,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:16:43,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077969519] [2022-12-13 21:16:43,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077969519] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 21:16:43,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2075550202] [2022-12-13 21:16:43,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:16:43,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 21:16:43,499 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d19267b5-2e5c-4b70-b9fe-6dc0c303275a/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 21:16:43,500 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d19267b5-2e5c-4b70-b9fe-6dc0c303275a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 21:16:43,500 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d19267b5-2e5c-4b70-b9fe-6dc0c303275a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 21:16:43,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:16:43,848 INFO L263 TraceCheckSpWp]: Trace formula consists of 2613 conjuncts, 34 conjunts are in the unsatisfiable core [2022-12-13 21:16:43,851 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:16:44,665 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-12-13 21:16:44,665 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 21:16:44,869 INFO L321 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-12-13 21:16:44,870 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 24 treesize of output 19 [2022-12-13 21:16:44,958 INFO L321 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-12-13 21:16:44,958 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 24 treesize of output 19 [2022-12-13 21:16:45,007 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-12-13 21:16:45,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2075550202] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 21:16:45,008 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 21:16:45,008 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 12, 10] total 33 [2022-12-13 21:16:45,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397141732] [2022-12-13 21:16:45,008 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 21:16:45,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-12-13 21:16:45,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:16:45,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-12-13 21:16:45,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=935, Unknown=0, NotChecked=0, Total=1056 [2022-12-13 21:16:45,010 INFO L87 Difference]: Start difference. First operand 95 states and 101 transitions. Second operand has 33 states, 31 states have (on average 4.516129032258065) internal successors, (140), 31 states have internal predecessors, (140), 11 states have call successors, (32), 5 states have call predecessors, (32), 7 states have return successors, (29), 10 states have call predecessors, (29), 10 states have call successors, (29) [2022-12-13 21:16:46,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:16:46,654 INFO L93 Difference]: Finished difference Result 95 states and 101 transitions. [2022-12-13 21:16:46,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 21:16:46,655 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 31 states have (on average 4.516129032258065) internal successors, (140), 31 states have internal predecessors, (140), 11 states have call successors, (32), 5 states have call predecessors, (32), 7 states have return successors, (29), 10 states have call predecessors, (29), 10 states have call successors, (29) Word has length 116 [2022-12-13 21:16:46,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:16:46,655 INFO L225 Difference]: With dead ends: 95 [2022-12-13 21:16:46,655 INFO L226 Difference]: Without dead ends: 0 [2022-12-13 21:16:46,656 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 240 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 472 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=234, Invalid=1488, Unknown=0, NotChecked=0, Total=1722 [2022-12-13 21:16:46,656 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 233 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 928 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 1021 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 928 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-12-13 21:16:46,656 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 306 Invalid, 1021 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 928 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-12-13 21:16:46,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-12-13 21:16:46,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-12-13 21:16:46,657 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-12-13 21:16:46,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-12-13 21:16:46,657 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 116 [2022-12-13 21:16:46,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:16:46,657 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-12-13 21:16:46,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 31 states have (on average 4.516129032258065) internal successors, (140), 31 states have internal predecessors, (140), 11 states have call successors, (32), 5 states have call predecessors, (32), 7 states have return successors, (29), 10 states have call predecessors, (29), 10 states have call successors, (29) [2022-12-13 21:16:46,657 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-12-13 21:16:46,657 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-12-13 21:16:46,659 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-12-13 21:16:46,667 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d19267b5-2e5c-4b70-b9fe-6dc0c303275a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-13 21:16:46,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d19267b5-2e5c-4b70-b9fe-6dc0c303275a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-12-13 21:16:46,866 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-12-13 21:16:49,490 INFO L895 garLoopResultBuilder]: At program point L6894(line 6894) the Hoare annotation is: (or (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) (and (forall ((|v_ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base_BEFORE_CALL_15| Int)) (not (let ((.cse0 (select (select |#memory_int| |v_ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base_BEFORE_CALL_15|) 16))) (<= .cse0 (+ (* 18446744073709551616 (div (+ (- 1) .cse0) 18446744073709551616)) 36028797018963967))))) (forall ((|v_ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base_BEFORE_CALL_15| Int)) (not (let ((.cse1 (select (select |#memory_int| |v_ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base_BEFORE_CALL_15|) 16))) (<= .cse1 (+ 18446744073709551615 (* (div (+ .cse1 (- 36028797018963968)) 18446744073709551616) 18446744073709551616))))))) (not (<= |~#s_can_fail_allocator_static~0.offset| 0)) (not (<= 0 |~#s_can_fail_allocator_static~0.offset|))) [2022-12-13 21:16:49,490 INFO L899 garLoopResultBuilder]: For program point L6896-1(line 6896) no Hoare annotation was computed. [2022-12-13 21:16:49,490 INFO L895 garLoopResultBuilder]: At program point L6896(line 6896) the Hoare annotation is: (or (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) (and (forall ((|v_ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base_BEFORE_CALL_15| Int)) (not (let ((.cse0 (select (select |#memory_int| |v_ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base_BEFORE_CALL_15|) 16))) (<= .cse0 (+ (* 18446744073709551616 (div (+ (- 1) .cse0) 18446744073709551616)) 36028797018963967))))) (forall ((|v_ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base_BEFORE_CALL_15| Int)) (not (let ((.cse1 (select (select |#memory_int| |v_ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base_BEFORE_CALL_15|) 16))) (<= .cse1 (+ 18446744073709551615 (* (div (+ .cse1 (- 36028797018963968)) 18446744073709551616) 18446744073709551616))))))) (not (<= |~#s_can_fail_allocator_static~0.offset| 0)) (not (<= 0 |~#s_can_fail_allocator_static~0.offset|))) [2022-12-13 21:16:49,491 INFO L899 garLoopResultBuilder]: For program point L6894-3(lines 6894 6896) no Hoare annotation was computed. [2022-12-13 21:16:49,491 INFO L899 garLoopResultBuilder]: For program point L6894-1(lines 6894 6896) no Hoare annotation was computed. [2022-12-13 21:16:49,491 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 6893 6897) the Hoare annotation is: (or (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) (and (forall ((|v_ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base_BEFORE_CALL_15| Int)) (not (let ((.cse0 (select (select |#memory_int| |v_ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base_BEFORE_CALL_15|) 16))) (<= .cse0 (+ (* 18446744073709551616 (div (+ (- 1) .cse0) 18446744073709551616)) 36028797018963967))))) (forall ((|v_ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base_BEFORE_CALL_15| Int)) (not (let ((.cse1 (select (select |#memory_int| |v_ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base_BEFORE_CALL_15|) 16))) (<= .cse1 (+ 18446744073709551615 (* (div (+ .cse1 (- 36028797018963968)) 18446744073709551616) 18446744073709551616))))))) (not (<= |~#s_can_fail_allocator_static~0.offset| 0)) (not (<= 0 |~#s_can_fail_allocator_static~0.offset|))) [2022-12-13 21:16:49,491 INFO L899 garLoopResultBuilder]: For program point can_fail_mallocFINAL(lines 6893 6897) no Hoare annotation was computed. [2022-12-13 21:16:49,491 INFO L899 garLoopResultBuilder]: For program point can_fail_mallocEXIT(lines 6893 6897) no Hoare annotation was computed. [2022-12-13 21:16:49,491 INFO L899 garLoopResultBuilder]: For program point bounded_mallocFINAL(lines 6876 6881) no Hoare annotation was computed. [2022-12-13 21:16:49,491 INFO L899 garLoopResultBuilder]: For program point L6877-1(lines 6877 6879) no Hoare annotation was computed. [2022-12-13 21:16:49,492 INFO L895 garLoopResultBuilder]: At program point L6877(lines 6877 6879) the Hoare annotation is: (or (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) (and (forall ((|v_ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base_BEFORE_CALL_15| Int)) (not (let ((.cse0 (select (select |#memory_int| |v_ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base_BEFORE_CALL_15|) 16))) (<= .cse0 (+ (* 18446744073709551616 (div (+ (- 1) .cse0) 18446744073709551616)) 36028797018963967))))) (forall ((|v_ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base_BEFORE_CALL_15| Int)) (not (let ((.cse1 (select (select |#memory_int| |v_ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base_BEFORE_CALL_15|) 16))) (<= .cse1 (+ 18446744073709551615 (* (div (+ .cse1 (- 36028797018963968)) 18446744073709551616) 18446744073709551616))))))) (not (<= |~#s_can_fail_allocator_static~0.offset| 0)) (not (<= 0 |~#s_can_fail_allocator_static~0.offset|))) [2022-12-13 21:16:49,492 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 6876 6881) the Hoare annotation is: (or (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) (and (forall ((|v_ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base_BEFORE_CALL_15| Int)) (not (let ((.cse0 (select (select |#memory_int| |v_ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base_BEFORE_CALL_15|) 16))) (<= .cse0 (+ (* 18446744073709551616 (div (+ (- 1) .cse0) 18446744073709551616)) 36028797018963967))))) (forall ((|v_ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base_BEFORE_CALL_15| Int)) (not (let ((.cse1 (select (select |#memory_int| |v_ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base_BEFORE_CALL_15|) 16))) (<= .cse1 (+ 18446744073709551615 (* (div (+ .cse1 (- 36028797018963968)) 18446744073709551616) 18446744073709551616))))))) (not (<= |~#s_can_fail_allocator_static~0.offset| 0)) (not (<= 0 |~#s_can_fail_allocator_static~0.offset|))) [2022-12-13 21:16:49,492 INFO L899 garLoopResultBuilder]: For program point bounded_mallocEXIT(lines 6876 6881) no Hoare annotation was computed. [2022-12-13 21:16:49,492 INFO L899 garLoopResultBuilder]: For program point aws_mem_acquireEXIT(lines 6922 6932) no Hoare annotation was computed. [2022-12-13 21:16:49,492 INFO L899 garLoopResultBuilder]: For program point L6928-2(lines 6928 6930) no Hoare annotation was computed. [2022-12-13 21:16:49,493 INFO L899 garLoopResultBuilder]: For program point L6927(line 6927) no Hoare annotation was computed. [2022-12-13 21:16:49,493 INFO L899 garLoopResultBuilder]: For program point L6928(lines 6928 6930) no Hoare annotation was computed. [2022-12-13 21:16:49,493 INFO L899 garLoopResultBuilder]: For program point L6929-1(line 6929) no Hoare annotation was computed. [2022-12-13 21:16:49,493 INFO L895 garLoopResultBuilder]: At program point L6929(line 6929) the Hoare annotation is: (or (and (< 0 (+ aws_mem_acquire_~mem~0.offset 1)) (<= aws_mem_acquire_~mem~0.base 0) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (<= aws_mem_acquire_~mem~0.offset 0) (< 0 (+ aws_mem_acquire_~mem~0.base 1))) (and (forall ((|v_ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base_BEFORE_CALL_15| Int)) (not (let ((.cse0 (select (select |#memory_int| |v_ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base_BEFORE_CALL_15|) 16))) (<= .cse0 (+ (* 18446744073709551616 (div (+ (- 1) .cse0) 18446744073709551616)) 36028797018963967))))) (forall ((|v_ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base_BEFORE_CALL_15| Int)) (not (let ((.cse1 (select (select |#memory_int| |v_ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base_BEFORE_CALL_15|) 16))) (<= .cse1 (+ 18446744073709551615 (* (div (+ .cse1 (- 36028797018963968)) 18446744073709551616) 18446744073709551616))))))) (not (<= |~#s_can_fail_allocator_static~0.offset| 0)) (not (<= 0 |~#s_can_fail_allocator_static~0.offset|))) [2022-12-13 21:16:49,493 INFO L895 garLoopResultBuilder]: At program point L6923-1(line 6923) the Hoare annotation is: (or (and (= |old(#length)| |#length|) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= |old(#valid)| |#valid|)) (and (forall ((|v_ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base_BEFORE_CALL_15| Int)) (not (let ((.cse0 (select (select |#memory_int| |v_ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base_BEFORE_CALL_15|) 16))) (<= .cse0 (+ (* 18446744073709551616 (div (+ (- 1) .cse0) 18446744073709551616)) 36028797018963967))))) (forall ((|v_ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base_BEFORE_CALL_15| Int)) (not (let ((.cse1 (select (select |#memory_int| |v_ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base_BEFORE_CALL_15|) 16))) (<= .cse1 (+ 18446744073709551615 (* (div (+ .cse1 (- 36028797018963968)) 18446744073709551616) 18446744073709551616))))))) (not (<= |~#s_can_fail_allocator_static~0.offset| 0)) (not (<= 0 |~#s_can_fail_allocator_static~0.offset|))) [2022-12-13 21:16:49,494 INFO L895 garLoopResultBuilder]: At program point L6923(line 6923) the Hoare annotation is: (or (and (= |old(#length)| |#length|) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= |old(#valid)| |#valid|)) (and (forall ((|v_ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base_BEFORE_CALL_15| Int)) (not (let ((.cse0 (select (select |#memory_int| |v_ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base_BEFORE_CALL_15|) 16))) (<= .cse0 (+ (* 18446744073709551616 (div (+ (- 1) .cse0) 18446744073709551616)) 36028797018963967))))) (forall ((|v_ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base_BEFORE_CALL_15| Int)) (not (let ((.cse1 (select (select |#memory_int| |v_ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base_BEFORE_CALL_15|) 16))) (<= .cse1 (+ 18446744073709551615 (* (div (+ .cse1 (- 36028797018963968)) 18446744073709551616) 18446744073709551616))))))) (not (<= |~#s_can_fail_allocator_static~0.offset| 0)) (not (<= 0 |~#s_can_fail_allocator_static~0.offset|))) [2022-12-13 21:16:49,494 INFO L895 garLoopResultBuilder]: At program point L6925-1(line 6925) the Hoare annotation is: (or (and (= |old(#length)| |#length|) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= |old(#valid)| |#valid|)) (and (forall ((|v_ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base_BEFORE_CALL_15| Int)) (not (let ((.cse0 (select (select |#memory_int| |v_ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base_BEFORE_CALL_15|) 16))) (<= .cse0 (+ (* 18446744073709551616 (div (+ (- 1) .cse0) 18446744073709551616)) 36028797018963967))))) (forall ((|v_ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base_BEFORE_CALL_15| Int)) (not (let ((.cse1 (select (select |#memory_int| |v_ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base_BEFORE_CALL_15|) 16))) (<= .cse1 (+ 18446744073709551615 (* (div (+ .cse1 (- 36028797018963968)) 18446744073709551616) 18446744073709551616))))))) (not (<= |~#s_can_fail_allocator_static~0.offset| 0)) (not (<= 0 |~#s_can_fail_allocator_static~0.offset|))) [2022-12-13 21:16:49,494 INFO L895 garLoopResultBuilder]: At program point L6925(line 6925) the Hoare annotation is: (or (and (= |old(#length)| |#length|) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= |old(#valid)| |#valid|)) (and (forall ((|v_ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base_BEFORE_CALL_15| Int)) (not (let ((.cse0 (select (select |#memory_int| |v_ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base_BEFORE_CALL_15|) 16))) (<= .cse0 (+ (* 18446744073709551616 (div (+ (- 1) .cse0) 18446744073709551616)) 36028797018963967))))) (forall ((|v_ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base_BEFORE_CALL_15| Int)) (not (let ((.cse1 (select (select |#memory_int| |v_ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base_BEFORE_CALL_15|) 16))) (<= .cse1 (+ 18446744073709551615 (* (div (+ .cse1 (- 36028797018963968)) 18446744073709551616) 18446744073709551616))))))) (not (<= |~#s_can_fail_allocator_static~0.offset| 0)) (not (<= 0 |~#s_can_fail_allocator_static~0.offset|))) [2022-12-13 21:16:49,494 INFO L899 garLoopResultBuilder]: For program point aws_mem_acquireFINAL(lines 6922 6932) no Hoare annotation was computed. [2022-12-13 21:16:49,494 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 6922 6932) the Hoare annotation is: (or (and (= |old(#length)| |#length|) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= |old(#valid)| |#valid|)) (and (forall ((|v_ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base_BEFORE_CALL_15| Int)) (not (let ((.cse0 (select (select |#memory_int| |v_ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base_BEFORE_CALL_15|) 16))) (<= .cse0 (+ (* 18446744073709551616 (div (+ (- 1) .cse0) 18446744073709551616)) 36028797018963967))))) (forall ((|v_ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base_BEFORE_CALL_15| Int)) (not (let ((.cse1 (select (select |#memory_int| |v_ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base_BEFORE_CALL_15|) 16))) (<= .cse1 (+ 18446744073709551615 (* (div (+ .cse1 (- 36028797018963968)) 18446744073709551616) 18446744073709551616))))))) (not (<= |~#s_can_fail_allocator_static~0.offset| 0)) (not (<= 0 |~#s_can_fail_allocator_static~0.offset|))) [2022-12-13 21:16:49,495 INFO L899 garLoopResultBuilder]: For program point L6923-2(line 6923) no Hoare annotation was computed. [2022-12-13 21:16:49,495 INFO L899 garLoopResultBuilder]: For program point L7162(line 7162) no Hoare annotation was computed. [2022-12-13 21:16:49,495 INFO L899 garLoopResultBuilder]: For program point L7162-4(line 7162) no Hoare annotation was computed. [2022-12-13 21:16:49,495 INFO L899 garLoopResultBuilder]: For program point L7162-3(line 7162) no Hoare annotation was computed. [2022-12-13 21:16:49,495 INFO L899 garLoopResultBuilder]: For program point L7162-2(line 7162) no Hoare annotation was computed. [2022-12-13 21:16:49,495 INFO L899 garLoopResultBuilder]: For program point L7162-8(line 7162) no Hoare annotation was computed. [2022-12-13 21:16:49,495 INFO L899 garLoopResultBuilder]: For program point L7162-6(line 7162) no Hoare annotation was computed. [2022-12-13 21:16:49,495 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 7157 7163) the Hoare annotation is: true [2022-12-13 21:16:49,495 INFO L899 garLoopResultBuilder]: For program point aws_byte_buf_is_validFINAL(lines 7157 7163) no Hoare annotation was computed. [2022-12-13 21:16:49,495 INFO L899 garLoopResultBuilder]: For program point aws_byte_buf_is_validEXIT(lines 7157 7163) no Hoare annotation was computed. [2022-12-13 21:16:49,495 INFO L899 garLoopResultBuilder]: For program point L7159-1(line 7159) no Hoare annotation was computed. [2022-12-13 21:16:49,496 INFO L899 garLoopResultBuilder]: For program point L7159(lines 7159 7162) no Hoare annotation was computed. [2022-12-13 21:16:49,496 INFO L899 garLoopResultBuilder]: For program point L7159-4(lines 7159 7160) no Hoare annotation was computed. [2022-12-13 21:16:49,496 INFO L899 garLoopResultBuilder]: For program point L7159-3(line 7159) no Hoare annotation was computed. [2022-12-13 21:16:49,496 INFO L899 garLoopResultBuilder]: For program point L7159-9(lines 7159 7162) no Hoare annotation was computed. [2022-12-13 21:16:49,496 INFO L899 garLoopResultBuilder]: For program point L7159-7(lines 7159 7162) no Hoare annotation was computed. [2022-12-13 21:16:49,496 INFO L899 garLoopResultBuilder]: For program point L7159-6(lines 7159 7160) no Hoare annotation was computed. [2022-12-13 21:16:49,496 INFO L899 garLoopResultBuilder]: For program point L7159-11(lines 7159 7162) no Hoare annotation was computed. [2022-12-13 21:16:49,496 INFO L899 garLoopResultBuilder]: For program point nondet_boolFINAL(line 261) no Hoare annotation was computed. [2022-12-13 21:16:49,496 INFO L899 garLoopResultBuilder]: For program point nondet_boolEXIT(line 261) no Hoare annotation was computed. [2022-12-13 21:16:49,496 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 261) the Hoare annotation is: true [2022-12-13 21:16:49,496 INFO L899 garLoopResultBuilder]: For program point L211-2(lines 210 212) no Hoare annotation was computed. [2022-12-13 21:16:49,497 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 210 212) the Hoare annotation is: true [2022-12-13 21:16:49,497 INFO L899 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2022-12-13 21:16:49,497 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 210 212) no Hoare annotation was computed. [2022-12-13 21:16:49,497 INFO L899 garLoopResultBuilder]: For program point L7099(lines 7099 7101) no Hoare annotation was computed. [2022-12-13 21:16:49,497 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 1988 1999) the Hoare annotation is: (or (= ~tl_last_error~0 |old(~tl_last_error~0)|) (not (<= |~#s_can_fail_allocator_static~0.offset| 0)) (not (<= 0 |~#s_can_fail_allocator_static~0.offset|))) [2022-12-13 21:16:49,497 INFO L899 garLoopResultBuilder]: For program point aws_raise_errorFINAL(lines 1988 1999) no Hoare annotation was computed. [2022-12-13 21:16:49,497 INFO L899 garLoopResultBuilder]: For program point aws_raise_errorEXIT(lines 1988 1999) no Hoare annotation was computed. [2022-12-13 21:16:49,497 INFO L899 garLoopResultBuilder]: For program point can_fail_allocatorFINAL(lines 6883 6885) no Hoare annotation was computed. [2022-12-13 21:16:49,497 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 6883 6885) the Hoare annotation is: true [2022-12-13 21:16:49,497 INFO L899 garLoopResultBuilder]: For program point can_fail_allocatorEXIT(lines 6883 6885) no Hoare annotation was computed. [2022-12-13 21:16:49,498 INFO L899 garLoopResultBuilder]: For program point aws_allocator_is_validFINAL(lines 6917 6920) no Hoare annotation was computed. [2022-12-13 21:16:49,498 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 6917 6920) the Hoare annotation is: true [2022-12-13 21:16:49,498 INFO L899 garLoopResultBuilder]: For program point L6919-1(line 6919) no Hoare annotation was computed. [2022-12-13 21:16:49,498 INFO L902 garLoopResultBuilder]: At program point L6919(line 6919) the Hoare annotation is: true [2022-12-13 21:16:49,498 INFO L899 garLoopResultBuilder]: For program point aws_allocator_is_validEXIT(lines 6917 6920) no Hoare annotation was computed. [2022-12-13 21:16:49,498 INFO L899 garLoopResultBuilder]: For program point L7117-2(lines 7117 7121) no Hoare annotation was computed. [2022-12-13 21:16:49,498 INFO L895 garLoopResultBuilder]: At program point L8752(line 8752) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| 24))) (and (= |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset| |ULTIMATE.start_aws_byte_buf_init_harness_#t~mem1141#1.offset|) (= (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|) 0) (= |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) (+ 16 |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset|))) (<= 0 |~#s_can_fail_allocator_static~0.offset|) (= |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| |ULTIMATE.start_aws_byte_buf_init_~capacity#1|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) .cse0) |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|) (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) (not (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| 0)) (= |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) .cse0)) (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|) (= |ULTIMATE.start_aws_byte_buf_init_harness_#t~mem1141#1.base| |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|) (= |ULTIMATE.start_aws_byte_buf_init_~allocator#1.base| |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|) (= |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset| |ULTIMATE.start_aws_byte_buf_init_~allocator#1.offset|) (<= |~#s_can_fail_allocator_static~0.offset| 0))) [2022-12-13 21:16:49,498 INFO L899 garLoopResultBuilder]: For program point L8752-1(line 8752) no Hoare annotation was computed. [2022-12-13 21:16:49,499 INFO L899 garLoopResultBuilder]: For program point L7117(lines 7117 7118) no Hoare annotation was computed. [2022-12-13 21:16:49,499 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(line 8757) the Hoare annotation is: true [2022-12-13 21:16:49,499 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-12-13 21:16:49,499 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-12-13 21:16:49,499 INFO L895 garLoopResultBuilder]: At program point L7126(line 7126) the Hoare annotation is: (let ((.cse16 (+ |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| 24)) (.cse15 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|))) (let ((.cse0 (= (select .cse15 |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|) 0)) (.cse1 (= |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) (+ 16 |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset|)))) (.cse3 (<= 0 |~#s_can_fail_allocator_static~0.offset|)) (.cse4 (= |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset| 0)) (.cse5 (= |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| |ULTIMATE.start_aws_byte_buf_init_~capacity#1|)) (.cse6 (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) .cse16) |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|)) (.cse7 (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|)) (.cse8 (not (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| 0))) (.cse9 (= |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) .cse16))) (.cse10 (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|)) (.cse11 (= |ULTIMATE.start_aws_byte_buf_init_~allocator#1.base| |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|)) (.cse12 (= |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset| |ULTIMATE.start_aws_byte_buf_init_~allocator#1.offset|)) (.cse13 (<= |~#s_can_fail_allocator_static~0.offset| 0))) (or (let ((.cse2 (+ 8 |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|))) (and .cse0 .cse1 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) .cse2) 0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) .cse2) 0) .cse13)) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 (let ((.cse14 (select .cse15 (+ 16 |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|)))) (<= .cse14 (+ 18446744073709551615 (* (div (+ (- 1) .cse14) 18446744073709551616) 18446744073709551616)))) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13)))) [2022-12-13 21:16:49,499 INFO L899 garLoopResultBuilder]: For program point L7126-2(line 7126) no Hoare annotation was computed. [2022-12-13 21:16:49,499 INFO L895 garLoopResultBuilder]: At program point L7126-1(line 7126) the Hoare annotation is: (let ((.cse19 (+ |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| 24)) (.cse18 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|))) (let ((.cse0 (= (select .cse18 |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|) 0)) (.cse1 (= |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) (+ 16 |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset|)))) (.cse3 (<= 0 |~#s_can_fail_allocator_static~0.offset|)) (.cse4 (<= 1 |ULTIMATE.start_aws_byte_buf_init_#t~ret587#1|)) (.cse5 (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| 0)) (.cse6 (= |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset| 0)) (.cse7 (= |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| |ULTIMATE.start_aws_byte_buf_init_~capacity#1|)) (.cse8 (not (= |ULTIMATE.start_aws_byte_buf_init_~buf#1.base| 0))) (.cse9 (<= |ULTIMATE.start_aws_byte_buf_init_#t~ret587#1| 1)) (.cse10 (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) .cse19) |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|)) (.cse11 (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|)) (.cse12 (not (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| 0))) (.cse13 (= |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) .cse19))) (.cse14 (= |ULTIMATE.start_aws_byte_buf_init_~allocator#1.base| |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|)) (.cse15 (= |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset| |ULTIMATE.start_aws_byte_buf_init_~allocator#1.offset|)) (.cse16 (<= |~#s_can_fail_allocator_static~0.offset| 0))) (or (let ((.cse2 (+ 8 |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|))) (and .cse0 .cse1 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) .cse2) 0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) .cse2) 0) .cse16)) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (let ((.cse17 (select .cse18 (+ 16 |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|)))) (<= .cse17 (+ 18446744073709551615 (* (div (+ (- 1) .cse17) 18446744073709551616) 18446744073709551616)))) .cse12 .cse13 .cse14 .cse15 .cse16)))) [2022-12-13 21:16:49,500 INFO L899 garLoopResultBuilder]: For program point L8749(lines 8749 8755) no Hoare annotation was computed. [2022-12-13 21:16:49,500 INFO L899 garLoopResultBuilder]: For program point L8749-2(lines 8749 8755) no Hoare annotation was computed. [2022-12-13 21:16:49,500 INFO L895 garLoopResultBuilder]: At program point L8753(line 8753) the Hoare annotation is: (and (= (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|) 0) (= |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) (+ 16 |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset|))) (<= 0 |~#s_can_fail_allocator_static~0.offset|) (= |ULTIMATE.start_aws_byte_buf_init_harness_#t~mem1142#1| 0) (= |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| |ULTIMATE.start_aws_byte_buf_init_~capacity#1|) (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) (not (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| 0)) (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|) (= |ULTIMATE.start_aws_byte_buf_init_~allocator#1.base| |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|) (= |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset| |ULTIMATE.start_aws_byte_buf_init_~allocator#1.offset|) (<= |~#s_can_fail_allocator_static~0.offset| 0)) [2022-12-13 21:16:49,500 INFO L899 garLoopResultBuilder]: For program point L8753-1(line 8753) no Hoare annotation was computed. [2022-12-13 21:16:49,500 INFO L899 garLoopResultBuilder]: For program point L8741(lines 8741 8756) no Hoare annotation was computed. [2022-12-13 21:16:49,500 INFO L899 garLoopResultBuilder]: For program point L7114-1(lines 7114 7116) no Hoare annotation was computed. [2022-12-13 21:16:49,500 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-12-13 21:16:49,500 INFO L895 garLoopResultBuilder]: At program point L8754(line 8754) the Hoare annotation is: (and (= |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) (+ 16 |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset|))) (<= 0 |~#s_can_fail_allocator_static~0.offset|) (= (+ |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| (* (div |ULTIMATE.start_aws_byte_buf_init_harness_#t~mem1143#1| 18446744073709551616) 18446744073709551616)) (+ (* 18446744073709551616 (div |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| 18446744073709551616)) |ULTIMATE.start_aws_byte_buf_init_harness_#t~mem1143#1|)) (= |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| |ULTIMATE.start_aws_byte_buf_init_~capacity#1|) (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) (not (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| 0)) (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|) (= |ULTIMATE.start_aws_byte_buf_init_~allocator#1.base| |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|) (= |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset| |ULTIMATE.start_aws_byte_buf_init_~allocator#1.offset|) (<= |~#s_can_fail_allocator_static~0.offset| 0)) [2022-12-13 21:16:49,501 INFO L895 garLoopResultBuilder]: At program point L8746(line 8746) the Hoare annotation is: (and (<= 0 |~#s_can_fail_allocator_static~0.offset|) (or (exists ((|v_ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base_BEFORE_CALL_15| Int)) (let ((.cse0 (select (select |#memory_int| |v_ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base_BEFORE_CALL_15|) 16))) (<= .cse0 (+ (* 18446744073709551616 (div (+ (- 1) .cse0) 18446744073709551616)) 36028797018963967)))) (exists ((|v_ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base_BEFORE_CALL_15| Int)) (let ((.cse1 (select (select |#memory_int| |v_ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base_BEFORE_CALL_15|) 16))) (<= .cse1 (+ 18446744073709551615 (* (div (+ .cse1 (- 36028797018963968)) 18446744073709551616) 18446744073709551616)))))) (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| 0) (not (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| 0)) (<= |~#s_can_fail_allocator_static~0.offset| 0)) [2022-12-13 21:16:49,501 INFO L899 garLoopResultBuilder]: For program point L8754-1(line 8754) no Hoare annotation was computed. [2022-12-13 21:16:49,501 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2022-12-13 21:16:49,501 INFO L895 garLoopResultBuilder]: At program point L7111-1(line 7111) the Hoare annotation is: (and (<= 0 |~#s_can_fail_allocator_static~0.offset|) (or (exists ((|v_ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base_BEFORE_CALL_15| Int)) (let ((.cse0 (select (select |#memory_int| |v_ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base_BEFORE_CALL_15|) 16))) (<= .cse0 (+ (* 18446744073709551616 (div (+ (- 1) .cse0) 18446744073709551616)) 36028797018963967)))) (exists ((|v_ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base_BEFORE_CALL_15| Int)) (let ((.cse1 (select (select |#memory_int| |v_ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base_BEFORE_CALL_15|) 16))) (<= .cse1 (+ 18446744073709551615 (* (div (+ .cse1 (- 36028797018963968)) 18446744073709551616) 18446744073709551616)))))) (= |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| |ULTIMATE.start_aws_byte_buf_init_~capacity#1|) (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) (not (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| 0)) (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|) (= |ULTIMATE.start_aws_byte_buf_init_~allocator#1.base| |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|) (= |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset| |ULTIMATE.start_aws_byte_buf_init_~allocator#1.offset|) (<= |~#s_can_fail_allocator_static~0.offset| 0)) [2022-12-13 21:16:49,501 INFO L895 garLoopResultBuilder]: At program point L7111(line 7111) the Hoare annotation is: (and (<= 0 |~#s_can_fail_allocator_static~0.offset|) (or (exists ((|v_ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base_BEFORE_CALL_15| Int)) (let ((.cse0 (select (select |#memory_int| |v_ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base_BEFORE_CALL_15|) 16))) (<= .cse0 (+ (* 18446744073709551616 (div (+ (- 1) .cse0) 18446744073709551616)) 36028797018963967)))) (exists ((|v_ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base_BEFORE_CALL_15| Int)) (let ((.cse1 (select (select |#memory_int| |v_ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base_BEFORE_CALL_15|) 16))) (<= .cse1 (+ 18446744073709551615 (* (div (+ .cse1 (- 36028797018963968)) 18446744073709551616) 18446744073709551616)))))) (= |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| |ULTIMATE.start_aws_byte_buf_init_~capacity#1|) (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) (not (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| 0)) (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|) (= |ULTIMATE.start_aws_byte_buf_init_~allocator#1.base| |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|) (= |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset| |ULTIMATE.start_aws_byte_buf_init_~allocator#1.offset|) (<= |~#s_can_fail_allocator_static~0.offset| 0)) [2022-12-13 21:16:49,501 INFO L899 garLoopResultBuilder]: For program point L8746-1(line 8746) no Hoare annotation was computed. [2022-12-13 21:16:49,501 INFO L899 garLoopResultBuilder]: For program point L8751-2(line 8751) no Hoare annotation was computed. [2022-12-13 21:16:49,502 INFO L899 garLoopResultBuilder]: For program point L7116-1(line 7116) no Hoare annotation was computed. [2022-12-13 21:16:49,502 INFO L895 garLoopResultBuilder]: At program point aws_byte_buf_init_returnLabel#1(lines 7110 7128) the Hoare annotation is: (let ((.cse16 (+ |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| 24)) (.cse15 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|))) (let ((.cse0 (= (select .cse15 |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|) 0)) (.cse1 (= |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) (+ 16 |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset|)))) (.cse3 (<= 0 |~#s_can_fail_allocator_static~0.offset|)) (.cse4 (= |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset| 0)) (.cse5 (= |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| |ULTIMATE.start_aws_byte_buf_init_~capacity#1|)) (.cse6 (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) .cse16) |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|)) (.cse7 (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|)) (.cse8 (not (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| 0))) (.cse9 (= |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) .cse16))) (.cse10 (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|)) (.cse11 (= |ULTIMATE.start_aws_byte_buf_init_~allocator#1.base| |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|)) (.cse12 (= |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset| |ULTIMATE.start_aws_byte_buf_init_~allocator#1.offset|)) (.cse13 (<= |~#s_can_fail_allocator_static~0.offset| 0))) (or (let ((.cse2 (+ 8 |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|))) (and .cse0 .cse1 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) .cse2) 0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) .cse2) 0) .cse13)) (and .cse3 .cse4 .cse5 .cse7 .cse8 (<= (+ |ULTIMATE.start_aws_byte_buf_init_#res#1| 1) 0) .cse10 .cse11 (not (= (* 18446744073709551616 (div |ULTIMATE.start_aws_byte_buf_init_~capacity#1| 18446744073709551616)) |ULTIMATE.start_aws_byte_buf_init_~capacity#1|)) .cse12 .cse13) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 (let ((.cse14 (select .cse15 (+ 16 |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|)))) (<= .cse14 (+ 18446744073709551615 (* (div (+ (- 1) .cse14) 18446744073709551616) 18446744073709551616)))) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13)))) [2022-12-13 21:16:49,502 INFO L895 garLoopResultBuilder]: At program point L7116(line 7116) the Hoare annotation is: (and (<= 0 |~#s_can_fail_allocator_static~0.offset|) (or (exists ((|v_ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base_BEFORE_CALL_15| Int)) (let ((.cse0 (select (select |#memory_int| |v_ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base_BEFORE_CALL_15|) 16))) (<= .cse0 (+ (* 18446744073709551616 (div (+ (- 1) .cse0) 18446744073709551616)) 36028797018963967)))) (exists ((|v_ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base_BEFORE_CALL_15| Int)) (let ((.cse1 (select (select |#memory_int| |v_ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base_BEFORE_CALL_15|) 16))) (<= .cse1 (+ 18446744073709551615 (* (div (+ .cse1 (- 36028797018963968)) 18446744073709551616) 18446744073709551616)))))) (= |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| |ULTIMATE.start_aws_byte_buf_init_~capacity#1|) (< (* 18446744073709551616 (div |ULTIMATE.start_aws_byte_buf_init_~capacity#1| 18446744073709551616)) |ULTIMATE.start_aws_byte_buf_init_~capacity#1|) (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) (not (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| 0)) (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|) (= |ULTIMATE.start_aws_byte_buf_init_~allocator#1.base| |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|) (= |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset| |ULTIMATE.start_aws_byte_buf_init_~allocator#1.offset|) (<= |~#s_can_fail_allocator_static~0.offset| 0)) [2022-12-13 21:16:49,502 INFO L895 garLoopResultBuilder]: At program point L8751(line 8751) the Hoare annotation is: (let ((.cse16 (+ |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| 24)) (.cse15 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|))) (let ((.cse0 (= (select .cse15 |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|) 0)) (.cse1 (= |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) (+ 16 |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset|)))) (.cse3 (<= 0 |~#s_can_fail_allocator_static~0.offset|)) (.cse4 (= |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset| 0)) (.cse5 (= |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| |ULTIMATE.start_aws_byte_buf_init_~capacity#1|)) (.cse6 (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) .cse16) |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|)) (.cse7 (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|)) (.cse8 (not (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| 0))) (.cse9 (= |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) .cse16))) (.cse10 (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|)) (.cse11 (= |ULTIMATE.start_aws_byte_buf_init_~allocator#1.base| |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|)) (.cse12 (= |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset| |ULTIMATE.start_aws_byte_buf_init_~allocator#1.offset|)) (.cse13 (<= |~#s_can_fail_allocator_static~0.offset| 0))) (or (let ((.cse2 (+ 8 |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|))) (and .cse0 .cse1 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) .cse2) 0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) .cse2) 0) .cse13)) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 (let ((.cse14 (select .cse15 (+ 16 |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|)))) (<= .cse14 (+ 18446744073709551615 (* (div (+ (- 1) .cse14) 18446744073709551616) 18446744073709551616)))) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13)))) [2022-12-13 21:16:49,502 INFO L895 garLoopResultBuilder]: At program point L8751-1(line 8751) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| 24))) (and (= (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|) 0) (= |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) (+ 16 |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset|))) (<= 0 |~#s_can_fail_allocator_static~0.offset|) (<= |ULTIMATE.start_aws_byte_buf_init_harness_#t~ret1140#1| 1) (= |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| |ULTIMATE.start_aws_byte_buf_init_~capacity#1|) (<= 1 |ULTIMATE.start_aws_byte_buf_init_harness_#t~ret1140#1|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) .cse0) |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|) (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) (not (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| 0)) (= |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) .cse0)) (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|) (= |ULTIMATE.start_aws_byte_buf_init_~allocator#1.base| |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|) (= |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset| |ULTIMATE.start_aws_byte_buf_init_~allocator#1.offset|) (<= |~#s_can_fail_allocator_static~0.offset| 0))) [2022-12-13 21:16:49,503 INFO L899 garLoopResultBuilder]: For program point L7112(lines 7110 7128) no Hoare annotation was computed. [2022-12-13 21:16:49,503 INFO L899 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2022-12-13 21:16:49,503 INFO L899 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2022-12-13 21:16:49,503 INFO L899 garLoopResultBuilder]: For program point L223-3(lines 222 224) no Hoare annotation was computed. [2022-12-13 21:16:49,503 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 222 224) no Hoare annotation was computed. [2022-12-13 21:16:49,503 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 222 224) the Hoare annotation is: true [2022-12-13 21:16:49,503 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2022-12-13 21:16:49,506 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:16:49,507 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 21:16:49,513 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 21:16:49,514 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 21:16:49,514 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 21:16:49,514 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 21:16:49,514 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 21:16:49,514 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 21:16:49,517 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 21:16:49,517 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 21:16:49,517 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 21:16:49,518 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 21:16:49,518 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 21:16:49,518 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 21:16:49,520 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 09:16:49 BoogieIcfgContainer [2022-12-13 21:16:49,520 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 21:16:49,520 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 21:16:49,520 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 21:16:49,520 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 21:16:49,521 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:16:14" (3/4) ... [2022-12-13 21:16:49,523 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-12-13 21:16:49,527 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_allocator_is_valid [2022-12-13 21:16:49,527 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure can_fail_malloc [2022-12-13 21:16:49,527 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure bounded_malloc [2022-12-13 21:16:49,527 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_mem_acquire [2022-12-13 21:16:49,527 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_byte_buf_is_valid [2022-12-13 21:16:49,527 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_bool [2022-12-13 21:16:49,528 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2022-12-13 21:16:49,528 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2022-12-13 21:16:49,528 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_raise_error [2022-12-13 21:16:49,528 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure can_fail_allocator [2022-12-13 21:16:49,536 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 123 nodes and edges [2022-12-13 21:16:49,537 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 56 nodes and edges [2022-12-13 21:16:49,537 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 25 nodes and edges [2022-12-13 21:16:49,538 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2022-12-13 21:16:49,538 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2022-12-13 21:16:49,538 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-12-13 21:16:49,539 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-12-13 21:16:49,539 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-12-13 21:16:49,559 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((unknown-#memory_int-unknown[buf][buf] == 0 && capacity == unknown-#memory_int-unknown[buf][16 + buf]) && #memory_$Pointer$[buf][8 + buf] == 0) && 0 <= s_can_fail_allocator_static) && buf == 0) && capacity == capacity) && #memory_$Pointer$[buf][buf + 24] == allocator) && buf == buf) && !(buf == 0)) && allocator == #memory_$Pointer$[buf][buf + 24]) && buf == buf) && allocator == allocator) && allocator == allocator) && #memory_$Pointer$[buf][8 + buf] == 0) && s_can_fail_allocator_static <= 0) || ((((((((((0 <= s_can_fail_allocator_static && buf == 0) && capacity == capacity) && buf == buf) && !(buf == 0)) && \result + 1 <= 0) && buf == buf) && allocator == allocator) && !(18446744073709551616 * (capacity / 18446744073709551616) == capacity)) && allocator == allocator) && s_can_fail_allocator_static <= 0)) || (((((((((((((unknown-#memory_int-unknown[buf][buf] == 0 && capacity == unknown-#memory_int-unknown[buf][16 + buf]) && 0 <= s_can_fail_allocator_static) && buf == 0) && capacity == capacity) && #memory_$Pointer$[buf][buf + 24] == allocator) && buf == buf) && unknown-#memory_int-unknown[buf][16 + buf] <= 18446744073709551615 + (-1 + unknown-#memory_int-unknown[buf][16 + buf]) / 18446744073709551616 * 18446744073709551616) && !(buf == 0)) && allocator == #memory_$Pointer$[buf][buf + 24]) && buf == buf) && allocator == allocator) && allocator == allocator) && s_can_fail_allocator_static <= 0) [2022-12-13 21:16:49,878 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d19267b5-2e5c-4b70-b9fe-6dc0c303275a/bin/uautomizer-uyxdKDjOR8/witness.graphml [2022-12-13 21:16:49,878 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 21:16:49,878 INFO L158 Benchmark]: Toolchain (without parser) took 38277.76ms. Allocated memory was 115.3MB in the beginning and 589.3MB in the end (delta: 474.0MB). Free memory was 72.4MB in the beginning and 480.6MB in the end (delta: -408.2MB). Peak memory consumption was 401.8MB. Max. memory is 16.1GB. [2022-12-13 21:16:49,879 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 115.3MB. Free memory is still 91.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 21:16:49,879 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1615.62ms. Allocated memory was 115.3MB in the beginning and 161.5MB in the end (delta: 46.1MB). Free memory was 72.4MB in the beginning and 80.8MB in the end (delta: -8.4MB). Peak memory consumption was 71.8MB. Max. memory is 16.1GB. [2022-12-13 21:16:49,879 INFO L158 Benchmark]: Boogie Procedure Inliner took 92.96ms. Allocated memory is still 161.5MB. Free memory was 80.8MB in the beginning and 69.3MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-12-13 21:16:49,879 INFO L158 Benchmark]: Boogie Preprocessor took 44.86ms. Allocated memory is still 161.5MB. Free memory was 69.3MB in the beginning and 63.1MB in the end (delta: 6.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-12-13 21:16:49,879 INFO L158 Benchmark]: RCFGBuilder took 964.25ms. Allocated memory was 161.5MB in the beginning and 195.0MB in the end (delta: 33.6MB). Free memory was 63.1MB in the beginning and 127.1MB in the end (delta: -64.0MB). Peak memory consumption was 39.7MB. Max. memory is 16.1GB. [2022-12-13 21:16:49,879 INFO L158 Benchmark]: TraceAbstraction took 35197.82ms. Allocated memory was 195.0MB in the beginning and 589.3MB in the end (delta: 394.3MB). Free memory was 126.0MB in the beginning and 248.7MB in the end (delta: -122.7MB). Peak memory consumption was 351.3MB. Max. memory is 16.1GB. [2022-12-13 21:16:49,880 INFO L158 Benchmark]: Witness Printer took 357.91ms. Allocated memory is still 589.3MB. Free memory was 248.7MB in the beginning and 480.6MB in the end (delta: -231.9MB). Peak memory consumption was 102.8MB. Max. memory is 16.1GB. [2022-12-13 21:16:49,881 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.10ms. Allocated memory is still 115.3MB. Free memory is still 91.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1615.62ms. Allocated memory was 115.3MB in the beginning and 161.5MB in the end (delta: 46.1MB). Free memory was 72.4MB in the beginning and 80.8MB in the end (delta: -8.4MB). Peak memory consumption was 71.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 92.96ms. Allocated memory is still 161.5MB. Free memory was 80.8MB in the beginning and 69.3MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.86ms. Allocated memory is still 161.5MB. Free memory was 69.3MB in the beginning and 63.1MB in the end (delta: 6.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 964.25ms. Allocated memory was 161.5MB in the beginning and 195.0MB in the end (delta: 33.6MB). Free memory was 63.1MB in the beginning and 127.1MB in the end (delta: -64.0MB). Peak memory consumption was 39.7MB. Max. memory is 16.1GB. * TraceAbstraction took 35197.82ms. Allocated memory was 195.0MB in the beginning and 589.3MB in the end (delta: 394.3MB). Free memory was 126.0MB in the beginning and 248.7MB in the end (delta: -122.7MB). Peak memory consumption was 351.3MB. Max. memory is 16.1GB. * Witness Printer took 357.91ms. Allocated memory is still 589.3MB. Free memory was 248.7MB in the beginning and 480.6MB in the end (delta: -231.9MB). Peak memory consumption was 102.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset * 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 11 procedures, 99 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 35.1s, OverallIterations: 27, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2601 SdHoareTripleChecker+Valid, 5.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2484 mSDsluCounter, 14773 SdHoareTripleChecker+Invalid, 5.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12253 mSDsCounter, 693 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6608 IncrementalHoareTripleChecker+Invalid, 7301 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 693 mSolverCounterUnsat, 2520 mSDtfsCounter, 6608 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1060 GetRequests, 727 SyntacticMatches, 7 SemanticMatches, 326 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1354 ImplicationChecksByTransitivity, 4.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=243occurred in iteration=20, InterpolantAutomatonStates: 236, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 27 MinimizatonAttempts, 356 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 32 LocationsWithAnnotation, 194 PreInvPairs, 222 NumberOfFragments, 1942 HoareAnnotationTreeSize, 194 FomulaSimplifications, 45 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 32 FomulaSimplificationsInter, 93703 FormulaSimplificationTreeSizeReductionInter, 2.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 20.2s InterpolantComputationTime, 1776 NumberOfCodeBlocks, 1776 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 1922 ConstructedInterpolants, 38 QuantifiedInterpolants, 10990 SizeOfPredicates, 40 NumberOfNonLiveVariables, 5068 ConjunctsInSsa, 74 ConjunctsInUnsatCore, 31 InterpolantComputations, 25 PerfectInterpolantSequences, 576/635 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: 8757]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7110]: Loop Invariant [2022-12-13 21:16:49,885 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 21:16:49,885 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 21:16:49,886 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 21:16:49,886 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 21:16:49,886 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 21:16:49,886 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 21:16:49,888 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 21:16:49,889 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 21:16:49,889 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-12-13 21:16:49,889 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 21:16:49,890 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-12-13 21:16:49,890 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((((((((((unknown-#memory_int-unknown[buf][buf] == 0 && capacity == unknown-#memory_int-unknown[buf][16 + buf]) && #memory_$Pointer$[buf][8 + buf] == 0) && 0 <= s_can_fail_allocator_static) && buf == 0) && capacity == capacity) && #memory_$Pointer$[buf][buf + 24] == allocator) && buf == buf) && !(buf == 0)) && allocator == #memory_$Pointer$[buf][buf + 24]) && buf == buf) && allocator == allocator) && allocator == allocator) && #memory_$Pointer$[buf][8 + buf] == 0) && s_can_fail_allocator_static <= 0) || ((((((((((0 <= s_can_fail_allocator_static && buf == 0) && capacity == capacity) && buf == buf) && !(buf == 0)) && \result + 1 <= 0) && buf == buf) && allocator == allocator) && !(18446744073709551616 * (capacity / 18446744073709551616) == capacity)) && allocator == allocator) && s_can_fail_allocator_static <= 0)) || (((((((((((((unknown-#memory_int-unknown[buf][buf] == 0 && capacity == unknown-#memory_int-unknown[buf][16 + buf]) && 0 <= s_can_fail_allocator_static) && buf == 0) && capacity == capacity) && #memory_$Pointer$[buf][buf + 24] == allocator) && buf == buf) && unknown-#memory_int-unknown[buf][16 + buf] <= 18446744073709551615 + (-1 + unknown-#memory_int-unknown[buf][16 + buf]) / 18446744073709551616 * 18446744073709551616) && !(buf == 0)) && allocator == #memory_$Pointer$[buf][buf + 24]) && buf == buf) && allocator == allocator) && allocator == allocator) && s_can_fail_allocator_static <= 0) RESULT: Ultimate proved your program to be correct! [2022-12-13 21:16:49,902 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d19267b5-2e5c-4b70-b9fe-6dc0c303275a/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE