./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/aws-c-common/aws_hash_callback_c_str_eq_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b4ec56b 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_70ff65cb-6bab-4ae5-a686-edb0787c32db/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70ff65cb-6bab-4ae5-a686-edb0787c32db/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70ff65cb-6bab-4ae5-a686-edb0787c32db/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70ff65cb-6bab-4ae5-a686-edb0787c32db/bin/uautomizer-ug76WZFUDN/config/AutomizerReach.xml -i ../../sv-benchmarks/c/aws-c-common/aws_hash_callback_c_str_eq_harness.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70ff65cb-6bab-4ae5-a686-edb0787c32db/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70ff65cb-6bab-4ae5-a686-edb0787c32db/bin/uautomizer-ug76WZFUDN --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 e2319232de809c5fc7a2ae9b5bcaacd5710dfa5ecc8cc9afebba783e154bd6e0 --- 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-6b4ec56 [2022-11-20 10:32:27,380 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 10:32:27,383 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 10:32:27,424 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 10:32:27,425 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 10:32:27,426 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 10:32:27,427 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 10:32:27,429 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 10:32:27,431 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 10:32:27,432 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 10:32:27,433 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 10:32:27,434 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 10:32:27,442 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 10:32:27,450 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 10:32:27,451 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 10:32:27,453 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 10:32:27,453 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 10:32:27,454 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 10:32:27,456 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 10:32:27,458 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 10:32:27,459 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 10:32:27,460 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 10:32:27,462 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 10:32:27,463 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 10:32:27,466 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 10:32:27,466 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 10:32:27,467 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 10:32:27,468 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 10:32:27,468 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 10:32:27,469 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 10:32:27,469 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 10:32:27,470 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 10:32:27,471 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 10:32:27,472 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 10:32:27,473 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 10:32:27,473 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 10:32:27,474 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 10:32:27,474 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 10:32:27,475 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 10:32:27,476 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 10:32:27,476 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 10:32:27,480 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70ff65cb-6bab-4ae5-a686-edb0787c32db/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-11-20 10:32:27,514 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 10:32:27,514 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 10:32:27,515 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 10:32:27,515 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 10:32:27,516 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 10:32:27,516 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 10:32:27,517 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 10:32:27,517 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 10:32:27,517 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 10:32:27,517 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 10:32:27,518 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 10:32:27,518 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 10:32:27,519 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 10:32:27,519 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 10:32:27,519 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 10:32:27,519 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 10:32:27,519 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 10:32:27,519 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 10:32:27,520 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 10:32:27,520 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 10:32:27,520 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 10:32:27,520 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 10:32:27,520 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 10:32:27,521 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 10:32:27,521 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 10:32:27,521 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 10:32:27,521 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 10:32:27,521 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-20 10:32:27,522 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-20 10:32:27,522 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 10:32:27,522 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70ff65cb-6bab-4ae5-a686-edb0787c32db/bin/uautomizer-ug76WZFUDN/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_70ff65cb-6bab-4ae5-a686-edb0787c32db/bin/uautomizer-ug76WZFUDN 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 -> e2319232de809c5fc7a2ae9b5bcaacd5710dfa5ecc8cc9afebba783e154bd6e0 [2022-11-20 10:32:27,818 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 10:32:27,853 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 10:32:27,857 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 10:32:27,859 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 10:32:27,860 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 10:32:27,861 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70ff65cb-6bab-4ae5-a686-edb0787c32db/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/aws-c-common/aws_hash_callback_c_str_eq_harness.i [2022-11-20 10:32:31,023 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 10:32:31,658 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 10:32:31,659 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70ff65cb-6bab-4ae5-a686-edb0787c32db/sv-benchmarks/c/aws-c-common/aws_hash_callback_c_str_eq_harness.i [2022-11-20 10:32:31,700 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70ff65cb-6bab-4ae5-a686-edb0787c32db/bin/uautomizer-ug76WZFUDN/data/ef58bf68c/09236afefa304db89062491c02ce97c8/FLAGb14544333 [2022-11-20 10:32:31,721 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70ff65cb-6bab-4ae5-a686-edb0787c32db/bin/uautomizer-ug76WZFUDN/data/ef58bf68c/09236afefa304db89062491c02ce97c8 [2022-11-20 10:32:31,728 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 10:32:31,729 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 10:32:31,733 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 10:32:31,733 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 10:32:31,738 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 10:32:31,738 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:32:31" (1/1) ... [2022-11-20 10:32:31,740 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45908e79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:32:31, skipping insertion in model container [2022-11-20 10:32:31,741 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:32:31" (1/1) ... [2022-11-20 10:32:31,749 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 10:32:31,883 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 10:32:32,258 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_70ff65cb-6bab-4ae5-a686-edb0787c32db/sv-benchmarks/c/aws-c-common/aws_hash_callback_c_str_eq_harness.i[4500,4513] [2022-11-20 10:32:32,270 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_70ff65cb-6bab-4ae5-a686-edb0787c32db/sv-benchmarks/c/aws-c-common/aws_hash_callback_c_str_eq_harness.i[4560,4573] [2022-11-20 10:32:33,870 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:32:33,871 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:32:33,872 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:32:33,873 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:32:33,874 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:32:33,894 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:32:33,897 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:32:33,899 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:32:33,903 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:32:34,645 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-11-20 10:32:34,646 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-11-20 10:32:34,648 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-11-20 10:32:34,649 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-11-20 10:32:34,651 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-11-20 10:32:34,652 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-11-20 10:32:34,653 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-11-20 10:32:34,654 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-11-20 10:32:34,655 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-11-20 10:32:34,656 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-11-20 10:32:34,978 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-11-20 10:32:35,104 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:32:35,105 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:32:35,404 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:32:35,405 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:32:35,434 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:32:35,437 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:32:35,451 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:32:35,452 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:32:35,474 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:32:35,480 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:32:35,482 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:32:35,483 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:32:35,484 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:32:35,486 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:32:35,486 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:32:35,569 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 10:32:35,623 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 10:32:35,638 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_70ff65cb-6bab-4ae5-a686-edb0787c32db/sv-benchmarks/c/aws-c-common/aws_hash_callback_c_str_eq_harness.i[4500,4513] [2022-11-20 10:32:35,639 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_70ff65cb-6bab-4ae5-a686-edb0787c32db/sv-benchmarks/c/aws-c-common/aws_hash_callback_c_str_eq_harness.i[4560,4573] [2022-11-20 10:32:35,670 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:32:35,670 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:32:35,671 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:32:35,671 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:32:35,672 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:32:35,678 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:32:35,678 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:32:35,679 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:32:35,680 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:32:35,709 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-11-20 10:32:35,710 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-11-20 10:32:35,711 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-11-20 10:32:35,712 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-11-20 10:32:35,713 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-11-20 10:32:35,713 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-11-20 10:32:35,714 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-11-20 10:32:35,714 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-11-20 10:32:35,715 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-11-20 10:32:35,716 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-11-20 10:32:35,735 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-11-20 10:32:35,791 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:32:35,794 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:32:35,949 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:32:35,950 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:32:35,964 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:32:35,965 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:32:35,971 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:32:35,971 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:32:35,980 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:32:35,980 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:32:35,982 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:32:35,982 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:32:35,983 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:32:35,984 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:32:35,984 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:32:36,014 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 10:32:36,248 INFO L208 MainTranslator]: Completed translation [2022-11-20 10:32:36,250 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:32:36 WrapperNode [2022-11-20 10:32:36,251 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 10:32:36,252 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 10:32:36,252 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 10:32:36,253 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 10:32:36,261 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:32:36" (1/1) ... [2022-11-20 10:32:36,414 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:32:36" (1/1) ... [2022-11-20 10:32:36,491 INFO L138 Inliner]: procedures = 768, calls = 3252, calls flagged for inlining = 78, calls inlined = 5, statements flattened = 336 [2022-11-20 10:32:36,497 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 10:32:36,498 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 10:32:36,498 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 10:32:36,498 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 10:32:36,508 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:32:36" (1/1) ... [2022-11-20 10:32:36,509 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:32:36" (1/1) ... [2022-11-20 10:32:36,531 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:32:36" (1/1) ... [2022-11-20 10:32:36,532 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:32:36" (1/1) ... [2022-11-20 10:32:36,573 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:32:36" (1/1) ... [2022-11-20 10:32:36,581 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:32:36" (1/1) ... [2022-11-20 10:32:36,601 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:32:36" (1/1) ... [2022-11-20 10:32:36,610 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:32:36" (1/1) ... [2022-11-20 10:32:36,617 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 10:32:36,622 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 10:32:36,623 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 10:32:36,624 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 10:32:36,625 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:32:36" (1/1) ... [2022-11-20 10:32:36,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 10:32:36,643 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70ff65cb-6bab-4ae5-a686-edb0787c32db/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:32:36,656 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70ff65cb-6bab-4ae5-a686-edb0787c32db/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 10:32:36,687 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70ff65cb-6bab-4ae5-a686-edb0787c32db/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 10:32:36,706 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2022-11-20 10:32:36,707 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2022-11-20 10:32:36,707 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-20 10:32:36,707 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-20 10:32:36,707 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-20 10:32:36,707 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-20 10:32:36,708 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 10:32:36,708 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 10:32:36,708 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 10:32:36,708 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2022-11-20 10:32:36,709 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2022-11-20 10:32:36,709 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-11-20 10:32:36,709 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-11-20 10:32:36,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-20 10:32:36,711 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2022-11-20 10:32:36,711 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2022-11-20 10:32:36,711 INFO L130 BoogieDeclarations]: Found specification of procedure ensure_c_str_is_allocated [2022-11-20 10:32:36,711 INFO L138 BoogieDeclarations]: Found implementation of procedure ensure_c_str_is_allocated [2022-11-20 10:32:36,711 INFO L130 BoogieDeclarations]: Found specification of procedure aws_c_string_is_valid [2022-11-20 10:32:36,712 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_c_string_is_valid [2022-11-20 10:32:36,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 10:32:37,007 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 10:32:37,010 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 10:32:37,496 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume !true; [2022-11-20 10:32:37,513 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 10:32:37,526 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 10:32:37,527 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-20 10:32:37,529 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:32:37 BoogieIcfgContainer [2022-11-20 10:32:37,529 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 10:32:37,532 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 10:32:37,532 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 10:32:37,536 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 10:32:37,536 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 10:32:31" (1/3) ... [2022-11-20 10:32:37,538 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fd57957 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:32:37, skipping insertion in model container [2022-11-20 10:32:37,539 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:32:36" (2/3) ... [2022-11-20 10:32:37,540 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fd57957 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:32:37, skipping insertion in model container [2022-11-20 10:32:37,540 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:32:37" (3/3) ... [2022-11-20 10:32:37,541 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_hash_callback_c_str_eq_harness.i [2022-11-20 10:32:37,561 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 10:32:37,561 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-20 10:32:37,609 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 10:32:37,616 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;@7230f094, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 10:32:37,617 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-20 10:32:37,621 INFO L276 IsEmpty]: Start isEmpty. Operand has 71 states, 44 states have (on average 1.1590909090909092) internal successors, (51), 44 states have internal predecessors, (51), 19 states have call successors, (19), 7 states have call predecessors, (19), 7 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-11-20 10:32:37,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-11-20 10:32:37,632 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:32:37,633 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:32:37,634 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:32:37,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:32:37,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1163022186, now seen corresponding path program 1 times [2022-11-20 10:32:37,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:32:37,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708502917] [2022-11-20 10:32:37,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:32:37,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:32:38,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:38,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:32:38,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:38,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:32:38,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:38,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 10:32:38,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:38,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-20 10:32:38,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:38,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:32:38,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:38,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-20 10:32:38,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:38,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-20 10:32:38,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:38,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-20 10:32:38,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:38,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-20 10:32:38,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:38,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-20 10:32:38,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:38,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-20 10:32:38,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:38,507 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-11-20 10:32:38,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:32:38,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708502917] [2022-11-20 10:32:38,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708502917] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:32:38,510 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:32:38,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:32:38,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052660832] [2022-11-20 10:32:38,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:32:38,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:32:38,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:32:38,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:32:38,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:32:38,556 INFO L87 Difference]: Start difference. First operand has 71 states, 44 states have (on average 1.1590909090909092) internal successors, (51), 44 states have internal predecessors, (51), 19 states have call successors, (19), 7 states have call predecessors, (19), 7 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-11-20 10:32:38,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:32:38,724 INFO L93 Difference]: Finished difference Result 139 states and 186 transitions. [2022-11-20 10:32:38,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:32:38,727 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 67 [2022-11-20 10:32:38,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:32:38,735 INFO L225 Difference]: With dead ends: 139 [2022-11-20 10:32:38,735 INFO L226 Difference]: Without dead ends: 65 [2022-11-20 10:32:38,738 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 30 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-20 10:32:38,742 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 17 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:32:38,743 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 99 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:32:38,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-11-20 10:32:38,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-11-20 10:32:38,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 39 states have internal predecessors, (41), 19 states have call successors, (19), 7 states have call predecessors, (19), 7 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-11-20 10:32:38,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 78 transitions. [2022-11-20 10:32:38,806 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 78 transitions. Word has length 67 [2022-11-20 10:32:38,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:32:38,807 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 78 transitions. [2022-11-20 10:32:38,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-11-20 10:32:38,809 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 78 transitions. [2022-11-20 10:32:38,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-11-20 10:32:38,816 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:32:38,816 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:32:38,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 10:32:38,817 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:32:38,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:32:38,817 INFO L85 PathProgramCache]: Analyzing trace with hash -447828983, now seen corresponding path program 1 times [2022-11-20 10:32:38,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:32:38,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515535952] [2022-11-20 10:32:38,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:32:38,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:32:38,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:39,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:32:39,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:40,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:32:40,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:40,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 10:32:40,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:40,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-20 10:32:40,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:40,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:32:40,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:40,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-20 10:32:40,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:40,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-20 10:32:40,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:40,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-20 10:32:40,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:40,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-20 10:32:40,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:40,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-20 10:32:40,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:40,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-20 10:32:40,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:40,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-20 10:32:40,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:40,482 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-20 10:32:40,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:32:40,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515535952] [2022-11-20 10:32:40,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515535952] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:32:40,485 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:32:40,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-20 10:32:40,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270755185] [2022-11-20 10:32:40,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:32:40,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-20 10:32:40,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:32:40,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-20 10:32:40,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2022-11-20 10:32:40,489 INFO L87 Difference]: Start difference. First operand 65 states and 78 transitions. Second operand has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 9 states have internal predecessors, (31), 5 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (12), 7 states have call predecessors, (12), 4 states have call successors, (12) [2022-11-20 10:32:41,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:32:41,059 INFO L93 Difference]: Finished difference Result 89 states and 103 transitions. [2022-11-20 10:32:41,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-20 10:32:41,060 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 9 states have internal predecessors, (31), 5 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (12), 7 states have call predecessors, (12), 4 states have call successors, (12) Word has length 70 [2022-11-20 10:32:41,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:32:41,063 INFO L225 Difference]: With dead ends: 89 [2022-11-20 10:32:41,063 INFO L226 Difference]: Without dead ends: 65 [2022-11-20 10:32:41,064 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2022-11-20 10:32:41,078 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 46 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 10:32:41,079 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 396 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-20 10:32:41,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-11-20 10:32:41,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-11-20 10:32:41,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 38 states have (on average 1.0526315789473684) internal successors, (40), 39 states have internal predecessors, (40), 19 states have call successors, (19), 7 states have call predecessors, (19), 7 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-11-20 10:32:41,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 77 transitions. [2022-11-20 10:32:41,111 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 77 transitions. Word has length 70 [2022-11-20 10:32:41,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:32:41,112 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 77 transitions. [2022-11-20 10:32:41,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 9 states have internal predecessors, (31), 5 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (12), 7 states have call predecessors, (12), 4 states have call successors, (12) [2022-11-20 10:32:41,117 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 77 transitions. [2022-11-20 10:32:41,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-11-20 10:32:41,120 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:32:41,121 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 10:32:41,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 10:32:41,121 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:32:41,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:32:41,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1505925942, now seen corresponding path program 1 times [2022-11-20 10:32:41,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:32:41,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202283113] [2022-11-20 10:32:41,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:32:41,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:32:41,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:42,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:32:42,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:42,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:32:42,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:42,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 10:32:42,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:42,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-20 10:32:42,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:42,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:32:42,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:42,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-20 10:32:42,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:42,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-20 10:32:42,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:42,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-20 10:32:42,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:42,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-20 10:32:42,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:42,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-20 10:32:42,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:42,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-20 10:32:42,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:42,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-20 10:32:42,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:42,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-20 10:32:42,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:42,525 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-11-20 10:32:42,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:32:42,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202283113] [2022-11-20 10:32:42,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202283113] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:32:42,525 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:32:42,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-11-20 10:32:42,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54823442] [2022-11-20 10:32:42,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:32:42,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-20 10:32:42,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:32:42,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-20 10:32:42,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2022-11-20 10:32:42,527 INFO L87 Difference]: Start difference. First operand 65 states and 77 transitions. Second operand has 16 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 11 states have internal predecessors, (32), 5 states have call successors, (14), 3 states have call predecessors, (14), 4 states have return successors, (13), 7 states have call predecessors, (13), 4 states have call successors, (13) [2022-11-20 10:32:43,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:32:43,275 INFO L93 Difference]: Finished difference Result 94 states and 115 transitions. [2022-11-20 10:32:43,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-20 10:32:43,276 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 11 states have internal predecessors, (32), 5 states have call successors, (14), 3 states have call predecessors, (14), 4 states have return successors, (13), 7 states have call predecessors, (13), 4 states have call successors, (13) Word has length 75 [2022-11-20 10:32:43,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:32:43,277 INFO L225 Difference]: With dead ends: 94 [2022-11-20 10:32:43,277 INFO L226 Difference]: Without dead ends: 92 [2022-11-20 10:32:43,278 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=525, Unknown=0, NotChecked=0, Total=600 [2022-11-20 10:32:43,279 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 62 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 680 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 730 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 680 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-20 10:32:43,279 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 519 Invalid, 730 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 680 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-20 10:32:43,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-11-20 10:32:43,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 82. [2022-11-20 10:32:43,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 47 states have (on average 1.0425531914893618) internal successors, (49), 49 states have internal predecessors, (49), 26 states have call successors, (26), 8 states have call predecessors, (26), 8 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2022-11-20 10:32:43,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 100 transitions. [2022-11-20 10:32:43,292 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 100 transitions. Word has length 75 [2022-11-20 10:32:43,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:32:43,293 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 100 transitions. [2022-11-20 10:32:43,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 11 states have internal predecessors, (32), 5 states have call successors, (14), 3 states have call predecessors, (14), 4 states have return successors, (13), 7 states have call predecessors, (13), 4 states have call successors, (13) [2022-11-20 10:32:43,294 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 100 transitions. [2022-11-20 10:32:43,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-11-20 10:32:43,295 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:32:43,295 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 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] [2022-11-20 10:32:43,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 10:32:43,296 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:32:43,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:32:43,296 INFO L85 PathProgramCache]: Analyzing trace with hash -892933696, now seen corresponding path program 1 times [2022-11-20 10:32:43,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:32:43,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117914824] [2022-11-20 10:32:43,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:32:43,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:32:43,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:44,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:32:44,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:44,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:32:44,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:44,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 10:32:44,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:44,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-20 10:32:44,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:44,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:32:44,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:44,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-20 10:32:44,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:44,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-20 10:32:44,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:44,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-20 10:32:44,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:44,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-20 10:32:44,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:44,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-20 10:32:44,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:44,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-20 10:32:44,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:44,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-20 10:32:44,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:44,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-20 10:32:44,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:44,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-11-20 10:32:44,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:44,579 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-11-20 10:32:44,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:32:44,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117914824] [2022-11-20 10:32:44,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117914824] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:32:44,580 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:32:44,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-20 10:32:44,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424162731] [2022-11-20 10:32:44,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:32:44,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-20 10:32:44,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:32:44,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-20 10:32:44,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2022-11-20 10:32:44,584 INFO L87 Difference]: Start difference. First operand 82 states and 100 transitions. Second operand has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 10 states have internal predecessors, (36), 5 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 6 states have call predecessors, (14), 4 states have call successors, (14) [2022-11-20 10:32:45,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:32:45,260 INFO L93 Difference]: Finished difference Result 98 states and 118 transitions. [2022-11-20 10:32:45,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-20 10:32:45,261 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 10 states have internal predecessors, (36), 5 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 6 states have call predecessors, (14), 4 states have call successors, (14) Word has length 83 [2022-11-20 10:32:45,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:32:45,263 INFO L225 Difference]: With dead ends: 98 [2022-11-20 10:32:45,263 INFO L226 Difference]: Without dead ends: 96 [2022-11-20 10:32:45,264 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2022-11-20 10:32:45,264 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 60 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 564 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-20 10:32:45,265 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 439 Invalid, 613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 564 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-20 10:32:45,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-11-20 10:32:45,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 90. [2022-11-20 10:32:45,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 53 states have (on average 1.0377358490566038) internal successors, (55), 55 states have internal predecessors, (55), 27 states have call successors, (27), 9 states have call predecessors, (27), 9 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2022-11-20 10:32:45,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 108 transitions. [2022-11-20 10:32:45,278 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 108 transitions. Word has length 83 [2022-11-20 10:32:45,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:32:45,279 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 108 transitions. [2022-11-20 10:32:45,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 10 states have internal predecessors, (36), 5 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 6 states have call predecessors, (14), 4 states have call successors, (14) [2022-11-20 10:32:45,280 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 108 transitions. [2022-11-20 10:32:45,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-11-20 10:32:45,281 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:32:45,281 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 4, 4, 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] [2022-11-20 10:32:45,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-20 10:32:45,282 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:32:45,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:32:45,282 INFO L85 PathProgramCache]: Analyzing trace with hash 829878033, now seen corresponding path program 1 times [2022-11-20 10:32:45,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:32:45,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861226107] [2022-11-20 10:32:45,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:32:45,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:32:45,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:46,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:32:46,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:46,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:32:46,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:46,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 10:32:46,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:46,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-20 10:32:46,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:46,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:32:46,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:46,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-20 10:32:46,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:46,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-20 10:32:46,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:46,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-20 10:32:46,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:46,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:32:46,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:46,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 10:32:46,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:46,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-20 10:32:46,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:46,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:32:46,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:46,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-20 10:32:46,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:46,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-11-20 10:32:46,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:46,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-11-20 10:32:46,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:46,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-20 10:32:46,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:46,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-11-20 10:32:46,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:46,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-11-20 10:32:46,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:46,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-11-20 10:32:46,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:46,663 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2022-11-20 10:32:46,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:32:46,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861226107] [2022-11-20 10:32:46,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861226107] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:32:46,663 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:32:46,664 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-11-20 10:32:46,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817397396] [2022-11-20 10:32:46,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:32:46,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-20 10:32:46,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:32:46,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-20 10:32:46,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2022-11-20 10:32:46,666 INFO L87 Difference]: Start difference. First operand 90 states and 108 transitions. Second operand has 15 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 10 states have internal predecessors, (38), 4 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (16), 6 states have call predecessors, (16), 3 states have call successors, (16) [2022-11-20 10:32:47,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:32:47,290 INFO L93 Difference]: Finished difference Result 102 states and 121 transitions. [2022-11-20 10:32:47,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-20 10:32:47,291 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 10 states have internal predecessors, (38), 4 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (16), 6 states have call predecessors, (16), 3 states have call successors, (16) Word has length 107 [2022-11-20 10:32:47,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:32:47,293 INFO L225 Difference]: With dead ends: 102 [2022-11-20 10:32:47,293 INFO L226 Difference]: Without dead ends: 100 [2022-11-20 10:32:47,294 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2022-11-20 10:32:47,294 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 33 mSDsluCounter, 724 mSDsCounter, 0 mSdLazyCounter, 675 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 802 SdHoareTripleChecker+Invalid, 697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 675 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-20 10:32:47,295 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 802 Invalid, 697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 675 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-20 10:32:47,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-11-20 10:32:47,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 94. [2022-11-20 10:32:47,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 56 states have (on average 1.0357142857142858) internal successors, (58), 58 states have internal predecessors, (58), 27 states have call successors, (27), 10 states have call predecessors, (27), 10 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2022-11-20 10:32:47,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 111 transitions. [2022-11-20 10:32:47,309 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 111 transitions. Word has length 107 [2022-11-20 10:32:47,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:32:47,309 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 111 transitions. [2022-11-20 10:32:47,310 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 10 states have internal predecessors, (38), 4 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (16), 6 states have call predecessors, (16), 3 states have call successors, (16) [2022-11-20 10:32:47,310 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 111 transitions. [2022-11-20 10:32:47,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-11-20 10:32:47,311 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:32:47,311 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 4, 4, 2, 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] [2022-11-20 10:32:47,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-20 10:32:47,312 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:32:47,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:32:47,312 INFO L85 PathProgramCache]: Analyzing trace with hash 265370887, now seen corresponding path program 1 times [2022-11-20 10:32:47,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:32:47,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853310489] [2022-11-20 10:32:47,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:32:47,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:32:47,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:48,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:32:48,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:48,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:32:48,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:48,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 10:32:48,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:48,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-20 10:32:48,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:48,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:32:48,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:48,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-20 10:32:48,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:48,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-20 10:32:48,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:48,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-20 10:32:48,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:48,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:32:48,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:48,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 10:32:48,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:48,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-20 10:32:48,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:48,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:32:48,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:48,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-20 10:32:48,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:48,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-11-20 10:32:48,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:48,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-11-20 10:32:48,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:48,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-20 10:32:48,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:48,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-11-20 10:32:48,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:48,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-11-20 10:32:48,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:48,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-11-20 10:32:48,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:48,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-11-20 10:32:48,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:48,867 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-11-20 10:32:48,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:32:48,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853310489] [2022-11-20 10:32:48,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853310489] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:32:48,867 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:32:48,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-11-20 10:32:48,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604291703] [2022-11-20 10:32:48,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:32:48,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-20 10:32:48,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:32:48,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-20 10:32:48,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2022-11-20 10:32:48,871 INFO L87 Difference]: Start difference. First operand 94 states and 111 transitions. Second operand has 15 states, 14 states have (on average 2.642857142857143) internal successors, (37), 10 states have internal predecessors, (37), 5 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (15), 7 states have call predecessors, (15), 4 states have call successors, (15) [2022-11-20 10:32:49,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:32:49,367 INFO L93 Difference]: Finished difference Result 100 states and 116 transitions. [2022-11-20 10:32:49,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-20 10:32:49,368 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.642857142857143) internal successors, (37), 10 states have internal predecessors, (37), 5 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (15), 7 states have call predecessors, (15), 4 states have call successors, (15) Word has length 115 [2022-11-20 10:32:49,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:32:49,371 INFO L225 Difference]: With dead ends: 100 [2022-11-20 10:32:49,371 INFO L226 Difference]: Without dead ends: 96 [2022-11-20 10:32:49,372 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2022-11-20 10:32:49,372 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 46 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 10:32:49,373 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 392 Invalid, 497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 464 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-20 10:32:49,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-11-20 10:32:49,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 71. [2022-11-20 10:32:49,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 43 states have (on average 1.0232558139534884) internal successors, (44), 43 states have internal predecessors, (44), 19 states have call successors, (19), 9 states have call predecessors, (19), 8 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-11-20 10:32:49,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 81 transitions. [2022-11-20 10:32:49,392 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 81 transitions. Word has length 115 [2022-11-20 10:32:49,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:32:49,394 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 81 transitions. [2022-11-20 10:32:49,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.642857142857143) internal successors, (37), 10 states have internal predecessors, (37), 5 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (15), 7 states have call predecessors, (15), 4 states have call successors, (15) [2022-11-20 10:32:49,395 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 81 transitions. [2022-11-20 10:32:49,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-11-20 10:32:49,395 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:32:49,396 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 3, 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] [2022-11-20 10:32:49,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-20 10:32:49,396 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:32:49,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:32:49,397 INFO L85 PathProgramCache]: Analyzing trace with hash -565706850, now seen corresponding path program 1 times [2022-11-20 10:32:49,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:32:49,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602285392] [2022-11-20 10:32:49,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:32:49,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:32:49,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:50,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:32:50,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:51,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:32:51,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:51,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 10:32:51,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:51,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-20 10:32:51,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:51,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:32:51,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:51,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-20 10:32:51,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:51,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-20 10:32:51,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:51,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-20 10:32:51,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:51,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-20 10:32:51,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:51,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-20 10:32:51,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:51,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-20 10:32:51,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:51,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-20 10:32:51,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:51,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-20 10:32:51,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:51,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-11-20 10:32:51,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:51,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-20 10:32:51,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:51,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-20 10:32:51,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:51,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-20 10:32:51,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:51,291 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2022-11-20 10:32:51,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:32:51,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602285392] [2022-11-20 10:32:51,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602285392] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:32:51,292 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:32:51,292 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-11-20 10:32:51,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536717545] [2022-11-20 10:32:51,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:32:51,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-20 10:32:51,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:32:51,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-20 10:32:51,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2022-11-20 10:32:51,294 INFO L87 Difference]: Start difference. First operand 71 states and 81 transitions. Second operand has 15 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 11 states have internal predecessors, (39), 6 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (17), 7 states have call predecessors, (17), 5 states have call successors, (17) [2022-11-20 10:32:51,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:32:51,911 INFO L93 Difference]: Finished difference Result 102 states and 120 transitions. [2022-11-20 10:32:51,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-20 10:32:51,912 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 11 states have internal predecessors, (39), 6 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (17), 7 states have call predecessors, (17), 5 states have call successors, (17) Word has length 100 [2022-11-20 10:32:51,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:32:51,913 INFO L225 Difference]: With dead ends: 102 [2022-11-20 10:32:51,913 INFO L226 Difference]: Without dead ends: 71 [2022-11-20 10:32:51,914 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=325, Unknown=0, NotChecked=0, Total=380 [2022-11-20 10:32:51,915 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 56 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 629 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-20 10:32:51,915 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 469 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 629 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-20 10:32:51,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-11-20 10:32:51,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2022-11-20 10:32:51,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 43 states have (on average 1.0) internal successors, (43), 43 states have internal predecessors, (43), 19 states have call successors, (19), 9 states have call predecessors, (19), 8 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-11-20 10:32:51,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 80 transitions. [2022-11-20 10:32:51,925 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 80 transitions. Word has length 100 [2022-11-20 10:32:51,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:32:51,925 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 80 transitions. [2022-11-20 10:32:51,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 11 states have internal predecessors, (39), 6 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (17), 7 states have call predecessors, (17), 5 states have call successors, (17) [2022-11-20 10:32:51,926 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 80 transitions. [2022-11-20 10:32:51,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-11-20 10:32:51,928 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:32:51,928 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 4, 4, 3, 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] [2022-11-20 10:32:51,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-20 10:32:51,929 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:32:51,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:32:51,929 INFO L85 PathProgramCache]: Analyzing trace with hash -549207241, now seen corresponding path program 1 times [2022-11-20 10:32:51,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:32:51,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052194746] [2022-11-20 10:32:51,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:32:51,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:32:52,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:32:52,252 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 10:32:52,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:32:52,604 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 10:32:52,604 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-20 10:32:52,605 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-20 10:32:52,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-20 10:32:52,611 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:32:52,616 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-20 10:32:52,688 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 10:32:52 BoogieIcfgContainer [2022-11-20 10:32:52,688 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-20 10:32:52,688 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-20 10:32:52,688 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-20 10:32:52,688 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-20 10:32:52,689 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:32:37" (3/4) ... [2022-11-20 10:32:52,692 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-20 10:32:52,692 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-20 10:32:52,693 INFO L158 Benchmark]: Toolchain (without parser) took 20963.80ms. Allocated memory was 182.5MB in the beginning and 450.9MB in the end (delta: 268.4MB). Free memory was 141.7MB in the beginning and 278.6MB in the end (delta: -136.8MB). Peak memory consumption was 134.3MB. Max. memory is 16.1GB. [2022-11-20 10:32:52,693 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 109.1MB. Free memory is still 58.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 10:32:52,693 INFO L158 Benchmark]: CACSL2BoogieTranslator took 4518.22ms. Allocated memory was 182.5MB in the beginning and 249.6MB in the end (delta: 67.1MB). Free memory was 141.7MB in the beginning and 170.2MB in the end (delta: -28.5MB). Peak memory consumption was 111.6MB. Max. memory is 16.1GB. [2022-11-20 10:32:52,694 INFO L158 Benchmark]: Boogie Procedure Inliner took 244.81ms. Allocated memory is still 249.6MB. Free memory was 170.2MB in the beginning and 159.7MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-20 10:32:52,694 INFO L158 Benchmark]: Boogie Preprocessor took 124.02ms. Allocated memory is still 249.6MB. Free memory was 159.7MB in the beginning and 155.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-20 10:32:52,694 INFO L158 Benchmark]: RCFGBuilder took 907.13ms. Allocated memory is still 249.6MB. Free memory was 155.5MB in the beginning and 119.9MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2022-11-20 10:32:52,694 INFO L158 Benchmark]: TraceAbstraction took 15155.67ms. Allocated memory was 249.6MB in the beginning and 450.9MB in the end (delta: 201.3MB). Free memory was 118.8MB in the beginning and 278.6MB in the end (delta: -159.8MB). Peak memory consumption was 41.6MB. Max. memory is 16.1GB. [2022-11-20 10:32:52,695 INFO L158 Benchmark]: Witness Printer took 4.02ms. Allocated memory is still 450.9MB. Free memory was 278.6MB in the beginning and 278.6MB in the end (delta: 2.0kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 10:32:52,696 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31ms. Allocated memory is still 109.1MB. Free memory is still 58.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 4518.22ms. Allocated memory was 182.5MB in the beginning and 249.6MB in the end (delta: 67.1MB). Free memory was 141.7MB in the beginning and 170.2MB in the end (delta: -28.5MB). Peak memory consumption was 111.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 244.81ms. Allocated memory is still 249.6MB. Free memory was 170.2MB in the beginning and 159.7MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 124.02ms. Allocated memory is still 249.6MB. Free memory was 159.7MB in the beginning and 155.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 907.13ms. Allocated memory is still 249.6MB. Free memory was 155.5MB in the beginning and 119.9MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * TraceAbstraction took 15155.67ms. Allocated memory was 249.6MB in the beginning and 450.9MB in the end (delta: 201.3MB). Free memory was 118.8MB in the beginning and 278.6MB in the end (delta: -159.8MB). Peak memory consumption was 41.6MB. Max. memory is 16.1GB. * Witness Printer took 4.02ms. Allocated memory is still 450.9MB. Free memory was 278.6MB in the beginning and 278.6MB in the end (delta: 2.0kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 223]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of strcmp at line 10798, overapproximation of strlen at line 11324. Possible FailurePath: [L6879-L6884] static struct aws_allocator s_can_fail_allocator_static = { .mem_acquire = s_can_fail_malloc_allocator, .mem_release = s_can_fail_free_allocator, .mem_realloc = s_can_fail_realloc_allocator, .mem_calloc = s_can_fail_calloc_allocator, }; [L7634-L7646] static const uint8_t s_tolower_table[256] = { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z', 91, 92, 93, 94, 95, 96, 'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z', 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199, 200, 201, 202, 203, 204, 205, 206, 207, 208, 209, 210, 211, 212, 213, 214, 215, 216, 217, 218, 219, 220, 221, 222, 223, 224, 225, 226, 227, 228, 229, 230, 231, 232, 233, 234, 235, 236, 237, 238, 239, 240, 241, 242, 243, 244, 245, 246, 247, 248, 249, 250, 251, 252, 253, 254, 255}; VAL [s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L11328] CALL aws_hash_callback_c_str_eq_harness() [L11318] CALL, EXPR ensure_c_str_is_allocated(64) VAL [\old(max_size)=64, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L6832] CALL, EXPR nondet_uint64_t() VAL [s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L266] return __VERIFIER_nondet_ulong(); [L6832] RET, EXPR nondet_uint64_t() VAL [\old(max_size)=64, max_size=64, nondet_uint64_t()=-36893488147419103231, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L6832] size_t cap = nondet_uint64_t(); [L6833] CALL assume_abort_if_not(cap > 0 && cap <= max_size) VAL [\old(cond)=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L6833] RET assume_abort_if_not(cap > 0 && cap <= max_size) VAL [\old(max_size)=64, cap=1, max_size=64, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L6834] CALL, EXPR bounded_malloc(cap) VAL [\old(size)=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L6896-L6898] CALL assume_abort_if_not(size <= ( (18446744073709551615UL) >> (8 + 1))) VAL [\old(cond)=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L6896-L6898] RET assume_abort_if_not(size <= ( (18446744073709551615UL) >> (8 + 1))) VAL [\old(size)=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}, size=1] [L6899] return malloc(size); [L6834] RET, EXPR bounded_malloc(cap) VAL [\old(max_size)=64, bounded_malloc(cap)={-2:0}, cap=1, max_size=64, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L6834] const char *str = bounded_malloc(cap); [L6838] EXPR str[cap - 1] VAL [\old(max_size)=64, cap=1, max_size=64, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}, str={-2:0}, str[cap - 1]=0] [L6838] CALL assume_abort_if_not(str[cap - 1] == 0) VAL [\old(cond)=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L6838] RET assume_abort_if_not(str[cap - 1] == 0) VAL [\old(max_size)=64, cap=1, max_size=64, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}, str={-2:0}, str[cap - 1]=0] [L6839] return str; VAL [\old(max_size)=64, \result={-2:0}, cap=1, max_size=64, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}, str={-2:0}] [L11318] RET, EXPR ensure_c_str_is_allocated(64) VAL [ensure_c_str_is_allocated(64)={-2:0}, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L11318] const char *str1 = ensure_c_str_is_allocated(64); [L11319] CALL, EXPR nondet_bool() VAL [s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L261] return __VERIFIER_nondet_bool(); [L11319] RET, EXPR nondet_bool() VAL [nondet_bool()=0, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}, str1={-2:0}] [L11319] EXPR nondet_bool() ? str1 : ensure_c_str_is_allocated(64) VAL [nondet_bool()=0, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}, str1={-2:0}] [L11319] CALL, EXPR ensure_c_str_is_allocated(64) VAL [\old(max_size)=64, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L6832] CALL, EXPR nondet_uint64_t() VAL [s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L266] return __VERIFIER_nondet_ulong(); [L6832] RET, EXPR nondet_uint64_t() VAL [\old(max_size)=64, max_size=64, nondet_uint64_t()=-18446744073709551615, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L6832] size_t cap = nondet_uint64_t(); [L6833] CALL assume_abort_if_not(cap > 0 && cap <= max_size) VAL [\old(cond)=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L6833] RET assume_abort_if_not(cap > 0 && cap <= max_size) VAL [\old(max_size)=64, cap=1, max_size=64, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L6834] CALL, EXPR bounded_malloc(cap) VAL [\old(size)=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L6896-L6898] CALL assume_abort_if_not(size <= ( (18446744073709551615UL) >> (8 + 1))) VAL [\old(cond)=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L6896-L6898] RET assume_abort_if_not(size <= ( (18446744073709551615UL) >> (8 + 1))) VAL [\old(size)=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}, size=1] [L6899] return malloc(size); [L6834] RET, EXPR bounded_malloc(cap) VAL [\old(max_size)=64, bounded_malloc(cap)={-3:0}, cap=1, max_size=64, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L6834] const char *str = bounded_malloc(cap); [L6838] EXPR str[cap - 1] VAL [\old(max_size)=64, cap=1, max_size=64, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}, str={-3:0}, str[cap - 1]=0] [L6838] CALL assume_abort_if_not(str[cap - 1] == 0) VAL [\old(cond)=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L6838] RET assume_abort_if_not(str[cap - 1] == 0) VAL [\old(max_size)=64, cap=1, max_size=64, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}, str={-3:0}, str[cap - 1]=0] [L6839] return str; VAL [\old(max_size)=64, \result={-3:0}, cap=1, max_size=64, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}, str={-3:0}] [L11319] RET, EXPR ensure_c_str_is_allocated(64) VAL [ensure_c_str_is_allocated(64)={-3:0}, nondet_bool()=0, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}, str1={-2:0}] [L11319] EXPR nondet_bool() ? str1 : ensure_c_str_is_allocated(64) VAL [ensure_c_str_is_allocated(64)={-3:0}, nondet_bool()=0, nondet_bool() ? str1 : ensure_c_str_is_allocated(64)={-3:0}, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}, str1={-2:0}] [L11319] const char *str2 = nondet_bool() ? str1 : ensure_c_str_is_allocated(64); [L11322] CALL, EXPR aws_hash_callback_c_str_eq(str1, str2) [L10794] CALL, EXPR aws_c_string_is_valid(a) VAL [s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}, str={-2:0}] [L6272] return str && ((((1)) == 0) || ((str))); VAL [\result=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}, str={-2:0}, str={-2:0}] [L10794] RET, EXPR aws_c_string_is_valid(a) VAL [a={-2:0}, a={-2:0}, aws_c_string_is_valid(a)=1, b={-3:0}, b={-3:0}, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L10794] CALL assume_abort_if_not((aws_c_string_is_valid(a))) VAL [\old(cond)=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L10794] RET assume_abort_if_not((aws_c_string_is_valid(a))) VAL [a={-2:0}, a={-2:0}, aws_c_string_is_valid(a)=1, b={-3:0}, b={-3:0}, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L10795] CALL, EXPR aws_c_string_is_valid(b) VAL [s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}, str={-3:0}] [L6272] return str && ((((1)) == 0) || ((str))); VAL [\result=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}, str={-3:0}, str={-3:0}] [L10795] RET, EXPR aws_c_string_is_valid(b) VAL [a={-2:0}, a={-2:0}, aws_c_string_is_valid(b)=1, b={-3:0}, b={-3:0}, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L10795] CALL assume_abort_if_not((aws_c_string_is_valid(b))) VAL [\old(cond)=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L10795] RET assume_abort_if_not((aws_c_string_is_valid(b))) VAL [a={-2:0}, a={-2:0}, aws_c_string_is_valid(b)=1, b={-3:0}, b={-3:0}, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L10797-L10798] _Bool rval = !strcmp(a, b); [L10799] CALL, EXPR aws_c_string_is_valid(a) VAL [s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}, str={-2:0}] [L6272] return str && ((((1)) == 0) || ((str))); VAL [\result=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}, str={-2:0}, str={-2:0}] [L10799] RET, EXPR aws_c_string_is_valid(a) VAL [a={-2:0}, a={-2:0}, aws_c_string_is_valid(a)=1, b={-3:0}, b={-3:0}, rval=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L10799] EXPR aws_c_string_is_valid(a) && aws_c_string_is_valid(b) VAL [a={-2:0}, a={-2:0}, aws_c_string_is_valid(a)=1, aws_c_string_is_valid(a) && aws_c_string_is_valid(b)=1, b={-3:0}, b={-3:0}, rval=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L10799] CALL, EXPR aws_c_string_is_valid(b) VAL [s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}, str={-3:0}] [L6272] return str && ((((1)) == 0) || ((str))); VAL [\result=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}, str={-3:0}, str={-3:0}] [L10799] RET, EXPR aws_c_string_is_valid(b) VAL [a={-2:0}, a={-2:0}, aws_c_string_is_valid(a)=1, aws_c_string_is_valid(a) && aws_c_string_is_valid(b)=1, aws_c_string_is_valid(b)=1, b={-3:0}, b={-3:0}, rval=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L10799] EXPR aws_c_string_is_valid(a) && aws_c_string_is_valid(b) VAL [a={-2:0}, a={-2:0}, aws_c_string_is_valid(a)=1, aws_c_string_is_valid(a) && aws_c_string_is_valid(b)=1, aws_c_string_is_valid(b)=1, b={-3:0}, b={-3:0}, rval=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L10799] CALL __VERIFIER_assert((aws_c_string_is_valid(a) && aws_c_string_is_valid(b))) VAL [\old(cond)=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L223] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L10799] RET __VERIFIER_assert((aws_c_string_is_valid(a) && aws_c_string_is_valid(b))) VAL [a={-2:0}, a={-2:0}, aws_c_string_is_valid(a)=1, aws_c_string_is_valid(a) && aws_c_string_is_valid(b)=1, aws_c_string_is_valid(b)=1, b={-3:0}, b={-3:0}, rval=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L10799] return rval; VAL [\result=1, a={-2:0}, a={-2:0}, b={-3:0}, b={-3:0}, rval=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L11322] RET, EXPR aws_hash_callback_c_str_eq(str1, str2) [L11321-L11322] _Bool rval = aws_hash_callback_c_str_eq(str1, str2); [L11323] COND TRUE \read(rval) [L11324] size_t len = strlen(str1); [L11325] CALL assert_bytes_match(str1, str2, len) [L7113] CALL __VERIFIER_assert(!a == !b) VAL [\old(cond)=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L223] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L7113] RET __VERIFIER_assert(!a == !b) VAL [\old(len)=258, a={-2:0}, a={-2:0}, b={-3:0}, b={-3:0}, len=258, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L7114-L7117] COND TRUE len > 0 && a != ((void *)0) && b != ((void *)0) VAL [\old(len)=258, a={-2:0}, a={-2:0}, b={-3:0}, b={-3:0}, len=258, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L7119] CALL, EXPR nondet_uint64_t() VAL [s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L266] return __VERIFIER_nondet_ulong(); [L7119] RET, EXPR nondet_uint64_t() VAL [\old(len)=258, a={-2:0}, a={-2:0}, b={-3:0}, b={-3:0}, len=258, nondet_uint64_t()=18446744073709551873, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L7119] size_t i = nondet_uint64_t(); [L7120-L7122] CALL assume_abort_if_not(i < len && len < ( (18446744073709551615UL) >> (8 + 1))) VAL [\old(cond)=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L7120-L7122] RET assume_abort_if_not(i < len && len < ( (18446744073709551615UL) >> (8 + 1))) VAL [\old(len)=258, a={-2:0}, a={-2:0}, b={-3:0}, b={-3:0}, i=257, len=258, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L7123] EXPR a[i] [L7123] EXPR b[i] VAL [\old(len)=258, a={-2:0}, a={-2:0}, a[i]=-255, b={-3:0}, b={-3:0}, b[i]=0, i=257, len=258, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L7123] CALL __VERIFIER_assert(a[i] == b[i]) VAL [\old(cond)=0, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L223] COND TRUE !cond VAL [\old(cond)=0, cond=0, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L223] reach_error() VAL [\old(cond)=0, cond=0, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 71 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 15.0s, OverallIterations: 8, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 377 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 320 mSDsluCounter, 3116 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2701 mSDsCounter, 250 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3464 IncrementalHoareTripleChecker+Invalid, 3714 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 250 mSolverCounterUnsat, 415 mSDtfsCounter, 3464 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 342 GetRequests, 229 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=94occurred in iteration=5, InterpolantAutomatonStates: 95, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 47 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 8.9s InterpolantComputationTime, 749 NumberOfCodeBlocks, 749 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 610 ConstructedInterpolants, 0 QuantifiedInterpolants, 1728 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 597/597 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-20 10:32:52,718 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70ff65cb-6bab-4ae5-a686-edb0787c32db/bin/uautomizer-ug76WZFUDN/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 Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70ff65cb-6bab-4ae5-a686-edb0787c32db/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70ff65cb-6bab-4ae5-a686-edb0787c32db/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70ff65cb-6bab-4ae5-a686-edb0787c32db/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70ff65cb-6bab-4ae5-a686-edb0787c32db/bin/uautomizer-ug76WZFUDN/config/AutomizerReach.xml -i ../../sv-benchmarks/c/aws-c-common/aws_hash_callback_c_str_eq_harness.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70ff65cb-6bab-4ae5-a686-edb0787c32db/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70ff65cb-6bab-4ae5-a686-edb0787c32db/bin/uautomizer-ug76WZFUDN --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 e2319232de809c5fc7a2ae9b5bcaacd5710dfa5ecc8cc9afebba783e154bd6e0 --- 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-6b4ec56 [2022-11-20 10:32:55,199 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 10:32:55,201 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 10:32:55,232 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 10:32:55,232 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 10:32:55,237 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 10:32:55,242 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 10:32:55,244 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 10:32:55,247 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 10:32:55,249 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 10:32:55,250 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 10:32:55,254 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 10:32:55,256 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 10:32:55,258 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 10:32:55,261 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 10:32:55,264 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 10:32:55,266 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 10:32:55,273 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 10:32:55,275 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 10:32:55,277 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 10:32:55,283 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 10:32:55,285 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 10:32:55,286 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 10:32:55,292 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 10:32:55,295 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 10:32:55,298 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 10:32:55,298 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 10:32:55,299 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 10:32:55,300 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 10:32:55,301 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 10:32:55,302 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 10:32:55,303 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 10:32:55,305 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 10:32:55,306 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 10:32:55,324 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 10:32:55,325 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 10:32:55,326 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 10:32:55,326 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 10:32:55,326 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 10:32:55,327 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 10:32:55,328 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 10:32:55,329 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70ff65cb-6bab-4ae5-a686-edb0787c32db/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2022-11-20 10:32:55,377 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 10:32:55,378 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 10:32:55,379 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 10:32:55,379 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 10:32:55,380 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 10:32:55,380 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 10:32:55,381 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 10:32:55,381 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 10:32:55,381 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 10:32:55,382 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 10:32:55,383 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 10:32:55,383 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 10:32:55,383 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 10:32:55,384 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 10:32:55,384 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-20 10:32:55,384 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-20 10:32:55,384 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-20 10:32:55,384 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 10:32:55,385 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 10:32:55,385 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 10:32:55,385 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 10:32:55,385 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 10:32:55,386 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 10:32:55,386 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 10:32:55,386 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 10:32:55,386 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 10:32:55,387 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 10:32:55,387 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-20 10:32:55,387 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-20 10:32:55,387 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-20 10:32:55,387 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-20 10:32:55,388 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 10:32:55,388 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-20 10:32:55,388 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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_70ff65cb-6bab-4ae5-a686-edb0787c32db/bin/uautomizer-ug76WZFUDN/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_70ff65cb-6bab-4ae5-a686-edb0787c32db/bin/uautomizer-ug76WZFUDN 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 -> e2319232de809c5fc7a2ae9b5bcaacd5710dfa5ecc8cc9afebba783e154bd6e0 [2022-11-20 10:32:55,770 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 10:32:55,792 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 10:32:55,795 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 10:32:55,796 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 10:32:55,796 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 10:32:55,798 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70ff65cb-6bab-4ae5-a686-edb0787c32db/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/aws-c-common/aws_hash_callback_c_str_eq_harness.i [2022-11-20 10:32:59,039 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 10:32:59,642 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 10:32:59,642 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70ff65cb-6bab-4ae5-a686-edb0787c32db/sv-benchmarks/c/aws-c-common/aws_hash_callback_c_str_eq_harness.i [2022-11-20 10:32:59,688 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70ff65cb-6bab-4ae5-a686-edb0787c32db/bin/uautomizer-ug76WZFUDN/data/d2160f69c/a28258e2b11c43639c243fe3b1fe5bb2/FLAG2b7ecd2b6 [2022-11-20 10:32:59,707 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70ff65cb-6bab-4ae5-a686-edb0787c32db/bin/uautomizer-ug76WZFUDN/data/d2160f69c/a28258e2b11c43639c243fe3b1fe5bb2 [2022-11-20 10:32:59,709 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 10:32:59,711 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 10:32:59,712 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 10:32:59,712 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 10:32:59,715 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 10:32:59,716 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:32:59" (1/1) ... [2022-11-20 10:32:59,717 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28be3bd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:32:59, skipping insertion in model container [2022-11-20 10:32:59,717 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:32:59" (1/1) ... [2022-11-20 10:32:59,724 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 10:32:59,869 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 10:33:00,238 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_70ff65cb-6bab-4ae5-a686-edb0787c32db/sv-benchmarks/c/aws-c-common/aws_hash_callback_c_str_eq_harness.i[4500,4513] [2022-11-20 10:33:00,246 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_70ff65cb-6bab-4ae5-a686-edb0787c32db/sv-benchmarks/c/aws-c-common/aws_hash_callback_c_str_eq_harness.i[4560,4573] [2022-11-20 10:33:01,533 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:33:01,534 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:33:01,541 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:33:01,543 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:33:01,546 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:33:01,561 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:33:01,562 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:33:01,564 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:33:01,565 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:33:02,149 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-11-20 10:33:02,151 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-11-20 10:33:02,152 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-11-20 10:33:02,154 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-11-20 10:33:02,156 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-11-20 10:33:02,162 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-11-20 10:33:02,163 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-11-20 10:33:02,164 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-11-20 10:33:02,165 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-11-20 10:33:02,166 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-11-20 10:33:02,437 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-11-20 10:33:02,553 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:33:02,553 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:33:02,911 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:33:02,914 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:33:02,946 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:33:02,947 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:33:02,956 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:33:02,957 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:33:02,975 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:33:02,976 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:33:02,978 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:33:02,978 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:33:02,979 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:33:02,980 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:33:02,981 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:33:03,093 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 10:33:03,160 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-11-20 10:33:03,221 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 10:33:03,226 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_70ff65cb-6bab-4ae5-a686-edb0787c32db/sv-benchmarks/c/aws-c-common/aws_hash_callback_c_str_eq_harness.i[4500,4513] [2022-11-20 10:33:03,227 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_70ff65cb-6bab-4ae5-a686-edb0787c32db/sv-benchmarks/c/aws-c-common/aws_hash_callback_c_str_eq_harness.i[4560,4573] [2022-11-20 10:33:03,306 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:33:03,306 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:33:03,307 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:33:03,311 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:33:03,311 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:33:03,317 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:33:03,318 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:33:03,319 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:33:03,320 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:33:03,362 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-11-20 10:33:03,363 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-11-20 10:33:03,364 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-11-20 10:33:03,364 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-11-20 10:33:03,365 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-11-20 10:33:03,366 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-11-20 10:33:03,366 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-11-20 10:33:03,367 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-11-20 10:33:03,367 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-11-20 10:33:03,368 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-11-20 10:33:03,386 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-11-20 10:33:03,443 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:33:03,446 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:33:03,552 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:33:03,553 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:33:03,561 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:33:03,562 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:33:03,565 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:33:03,566 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:33:03,574 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:33:03,575 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:33:03,576 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:33:03,576 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:33:03,577 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:33:03,577 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:33:03,578 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:33:03,612 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 10:33:03,633 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 10:33:03,646 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_70ff65cb-6bab-4ae5-a686-edb0787c32db/sv-benchmarks/c/aws-c-common/aws_hash_callback_c_str_eq_harness.i[4500,4513] [2022-11-20 10:33:03,647 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_70ff65cb-6bab-4ae5-a686-edb0787c32db/sv-benchmarks/c/aws-c-common/aws_hash_callback_c_str_eq_harness.i[4560,4573] [2022-11-20 10:33:03,675 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:33:03,675 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:33:03,676 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:33:03,676 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:33:03,677 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:33:03,681 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:33:03,682 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:33:03,683 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:33:03,683 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:33:03,735 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-11-20 10:33:03,736 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-11-20 10:33:03,736 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-11-20 10:33:03,736 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-11-20 10:33:03,737 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-11-20 10:33:03,737 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-11-20 10:33:03,738 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-11-20 10:33:03,738 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-11-20 10:33:03,738 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-11-20 10:33:03,739 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-11-20 10:33:03,755 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-11-20 10:33:03,806 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:33:03,806 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:33:03,869 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:33:03,869 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:33:03,876 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:33:03,877 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:33:03,919 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:33:03,919 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-20 10:33:03,922 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator has thrown an exception: java.lang.ArithmeticException: BigInteger out of long range at java.base/java.math.BigInteger.longValueExact(BigInteger.java:4773) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CTranslationUtil.countNumberOfPrimitiveElementInType(CTranslationUtil.java:560) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CTranslationUtil.countNumberOfPrimitiveElementInType(CTranslationUtil.java:553) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.InitializationHandler.useConstantArrayForOnHeapDefaultInit(InitializationHandler.java:1052) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.InitializationHandler.initialize(InitializationHandler.java:261) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.InitializationHandler.initialize(InitializationHandler.java:207) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.handleIASTDeclarator(CHandler.java:2957) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:2165) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainDispatcher.dispatch(MainDispatcher.java:281) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1141) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainDispatcher.dispatch(MainDispatcher.java:320) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1087) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainDispatcher.dispatch(MainDispatcher.java:334) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.FunctionHandler.handleFunctionDefinition(FunctionHandler.java:371) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1489) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainDispatcher.dispatch(MainDispatcher.java:289) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.processTUchild(CHandler.java:3314) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:2388) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:600) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainDispatcher.dispatch(MainDispatcher.java:270) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.performMainRun(MainTranslator.java:244) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.translate(MainTranslator.java:206) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.run(MainTranslator.java:115) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.(MainTranslator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver.finish(CACSL2BoogieTranslatorObserver.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-20 10:33:03,931 INFO L158 Benchmark]: Toolchain (without parser) took 4219.81ms. Allocated memory was 79.7MB in the beginning and 136.3MB in the end (delta: 56.6MB). Free memory was 48.6MB in the beginning and 68.5MB in the end (delta: -19.9MB). Peak memory consumption was 73.5MB. Max. memory is 16.1GB. [2022-11-20 10:33:03,932 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 79.7MB. Free memory is still 57.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 10:33:03,932 INFO L158 Benchmark]: CACSL2BoogieTranslator took 4217.74ms. Allocated memory was 79.7MB in the beginning and 136.3MB in the end (delta: 56.6MB). Free memory was 48.3MB in the beginning and 68.5MB in the end (delta: -20.2MB). Peak memory consumption was 73.5MB. Max. memory is 16.1GB. [2022-11-20 10:33:03,937 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.29ms. Allocated memory is still 79.7MB. Free memory is still 57.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 4217.74ms. Allocated memory was 79.7MB in the beginning and 136.3MB in the end (delta: 56.6MB). Free memory was 48.3MB in the beginning and 68.5MB in the end (delta: -20.2MB). Peak memory consumption was 73.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - ExceptionOrErrorResult: ArithmeticException: BigInteger out of long range de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: ArithmeticException: BigInteger out of long range: java.base/java.math.BigInteger.longValueExact(BigInteger.java:4773) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: ArithmeticException: BigInteger out of long range