./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/aws-c-common/aws_hash_table_clear_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecd4ecb4-206c-4b5e-90f6-442b387555e3/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecd4ecb4-206c-4b5e-90f6-442b387555e3/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecd4ecb4-206c-4b5e-90f6-442b387555e3/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecd4ecb4-206c-4b5e-90f6-442b387555e3/bin/uautomizer-ZsLfNo2U6R/config/AutomizerReach.xml -i ../../sv-benchmarks/c/aws-c-common/aws_hash_table_clear_harness.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecd4ecb4-206c-4b5e-90f6-442b387555e3/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecd4ecb4-206c-4b5e-90f6-442b387555e3/bin/uautomizer-ZsLfNo2U6R --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 76206b4f7fb4016a4087a30dbd51e90ef533ed916c2eae20331e23ac9a9e91be --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-25 18:10:08,701 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 18:10:08,703 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 18:10:08,729 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 18:10:08,732 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 18:10:08,743 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 18:10:08,745 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 18:10:08,749 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 18:10:08,751 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 18:10:08,756 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 18:10:08,757 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 18:10:08,760 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 18:10:08,760 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 18:10:08,765 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 18:10:08,766 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 18:10:08,769 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 18:10:08,775 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 18:10:08,775 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 18:10:08,777 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 18:10:08,778 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 18:10:08,779 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 18:10:08,781 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 18:10:08,782 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 18:10:08,782 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 18:10:08,785 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 18:10:08,785 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 18:10:08,786 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 18:10:08,787 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 18:10:08,787 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 18:10:08,788 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 18:10:08,788 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 18:10:08,789 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 18:10:08,789 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 18:10:08,790 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 18:10:08,791 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 18:10:08,791 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 18:10:08,792 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 18:10:08,792 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 18:10:08,793 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 18:10:08,793 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 18:10:08,798 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 18:10:08,800 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecd4ecb4-206c-4b5e-90f6-442b387555e3/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-11-25 18:10:08,837 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 18:10:08,837 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 18:10:08,838 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 18:10:08,838 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 18:10:08,839 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 18:10:08,839 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 18:10:08,839 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 18:10:08,839 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 18:10:08,840 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 18:10:08,840 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 18:10:08,840 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 18:10:08,840 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 18:10:08,840 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 18:10:08,841 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 18:10:08,841 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 18:10:08,841 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 18:10:08,841 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 18:10:08,841 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 18:10:08,842 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 18:10:08,842 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 18:10:08,842 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 18:10:08,845 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 18:10:08,846 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 18:10:08,846 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 18:10:08,846 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 18:10:08,846 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 18:10:08,847 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 18:10:08,847 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 18:10:08,847 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 18:10:08,848 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 18:10:08,848 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 18:10:08,848 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_ecd4ecb4-206c-4b5e-90f6-442b387555e3/bin/uautomizer-ZsLfNo2U6R/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecd4ecb4-206c-4b5e-90f6-442b387555e3/bin/uautomizer-ZsLfNo2U6R Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 76206b4f7fb4016a4087a30dbd51e90ef533ed916c2eae20331e23ac9a9e91be [2022-11-25 18:10:09,123 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 18:10:09,150 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 18:10:09,153 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 18:10:09,155 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 18:10:09,155 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 18:10:09,157 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecd4ecb4-206c-4b5e-90f6-442b387555e3/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/aws-c-common/aws_hash_table_clear_harness.i [2022-11-25 18:10:12,121 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 18:10:12,768 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 18:10:12,769 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecd4ecb4-206c-4b5e-90f6-442b387555e3/sv-benchmarks/c/aws-c-common/aws_hash_table_clear_harness.i [2022-11-25 18:10:12,816 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecd4ecb4-206c-4b5e-90f6-442b387555e3/bin/uautomizer-ZsLfNo2U6R/data/43c00a742/d753a12a8b184750a63916e655fa5385/FLAG63af72895 [2022-11-25 18:10:12,835 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecd4ecb4-206c-4b5e-90f6-442b387555e3/bin/uautomizer-ZsLfNo2U6R/data/43c00a742/d753a12a8b184750a63916e655fa5385 [2022-11-25 18:10:12,839 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 18:10:12,842 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 18:10:12,846 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 18:10:12,847 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 18:10:12,850 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 18:10:12,851 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:10:12" (1/1) ... [2022-11-25 18:10:12,852 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4aa1d329 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:10:12, skipping insertion in model container [2022-11-25 18:10:12,852 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:10:12" (1/1) ... [2022-11-25 18:10:12,859 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 18:10:12,977 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 18:10:13,276 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_ecd4ecb4-206c-4b5e-90f6-442b387555e3/sv-benchmarks/c/aws-c-common/aws_hash_table_clear_harness.i[4494,4507] [2022-11-25 18:10:13,288 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_ecd4ecb4-206c-4b5e-90f6-442b387555e3/sv-benchmarks/c/aws-c-common/aws_hash_table_clear_harness.i[4554,4567] [2022-11-25 18:10:14,541 WARN L623 FunctionHandler]: Unknown extern function my_memset [2022-11-25 18:10:14,566 WARN L623 FunctionHandler]: Unknown extern function my_memset [2022-11-25 18:10:14,575 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:10:14,576 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:10:14,576 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:10:14,577 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:10:14,578 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:10:14,583 WARN L623 FunctionHandler]: Unknown extern function my_memset [2022-11-25 18:10:14,591 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:10:14,592 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:10:14,594 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:10:14,595 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:10:14,596 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:10:14,597 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:10:14,598 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:10:14,598 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:10:14,714 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-11-25 18:10:14,715 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-11-25 18:10:14,716 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-11-25 18:10:14,724 WARN L623 FunctionHandler]: Unknown extern function ntohl [2022-11-25 18:10:14,729 WARN L623 FunctionHandler]: Unknown extern function htons [2022-11-25 18:10:14,730 WARN L623 FunctionHandler]: Unknown extern function ntohs [2022-11-25 18:10:14,915 WARN L623 FunctionHandler]: Unknown extern function my_memset [2022-11-25 18:10:15,105 WARN L623 FunctionHandler]: Unknown extern function my_abort [2022-11-25 18:10:15,106 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-11-25 18:10:15,107 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-11-25 18:10:15,109 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-11-25 18:10:15,110 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-11-25 18:10:15,112 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-11-25 18:10:15,113 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-11-25 18:10:15,113 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-11-25 18:10:15,114 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-11-25 18:10:15,115 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-11-25 18:10:15,115 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-11-25 18:10:15,323 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-11-25 18:10:15,377 WARN L623 FunctionHandler]: Unknown extern function my_memset [2022-11-25 18:10:15,422 WARN L623 FunctionHandler]: Unknown extern function fprintf [2022-11-25 18:10:15,692 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:10:15,694 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:10:15,718 WARN L623 FunctionHandler]: Unknown extern function my_memset [2022-11-25 18:10:15,728 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:10:15,729 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:10:15,737 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:10:15,738 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:10:15,770 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:10:15,775 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:10:15,780 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:10:15,780 WARN L623 FunctionHandler]: Unknown extern function my_memset [2022-11-25 18:10:15,780 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:10:15,781 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:10:15,781 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:10:15,782 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:10:15,793 WARN L623 FunctionHandler]: Unknown extern function my_memset [2022-11-25 18:10:15,799 WARN L623 FunctionHandler]: Unknown extern function my_memset [2022-11-25 18:10:15,813 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 18:10:15,857 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 18:10:15,880 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_ecd4ecb4-206c-4b5e-90f6-442b387555e3/sv-benchmarks/c/aws-c-common/aws_hash_table_clear_harness.i[4494,4507] [2022-11-25 18:10:15,890 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_ecd4ecb4-206c-4b5e-90f6-442b387555e3/sv-benchmarks/c/aws-c-common/aws_hash_table_clear_harness.i[4554,4567] [2022-11-25 18:10:15,929 WARN L623 FunctionHandler]: Unknown extern function my_memset [2022-11-25 18:10:15,937 WARN L623 FunctionHandler]: Unknown extern function my_memset [2022-11-25 18:10:15,940 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:10:15,941 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:10:15,941 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:10:15,941 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:10:15,942 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:10:15,944 WARN L623 FunctionHandler]: Unknown extern function my_memset [2022-11-25 18:10:15,947 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:10:15,948 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:10:15,949 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:10:15,949 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:10:15,950 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:10:15,950 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:10:15,951 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:10:15,951 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:10:15,957 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-11-25 18:10:15,958 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-11-25 18:10:15,958 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-11-25 18:10:15,961 WARN L623 FunctionHandler]: Unknown extern function ntohl [2022-11-25 18:10:15,962 WARN L623 FunctionHandler]: Unknown extern function htons [2022-11-25 18:10:15,963 WARN L623 FunctionHandler]: Unknown extern function ntohs [2022-11-25 18:10:15,965 WARN L623 FunctionHandler]: Unknown extern function my_memset [2022-11-25 18:10:15,988 WARN L623 FunctionHandler]: Unknown extern function my_abort [2022-11-25 18:10:15,989 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-11-25 18:10:15,989 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-11-25 18:10:15,990 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-11-25 18:10:15,991 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-11-25 18:10:15,992 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-11-25 18:10:15,992 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-11-25 18:10:15,992 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-11-25 18:10:15,993 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-11-25 18:10:15,993 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-11-25 18:10:15,994 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-11-25 18:10:16,029 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-11-25 18:10:16,056 WARN L623 FunctionHandler]: Unknown extern function my_memset [2022-11-25 18:10:16,080 WARN L623 FunctionHandler]: Unknown extern function fprintf [2022-11-25 18:10:16,150 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:10:16,152 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:10:16,160 WARN L623 FunctionHandler]: Unknown extern function my_memset [2022-11-25 18:10:16,162 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:10:16,163 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:10:16,166 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:10:16,167 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:10:16,268 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:10:16,269 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:10:16,269 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:10:16,270 WARN L623 FunctionHandler]: Unknown extern function my_memset [2022-11-25 18:10:16,270 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:10:16,270 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:10:16,271 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:10:16,271 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:10:16,279 WARN L623 FunctionHandler]: Unknown extern function my_memset [2022-11-25 18:10:16,287 WARN L623 FunctionHandler]: Unknown extern function my_memset [2022-11-25 18:10:16,294 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 18:10:16,614 INFO L208 MainTranslator]: Completed translation [2022-11-25 18:10:16,614 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:10:16 WrapperNode [2022-11-25 18:10:16,614 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 18:10:16,615 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 18:10:16,616 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 18:10:16,616 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 18:10:16,622 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:10:16" (1/1) ... [2022-11-25 18:10:16,717 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:10:16" (1/1) ... [2022-11-25 18:10:16,820 INFO L138 Inliner]: procedures = 775, calls = 2439, calls flagged for inlining = 68, calls inlined = 13, statements flattened = 611 [2022-11-25 18:10:16,820 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 18:10:16,821 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 18:10:16,821 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 18:10:16,821 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 18:10:16,831 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:10:16" (1/1) ... [2022-11-25 18:10:16,831 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:10:16" (1/1) ... [2022-11-25 18:10:16,848 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:10:16" (1/1) ... [2022-11-25 18:10:16,849 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:10:16" (1/1) ... [2022-11-25 18:10:16,896 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:10:16" (1/1) ... [2022-11-25 18:10:16,900 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:10:16" (1/1) ... [2022-11-25 18:10:16,907 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:10:16" (1/1) ... [2022-11-25 18:10:16,911 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:10:16" (1/1) ... [2022-11-25 18:10:16,920 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 18:10:16,921 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 18:10:16,921 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 18:10:16,921 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 18:10:16,922 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:10:16" (1/1) ... [2022-11-25 18:10:16,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 18:10:16,940 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecd4ecb4-206c-4b5e-90f6-442b387555e3/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:10:16,971 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecd4ecb4-206c-4b5e-90f6-442b387555e3/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 18:10:17,002 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecd4ecb4-206c-4b5e-90f6-442b387555e3/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 18:10:17,022 INFO L130 BoogieDeclarations]: Found specification of procedure memset_override_0_impl [2022-11-25 18:10:17,022 INFO L138 BoogieDeclarations]: Found implementation of procedure memset_override_0_impl [2022-11-25 18:10:17,023 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-11-25 18:10:17,023 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2022-11-25 18:10:17,023 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2022-11-25 18:10:17,023 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-25 18:10:17,024 INFO L130 BoogieDeclarations]: Found specification of procedure aws_raise_error [2022-11-25 18:10:17,024 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_raise_error [2022-11-25 18:10:17,027 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-25 18:10:17,028 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-25 18:10:17,028 INFO L130 BoogieDeclarations]: Found specification of procedure hash_table_state_is_valid [2022-11-25 18:10:17,028 INFO L138 BoogieDeclarations]: Found implementation of procedure hash_table_state_is_valid [2022-11-25 18:10:17,028 INFO L130 BoogieDeclarations]: Found specification of procedure aws_hash_table_clear [2022-11-25 18:10:17,029 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_hash_table_clear [2022-11-25 18:10:17,029 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-25 18:10:17,030 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 18:10:17,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-25 18:10:17,035 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 18:10:17,035 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 18:10:17,035 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2022-11-25 18:10:17,035 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2022-11-25 18:10:17,035 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mul_size_checked [2022-11-25 18:10:17,035 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mul_size_checked [2022-11-25 18:10:17,036 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 18:10:17,036 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_plus [2022-11-25 18:10:17,036 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_plus [2022-11-25 18:10:17,036 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-25 18:10:17,036 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2022-11-25 18:10:17,036 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2022-11-25 18:10:17,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 18:10:17,036 INFO L130 BoogieDeclarations]: Found specification of procedure my_memset [2022-11-25 18:10:17,036 INFO L138 BoogieDeclarations]: Found implementation of procedure my_memset [2022-11-25 18:10:17,037 INFO L130 BoogieDeclarations]: Found specification of procedure aws_is_power_of_two [2022-11-25 18:10:17,037 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_is_power_of_two [2022-11-25 18:10:17,037 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 18:10:17,037 INFO L130 BoogieDeclarations]: Found specification of procedure hash_table_state_required_bytes [2022-11-25 18:10:17,037 INFO L138 BoogieDeclarations]: Found implementation of procedure hash_table_state_required_bytes [2022-11-25 18:10:17,037 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2022-11-25 18:10:17,037 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2022-11-25 18:10:17,037 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-11-25 18:10:17,037 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-11-25 18:10:17,038 INFO L130 BoogieDeclarations]: Found specification of procedure aws_hash_table_is_valid [2022-11-25 18:10:17,038 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_hash_table_is_valid [2022-11-25 18:10:17,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-25 18:10:17,038 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_mult [2022-11-25 18:10:17,038 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_mult [2022-11-25 18:10:17,038 INFO L130 BoogieDeclarations]: Found specification of procedure aws_add_size_checked [2022-11-25 18:10:17,038 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_add_size_checked [2022-11-25 18:10:17,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 18:10:17,440 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 18:10:17,442 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 18:10:18,575 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 18:10:18,593 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 18:10:18,594 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-25 18:10:18,597 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:10:18 BoogieIcfgContainer [2022-11-25 18:10:18,598 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 18:10:18,601 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 18:10:18,602 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 18:10:18,605 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 18:10:18,605 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 06:10:12" (1/3) ... [2022-11-25 18:10:18,607 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d137ee4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 06:10:18, skipping insertion in model container [2022-11-25 18:10:18,608 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:10:16" (2/3) ... [2022-11-25 18:10:18,609 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d137ee4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 06:10:18, skipping insertion in model container [2022-11-25 18:10:18,609 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:10:18" (3/3) ... [2022-11-25 18:10:18,610 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_hash_table_clear_harness.i [2022-11-25 18:10:18,629 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 18:10:18,630 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-25 18:10:18,695 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 18:10:18,702 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;@2d49bd0a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 18:10:18,702 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-25 18:10:18,708 INFO L276 IsEmpty]: Start isEmpty. Operand has 169 states, 108 states have (on average 1.1851851851851851) internal successors, (128), 109 states have internal predecessors, (128), 41 states have call successors, (41), 18 states have call predecessors, (41), 18 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2022-11-25 18:10:18,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-11-25 18:10:18,722 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:10:18,723 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:10:18,723 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:10:18,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:10:18,729 INFO L85 PathProgramCache]: Analyzing trace with hash 889774617, now seen corresponding path program 1 times [2022-11-25 18:10:18,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:10:18,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329988027] [2022-11-25 18:10:18,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:10:18,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:10:19,144 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 18:10:19,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1349147608] [2022-11-25 18:10:19,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:10:19,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:10:19,159 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecd4ecb4-206c-4b5e-90f6-442b387555e3/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:10:19,177 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecd4ecb4-206c-4b5e-90f6-442b387555e3/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:10:19,200 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecd4ecb4-206c-4b5e-90f6-442b387555e3/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-25 18:10:19,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:19,915 INFO L263 TraceCheckSpWp]: Trace formula consists of 2354 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-25 18:10:19,930 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:10:20,035 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2022-11-25 18:10:20,035 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 18:10:20,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:10:20,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329988027] [2022-11-25 18:10:20,036 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 18:10:20,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1349147608] [2022-11-25 18:10:20,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1349147608] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:10:20,037 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:10:20,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:10:20,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382515028] [2022-11-25 18:10:20,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:10:20,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:10:20,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:10:20,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:10:20,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:10:20,078 INFO L87 Difference]: Start difference. First operand has 169 states, 108 states have (on average 1.1851851851851851) internal successors, (128), 109 states have internal predecessors, (128), 41 states have call successors, (41), 18 states have call predecessors, (41), 18 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-11-25 18:10:20,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:10:20,139 INFO L93 Difference]: Finished difference Result 334 states and 435 transitions. [2022-11-25 18:10:20,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:10:20,142 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 139 [2022-11-25 18:10:20,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:10:20,153 INFO L225 Difference]: With dead ends: 334 [2022-11-25 18:10:20,153 INFO L226 Difference]: Without dead ends: 163 [2022-11-25 18:10:20,158 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:10:20,161 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 0 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 18:10:20,162 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 406 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 18:10:20,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2022-11-25 18:10:20,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2022-11-25 18:10:20,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 103 states have (on average 1.145631067961165) internal successors, (118), 104 states have internal predecessors, (118), 41 states have call successors, (41), 18 states have call predecessors, (41), 18 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2022-11-25 18:10:20,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 199 transitions. [2022-11-25 18:10:20,218 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 199 transitions. Word has length 139 [2022-11-25 18:10:20,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:10:20,221 INFO L495 AbstractCegarLoop]: Abstraction has 163 states and 199 transitions. [2022-11-25 18:10:20,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-11-25 18:10:20,221 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 199 transitions. [2022-11-25 18:10:20,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-11-25 18:10:20,225 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:10:20,226 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:10:20,234 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecd4ecb4-206c-4b5e-90f6-442b387555e3/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-25 18:10:20,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecd4ecb4-206c-4b5e-90f6-442b387555e3/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2022-11-25 18:10:20,428 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:10:20,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:10:20,429 INFO L85 PathProgramCache]: Analyzing trace with hash -131293737, now seen corresponding path program 1 times [2022-11-25 18:10:20,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:10:20,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747699845] [2022-11-25 18:10:20,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:10:20,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:10:20,593 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 18:10:20,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [542050013] [2022-11-25 18:10:20,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:10:20,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:10:20,595 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecd4ecb4-206c-4b5e-90f6-442b387555e3/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:10:20,596 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecd4ecb4-206c-4b5e-90f6-442b387555e3/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:10:20,626 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecd4ecb4-206c-4b5e-90f6-442b387555e3/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-25 18:10:21,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:21,315 INFO L263 TraceCheckSpWp]: Trace formula consists of 2359 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-25 18:10:21,320 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:10:21,395 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2022-11-25 18:10:21,396 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 18:10:21,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:10:21,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747699845] [2022-11-25 18:10:21,396 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 18:10:21,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [542050013] [2022-11-25 18:10:21,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [542050013] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:10:21,397 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:10:21,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 18:10:21,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285217109] [2022-11-25 18:10:21,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:10:21,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 18:10:21,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:10:21,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 18:10:21,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 18:10:21,406 INFO L87 Difference]: Start difference. First operand 163 states and 199 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (21), 3 states have call predecessors, (21), 2 states have call successors, (21) [2022-11-25 18:10:21,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:10:21,497 INFO L93 Difference]: Finished difference Result 289 states and 353 transitions. [2022-11-25 18:10:21,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 18:10:21,498 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (21), 3 states have call predecessors, (21), 2 states have call successors, (21) Word has length 139 [2022-11-25 18:10:21,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:10:21,507 INFO L225 Difference]: With dead ends: 289 [2022-11-25 18:10:21,510 INFO L226 Difference]: Without dead ends: 168 [2022-11-25 18:10:21,511 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-25 18:10:21,514 INFO L413 NwaCegarLoop]: 195 mSDtfsCounter, 2 mSDsluCounter, 580 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 775 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 18:10:21,515 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 775 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 18:10:21,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2022-11-25 18:10:21,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2022-11-25 18:10:21,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 107 states have (on average 1.1401869158878504) internal successors, (122), 108 states have internal predecessors, (122), 41 states have call successors, (41), 18 states have call predecessors, (41), 19 states have return successors, (41), 41 states have call predecessors, (41), 40 states have call successors, (41) [2022-11-25 18:10:21,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 204 transitions. [2022-11-25 18:10:21,541 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 204 transitions. Word has length 139 [2022-11-25 18:10:21,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:10:21,543 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 204 transitions. [2022-11-25 18:10:21,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (21), 3 states have call predecessors, (21), 2 states have call successors, (21) [2022-11-25 18:10:21,544 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 204 transitions. [2022-11-25 18:10:21,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-11-25 18:10:21,555 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:10:21,555 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:10:21,570 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecd4ecb4-206c-4b5e-90f6-442b387555e3/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-25 18:10:21,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecd4ecb4-206c-4b5e-90f6-442b387555e3/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:10:21,765 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:10:21,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:10:21,766 INFO L85 PathProgramCache]: Analyzing trace with hash -2039178523, now seen corresponding path program 1 times [2022-11-25 18:10:21,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:10:21,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764291729] [2022-11-25 18:10:21,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:10:21,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:10:21,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:23,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:10:23,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:23,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-25 18:10:23,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:23,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 18:10:23,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:23,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 18:10:23,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:23,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-25 18:10:23,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:23,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:10:23,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:23,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:10:23,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:23,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 18:10:23,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:23,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-25 18:10:23,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:23,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-25 18:10:23,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:23,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:10:23,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:23,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-25 18:10:23,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:24,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-11-25 18:10:24,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:24,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-11-25 18:10:24,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:24,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-25 18:10:24,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:24,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-25 18:10:24,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:24,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-11-25 18:10:24,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:24,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-11-25 18:10:24,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:24,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-11-25 18:10:24,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:24,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-11-25 18:10:24,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:24,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-11-25 18:10:24,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:24,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-11-25 18:10:24,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:24,244 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2022-11-25 18:10:24,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:10:24,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764291729] [2022-11-25 18:10:24,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764291729] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:10:24,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [602963661] [2022-11-25 18:10:24,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:10:24,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:10:24,246 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecd4ecb4-206c-4b5e-90f6-442b387555e3/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:10:24,251 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecd4ecb4-206c-4b5e-90f6-442b387555e3/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:10:24,278 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecd4ecb4-206c-4b5e-90f6-442b387555e3/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-25 18:10:24,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:24,800 INFO L263 TraceCheckSpWp]: Trace formula consists of 2363 conjuncts, 36 conjunts are in the unsatisfiable core [2022-11-25 18:10:24,806 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:10:25,018 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 18:10:25,373 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2022-11-25 18:10:25,373 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 18:10:25,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [602963661] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:10:25,374 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 18:10:25,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [13] total 21 [2022-11-25 18:10:25,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117148970] [2022-11-25 18:10:25,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:10:25,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-25 18:10:25,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:10:25,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-25 18:10:25,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2022-11-25 18:10:25,377 INFO L87 Difference]: Start difference. First operand 168 states and 204 transitions. Second operand has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 9 states have internal predecessors, (71), 4 states have call successors, (26), 3 states have call predecessors, (26), 4 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) [2022-11-25 18:10:27,931 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2022-11-25 18:10:30,027 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 18:10:32,692 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 18:10:34,703 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 18:10:36,707 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 18:10:38,727 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 18:10:40,784 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 18:10:42,787 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 18:10:42,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:10:42,821 INFO L93 Difference]: Finished difference Result 341 states and 407 transitions. [2022-11-25 18:10:42,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-25 18:10:42,822 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 9 states have internal predecessors, (71), 4 states have call successors, (26), 3 states have call predecessors, (26), 4 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) Word has length 145 [2022-11-25 18:10:42,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:10:42,826 INFO L225 Difference]: With dead ends: 341 [2022-11-25 18:10:42,827 INFO L226 Difference]: Without dead ends: 231 [2022-11-25 18:10:42,828 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=126, Invalid=686, Unknown=0, NotChecked=0, Total=812 [2022-11-25 18:10:42,829 INFO L413 NwaCegarLoop]: 211 mSDtfsCounter, 116 mSDsluCounter, 971 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 27 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 1182 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.2s IncrementalHoareTripleChecker+Time [2022-11-25 18:10:42,831 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 1182 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 347 Invalid, 8 Unknown, 0 Unchecked, 17.2s Time] [2022-11-25 18:10:42,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2022-11-25 18:10:42,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 227. [2022-11-25 18:10:42,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 147 states have (on average 1.1360544217687074) internal successors, (167), 149 states have internal predecessors, (167), 49 states have call successors, (49), 28 states have call predecessors, (49), 30 states have return successors, (51), 49 states have call predecessors, (51), 48 states have call successors, (51) [2022-11-25 18:10:42,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 267 transitions. [2022-11-25 18:10:42,882 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 267 transitions. Word has length 145 [2022-11-25 18:10:42,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:10:42,883 INFO L495 AbstractCegarLoop]: Abstraction has 227 states and 267 transitions. [2022-11-25 18:10:42,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 9 states have internal predecessors, (71), 4 states have call successors, (26), 3 states have call predecessors, (26), 4 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) [2022-11-25 18:10:42,884 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 267 transitions. [2022-11-25 18:10:42,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-11-25 18:10:42,887 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:10:42,887 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:10:42,897 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecd4ecb4-206c-4b5e-90f6-442b387555e3/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-25 18:10:43,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecd4ecb4-206c-4b5e-90f6-442b387555e3/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:10:43,097 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:10:43,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:10:43,097 INFO L85 PathProgramCache]: Analyzing trace with hash 1113286307, now seen corresponding path program 1 times [2022-11-25 18:10:43,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:10:43,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268195176] [2022-11-25 18:10:43,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:10:43,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:10:43,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:43,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:10:43,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:43,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-25 18:10:43,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:43,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 18:10:43,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:43,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 18:10:43,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:43,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-25 18:10:43,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:43,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:10:43,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:43,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:10:43,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:43,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 18:10:43,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:43,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-25 18:10:43,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:43,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-25 18:10:43,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:43,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:10:43,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:43,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-25 18:10:43,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:43,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-11-25 18:10:43,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:43,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-11-25 18:10:43,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:43,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-25 18:10:43,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:43,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-25 18:10:43,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:43,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-11-25 18:10:43,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:43,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-11-25 18:10:43,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:43,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-11-25 18:10:43,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:43,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-11-25 18:10:43,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:43,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-11-25 18:10:43,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:43,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-11-25 18:10:43,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:44,006 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2022-11-25 18:10:44,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:10:44,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268195176] [2022-11-25 18:10:44,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268195176] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:10:44,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1550579325] [2022-11-25 18:10:44,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:10:44,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:10:44,007 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecd4ecb4-206c-4b5e-90f6-442b387555e3/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:10:44,011 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecd4ecb4-206c-4b5e-90f6-442b387555e3/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:10:44,030 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecd4ecb4-206c-4b5e-90f6-442b387555e3/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-25 18:10:44,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:44,573 INFO L263 TraceCheckSpWp]: Trace formula consists of 2358 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 18:10:44,578 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:10:44,697 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2022-11-25 18:10:44,698 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 18:10:44,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1550579325] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:10:44,698 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 18:10:44,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2022-11-25 18:10:44,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307654212] [2022-11-25 18:10:44,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:10:44,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 18:10:44,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:10:44,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 18:10:44,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-11-25 18:10:44,703 INFO L87 Difference]: Start difference. First operand 227 states and 267 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 3 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) [2022-11-25 18:10:44,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:10:44,902 INFO L93 Difference]: Finished difference Result 353 states and 420 transitions. [2022-11-25 18:10:44,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 18:10:44,903 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 3 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) Word has length 145 [2022-11-25 18:10:44,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:10:44,905 INFO L225 Difference]: With dead ends: 353 [2022-11-25 18:10:44,905 INFO L226 Difference]: Without dead ends: 232 [2022-11-25 18:10:44,906 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-11-25 18:10:44,907 INFO L413 NwaCegarLoop]: 170 mSDtfsCounter, 199 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 18:10:44,907 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 481 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 18:10:44,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2022-11-25 18:10:44,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2022-11-25 18:10:44,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 150 states have (on average 1.1266666666666667) internal successors, (169), 153 states have internal predecessors, (169), 50 states have call successors, (50), 28 states have call predecessors, (50), 31 states have return successors, (54), 50 states have call predecessors, (54), 49 states have call successors, (54) [2022-11-25 18:10:44,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 273 transitions. [2022-11-25 18:10:44,929 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 273 transitions. Word has length 145 [2022-11-25 18:10:44,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:10:44,929 INFO L495 AbstractCegarLoop]: Abstraction has 232 states and 273 transitions. [2022-11-25 18:10:44,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 3 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) [2022-11-25 18:10:44,930 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 273 transitions. [2022-11-25 18:10:44,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2022-11-25 18:10:44,932 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:10:44,932 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:10:44,946 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecd4ecb4-206c-4b5e-90f6-442b387555e3/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-25 18:10:45,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecd4ecb4-206c-4b5e-90f6-442b387555e3/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:10:45,142 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:10:45,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:10:45,143 INFO L85 PathProgramCache]: Analyzing trace with hash -783624291, now seen corresponding path program 1 times [2022-11-25 18:10:45,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:10:45,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761804464] [2022-11-25 18:10:45,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:10:45,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:10:45,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:45,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:10:45,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:45,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-25 18:10:45,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:45,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 18:10:45,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:45,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 18:10:45,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:45,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-25 18:10:45,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:45,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:10:45,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:45,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:10:45,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:45,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 18:10:45,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:45,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-25 18:10:45,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:45,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-25 18:10:45,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:45,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:10:45,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:45,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-25 18:10:45,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:46,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-25 18:10:46,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:46,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-11-25 18:10:46,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:46,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-25 18:10:46,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:46,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-25 18:10:46,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:46,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-11-25 18:10:46,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:46,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-11-25 18:10:46,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:46,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-25 18:10:46,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:46,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-11-25 18:10:46,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:46,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-11-25 18:10:46,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:46,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-11-25 18:10:46,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:46,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-11-25 18:10:46,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:46,316 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2022-11-25 18:10:46,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:10:46,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761804464] [2022-11-25 18:10:46,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761804464] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:10:46,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [161539162] [2022-11-25 18:10:46,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:10:46,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:10:46,317 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecd4ecb4-206c-4b5e-90f6-442b387555e3/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:10:46,318 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecd4ecb4-206c-4b5e-90f6-442b387555e3/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:10:46,342 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecd4ecb4-206c-4b5e-90f6-442b387555e3/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-25 18:10:46,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:46,874 INFO L263 TraceCheckSpWp]: Trace formula consists of 2387 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-25 18:10:46,878 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:10:49,094 WARN L859 $PredicateComparison]: unable to prove that (or (exists ((aws_hash_table_is_valid_~map.base Int) (aws_hash_table_is_valid_~map.offset Int)) (not (= 0 (select (select |c_#memory_$Pointer$.offset| aws_hash_table_is_valid_~map.base) aws_hash_table_is_valid_~map.offset)))) (exists ((aws_hash_table_is_valid_~map.base Int) (aws_hash_table_is_valid_~map.offset Int)) (not (= (select (select |c_#memory_$Pointer$.base| aws_hash_table_is_valid_~map.base) aws_hash_table_is_valid_~map.offset) 0)))) is different from true [2022-11-25 18:10:57,160 WARN L233 SmtUtils]: Spent 6.02s on a formula simplification that was a NOOP. DAG size: 23 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:11:05,230 WARN L233 SmtUtils]: Spent 6.02s on a formula simplification that was a NOOP. DAG size: 21 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:11:05,263 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2022-11-25 18:11:05,264 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 18:11:05,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [161539162] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:11:05,264 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 18:11:05,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 16 [2022-11-25 18:11:05,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662063076] [2022-11-25 18:11:05,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:11:05,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 18:11:05,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:11:05,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 18:11:05,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=175, Unknown=3, NotChecked=26, Total=240 [2022-11-25 18:11:05,266 INFO L87 Difference]: Start difference. First operand 232 states and 273 transitions. Second operand has 8 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 3 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (23), 2 states have call predecessors, (23), 3 states have call successors, (23) [2022-11-25 18:11:06,477 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 18:11:12,827 WARN L233 SmtUtils]: Spent 6.02s on a formula simplification that was a NOOP. DAG size: 25 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:11:15,073 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 18:11:15,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:11:15,233 INFO L93 Difference]: Finished difference Result 368 states and 439 transitions. [2022-11-25 18:11:15,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 18:11:15,233 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 3 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (23), 2 states have call predecessors, (23), 3 states have call successors, (23) Word has length 151 [2022-11-25 18:11:15,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:11:15,235 INFO L225 Difference]: With dead ends: 368 [2022-11-25 18:11:15,235 INFO L226 Difference]: Without dead ends: 239 [2022-11-25 18:11:15,236 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 24.5s TimeCoverageRelationStatistics Valid=64, Invalid=279, Unknown=3, NotChecked=34, Total=380 [2022-11-25 18:11:15,237 INFO L413 NwaCegarLoop]: 193 mSDtfsCounter, 12 mSDsluCounter, 848 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 1041 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 215 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-11-25 18:11:15,237 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 1041 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 159 Invalid, 1 Unknown, 215 Unchecked, 3.7s Time] [2022-11-25 18:11:15,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2022-11-25 18:11:15,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 238. [2022-11-25 18:11:15,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 154 states have (on average 1.1168831168831168) internal successors, (172), 157 states have internal predecessors, (172), 51 states have call successors, (51), 29 states have call predecessors, (51), 32 states have return successors, (55), 51 states have call predecessors, (55), 50 states have call successors, (55) [2022-11-25 18:11:15,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 278 transitions. [2022-11-25 18:11:15,256 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 278 transitions. Word has length 151 [2022-11-25 18:11:15,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:11:15,257 INFO L495 AbstractCegarLoop]: Abstraction has 238 states and 278 transitions. [2022-11-25 18:11:15,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 3 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (23), 2 states have call predecessors, (23), 3 states have call successors, (23) [2022-11-25 18:11:15,258 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 278 transitions. [2022-11-25 18:11:15,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-11-25 18:11:15,260 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:11:15,260 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:11:15,274 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecd4ecb4-206c-4b5e-90f6-442b387555e3/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-25 18:11:15,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecd4ecb4-206c-4b5e-90f6-442b387555e3/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:11:15,479 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:11:15,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:11:15,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1862607659, now seen corresponding path program 1 times [2022-11-25 18:11:15,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:11:15,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656457530] [2022-11-25 18:11:15,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:11:15,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:11:15,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:16,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:11:16,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:16,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-25 18:11:16,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:16,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 18:11:16,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:16,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 18:11:16,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:16,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-25 18:11:16,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:16,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:11:16,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:16,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:11:16,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:16,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 18:11:16,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:16,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-25 18:11:16,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:16,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-25 18:11:16,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:16,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:11:16,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:16,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-25 18:11:16,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:16,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-25 18:11:16,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:16,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:11:16,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:16,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-25 18:11:16,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:16,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-25 18:11:16,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:16,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-25 18:11:16,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:16,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-11-25 18:11:16,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:16,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-25 18:11:16,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:16,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-11-25 18:11:16,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:16,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-11-25 18:11:16,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:16,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-11-25 18:11:16,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:16,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-11-25 18:11:16,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:16,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-11-25 18:11:16,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:16,739 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2022-11-25 18:11:16,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:11:16,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656457530] [2022-11-25 18:11:16,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656457530] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:11:16,740 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:11:16,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-25 18:11:16,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012020635] [2022-11-25 18:11:16,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:11:16,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-25 18:11:16,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:11:16,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-25 18:11:16,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-11-25 18:11:16,743 INFO L87 Difference]: Start difference. First operand 238 states and 278 transitions. Second operand has 11 states, 9 states have (on average 7.333333333333333) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (28), 7 states have call predecessors, (28), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2022-11-25 18:11:17,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:11:17,841 INFO L93 Difference]: Finished difference Result 259 states and 300 transitions. [2022-11-25 18:11:17,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-25 18:11:17,844 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 7.333333333333333) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (28), 7 states have call predecessors, (28), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 156 [2022-11-25 18:11:17,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:11:17,846 INFO L225 Difference]: With dead ends: 259 [2022-11-25 18:11:17,846 INFO L226 Difference]: Without dead ends: 257 [2022-11-25 18:11:17,846 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2022-11-25 18:11:17,847 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 219 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 937 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 1051 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 937 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-25 18:11:17,847 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 593 Invalid, 1051 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 937 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-25 18:11:17,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2022-11-25 18:11:17,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 245. [2022-11-25 18:11:17,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 159 states have (on average 1.1132075471698113) internal successors, (177), 163 states have internal predecessors, (177), 51 states have call successors, (51), 30 states have call predecessors, (51), 34 states have return successors, (56), 51 states have call predecessors, (56), 50 states have call successors, (56) [2022-11-25 18:11:17,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 284 transitions. [2022-11-25 18:11:17,876 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 284 transitions. Word has length 156 [2022-11-25 18:11:17,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:11:17,878 INFO L495 AbstractCegarLoop]: Abstraction has 245 states and 284 transitions. [2022-11-25 18:11:17,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 7.333333333333333) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (28), 7 states have call predecessors, (28), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2022-11-25 18:11:17,878 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 284 transitions. [2022-11-25 18:11:17,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-11-25 18:11:17,881 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:11:17,881 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:11:17,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 18:11:17,882 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:11:17,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:11:17,882 INFO L85 PathProgramCache]: Analyzing trace with hash 443989020, now seen corresponding path program 1 times [2022-11-25 18:11:17,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:11:17,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292861159] [2022-11-25 18:11:17,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:11:17,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:11:18,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:22,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:11:22,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:22,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-25 18:11:22,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:22,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 18:11:22,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:22,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 18:11:22,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:22,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-25 18:11:22,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:22,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:11:22,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:23,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:11:23,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:23,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 18:11:23,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:23,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-25 18:11:23,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:23,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-25 18:11:23,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:23,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:11:23,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:23,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-25 18:11:23,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:23,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-25 18:11:23,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:23,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:11:23,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:23,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-25 18:11:23,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:23,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-25 18:11:23,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:23,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-25 18:11:23,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:23,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-11-25 18:11:23,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:23,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-25 18:11:23,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:23,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-11-25 18:11:23,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:23,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-11-25 18:11:23,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:23,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-11-25 18:11:23,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:23,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-11-25 18:11:23,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:23,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-11-25 18:11:23,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:23,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-11-25 18:11:23,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:23,626 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-11-25 18:11:23,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:11:23,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292861159] [2022-11-25 18:11:23,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292861159] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:11:23,627 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:11:23,627 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-11-25 18:11:23,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852364592] [2022-11-25 18:11:23,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:11:23,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-25 18:11:23,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:11:23,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-25 18:11:23,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=532, Unknown=0, NotChecked=0, Total=600 [2022-11-25 18:11:23,630 INFO L87 Difference]: Start difference. First operand 245 states and 284 transitions. Second operand has 25 states, 23 states have (on average 3.260869565217391) internal successors, (75), 20 states have internal predecessors, (75), 12 states have call successors, (29), 6 states have call predecessors, (29), 5 states have return successors, (25), 12 states have call predecessors, (25), 12 states have call successors, (25) [2022-11-25 18:11:26,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:11:26,187 INFO L93 Difference]: Finished difference Result 361 states and 422 transitions. [2022-11-25 18:11:26,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-25 18:11:26,188 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 3.260869565217391) internal successors, (75), 20 states have internal predecessors, (75), 12 states have call successors, (29), 6 states have call predecessors, (29), 5 states have return successors, (25), 12 states have call predecessors, (25), 12 states have call successors, (25) Word has length 162 [2022-11-25 18:11:26,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:11:26,195 INFO L225 Difference]: With dead ends: 361 [2022-11-25 18:11:26,195 INFO L226 Difference]: Without dead ends: 260 [2022-11-25 18:11:26,197 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=216, Invalid=1424, Unknown=0, NotChecked=0, Total=1640 [2022-11-25 18:11:26,199 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 309 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 2011 mSolverCounterSat, 200 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 2211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 200 IncrementalHoareTripleChecker+Valid, 2011 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-11-25 18:11:26,200 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 473 Invalid, 2211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [200 Valid, 2011 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-11-25 18:11:26,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2022-11-25 18:11:26,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 248. [2022-11-25 18:11:26,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 161 states have (on average 1.1118012422360248) internal successors, (179), 166 states have internal predecessors, (179), 51 states have call successors, (51), 30 states have call predecessors, (51), 35 states have return successors, (58), 51 states have call predecessors, (58), 50 states have call successors, (58) [2022-11-25 18:11:26,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 288 transitions. [2022-11-25 18:11:26,231 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 288 transitions. Word has length 162 [2022-11-25 18:11:26,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:11:26,233 INFO L495 AbstractCegarLoop]: Abstraction has 248 states and 288 transitions. [2022-11-25 18:11:26,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 3.260869565217391) internal successors, (75), 20 states have internal predecessors, (75), 12 states have call successors, (29), 6 states have call predecessors, (29), 5 states have return successors, (25), 12 states have call predecessors, (25), 12 states have call successors, (25) [2022-11-25 18:11:26,234 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 288 transitions. [2022-11-25 18:11:26,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-11-25 18:11:26,236 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:11:26,236 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:11:26,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 18:11:26,236 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:11:26,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:11:26,237 INFO L85 PathProgramCache]: Analyzing trace with hash -1799994278, now seen corresponding path program 1 times [2022-11-25 18:11:26,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:11:26,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178773133] [2022-11-25 18:11:26,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:11:26,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:11:26,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:26,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:11:26,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:26,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-25 18:11:26,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:26,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 18:11:26,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:26,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 18:11:26,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:26,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-25 18:11:26,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:26,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:11:26,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:26,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:11:26,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:26,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 18:11:26,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:26,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-25 18:11:26,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:26,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-25 18:11:26,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:26,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:11:26,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:26,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-25 18:11:26,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:26,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-25 18:11:26,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:26,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:11:26,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:26,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-25 18:11:26,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:26,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-25 18:11:26,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:26,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-25 18:11:26,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:26,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-11-25 18:11:26,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:26,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-25 18:11:26,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:26,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-11-25 18:11:26,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:27,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-11-25 18:11:27,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:27,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-11-25 18:11:27,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:27,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-11-25 18:11:27,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:27,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-11-25 18:11:27,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:27,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-11-25 18:11:27,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:27,090 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-11-25 18:11:27,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:11:27,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178773133] [2022-11-25 18:11:27,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178773133] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:11:27,091 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:11:27,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-25 18:11:27,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431035380] [2022-11-25 18:11:27,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:11:27,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-25 18:11:27,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:11:27,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-25 18:11:27,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-11-25 18:11:27,093 INFO L87 Difference]: Start difference. First operand 248 states and 288 transitions. Second operand has 10 states, 9 states have (on average 8.333333333333334) internal successors, (75), 6 states have internal predecessors, (75), 4 states have call successors, (29), 6 states have call predecessors, (29), 2 states have return successors, (25), 3 states have call predecessors, (25), 4 states have call successors, (25) [2022-11-25 18:11:28,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:11:28,004 INFO L93 Difference]: Finished difference Result 364 states and 425 transitions. [2022-11-25 18:11:28,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-25 18:11:28,005 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 8.333333333333334) internal successors, (75), 6 states have internal predecessors, (75), 4 states have call successors, (29), 6 states have call predecessors, (29), 2 states have return successors, (25), 3 states have call predecessors, (25), 4 states have call successors, (25) Word has length 162 [2022-11-25 18:11:28,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:11:28,007 INFO L225 Difference]: With dead ends: 364 [2022-11-25 18:11:28,008 INFO L226 Difference]: Without dead ends: 247 [2022-11-25 18:11:28,008 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2022-11-25 18:11:28,009 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 168 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 745 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 745 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-25 18:11:28,009 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 420 Invalid, 821 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 745 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-25 18:11:28,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2022-11-25 18:11:28,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 235. [2022-11-25 18:11:28,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 152 states have (on average 1.0986842105263157) internal successors, (167), 156 states have internal predecessors, (167), 49 states have call successors, (49), 29 states have call predecessors, (49), 33 states have return successors, (54), 49 states have call predecessors, (54), 48 states have call successors, (54) [2022-11-25 18:11:28,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 270 transitions. [2022-11-25 18:11:28,044 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 270 transitions. Word has length 162 [2022-11-25 18:11:28,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:11:28,045 INFO L495 AbstractCegarLoop]: Abstraction has 235 states and 270 transitions. [2022-11-25 18:11:28,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 8.333333333333334) internal successors, (75), 6 states have internal predecessors, (75), 4 states have call successors, (29), 6 states have call predecessors, (29), 2 states have return successors, (25), 3 states have call predecessors, (25), 4 states have call successors, (25) [2022-11-25 18:11:28,045 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 270 transitions. [2022-11-25 18:11:28,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2022-11-25 18:11:28,048 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:11:28,049 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:11:28,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 18:11:28,049 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:11:28,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:11:28,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1168881178, now seen corresponding path program 1 times [2022-11-25 18:11:28,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:11:28,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416521168] [2022-11-25 18:11:28,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:11:28,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:11:28,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:29,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:11:29,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:29,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-25 18:11:29,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:29,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 18:11:29,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:29,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 18:11:29,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:29,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-25 18:11:29,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:29,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:11:29,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:29,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:11:29,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:29,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 18:11:29,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:29,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-25 18:11:29,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:29,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-25 18:11:29,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:29,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:11:29,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:29,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-25 18:11:29,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:29,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-25 18:11:29,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:29,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:11:29,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:29,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-25 18:11:29,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:29,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-25 18:11:29,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:29,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-25 18:11:29,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:29,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-11-25 18:11:29,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:29,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-25 18:11:29,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:29,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-11-25 18:11:29,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:29,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-11-25 18:11:29,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:29,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-11-25 18:11:29,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:29,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-25 18:11:29,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:29,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:11:29,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:29,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-11-25 18:11:29,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:29,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-11-25 18:11:29,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:29,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-11-25 18:11:29,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:29,646 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 8 proven. 21 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2022-11-25 18:11:29,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:11:29,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416521168] [2022-11-25 18:11:29,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416521168] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:11:29,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1935036859] [2022-11-25 18:11:29,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:11:29,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:11:29,647 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecd4ecb4-206c-4b5e-90f6-442b387555e3/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:11:29,648 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecd4ecb4-206c-4b5e-90f6-442b387555e3/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:11:29,674 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecd4ecb4-206c-4b5e-90f6-442b387555e3/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-25 18:11:30,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:30,255 INFO L263 TraceCheckSpWp]: Trace formula consists of 2484 conjuncts, 61 conjunts are in the unsatisfiable core [2022-11-25 18:11:30,262 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:11:30,407 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2022-11-25 18:11:30,407 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 18:11:30,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1935036859] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:11:30,408 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 18:11:30,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 12 [2022-11-25 18:11:30,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556029297] [2022-11-25 18:11:30,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:11:30,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 18:11:30,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:11:30,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 18:11:30,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-11-25 18:11:30,410 INFO L87 Difference]: Start difference. First operand 235 states and 270 transitions. Second operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 4 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (25), 4 states have call predecessors, (25), 4 states have call successors, (25) [2022-11-25 18:11:30,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:11:30,639 INFO L93 Difference]: Finished difference Result 399 states and 458 transitions. [2022-11-25 18:11:30,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:11:30,640 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 4 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (25), 4 states have call predecessors, (25), 4 states have call successors, (25) Word has length 173 [2022-11-25 18:11:30,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:11:30,642 INFO L225 Difference]: With dead ends: 399 [2022-11-25 18:11:30,642 INFO L226 Difference]: Without dead ends: 235 [2022-11-25 18:11:30,643 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-11-25 18:11:30,644 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 20 mSDsluCounter, 805 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 984 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 18:11:30,644 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 984 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 18:11:30,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2022-11-25 18:11:30,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2022-11-25 18:11:30,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 152 states have (on average 1.0789473684210527) internal successors, (164), 156 states have internal predecessors, (164), 49 states have call successors, (49), 29 states have call predecessors, (49), 33 states have return successors, (54), 49 states have call predecessors, (54), 48 states have call successors, (54) [2022-11-25 18:11:30,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 267 transitions. [2022-11-25 18:11:30,669 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 267 transitions. Word has length 173 [2022-11-25 18:11:30,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:11:30,669 INFO L495 AbstractCegarLoop]: Abstraction has 235 states and 267 transitions. [2022-11-25 18:11:30,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 4 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (25), 4 states have call predecessors, (25), 4 states have call successors, (25) [2022-11-25 18:11:30,670 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 267 transitions. [2022-11-25 18:11:30,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2022-11-25 18:11:30,672 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:11:30,672 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:11:30,682 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecd4ecb4-206c-4b5e-90f6-442b387555e3/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-25 18:11:30,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecd4ecb4-206c-4b5e-90f6-442b387555e3/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-11-25 18:11:30,882 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:11:30,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:11:30,883 INFO L85 PathProgramCache]: Analyzing trace with hash -1367943333, now seen corresponding path program 1 times [2022-11-25 18:11:30,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:11:30,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106132139] [2022-11-25 18:11:30,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:11:30,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:11:30,957 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 18:11:30,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1923514047] [2022-11-25 18:11:30,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:11:30,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:11:30,958 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecd4ecb4-206c-4b5e-90f6-442b387555e3/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:11:30,959 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecd4ecb4-206c-4b5e-90f6-442b387555e3/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:11:30,978 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecd4ecb4-206c-4b5e-90f6-442b387555e3/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-25 18:12:55,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:12:55,863 INFO L263 TraceCheckSpWp]: Trace formula consists of 2589 conjuncts, 344 conjunts are in the unsatisfiable core [2022-11-25 18:12:55,876 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:12:55,892 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 18:12:56,646 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-25 18:12:56,647 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-25 18:12:56,744 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-25 18:12:57,001 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 18:12:57,221 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-25 18:12:57,501 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 18:12:58,004 INFO L321 Elim1Store]: treesize reduction 112, result has 28.7 percent of original size [2022-11-25 18:12:58,005 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 142 treesize of output 166 [2022-11-25 18:13:01,978 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-25 18:13:03,339 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 113 proven. 12 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2022-11-25 18:13:03,339 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:13:05,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:13:05,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106132139] [2022-11-25 18:13:05,508 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 18:13:05,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1923514047] [2022-11-25 18:13:05,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1923514047] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:13:05,508 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-11-25 18:13:05,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2022-11-25 18:13:05,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113805303] [2022-11-25 18:13:05,509 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-11-25 18:13:05,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-11-25 18:13:05,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:13:05,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-11-25 18:13:05,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=2185, Unknown=3, NotChecked=0, Total=2352 [2022-11-25 18:13:05,512 INFO L87 Difference]: Start difference. First operand 235 states and 267 transitions. Second operand has 37 states, 28 states have (on average 3.0357142857142856) internal successors, (85), 26 states have internal predecessors, (85), 12 states have call successors, (30), 6 states have call predecessors, (30), 11 states have return successors, (26), 12 states have call predecessors, (26), 12 states have call successors, (26) [2022-11-25 18:13:07,622 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 18:13:10,383 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 18:13:18,591 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 18:13:23,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:13:23,697 INFO L93 Difference]: Finished difference Result 398 states and 451 transitions. [2022-11-25 18:13:23,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-11-25 18:13:23,698 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 28 states have (on average 3.0357142857142856) internal successors, (85), 26 states have internal predecessors, (85), 12 states have call successors, (30), 6 states have call predecessors, (30), 11 states have return successors, (26), 12 states have call predecessors, (26), 12 states have call successors, (26) Word has length 179 [2022-11-25 18:13:23,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:13:23,700 INFO L225 Difference]: With dead ends: 398 [2022-11-25 18:13:23,700 INFO L226 Difference]: Without dead ends: 237 [2022-11-25 18:13:23,703 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 164 SyntacticMatches, 5 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1767 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=473, Invalid=6166, Unknown=3, NotChecked=0, Total=6642 [2022-11-25 18:13:23,704 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 265 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 3414 mSolverCounterSat, 215 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 3633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 215 IncrementalHoareTripleChecker+Valid, 3414 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.3s IncrementalHoareTripleChecker+Time [2022-11-25 18:13:23,704 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 615 Invalid, 3633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [215 Valid, 3414 Invalid, 4 Unknown, 0 Unchecked, 13.3s Time] [2022-11-25 18:13:23,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2022-11-25 18:13:23,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 235. [2022-11-25 18:13:23,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 152 states have (on average 1.0789473684210527) internal successors, (164), 156 states have internal predecessors, (164), 49 states have call successors, (49), 29 states have call predecessors, (49), 33 states have return successors, (53), 49 states have call predecessors, (53), 48 states have call successors, (53) [2022-11-25 18:13:23,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 266 transitions. [2022-11-25 18:13:23,735 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 266 transitions. Word has length 179 [2022-11-25 18:13:23,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:13:23,735 INFO L495 AbstractCegarLoop]: Abstraction has 235 states and 266 transitions. [2022-11-25 18:13:23,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 28 states have (on average 3.0357142857142856) internal successors, (85), 26 states have internal predecessors, (85), 12 states have call successors, (30), 6 states have call predecessors, (30), 11 states have return successors, (26), 12 states have call predecessors, (26), 12 states have call successors, (26) [2022-11-25 18:13:23,736 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 266 transitions. [2022-11-25 18:13:23,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2022-11-25 18:13:23,738 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:13:23,738 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:13:23,768 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecd4ecb4-206c-4b5e-90f6-442b387555e3/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-11-25 18:13:23,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecd4ecb4-206c-4b5e-90f6-442b387555e3/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:13:23,964 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:13:23,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:13:23,964 INFO L85 PathProgramCache]: Analyzing trace with hash 555700647, now seen corresponding path program 1 times [2022-11-25 18:13:23,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:13:23,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66569316] [2022-11-25 18:13:23,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:13:23,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:13:24,043 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 18:13:24,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1343572720] [2022-11-25 18:13:24,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:13:24,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:13:24,044 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecd4ecb4-206c-4b5e-90f6-442b387555e3/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:13:24,045 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecd4ecb4-206c-4b5e-90f6-442b387555e3/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:13:24,063 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecd4ecb4-206c-4b5e-90f6-442b387555e3/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-25 18:13:24,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:13:24,760 INFO L263 TraceCheckSpWp]: Trace formula consists of 2593 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 18:13:24,764 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:13:24,811 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2022-11-25 18:13:24,811 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 18:13:24,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:13:24,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66569316] [2022-11-25 18:13:24,812 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 18:13:24,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1343572720] [2022-11-25 18:13:24,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1343572720] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:13:24,812 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:13:24,813 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-25 18:13:24,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332041643] [2022-11-25 18:13:24,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:13:24,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 18:13:24,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:13:24,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 18:13:24,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-25 18:13:24,815 INFO L87 Difference]: Start difference. First operand 235 states and 266 transitions. Second operand has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 6 states have internal predecessors, (83), 2 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (27), 4 states have call predecessors, (27), 2 states have call successors, (27) [2022-11-25 18:13:24,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:13:24,876 INFO L93 Difference]: Finished difference Result 390 states and 443 transitions. [2022-11-25 18:13:24,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:13:24,877 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 6 states have internal predecessors, (83), 2 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (27), 4 states have call predecessors, (27), 2 states have call successors, (27) Word has length 185 [2022-11-25 18:13:24,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:13:24,878 INFO L225 Difference]: With dead ends: 390 [2022-11-25 18:13:24,878 INFO L226 Difference]: Without dead ends: 196 [2022-11-25 18:13:24,879 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-25 18:13:24,880 INFO L413 NwaCegarLoop]: 193 mSDtfsCounter, 2 mSDsluCounter, 951 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1144 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 18:13:24,880 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1144 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 18:13:24,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2022-11-25 18:13:24,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2022-11-25 18:13:24,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 127 states have (on average 1.0708661417322836) internal successors, (136), 129 states have internal predecessors, (136), 42 states have call successors, (42), 25 states have call predecessors, (42), 26 states have return successors, (43), 41 states have call predecessors, (43), 41 states have call successors, (43) [2022-11-25 18:13:24,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 221 transitions. [2022-11-25 18:13:24,905 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 221 transitions. Word has length 185 [2022-11-25 18:13:24,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:13:24,906 INFO L495 AbstractCegarLoop]: Abstraction has 196 states and 221 transitions. [2022-11-25 18:13:24,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 6 states have internal predecessors, (83), 2 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (27), 4 states have call predecessors, (27), 2 states have call successors, (27) [2022-11-25 18:13:24,906 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 221 transitions. [2022-11-25 18:13:24,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2022-11-25 18:13:24,908 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:13:24,909 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:13:24,924 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecd4ecb4-206c-4b5e-90f6-442b387555e3/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-25 18:13:25,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecd4ecb4-206c-4b5e-90f6-442b387555e3/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:13:25,119 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:13:25,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:13:25,119 INFO L85 PathProgramCache]: Analyzing trace with hash 620768873, now seen corresponding path program 1 times [2022-11-25 18:13:25,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:13:25,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610503536] [2022-11-25 18:13:25,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:13:25,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:13:25,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:13:25,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:13:25,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:13:25,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-25 18:13:25,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:13:25,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 18:13:25,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:13:25,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 18:13:25,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:13:25,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-25 18:13:25,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:13:25,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:13:25,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:13:25,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:13:25,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:13:25,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 18:13:25,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:13:25,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-25 18:13:25,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:13:25,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:13:25,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:13:25,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-25 18:13:25,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:13:25,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-25 18:13:25,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:13:25,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:13:25,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:13:25,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-11-25 18:13:25,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:13:25,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-25 18:13:25,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:13:25,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:13:25,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:13:25,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-11-25 18:13:25,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:13:25,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-11-25 18:13:25,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:13:25,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-25 18:13:25,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:13:25,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-11-25 18:13:25,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:13:25,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-11-25 18:13:25,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:13:25,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-11-25 18:13:25,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:13:25,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-11-25 18:13:25,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:13:25,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-11-25 18:13:25,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:13:25,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-25 18:13:25,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:13:25,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:13:25,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:13:26,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-11-25 18:13:26,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:13:26,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-11-25 18:13:26,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:13:26,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-11-25 18:13:26,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:13:26,030 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2022-11-25 18:13:26,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:13:26,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610503536] [2022-11-25 18:13:26,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610503536] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:13:26,031 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:13:26,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-25 18:13:26,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099162469] [2022-11-25 18:13:26,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:13:26,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-25 18:13:26,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:13:26,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-25 18:13:26,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-11-25 18:13:26,034 INFO L87 Difference]: Start difference. First operand 196 states and 221 transitions. Second operand has 10 states, 10 states have (on average 7.7) internal successors, (77), 6 states have internal predecessors, (77), 2 states have call successors, (31), 5 states have call predecessors, (31), 4 states have return successors, (27), 4 states have call predecessors, (27), 2 states have call successors, (27) [2022-11-25 18:13:26,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:13:26,234 INFO L93 Difference]: Finished difference Result 203 states and 226 transitions. [2022-11-25 18:13:26,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-25 18:13:26,235 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.7) internal successors, (77), 6 states have internal predecessors, (77), 2 states have call successors, (31), 5 states have call predecessors, (31), 4 states have return successors, (27), 4 states have call predecessors, (27), 2 states have call successors, (27) Word has length 185 [2022-11-25 18:13:26,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:13:26,235 INFO L225 Difference]: With dead ends: 203 [2022-11-25 18:13:26,235 INFO L226 Difference]: Without dead ends: 0 [2022-11-25 18:13:26,236 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-11-25 18:13:26,236 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 17 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 18:13:26,236 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 106 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 18:13:26,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-25 18:13:26,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-25 18:13:26,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:13:26,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-25 18:13:26,237 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 185 [2022-11-25 18:13:26,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:13:26,237 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-25 18:13:26,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.7) internal successors, (77), 6 states have internal predecessors, (77), 2 states have call successors, (31), 5 states have call predecessors, (31), 4 states have return successors, (27), 4 states have call predecessors, (27), 2 states have call successors, (27) [2022-11-25 18:13:26,238 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-25 18:13:26,238 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-25 18:13:26,243 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-25 18:13:26,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-25 18:13:26,246 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-25 18:13:38,642 WARN L233 SmtUtils]: Spent 12.26s on a formula simplification. DAG size of input: 67 DAG size of output: 63 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-11-25 18:13:47,121 WARN L233 SmtUtils]: Spent 8.08s on a formula simplification. DAG size of input: 57 DAG size of output: 49 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-11-25 18:13:56,364 INFO L899 garLoopResultBuilder]: For program point L6944-1(lines 6944 6946) no Hoare annotation was computed. [2022-11-25 18:13:56,364 INFO L895 garLoopResultBuilder]: At program point L6944(lines 6944 6946) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (forall ((|v_ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base_BEFORE_CALL_2| Int) (|aux_div_aux_mod_v_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1_BEFORE_CALL_4_104_116| Int) (|aux_mod_aux_mod_v_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1_BEFORE_CALL_4_104_116| Int) (|aux_div_v_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1_BEFORE_CALL_4_104| Int) (|v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_19| Int)) (let ((.cse0 (+ |aux_mod_aux_mod_v_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1_BEFORE_CALL_4_104_116| (* |aux_div_aux_mod_v_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1_BEFORE_CALL_4_104_116| 18446744073709551616)))) (or (not (<= 0 .cse0)) (not (<= 0 |aux_mod_aux_mod_v_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1_BEFORE_CALL_4_104_116|)) (= |v_ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base_BEFORE_CALL_2| |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_19|) (not (< |aux_mod_aux_mod_v_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1_BEFORE_CALL_4_104_116| 18446744073709551616)) (= |aux_mod_aux_mod_v_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1_BEFORE_CALL_4_104_116| 0) (not (= (select (select |#memory_int| |v_ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base_BEFORE_CALL_2|) 0) (+ 442721857768999609256 (* |aux_div_aux_mod_v_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1_BEFORE_CALL_4_104_116| 442721857769029238784) (* |aux_div_v_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1_BEFORE_CALL_4_104| 442721857769029238784) (* |aux_mod_aux_mod_v_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1_BEFORE_CALL_4_104_116| 24)))) (not (< |#StackHeapBarrier| |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_19|)) (not (<= .cse0 4)) (not (= (select |old(#valid)| |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_19|) 1))))) (and (= |bounded_malloc_#in~size| bounded_malloc_~size) (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) [2022-11-25 18:13:56,365 INFO L895 garLoopResultBuilder]: At program point bounded_mallocENTRY(lines 6943 6948) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (forall ((|v_ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base_BEFORE_CALL_2| Int) (|aux_div_aux_mod_v_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1_BEFORE_CALL_4_104_116| Int) (|aux_mod_aux_mod_v_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1_BEFORE_CALL_4_104_116| Int) (|aux_div_v_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1_BEFORE_CALL_4_104| Int) (|v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_19| Int)) (let ((.cse0 (+ |aux_mod_aux_mod_v_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1_BEFORE_CALL_4_104_116| (* |aux_div_aux_mod_v_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1_BEFORE_CALL_4_104_116| 18446744073709551616)))) (or (not (<= 0 .cse0)) (not (<= 0 |aux_mod_aux_mod_v_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1_BEFORE_CALL_4_104_116|)) (= |v_ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base_BEFORE_CALL_2| |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_19|) (not (< |aux_mod_aux_mod_v_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1_BEFORE_CALL_4_104_116| 18446744073709551616)) (= |aux_mod_aux_mod_v_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1_BEFORE_CALL_4_104_116| 0) (not (= (select (select |#memory_int| |v_ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base_BEFORE_CALL_2|) 0) (+ 442721857768999609256 (* |aux_div_aux_mod_v_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1_BEFORE_CALL_4_104_116| 442721857769029238784) (* |aux_div_v_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1_BEFORE_CALL_4_104| 442721857769029238784) (* |aux_mod_aux_mod_v_ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1_BEFORE_CALL_4_104_116| 24)))) (not (< |#StackHeapBarrier| |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_19|)) (not (<= .cse0 4)) (not (= (select |old(#valid)| |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_19|) 1))))) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) [2022-11-25 18:13:56,365 INFO L899 garLoopResultBuilder]: For program point bounded_mallocFINAL(lines 6943 6948) no Hoare annotation was computed. [2022-11-25 18:13:56,365 INFO L899 garLoopResultBuilder]: For program point bounded_mallocEXIT(lines 6943 6948) no Hoare annotation was computed. [2022-11-25 18:13:56,365 INFO L902 garLoopResultBuilder]: At program point L10017-4(line 10017) the Hoare annotation is: true [2022-11-25 18:13:56,365 INFO L899 garLoopResultBuilder]: For program point L10017-5(line 10017) no Hoare annotation was computed. [2022-11-25 18:13:56,365 INFO L899 garLoopResultBuilder]: For program point L10017-7(line 10017) no Hoare annotation was computed. [2022-11-25 18:13:56,366 INFO L899 garLoopResultBuilder]: For program point L10017(line 10017) no Hoare annotation was computed. [2022-11-25 18:13:56,366 INFO L899 garLoopResultBuilder]: For program point L10017-2(line 10017) no Hoare annotation was computed. [2022-11-25 18:13:56,366 INFO L899 garLoopResultBuilder]: For program point L10017-3(line 10017) no Hoare annotation was computed. [2022-11-25 18:13:56,366 INFO L902 garLoopResultBuilder]: At program point aws_hash_table_is_validENTRY(lines 10015 10018) the Hoare annotation is: true [2022-11-25 18:13:56,366 INFO L899 garLoopResultBuilder]: For program point aws_hash_table_is_validEXIT(lines 10015 10018) no Hoare annotation was computed. [2022-11-25 18:13:56,366 INFO L899 garLoopResultBuilder]: For program point aws_hash_table_is_validFINAL(lines 10015 10018) no Hoare annotation was computed. [2022-11-25 18:13:56,366 INFO L899 garLoopResultBuilder]: For program point nondet_boolFINAL(line 261) no Hoare annotation was computed. [2022-11-25 18:13:56,367 INFO L899 garLoopResultBuilder]: For program point nondet_boolEXIT(line 261) no Hoare annotation was computed. [2022-11-25 18:13:56,367 INFO L902 garLoopResultBuilder]: At program point nondet_boolENTRY(line 261) the Hoare annotation is: true [2022-11-25 18:13:56,367 INFO L895 garLoopResultBuilder]: At program point hash_table_state_required_bytesENTRY(lines 10128 10140) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (forall ((|v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_14| Int)) (or (not (= (select |old(#valid)| |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_14|) 1)) (not (< |#StackHeapBarrier| |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_14|)))) (and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= |old(#valid)| |#valid|)) (forall ((|v_ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.base_BEFORE_CALL_8| Int)) (= (select (select |old(#memory_$Pointer$.base)| |v_ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.base_BEFORE_CALL_8|) 0) 0))) [2022-11-25 18:13:56,367 INFO L899 garLoopResultBuilder]: For program point L10135-2(lines 10135 10137) no Hoare annotation was computed. [2022-11-25 18:13:56,368 INFO L895 garLoopResultBuilder]: At program point L10131(line 10131) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (forall ((|v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_14| Int)) (or (not (= (select |old(#valid)| |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_14|) 1)) (not (< |#StackHeapBarrier| |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_14|)))) (and (= hash_table_state_required_bytes_~required_bytes.offset |hash_table_state_required_bytes_#in~required_bytes.offset|) (= (select |old(#valid)| |hash_table_state_required_bytes_~#elemsize~0.base|) 0) (= hash_table_state_required_bytes_~size |hash_table_state_required_bytes_#in~size|) (= (store |old(#valid)| |hash_table_state_required_bytes_~#elemsize~0.base| (select |#valid| |hash_table_state_required_bytes_~#elemsize~0.base|)) |#valid|) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= hash_table_state_required_bytes_~required_bytes.base |hash_table_state_required_bytes_#in~required_bytes.base|) (= |hash_table_state_required_bytes_~#elemsize~0.offset| 0) (exists ((|v_ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.base_BEFORE_CALL_8| Int)) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.base_BEFORE_CALL_8|) 0) 0)))) (forall ((|v_ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.base_BEFORE_CALL_8| Int)) (= (select (select |old(#memory_$Pointer$.base)| |v_ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.base_BEFORE_CALL_8|) 0) 0))) [2022-11-25 18:13:56,368 INFO L899 garLoopResultBuilder]: For program point L10131-1(line 10131) no Hoare annotation was computed. [2022-11-25 18:13:56,368 INFO L895 garLoopResultBuilder]: At program point L10135(line 10135) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (forall ((|v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_14| Int)) (or (not (= (select |old(#valid)| |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_14|) 1)) (not (< |#StackHeapBarrier| |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_14|)))) (forall ((|v_ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.base_BEFORE_CALL_8| Int)) (= (select (select |old(#memory_$Pointer$.base)| |v_ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.base_BEFORE_CALL_8|) 0) 0)) (let ((.cse0 (* |hash_table_state_required_bytes_#in~size| 24))) (and (= hash_table_state_required_bytes_~required_bytes.offset |hash_table_state_required_bytes_#in~required_bytes.offset|) (= (select |old(#valid)| |hash_table_state_required_bytes_~#elemsize~0.base|) 0) (= hash_table_state_required_bytes_~size |hash_table_state_required_bytes_#in~size|) (= (store |old(#valid)| |hash_table_state_required_bytes_~#elemsize~0.base| (select |#valid| |hash_table_state_required_bytes_~#elemsize~0.base|)) |#valid|) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= hash_table_state_required_bytes_~required_bytes.base |hash_table_state_required_bytes_#in~required_bytes.base|) (= .cse0 |hash_table_state_required_bytes_#t~mem1321|) (= |hash_table_state_required_bytes_~#elemsize~0.offset| 0) (= (select (select |#memory_int| |hash_table_state_required_bytes_~#elemsize~0.base|) |hash_table_state_required_bytes_~#elemsize~0.offset|) .cse0)))) [2022-11-25 18:13:56,368 INFO L899 garLoopResultBuilder]: For program point hash_table_state_required_bytesEXIT(lines 10128 10140) no Hoare annotation was computed. [2022-11-25 18:13:56,369 INFO L899 garLoopResultBuilder]: For program point L10135-1(line 10135) no Hoare annotation was computed. [2022-11-25 18:13:56,369 INFO L899 garLoopResultBuilder]: For program point L10131-2(lines 10131 10133) no Hoare annotation was computed. [2022-11-25 18:13:56,369 INFO L899 garLoopResultBuilder]: For program point hash_table_state_required_bytesFINAL(lines 10128 10140) no Hoare annotation was computed. [2022-11-25 18:13:56,369 INFO L902 garLoopResultBuilder]: At program point memset_override_0_implENTRY(lines 7397 7412) the Hoare annotation is: true [2022-11-25 18:13:56,369 INFO L899 garLoopResultBuilder]: For program point memset_override_0_implFINAL(lines 7397 7412) no Hoare annotation was computed. [2022-11-25 18:13:56,374 INFO L899 garLoopResultBuilder]: For program point L7403-1(line 7403) no Hoare annotation was computed. [2022-11-25 18:13:56,374 INFO L902 garLoopResultBuilder]: At program point L7403(line 7403) the Hoare annotation is: true [2022-11-25 18:13:56,375 INFO L899 garLoopResultBuilder]: For program point L7407-4(lines 7407 7409) no Hoare annotation was computed. [2022-11-25 18:13:56,375 INFO L902 garLoopResultBuilder]: At program point L7407-3(lines 7407 7409) the Hoare annotation is: true [2022-11-25 18:13:56,376 INFO L899 garLoopResultBuilder]: For program point L7407-2(lines 7407 7409) no Hoare annotation was computed. [2022-11-25 18:13:56,377 INFO L899 garLoopResultBuilder]: For program point memset_override_0_implEXIT(lines 7397 7412) no Hoare annotation was computed. [2022-11-25 18:13:56,378 INFO L902 garLoopResultBuilder]: At program point L7398(line 7398) the Hoare annotation is: true [2022-11-25 18:13:56,378 INFO L899 garLoopResultBuilder]: For program point L7400(line 7400) no Hoare annotation was computed. [2022-11-25 18:13:56,378 INFO L902 garLoopResultBuilder]: At program point L7398-1(line 7398) the Hoare annotation is: true [2022-11-25 18:13:56,378 INFO L899 garLoopResultBuilder]: For program point aws_mul_size_checkedEXIT(lines 2586 2594) no Hoare annotation was computed. [2022-11-25 18:13:56,378 INFO L899 garLoopResultBuilder]: For program point L2498-1(lines 2498 2499) no Hoare annotation was computed. [2022-11-25 18:13:56,378 INFO L899 garLoopResultBuilder]: For program point aws_mul_size_checkedFINAL(lines 2586 2594) no Hoare annotation was computed. [2022-11-25 18:13:56,378 INFO L895 garLoopResultBuilder]: At program point aws_mul_size_checkedENTRY(lines 2586 2594) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (forall ((|v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_14| Int)) (or (not (= (select |old(#valid)| |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_14|) 1)) (not (< |#StackHeapBarrier| |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_14|)))) (and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= |old(#valid)| |#valid|)) (forall ((|v_ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.base_BEFORE_CALL_8| Int)) (= (select (select |old(#memory_$Pointer$.base)| |v_ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.base_BEFORE_CALL_8|) 0) 0))) [2022-11-25 18:13:56,379 INFO L895 garLoopResultBuilder]: At program point L2501(lines 2497 2502) the Hoare annotation is: (let ((.cse0 (= |aws_mul_size_checked_aws_mul_u64_checked_~r#1.base| |aws_mul_size_checked_#in~r#1.base|)) (.cse1 (exists ((|v___CPROVER_overflow_mult_~#c~1.base_42| Int) (v_ArrVal_1105 Int)) (and (= (select |old(#valid)| |v___CPROVER_overflow_mult_~#c~1.base_42|) 0) (= (store |old(#valid)| |v___CPROVER_overflow_mult_~#c~1.base_42| v_ArrVal_1105) |#valid|)))) (.cse2 (= |aws_mul_size_checked_#in~a#1| |aws_mul_size_checked_aws_mul_u64_checked_~a#1|)) (.cse3 (= |aws_mul_size_checked_#in~b#1| |aws_mul_size_checked_aws_mul_u64_checked_~b#1|)) (.cse4 (= |old(#valid)| |#valid|)) (.cse5 (= |aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset| |aws_mul_size_checked_#in~r#1.offset|))) (or (and .cse0 .cse1 .cse2 (<= (+ |aws_mul_size_checked_aws_mul_u64_checked_#res#1| 1) 0) .cse3 (exists ((|v_ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.base_BEFORE_CALL_8| Int)) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.base_BEFORE_CALL_8|) 0) 0))) .cse4 .cse5) (not (< 0 |#StackHeapBarrier|)) (forall ((|v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_14| Int)) (or (not (= (select |old(#valid)| |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_14|) 1)) (not (< |#StackHeapBarrier| |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_14|)))) (and (= (* |aws_mul_size_checked_#in~b#1| |aws_mul_size_checked_#in~a#1|) (select (select |#memory_int| |aws_mul_size_checked_#in~r#1.base|) |aws_mul_size_checked_#in~r#1.offset|)) .cse0 .cse1 (= ~tl_last_error~0 |old(~tl_last_error~0)|) .cse2 .cse3 (= |aws_mul_size_checked_aws_mul_u64_checked_#res#1| 0) .cse4 .cse5) (forall ((|v_ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.base_BEFORE_CALL_8| Int)) (= (select (select |old(#memory_$Pointer$.base)| |v_ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.base_BEFORE_CALL_8|) 0) 0)))) [2022-11-25 18:13:56,379 INFO L895 garLoopResultBuilder]: At program point L2498(line 2498) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (forall ((|v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_14| Int)) (or (not (= (select |old(#valid)| |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_14|) 1)) (not (< |#StackHeapBarrier| |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_14|)))) (forall ((|v_ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.base_BEFORE_CALL_8| Int)) (= (select (select |old(#memory_$Pointer$.base)| |v_ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.base_BEFORE_CALL_8|) 0) 0)) (and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |aws_mul_size_checked_aws_mul_u64_checked_~r#1.base| |aws_mul_size_checked_#in~r#1.base|) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= |aws_mul_size_checked_#in~a#1| |aws_mul_size_checked_aws_mul_u64_checked_~a#1|) (= |aws_mul_size_checked_#in~b#1| |aws_mul_size_checked_aws_mul_u64_checked_~b#1|) (= |old(#valid)| |#valid|) (= |aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset| |aws_mul_size_checked_#in~r#1.offset|))) [2022-11-25 18:13:56,379 INFO L899 garLoopResultBuilder]: For program point L2499-1(line 2499) no Hoare annotation was computed. [2022-11-25 18:13:56,379 INFO L895 garLoopResultBuilder]: At program point L2499(line 2499) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (forall ((|v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_14| Int)) (or (not (= (select |old(#valid)| |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_14|) 1)) (not (< |#StackHeapBarrier| |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_14|)))) (forall ((|v_ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.base_BEFORE_CALL_8| Int)) (= (select (select |old(#memory_$Pointer$.base)| |v_ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.base_BEFORE_CALL_8|) 0) 0)) (and (= |aws_mul_size_checked_aws_mul_u64_checked_~r#1.base| |aws_mul_size_checked_#in~r#1.base|) (exists ((|v___CPROVER_overflow_mult_~#c~1.base_42| Int) (v_ArrVal_1105 Int)) (and (= (select |old(#valid)| |v___CPROVER_overflow_mult_~#c~1.base_42|) 0) (= (store |old(#valid)| |v___CPROVER_overflow_mult_~#c~1.base_42| v_ArrVal_1105) |#valid|))) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= |aws_mul_size_checked_#in~a#1| |aws_mul_size_checked_aws_mul_u64_checked_~a#1|) (= |aws_mul_size_checked_#in~b#1| |aws_mul_size_checked_aws_mul_u64_checked_~b#1|) (exists ((|v_ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.base_BEFORE_CALL_8| Int)) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.base_BEFORE_CALL_8|) 0) 0))) (= |old(#valid)| |#valid|) (= |aws_mul_size_checked_aws_mul_u64_checked_~r#1.offset| |aws_mul_size_checked_#in~r#1.offset|))) [2022-11-25 18:13:56,379 INFO L899 garLoopResultBuilder]: For program point nondet_uint64_tEXIT(line 266) no Hoare annotation was computed. [2022-11-25 18:13:56,379 INFO L902 garLoopResultBuilder]: At program point nondet_uint64_tENTRY(line 266) the Hoare annotation is: true [2022-11-25 18:13:56,379 INFO L899 garLoopResultBuilder]: For program point nondet_uint64_tFINAL(line 266) no Hoare annotation was computed. [2022-11-25 18:13:56,379 INFO L899 garLoopResultBuilder]: For program point ##fun~$Pointer$~TO~VOIDEXIT(line -1) no Hoare annotation was computed. [2022-11-25 18:13:56,379 INFO L902 garLoopResultBuilder]: At program point ##fun~$Pointer$~TO~VOIDENTRY(line -1) the Hoare annotation is: true [2022-11-25 18:13:56,380 INFO L899 garLoopResultBuilder]: For program point ##fun~$Pointer$~TO~VOIDFINAL(line -1) no Hoare annotation was computed. [2022-11-25 18:13:56,380 INFO L899 garLoopResultBuilder]: For program point L6852(line 6852) no Hoare annotation was computed. [2022-11-25 18:13:56,380 INFO L895 garLoopResultBuilder]: At program point __CPROVER_overflow_plusENTRY(lines 248 251) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (forall ((|v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_14| Int)) (or (not (= (select |old(#valid)| |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_14|) 1)) (not (< |#StackHeapBarrier| |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_14|)))) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) [2022-11-25 18:13:56,380 INFO L899 garLoopResultBuilder]: For program point __CPROVER_overflow_plusFINAL(lines 248 251) no Hoare annotation was computed. [2022-11-25 18:13:56,380 INFO L899 garLoopResultBuilder]: For program point __CPROVER_overflow_plusEXIT(lines 248 251) no Hoare annotation was computed. [2022-11-25 18:13:56,380 INFO L902 garLoopResultBuilder]: At program point hash_table_state_is_validENTRY(lines 10026 10073) the Hoare annotation is: true [2022-11-25 18:13:56,380 INFO L899 garLoopResultBuilder]: For program point L10028(lines 10028 10032) no Hoare annotation was computed. [2022-11-25 18:13:56,380 INFO L899 garLoopResultBuilder]: For program point hash_table_state_is_validEXIT(lines 10026 10073) no Hoare annotation was computed. [2022-11-25 18:13:56,380 INFO L899 garLoopResultBuilder]: For program point hash_table_state_is_validFINAL(lines 10026 10073) no Hoare annotation was computed. [2022-11-25 18:13:56,381 INFO L899 garLoopResultBuilder]: For program point L10054-1(line 10054) no Hoare annotation was computed. [2022-11-25 18:13:56,381 INFO L902 garLoopResultBuilder]: At program point L10054(line 10054) the Hoare annotation is: true [2022-11-25 18:13:56,381 INFO L902 garLoopResultBuilder]: At program point my_memsetENTRY(lines 7414 7416) the Hoare annotation is: true [2022-11-25 18:13:56,381 INFO L899 garLoopResultBuilder]: For program point my_memsetFINAL(lines 7414 7416) no Hoare annotation was computed. [2022-11-25 18:13:56,381 INFO L899 garLoopResultBuilder]: For program point L7415-1(line 7415) no Hoare annotation was computed. [2022-11-25 18:13:56,381 INFO L902 garLoopResultBuilder]: At program point L7415(line 7415) the Hoare annotation is: true [2022-11-25 18:13:56,381 INFO L899 garLoopResultBuilder]: For program point my_memsetEXIT(lines 7414 7416) no Hoare annotation was computed. [2022-11-25 18:13:56,381 INFO L899 garLoopResultBuilder]: For program point L211-2(lines 210 212) no Hoare annotation was computed. [2022-11-25 18:13:56,381 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 210 212) the Hoare annotation is: true [2022-11-25 18:13:56,381 INFO L899 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2022-11-25 18:13:56,381 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 210 212) no Hoare annotation was computed. [2022-11-25 18:13:56,382 INFO L895 garLoopResultBuilder]: At program point aws_raise_errorENTRY(lines 1988 1999) the Hoare annotation is: (or (forall ((|v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_14| Int)) (or (not (= (select |#valid| |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_14|) 1)) (not (< |#StackHeapBarrier| |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_14|)))) (not (< 0 |#StackHeapBarrier|)) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (forall ((|v___CPROVER_overflow_mult_~#c~1.base_42| Int) (v_ArrVal_1105 Int)) (let ((.cse0 (select |#valid| |v___CPROVER_overflow_mult_~#c~1.base_42|))) (or (not (= .cse0 v_ArrVal_1105)) (not (= .cse0 0)))))) [2022-11-25 18:13:56,382 INFO L899 garLoopResultBuilder]: For program point aws_raise_errorFINAL(lines 1988 1999) no Hoare annotation was computed. [2022-11-25 18:13:56,382 INFO L899 garLoopResultBuilder]: For program point L7385(lines 7385 7387) no Hoare annotation was computed. [2022-11-25 18:13:56,382 INFO L899 garLoopResultBuilder]: For program point aws_raise_errorEXIT(lines 1988 1999) no Hoare annotation was computed. [2022-11-25 18:13:56,382 INFO L899 garLoopResultBuilder]: For program point L9941(lines 9941 9943) no Hoare annotation was computed. [2022-11-25 18:13:56,382 INFO L902 garLoopResultBuilder]: At program point L9945(line 9945) the Hoare annotation is: true [2022-11-25 18:13:56,383 INFO L899 garLoopResultBuilder]: For program point L9945-1(line 9945) no Hoare annotation was computed. [2022-11-25 18:13:56,383 INFO L902 garLoopResultBuilder]: At program point L9954(line 9954) the Hoare annotation is: true [2022-11-25 18:13:56,383 INFO L899 garLoopResultBuilder]: For program point aws_hash_table_clearEXIT(lines 9933 9958) no Hoare annotation was computed. [2022-11-25 18:13:56,383 INFO L902 garLoopResultBuilder]: At program point aws_hash_table_clearENTRY(lines 9933 9958) the Hoare annotation is: true [2022-11-25 18:13:56,383 INFO L899 garLoopResultBuilder]: For program point L9954-1(line 9954) no Hoare annotation was computed. [2022-11-25 18:13:56,383 INFO L899 garLoopResultBuilder]: For program point L9938(line 9938) no Hoare annotation was computed. [2022-11-25 18:13:56,383 INFO L899 garLoopResultBuilder]: For program point aws_hash_table_clearFINAL(lines 9933 9958) no Hoare annotation was computed. [2022-11-25 18:13:56,384 INFO L902 garLoopResultBuilder]: At program point L9934-1(line 9934) the Hoare annotation is: true [2022-11-25 18:13:56,384 INFO L899 garLoopResultBuilder]: For program point L9934-2(line 9934) no Hoare annotation was computed. [2022-11-25 18:13:56,384 INFO L899 garLoopResultBuilder]: For program point L9938-2(lines 9938 9951) no Hoare annotation was computed. [2022-11-25 18:13:56,384 INFO L899 garLoopResultBuilder]: For program point L9938-3(lines 9938 9951) no Hoare annotation was computed. [2022-11-25 18:13:56,384 INFO L902 garLoopResultBuilder]: At program point L9934(line 9934) the Hoare annotation is: true [2022-11-25 18:13:56,384 INFO L899 garLoopResultBuilder]: For program point L9947(lines 9947 9949) no Hoare annotation was computed. [2022-11-25 18:13:56,384 INFO L899 garLoopResultBuilder]: For program point L9939-1(lines 9939 9950) no Hoare annotation was computed. [2022-11-25 18:13:56,384 INFO L902 garLoopResultBuilder]: At program point L9939-3(lines 9939 9950) the Hoare annotation is: true [2022-11-25 18:13:56,384 INFO L902 garLoopResultBuilder]: At program point L9939-4(lines 9939 9950) the Hoare annotation is: true [2022-11-25 18:13:56,384 INFO L902 garLoopResultBuilder]: At program point L9948(line 9948) the Hoare annotation is: true [2022-11-25 18:13:56,384 INFO L899 garLoopResultBuilder]: For program point L9948-1(line 9948) no Hoare annotation was computed. [2022-11-25 18:13:56,384 INFO L899 garLoopResultBuilder]: For program point L9944(lines 9944 9946) no Hoare annotation was computed. [2022-11-25 18:13:56,385 INFO L899 garLoopResultBuilder]: For program point L9944-2(lines 9944 9946) no Hoare annotation was computed. [2022-11-25 18:13:56,385 INFO L902 garLoopResultBuilder]: At program point L9957(line 9957) the Hoare annotation is: true [2022-11-25 18:13:56,385 INFO L902 garLoopResultBuilder]: At program point L9957-1(line 9957) the Hoare annotation is: true [2022-11-25 18:13:56,385 INFO L899 garLoopResultBuilder]: For program point L9957-2(line 9957) no Hoare annotation was computed. [2022-11-25 18:13:56,385 INFO L895 garLoopResultBuilder]: At program point __CPROVER_overflow_multENTRY(lines 253 256) the Hoare annotation is: (or (forall ((|v_ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.base_BEFORE_CALL_8| Int)) (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.base_BEFORE_CALL_8|) 0) 0)) (not (< 0 |#StackHeapBarrier|)) (forall ((|v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_14| Int)) (or (not (= (select |old(#valid)| |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_14|) 1)) (not (< |#StackHeapBarrier| |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_14|)))) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) [2022-11-25 18:13:56,385 INFO L899 garLoopResultBuilder]: For program point __CPROVER_overflow_multEXIT(lines 253 256) no Hoare annotation was computed. [2022-11-25 18:13:56,385 INFO L899 garLoopResultBuilder]: For program point __CPROVER_overflow_multFINAL(lines 253 256) no Hoare annotation was computed. [2022-11-25 18:13:56,386 INFO L899 garLoopResultBuilder]: For program point aws_is_power_of_twoFINAL(lines 2626 2631) no Hoare annotation was computed. [2022-11-25 18:13:56,386 INFO L899 garLoopResultBuilder]: For program point aws_is_power_of_twoEXIT(lines 2626 2631) no Hoare annotation was computed. [2022-11-25 18:13:56,386 INFO L902 garLoopResultBuilder]: At program point aws_is_power_of_twoENTRY(lines 2626 2631) the Hoare annotation is: true [2022-11-25 18:13:56,386 INFO L895 garLoopResultBuilder]: At program point L2545(lines 2541 2546) the Hoare annotation is: (let ((.cse0 (= |aws_add_size_checked_#in~b#1| |aws_add_size_checked_aws_add_u64_checked_~b#1|)) (.cse1 (= |aws_add_size_checked_#in~r#1.base| |aws_add_size_checked_aws_add_u64_checked_~r#1.base|)) (.cse2 (= |aws_add_size_checked_#in~r#1.offset| |aws_add_size_checked_aws_add_u64_checked_~r#1.offset|)) (.cse3 (exists ((|v___CPROVER_overflow_mult_~#c~1.base_42| Int) (v_ArrVal_1105 Int)) (and (= (select |old(#valid)| |v___CPROVER_overflow_mult_~#c~1.base_42|) 0) (= (store |old(#valid)| |v___CPROVER_overflow_mult_~#c~1.base_42| v_ArrVal_1105) |#valid|)))) (.cse4 (= |old(#valid)| |#valid|)) (.cse5 (= |aws_add_size_checked_#in~a#1| |aws_add_size_checked_aws_add_u64_checked_~a#1|))) (or (and .cse0 (= (select (select |#memory_int| |aws_add_size_checked_#in~r#1.base|) |aws_add_size_checked_#in~r#1.offset|) (+ |aws_add_size_checked_#in~b#1| |aws_add_size_checked_#in~a#1|)) .cse1 .cse2 .cse3 (= ~tl_last_error~0 |old(~tl_last_error~0)|) .cse4 .cse5) (not (< 0 |#StackHeapBarrier|)) (forall ((|v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_14| Int)) (or (not (= (select |old(#valid)| |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_14|) 1)) (not (< |#StackHeapBarrier| |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_14|)))) (and .cse0 .cse1 .cse2 (<= (+ |aws_add_size_checked_aws_add_u64_checked_#res#1| 1) 0) .cse3 .cse4 .cse5))) [2022-11-25 18:13:56,386 INFO L895 garLoopResultBuilder]: At program point aws_add_size_checkedENTRY(lines 2613 2621) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (forall ((|v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_14| Int)) (or (not (= (select |old(#valid)| |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_14|) 1)) (not (< |#StackHeapBarrier| |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_14|)))) (and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= |old(#valid)| |#valid|))) [2022-11-25 18:13:56,386 INFO L895 garLoopResultBuilder]: At program point L2542(line 2542) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (forall ((|v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_14| Int)) (or (not (= (select |old(#valid)| |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_14|) 1)) (not (< |#StackHeapBarrier| |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_14|)))) (and (= |aws_add_size_checked_#in~b#1| |aws_add_size_checked_aws_add_u64_checked_~b#1|) (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |aws_add_size_checked_#in~r#1.base| |aws_add_size_checked_aws_add_u64_checked_~r#1.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |aws_add_size_checked_#in~r#1.offset| |aws_add_size_checked_aws_add_u64_checked_~r#1.offset|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= |old(#valid)| |#valid|) (= |aws_add_size_checked_#in~a#1| |aws_add_size_checked_aws_add_u64_checked_~a#1|))) [2022-11-25 18:13:56,387 INFO L899 garLoopResultBuilder]: For program point L2543-1(line 2543) no Hoare annotation was computed. [2022-11-25 18:13:56,387 INFO L895 garLoopResultBuilder]: At program point L2543(line 2543) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (forall ((|v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_14| Int)) (or (not (= (select |old(#valid)| |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_14|) 1)) (not (< |#StackHeapBarrier| |v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_14|)))) (and (= |aws_add_size_checked_#in~b#1| |aws_add_size_checked_aws_add_u64_checked_~b#1|) (= |aws_add_size_checked_#in~r#1.base| |aws_add_size_checked_aws_add_u64_checked_~r#1.base|) (= |aws_add_size_checked_#in~r#1.offset| |aws_add_size_checked_aws_add_u64_checked_~r#1.offset|) (exists ((|v___CPROVER_overflow_mult_~#c~1.base_42| Int) (v_ArrVal_1105 Int)) (and (= (select |old(#valid)| |v___CPROVER_overflow_mult_~#c~1.base_42|) 0) (= (store |old(#valid)| |v___CPROVER_overflow_mult_~#c~1.base_42| v_ArrVal_1105) |#valid|))) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= |old(#valid)| |#valid|) (= |aws_add_size_checked_#in~a#1| |aws_add_size_checked_aws_add_u64_checked_~a#1|))) [2022-11-25 18:13:56,387 INFO L899 garLoopResultBuilder]: For program point L2542-1(lines 2542 2543) no Hoare annotation was computed. [2022-11-25 18:13:56,387 INFO L899 garLoopResultBuilder]: For program point aws_add_size_checkedFINAL(lines 2613 2621) no Hoare annotation was computed. [2022-11-25 18:13:56,387 INFO L899 garLoopResultBuilder]: For program point aws_add_size_checkedEXIT(lines 2613 2621) no Hoare annotation was computed. [2022-11-25 18:13:56,387 INFO L899 garLoopResultBuilder]: For program point L6815-1(line 6815) no Hoare annotation was computed. [2022-11-25 18:13:56,388 INFO L895 garLoopResultBuilder]: At program point L6815(line 6815) the Hoare annotation is: (let ((.cse0 (mod |ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1| 18446744073709551616))) (and (= |ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries#1| 4) (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.offset| 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.base|) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base| |ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.base|) (= |ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.offset| |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset|) (not (= .cse0 0)) (= |ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.offset| 0) (exists ((|v_ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.base_BEFORE_CALL_8| Int)) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.base_BEFORE_CALL_8|) 0) 0))) (<= .cse0 4) (not (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base| |ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.base|)) (= (select |#valid| |ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.base|) 1) (< 0 |#StackHeapBarrier|))) [2022-11-25 18:13:56,388 INFO L895 garLoopResultBuilder]: At program point L6811-1(line 6811) the Hoare annotation is: (and (= |ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries#1| 4) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.base|) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base| |ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.base|) (= |ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.offset| |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset|) (= |ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.offset| 0) (exists ((|v_ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.base_BEFORE_CALL_8| Int)) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.base_BEFORE_CALL_8|) 0) 0))) (<= (mod |ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1| 18446744073709551616) 4) (= (select |#valid| |ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.base|) 1) (< 0 |#StackHeapBarrier|)) [2022-11-25 18:13:56,388 INFO L895 garLoopResultBuilder]: At program point L6811(line 6811) the Hoare annotation is: (and (= |ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries#1| 4) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.base|) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base| |ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.base|) (= |ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.offset| |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset|) (= |ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.offset| 0) (exists ((|v_ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.base_BEFORE_CALL_8| Int)) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.base_BEFORE_CALL_8|) 0) 0))) (= (select |#valid| |ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.base|) 1) (< 0 |#StackHeapBarrier|)) [2022-11-25 18:13:56,388 INFO L899 garLoopResultBuilder]: For program point L6815-3(line 6815) no Hoare annotation was computed. [2022-11-25 18:13:56,388 INFO L895 garLoopResultBuilder]: At program point L6815-2(line 6815) the Hoare annotation is: (let ((.cse0 (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.base|)) (.cse1 (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base| |ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.base|)) (.cse2 (= |ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.offset| |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset|)) (.cse4 (= |ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.offset| 0)) (.cse5 (not (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base| |ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.base|))) (.cse6 (= (select |#valid| |ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.base|) 1)) (.cse7 (< 0 |#StackHeapBarrier|))) (or (let ((.cse3 (mod |ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1| 18446744073709551616))) (and (= (+ (* |ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1| 24) 442721857768999609256) (select (select |#memory_int| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base|) |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.offset|)) (= |ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries#1| 4) (= |ULTIMATE.start_ensure_allocated_hash_table_#t~ret548#1| 0) (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.offset| 0) .cse0 .cse1 .cse2 (not (= .cse3 0)) .cse4 (<= .cse3 4) .cse5 .cse6 .cse7)) (and (<= (+ |ULTIMATE.start_ensure_allocated_hash_table_#t~ret548#1| 1) 0) .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7))) [2022-11-25 18:13:56,388 INFO L899 garLoopResultBuilder]: For program point L6840-1(line 6840) no Hoare annotation was computed. [2022-11-25 18:13:56,388 INFO L895 garLoopResultBuilder]: At program point L6840(line 6840) the Hoare annotation is: false [2022-11-25 18:13:56,388 INFO L899 garLoopResultBuilder]: For program point L7179-1(line 7179) no Hoare annotation was computed. [2022-11-25 18:13:56,389 INFO L895 garLoopResultBuilder]: At program point L7179(line 7179) the Hoare annotation is: false [2022-11-25 18:13:56,389 INFO L895 garLoopResultBuilder]: At program point L10148(line 10148) the Hoare annotation is: false [2022-11-25 18:13:56,389 INFO L899 garLoopResultBuilder]: For program point L7175(lines 7175 7183) no Hoare annotation was computed. [2022-11-25 18:13:56,389 INFO L899 garLoopResultBuilder]: For program point L10148-1(line 10148) no Hoare annotation was computed. [2022-11-25 18:13:56,389 INFO L899 garLoopResultBuilder]: For program point L6816-1(line 6816) no Hoare annotation was computed. [2022-11-25 18:13:56,389 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-25 18:13:56,390 INFO L895 garLoopResultBuilder]: At program point L6816(line 6816) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base|) 0)) (.cse1 (mod |ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1| 18446744073709551616))) (and (= |ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries#1| 4) (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.offset| 0) (= .cse0 (+ (* |ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1| 24) 442721857768999609256)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.base|) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base| |ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.base|) (= |ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.offset| |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset|) (not (= .cse1 0)) (= .cse0 |ULTIMATE.start_ensure_allocated_hash_table_#t~mem549#1|) (= |ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.offset| 0) (<= .cse1 4) (not (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0#1.base| |ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.base|)) (= (select |#valid| |ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.base|) 1) (< 0 |#StackHeapBarrier|))) [2022-11-25 18:13:56,390 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-25 18:13:56,390 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-11-25 18:13:56,390 INFO L899 garLoopResultBuilder]: For program point L6812-1(line 6812) no Hoare annotation was computed. [2022-11-25 18:13:56,390 INFO L895 garLoopResultBuilder]: At program point L10144(line 10144) the Hoare annotation is: false [2022-11-25 18:13:56,390 INFO L895 garLoopResultBuilder]: At program point L6812(line 6812) the Hoare annotation is: (let ((.cse0 (mod |ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1| 18446744073709551616))) (and (= |ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries#1| 4) (or (and (= |ULTIMATE.start_ensure_allocated_hash_table_#t~ret547#1| 1) (not (= .cse0 0))) (and (= |ULTIMATE.start_ensure_allocated_hash_table_#t~ret547#1| 0) (not (= |ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0#1| 1)))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.base|) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base| |ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.base|) (= |ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.offset| |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset|) (= |ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.offset| 0) (exists ((|v_ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.base_BEFORE_CALL_8| Int)) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.base_BEFORE_CALL_8|) 0) 0))) (<= .cse0 4) (= (select |#valid| |ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.base|) 1) (< 0 |#StackHeapBarrier|))) [2022-11-25 18:13:56,391 INFO L895 garLoopResultBuilder]: At program point L10144-1(line 10144) the Hoare annotation is: false [2022-11-25 18:13:56,391 INFO L899 garLoopResultBuilder]: For program point L10144-2(line 10144) no Hoare annotation was computed. [2022-11-25 18:13:56,391 INFO L899 garLoopResultBuilder]: For program point L6841-1(line 6841) no Hoare annotation was computed. [2022-11-25 18:13:56,391 INFO L895 garLoopResultBuilder]: At program point L6841(line 6841) the Hoare annotation is: false [2022-11-25 18:13:56,391 INFO L895 garLoopResultBuilder]: At program point L6833(lines 6831 6834) the Hoare annotation is: false [2022-11-25 18:13:56,391 INFO L899 garLoopResultBuilder]: For program point L7180-1(line 7180) no Hoare annotation was computed. [2022-11-25 18:13:56,392 INFO L895 garLoopResultBuilder]: At program point L7180(line 7180) the Hoare annotation is: false [2022-11-25 18:13:56,392 INFO L895 garLoopResultBuilder]: At program point L10149(line 10149) the Hoare annotation is: false [2022-11-25 18:13:56,392 INFO L895 garLoopResultBuilder]: At program point L10149-1(line 10149) the Hoare annotation is: false [2022-11-25 18:13:56,392 INFO L899 garLoopResultBuilder]: For program point L6825-1(line 6825) no Hoare annotation was computed. [2022-11-25 18:13:56,392 INFO L899 garLoopResultBuilder]: For program point L7176(lines 7176 7182) no Hoare annotation was computed. [2022-11-25 18:13:56,392 INFO L895 garLoopResultBuilder]: At program point L6825(line 6825) the Hoare annotation is: false [2022-11-25 18:13:56,392 INFO L899 garLoopResultBuilder]: For program point L6821(lines 6821 6828) no Hoare annotation was computed. [2022-11-25 18:13:56,393 INFO L899 garLoopResultBuilder]: For program point L10141(lines 10141 10153) no Hoare annotation was computed. [2022-11-25 18:13:56,393 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-25 18:13:56,393 INFO L899 garLoopResultBuilder]: For program point L6809(lines 6809 6819) no Hoare annotation was computed. [2022-11-25 18:13:56,393 INFO L899 garLoopResultBuilder]: For program point L7185(lines 7185 7187) no Hoare annotation was computed. [2022-11-25 18:13:56,393 INFO L902 garLoopResultBuilder]: At program point L10154(line 10154) the Hoare annotation is: true [2022-11-25 18:13:56,393 INFO L899 garLoopResultBuilder]: For program point L7181-1(line 7181) no Hoare annotation was computed. [2022-11-25 18:13:56,393 INFO L895 garLoopResultBuilder]: At program point L7181(line 7181) the Hoare annotation is: false [2022-11-25 18:13:56,394 INFO L895 garLoopResultBuilder]: At program point L6822(line 6822) the Hoare annotation is: false [2022-11-25 18:13:56,394 INFO L899 garLoopResultBuilder]: For program point L10150-1(line 10150) no Hoare annotation was computed. [2022-11-25 18:13:56,394 INFO L899 garLoopResultBuilder]: For program point L6822-1(line 6822) no Hoare annotation was computed. [2022-11-25 18:13:56,394 INFO L895 garLoopResultBuilder]: At program point L10150(line 10150) the Hoare annotation is: false [2022-11-25 18:13:56,394 INFO L895 garLoopResultBuilder]: At program point L6810(line 6810) the Hoare annotation is: (and (= |ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries#1| 4) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.base|) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base| |ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.base|) (= |ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.offset| |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset|) (= |ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.offset| 0) (exists ((|v_ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.base_BEFORE_CALL_8| Int)) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.base_BEFORE_CALL_8|) 0) 0))) (= (select |#valid| |ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.base|) 1) (< 0 |#StackHeapBarrier|)) [2022-11-25 18:13:56,394 INFO L895 garLoopResultBuilder]: At program point L6843(lines 6837 6844) the Hoare annotation is: false [2022-11-25 18:13:56,395 INFO L899 garLoopResultBuilder]: For program point L6839-1(line 6839) no Hoare annotation was computed. [2022-11-25 18:13:56,395 INFO L895 garLoopResultBuilder]: At program point L6839(line 6839) the Hoare annotation is: false [2022-11-25 18:13:56,395 INFO L899 garLoopResultBuilder]: For program point L6810-1(line 6810) no Hoare annotation was computed. [2022-11-25 18:13:56,395 INFO L899 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2022-11-25 18:13:56,395 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 222 224) the Hoare annotation is: true [2022-11-25 18:13:56,395 INFO L899 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2022-11-25 18:13:56,395 INFO L899 garLoopResultBuilder]: For program point L223-3(lines 222 224) no Hoare annotation was computed. [2022-11-25 18:13:56,396 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 222 224) no Hoare annotation was computed. [2022-11-25 18:13:56,396 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2022-11-25 18:13:56,399 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:13:56,402 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 18:13:56,415 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_42,QUANTIFIED] [2022-11-25 18:13:56,416 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1105,QUANTIFIED] [2022-11-25 18:13:56,423 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_42,QUANTIFIED] [2022-11-25 18:13:56,424 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 18:13:56,424 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.base_BEFORE_CALL_8,QUANTIFIED] [2022-11-25 18:13:56,425 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_14,QUANTIFIED] [2022-11-25 18:13:56,425 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_14,QUANTIFIED] [2022-11-25 18:13:56,425 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_42,QUANTIFIED] [2022-11-25 18:13:56,425 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1105,QUANTIFIED] [2022-11-25 18:13:56,426 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_42,QUANTIFIED] [2022-11-25 18:13:56,426 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 18:13:56,426 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.base_BEFORE_CALL_8,QUANTIFIED] [2022-11-25 18:13:56,430 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_42,QUANTIFIED] [2022-11-25 18:13:56,434 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1105,QUANTIFIED] [2022-11-25 18:13:56,434 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_42,QUANTIFIED] [2022-11-25 18:13:56,435 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 18:13:56,435 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.base_BEFORE_CALL_8,QUANTIFIED] [2022-11-25 18:13:56,435 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_14,QUANTIFIED] [2022-11-25 18:13:56,435 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_14,QUANTIFIED] [2022-11-25 18:13:56,435 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_42,QUANTIFIED] [2022-11-25 18:13:56,436 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1105,QUANTIFIED] [2022-11-25 18:13:56,436 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_42,QUANTIFIED] [2022-11-25 18:13:56,436 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 18:13:56,440 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.base_BEFORE_CALL_8,QUANTIFIED] [2022-11-25 18:13:56,442 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_42,QUANTIFIED] [2022-11-25 18:13:56,443 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1105,QUANTIFIED] [2022-11-25 18:13:56,443 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_42,QUANTIFIED] [2022-11-25 18:13:56,443 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_14,QUANTIFIED] [2022-11-25 18:13:56,443 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_14,QUANTIFIED] [2022-11-25 18:13:56,443 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_42,QUANTIFIED] [2022-11-25 18:13:56,444 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1105,QUANTIFIED] [2022-11-25 18:13:56,444 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_42,QUANTIFIED] [2022-11-25 18:13:56,445 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_42,QUANTIFIED] [2022-11-25 18:13:56,448 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1105,QUANTIFIED] [2022-11-25 18:13:56,448 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_42,QUANTIFIED] [2022-11-25 18:13:56,448 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_14,QUANTIFIED] [2022-11-25 18:13:56,449 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_14,QUANTIFIED] [2022-11-25 18:13:56,449 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_42,QUANTIFIED] [2022-11-25 18:13:56,449 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1105,QUANTIFIED] [2022-11-25 18:13:56,449 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_42,QUANTIFIED] [2022-11-25 18:13:56,451 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 06:13:56 BoogieIcfgContainer [2022-11-25 18:13:56,452 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 18:13:56,452 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 18:13:56,453 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 18:13:56,453 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 18:13:56,453 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:10:18" (3/4) ... [2022-11-25 18:13:56,456 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-25 18:13:56,463 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure bounded_malloc [2022-11-25 18:13:56,463 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_hash_table_is_valid [2022-11-25 18:13:56,463 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure hash_table_state_is_valid [2022-11-25 18:13:56,463 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure my_memset [2022-11-25 18:13:56,463 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_bool [2022-11-25 18:13:56,463 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure hash_table_state_required_bytes [2022-11-25 18:13:56,463 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2022-11-25 18:13:56,464 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure memset_override_0_impl [2022-11-25 18:13:56,464 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_raise_error [2022-11-25 18:13:56,464 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_hash_table_clear [2022-11-25 18:13:56,464 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __CPROVER_overflow_mult [2022-11-25 18:13:56,464 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_is_power_of_two [2022-11-25 18:13:56,464 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_add_size_checked [2022-11-25 18:13:56,464 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_mul_size_checked [2022-11-25 18:13:56,464 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_uint64_t [2022-11-25 18:13:56,464 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ##fun~$Pointer$~TO~VOID [2022-11-25 18:13:56,465 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2022-11-25 18:13:56,465 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __CPROVER_overflow_plus [2022-11-25 18:13:56,484 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 159 nodes and edges [2022-11-25 18:13:56,486 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 76 nodes and edges [2022-11-25 18:13:56,487 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 27 nodes and edges [2022-11-25 18:13:56,488 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2022-11-25 18:13:56,489 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2022-11-25 18:13:56,490 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-11-25 18:13:56,491 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-25 18:13:56,491 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-25 18:13:56,535 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((r == r && (\exists v___CPROVER_overflow_mult_~#c~1.base_42 : int, v_ArrVal_1105 : int :: \old(\valid)[v___CPROVER_overflow_mult_~#c~1.base_42] == 0 && \old(\valid)[v___CPROVER_overflow_mult_~#c~1.base_42 := v_ArrVal_1105] == \valid)) && \old(a) == a) && \result + 1 <= 0) && \old(b) == b) && (\exists v_ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.base_BEFORE_CALL_8 : int :: !(#memory_$Pointer$[v_ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.base_BEFORE_CALL_8][0] == 0))) && \old(\valid) == \valid) && r == r) || !(0 < unknown-#StackHeapBarrier-unknown)) || (forall v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_14 : int :: !(\old(\valid)[v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_14] == 1) || !(unknown-#StackHeapBarrier-unknown < v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_14))) || ((((((((\old(b) * \old(a) == unknown-#memory_int-unknown[r][r] && r == r) && (\exists v___CPROVER_overflow_mult_~#c~1.base_42 : int, v_ArrVal_1105 : int :: \old(\valid)[v___CPROVER_overflow_mult_~#c~1.base_42] == 0 && \old(\valid)[v___CPROVER_overflow_mult_~#c~1.base_42 := v_ArrVal_1105] == \valid)) && tl_last_error == \old(tl_last_error)) && \old(a) == a) && \old(b) == b) && \result == 0) && \old(\valid) == \valid) && r == r)) || (forall v_ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.base_BEFORE_CALL_8 : int :: \old(#memory_$Pointer$)[v_ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.base_BEFORE_CALL_8][0] == 0) [2022-11-25 18:13:56,535 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((\old(b) == b && unknown-#memory_int-unknown[r][r] == \old(b) + \old(a)) && r == r) && r == r) && (\exists v___CPROVER_overflow_mult_~#c~1.base_42 : int, v_ArrVal_1105 : int :: \old(\valid)[v___CPROVER_overflow_mult_~#c~1.base_42] == 0 && \old(\valid)[v___CPROVER_overflow_mult_~#c~1.base_42 := v_ArrVal_1105] == \valid)) && tl_last_error == \old(tl_last_error)) && \old(\valid) == \valid) && \old(a) == a) || !(0 < unknown-#StackHeapBarrier-unknown)) || (forall v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_14 : int :: !(\old(\valid)[v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_14] == 1) || !(unknown-#StackHeapBarrier-unknown < v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_14))) || ((((((\old(b) == b && r == r) && r == r) && \result + 1 <= 0) && (\exists v___CPROVER_overflow_mult_~#c~1.base_42 : int, v_ArrVal_1105 : int :: \old(\valid)[v___CPROVER_overflow_mult_~#c~1.base_42] == 0 && \old(\valid)[v___CPROVER_overflow_mult_~#c~1.base_42 := v_ArrVal_1105] == \valid)) && \old(\valid) == \valid) && \old(a) == a) [2022-11-25 18:13:56,960 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecd4ecb4-206c-4b5e-90f6-442b387555e3/bin/uautomizer-ZsLfNo2U6R/witness.graphml [2022-11-25 18:13:56,960 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 18:13:56,961 INFO L158 Benchmark]: Toolchain (without parser) took 224119.39ms. Allocated memory was 161.5MB in the beginning and 423.6MB in the end (delta: 262.1MB). Free memory was 125.9MB in the beginning and 260.5MB in the end (delta: -134.6MB). Peak memory consumption was 313.5MB. Max. memory is 16.1GB. [2022-11-25 18:13:56,961 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 123.7MB. Free memory is still 91.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 18:13:56,962 INFO L158 Benchmark]: CACSL2BoogieTranslator took 3768.34ms. Allocated memory was 161.5MB in the beginning and 195.0MB in the end (delta: 33.6MB). Free memory was 125.9MB in the beginning and 114.7MB in the end (delta: 11.2MB). Peak memory consumption was 107.0MB. Max. memory is 16.1GB. [2022-11-25 18:13:56,962 INFO L158 Benchmark]: Boogie Procedure Inliner took 204.93ms. Allocated memory is still 195.0MB. Free memory was 114.7MB in the beginning and 104.2MB in the end (delta: 10.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-25 18:13:56,962 INFO L158 Benchmark]: Boogie Preprocessor took 99.21ms. Allocated memory is still 195.0MB. Free memory was 104.2MB in the beginning and 96.8MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-25 18:13:56,963 INFO L158 Benchmark]: RCFGBuilder took 1677.42ms. Allocated memory is still 195.0MB. Free memory was 96.8MB in the beginning and 123.5MB in the end (delta: -26.7MB). Peak memory consumption was 46.7MB. Max. memory is 16.1GB. [2022-11-25 18:13:56,963 INFO L158 Benchmark]: TraceAbstraction took 217850.72ms. Allocated memory was 195.0MB in the beginning and 423.6MB in the end (delta: 228.6MB). Free memory was 122.5MB in the beginning and 130.9MB in the end (delta: -8.4MB). Peak memory consumption was 221.2MB. Max. memory is 16.1GB. [2022-11-25 18:13:56,964 INFO L158 Benchmark]: Witness Printer took 507.98ms. Allocated memory is still 423.6MB. Free memory was 130.9MB in the beginning and 260.5MB in the end (delta: -129.6MB). Peak memory consumption was 53.9MB. Max. memory is 16.1GB. [2022-11-25 18:13:56,965 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.23ms. Allocated memory is still 123.7MB. Free memory is still 91.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 3768.34ms. Allocated memory was 161.5MB in the beginning and 195.0MB in the end (delta: 33.6MB). Free memory was 125.9MB in the beginning and 114.7MB in the end (delta: 11.2MB). Peak memory consumption was 107.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 204.93ms. Allocated memory is still 195.0MB. Free memory was 114.7MB in the beginning and 104.2MB in the end (delta: 10.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 99.21ms. Allocated memory is still 195.0MB. Free memory was 104.2MB in the beginning and 96.8MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1677.42ms. Allocated memory is still 195.0MB. Free memory was 96.8MB in the beginning and 123.5MB in the end (delta: -26.7MB). Peak memory consumption was 46.7MB. Max. memory is 16.1GB. * TraceAbstraction took 217850.72ms. Allocated memory was 195.0MB in the beginning and 423.6MB in the end (delta: 228.6MB). Free memory was 122.5MB in the beginning and 130.9MB in the end (delta: -8.4MB). Peak memory consumption was 221.2MB. Max. memory is 16.1GB. * Witness Printer took 507.98ms. Allocated memory is still 423.6MB. Free memory was 130.9MB in the beginning and 260.5MB in the end (delta: -129.6MB). Peak memory consumption was 53.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_42,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1105,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_42,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.base_BEFORE_CALL_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_42,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1105,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_42,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.base_BEFORE_CALL_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_42,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1105,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_42,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.base_BEFORE_CALL_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_42,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1105,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_42,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.base_BEFORE_CALL_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_42,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1105,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_42,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_42,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1105,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_42,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_42,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1105,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_42,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_42,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1105,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_42,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 19 procedures, 169 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 217.7s, OverallIterations: 12, TraceHistogramMax: 10, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 51.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 30.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 13 mSolverCounterUnknown, 1385 SdHoareTripleChecker+Valid, 38.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1329 mSDsluCounter, 8220 SdHoareTripleChecker+Invalid, 37.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 215 IncrementalHoareTripleChecker+Unchecked, 6555 mSDsCounter, 680 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8058 IncrementalHoareTripleChecker+Invalid, 8966 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 680 mSolverCounterUnsat, 1665 mSDtfsCounter, 8058 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1835 GetRequests, 1588 SyntacticMatches, 6 SemanticMatches, 241 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2311 ImplicationChecksByTransitivity, 38.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=248occurred in iteration=7, InterpolantAutomatonStates: 148, 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, 12 MinimizatonAttempts, 43 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 67 LocationsWithAnnotation, 581 PreInvPairs, 627 NumberOfFragments, 1349 HoareAnnotationTreeSize, 581 FomulaSimplifications, 93 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 67 FomulaSimplificationsInter, 1010 FormulaSimplificationTreeSizeReductionInter, 30.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 88.8s SatisfiabilityAnalysisTime, 42.6s InterpolantComputationTime, 2535 NumberOfCodeBlocks, 2535 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 2519 ConstructedInterpolants, 59 QuantifiedInterpolants, 7230 SizeOfPredicates, 74 NumberOfNonLiveVariables, 19487 ConjunctsInSsa, 485 ConjunctsInUnsatCore, 16 InterpolantComputations, 11 PerfectInterpolantSequences, 3146/3196 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: 6831]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 7407]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6837]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2497]: Loop Invariant [2022-11-25 18:13:56,991 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_42,QUANTIFIED] [2022-11-25 18:13:56,991 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1105,QUANTIFIED] [2022-11-25 18:13:56,991 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_42,QUANTIFIED] [2022-11-25 18:13:56,992 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 18:13:56,992 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.base_BEFORE_CALL_8,QUANTIFIED] [2022-11-25 18:13:56,992 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_14,QUANTIFIED] [2022-11-25 18:13:56,994 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_14,QUANTIFIED] [2022-11-25 18:13:56,994 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_42,QUANTIFIED] [2022-11-25 18:13:56,996 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1105,QUANTIFIED] [2022-11-25 18:13:56,996 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_42,QUANTIFIED] [2022-11-25 18:13:56,996 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 18:13:56,996 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.base_BEFORE_CALL_8,QUANTIFIED] [2022-11-25 18:13:56,997 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_42,QUANTIFIED] [2022-11-25 18:13:56,997 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1105,QUANTIFIED] [2022-11-25 18:13:56,998 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_42,QUANTIFIED] [2022-11-25 18:13:56,998 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 18:13:56,999 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.base_BEFORE_CALL_8,QUANTIFIED] [2022-11-25 18:13:56,999 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_14,QUANTIFIED] [2022-11-25 18:13:56,999 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_14,QUANTIFIED] [2022-11-25 18:13:56,999 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_42,QUANTIFIED] [2022-11-25 18:13:57,000 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1105,QUANTIFIED] [2022-11-25 18:13:57,000 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_42,QUANTIFIED] [2022-11-25 18:13:57,000 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-25 18:13:57,000 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.base_BEFORE_CALL_8,QUANTIFIED] Derived loop invariant: ((((((((((r == r && (\exists v___CPROVER_overflow_mult_~#c~1.base_42 : int, v_ArrVal_1105 : int :: \old(\valid)[v___CPROVER_overflow_mult_~#c~1.base_42] == 0 && \old(\valid)[v___CPROVER_overflow_mult_~#c~1.base_42 := v_ArrVal_1105] == \valid)) && \old(a) == a) && \result + 1 <= 0) && \old(b) == b) && (\exists v_ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.base_BEFORE_CALL_8 : int :: !(#memory_$Pointer$[v_ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.base_BEFORE_CALL_8][0] == 0))) && \old(\valid) == \valid) && r == r) || !(0 < unknown-#StackHeapBarrier-unknown)) || (forall v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_14 : int :: !(\old(\valid)[v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_14] == 1) || !(unknown-#StackHeapBarrier-unknown < v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_14))) || ((((((((\old(b) * \old(a) == unknown-#memory_int-unknown[r][r] && r == r) && (\exists v___CPROVER_overflow_mult_~#c~1.base_42 : int, v_ArrVal_1105 : int :: \old(\valid)[v___CPROVER_overflow_mult_~#c~1.base_42] == 0 && \old(\valid)[v___CPROVER_overflow_mult_~#c~1.base_42 := v_ArrVal_1105] == \valid)) && tl_last_error == \old(tl_last_error)) && \old(a) == a) && \old(b) == b) && \result == 0) && \old(\valid) == \valid) && r == r)) || (forall v_ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.base_BEFORE_CALL_8 : int :: \old(#memory_$Pointer$)[v_ULTIMATE.start_aws_hash_table_clear_harness_~#map~0#1.base_BEFORE_CALL_8][0] == 0) - InvariantResult [Line: 2541]: Loop Invariant [2022-11-25 18:13:57,001 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_42,QUANTIFIED] [2022-11-25 18:13:57,002 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1105,QUANTIFIED] [2022-11-25 18:13:57,002 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_42,QUANTIFIED] [2022-11-25 18:13:57,002 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_14,QUANTIFIED] [2022-11-25 18:13:57,002 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_14,QUANTIFIED] [2022-11-25 18:13:57,002 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_42,QUANTIFIED] [2022-11-25 18:13:57,002 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1105,QUANTIFIED] [2022-11-25 18:13:57,003 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_42,QUANTIFIED] [2022-11-25 18:13:57,003 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_42,QUANTIFIED] [2022-11-25 18:13:57,004 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1105,QUANTIFIED] [2022-11-25 18:13:57,004 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_42,QUANTIFIED] [2022-11-25 18:13:57,004 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_14,QUANTIFIED] [2022-11-25 18:13:57,004 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_14,QUANTIFIED] [2022-11-25 18:13:57,004 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_42,QUANTIFIED] [2022-11-25 18:13:57,004 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1105,QUANTIFIED] [2022-11-25 18:13:57,005 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v___CPROVER_overflow_mult_~#c~1.base_42,QUANTIFIED] Derived loop invariant: (((((((((\old(b) == b && unknown-#memory_int-unknown[r][r] == \old(b) + \old(a)) && r == r) && r == r) && (\exists v___CPROVER_overflow_mult_~#c~1.base_42 : int, v_ArrVal_1105 : int :: \old(\valid)[v___CPROVER_overflow_mult_~#c~1.base_42] == 0 && \old(\valid)[v___CPROVER_overflow_mult_~#c~1.base_42 := v_ArrVal_1105] == \valid)) && tl_last_error == \old(tl_last_error)) && \old(\valid) == \valid) && \old(a) == a) || !(0 < unknown-#StackHeapBarrier-unknown)) || (forall v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_14 : int :: !(\old(\valid)[v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_14] == 1) || !(unknown-#StackHeapBarrier-unknown < v_ULTIMATE.start_ensure_allocated_hash_table_~map#1.base_BEFORE_CALL_14))) || ((((((\old(b) == b && r == r) && r == r) && \result + 1 <= 0) && (\exists v___CPROVER_overflow_mult_~#c~1.base_42 : int, v_ArrVal_1105 : int :: \old(\valid)[v___CPROVER_overflow_mult_~#c~1.base_42] == 0 && \old(\valid)[v___CPROVER_overflow_mult_~#c~1.base_42 := v_ArrVal_1105] == \valid)) && \old(\valid) == \valid) && \old(a) == a) - InvariantResult [Line: 9939]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 10154]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 9939]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-11-25 18:13:57,074 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecd4ecb4-206c-4b5e-90f6-442b387555e3/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE