./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/aws-c-common/aws_linked_list_prev_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8393723b 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_a6e44796-45bc-4379-a106-2f17d8ef6b3c/bin/utaipan-I9t0OCRTmS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6e44796-45bc-4379-a106-2f17d8ef6b3c/bin/utaipan-I9t0OCRTmS/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6e44796-45bc-4379-a106-2f17d8ef6b3c/bin/utaipan-I9t0OCRTmS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6e44796-45bc-4379-a106-2f17d8ef6b3c/bin/utaipan-I9t0OCRTmS/config/TaipanReach.xml -i ../../sv-benchmarks/c/aws-c-common/aws_linked_list_prev_harness.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6e44796-45bc-4379-a106-2f17d8ef6b3c/bin/utaipan-I9t0OCRTmS/config/svcomp-Reach-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6e44796-45bc-4379-a106-2f17d8ef6b3c/bin/utaipan-I9t0OCRTmS --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 Taipan --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 0aec0bb8b8715e014581c4eef5e1e25c7e0452a528f8abdf2f2a721d17b0fa7f --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-8393723 [2022-11-19 08:17:23,537 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-19 08:17:23,540 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-19 08:17:23,582 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-19 08:17:23,584 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-19 08:17:23,588 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-19 08:17:23,590 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-19 08:17:23,596 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-19 08:17:23,598 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-19 08:17:23,600 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-19 08:17:23,602 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-19 08:17:23,606 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-19 08:17:23,607 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-19 08:17:23,614 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-19 08:17:23,615 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-19 08:17:23,617 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-19 08:17:23,619 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-19 08:17:23,622 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-19 08:17:23,624 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-19 08:17:23,628 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-19 08:17:23,631 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-19 08:17:23,632 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-19 08:17:23,635 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-19 08:17:23,636 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-19 08:17:23,640 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-19 08:17:23,641 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-19 08:17:23,641 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-19 08:17:23,642 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-19 08:17:23,643 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-19 08:17:23,644 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-19 08:17:23,644 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-19 08:17:23,645 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-19 08:17:23,646 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-19 08:17:23,648 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-19 08:17:23,649 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-19 08:17:23,651 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-19 08:17:23,652 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-19 08:17:23,652 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-19 08:17:23,652 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-19 08:17:23,653 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-19 08:17:23,654 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-19 08:17:23,655 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6e44796-45bc-4379-a106-2f17d8ef6b3c/bin/utaipan-I9t0OCRTmS/config/svcomp-Reach-64bit-Taipan_Default.epf [2022-11-19 08:17:23,683 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-19 08:17:23,683 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-19 08:17:23,684 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-19 08:17:23,684 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-19 08:17:23,685 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-19 08:17:23,685 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-19 08:17:23,685 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-19 08:17:23,686 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-19 08:17:23,686 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-19 08:17:23,686 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-19 08:17:23,687 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-19 08:17:23,687 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-19 08:17:23,688 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-19 08:17:23,688 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-19 08:17:23,688 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-19 08:17:23,688 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-19 08:17:23,688 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-19 08:17:23,689 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-19 08:17:23,689 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-19 08:17:23,690 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-19 08:17:23,690 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-19 08:17:23,690 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-19 08:17:23,690 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-19 08:17:23,692 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-19 08:17:23,692 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-19 08:17:23,692 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-19 08:17:23,693 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-19 08:17:23,693 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-19 08:17:23,693 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-19 08:17:23,693 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 08:17:23,694 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-19 08:17:23,694 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-19 08:17:23,694 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-19 08:17:23,694 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-19 08:17:23,695 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-19 08:17:23,695 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-19 08:17:23,695 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-19 08:17:23,695 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-19 08:17:23,695 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_a6e44796-45bc-4379-a106-2f17d8ef6b3c/bin/utaipan-I9t0OCRTmS/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_a6e44796-45bc-4379-a106-2f17d8ef6b3c/bin/utaipan-I9t0OCRTmS 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 -> Taipan 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 -> 0aec0bb8b8715e014581c4eef5e1e25c7e0452a528f8abdf2f2a721d17b0fa7f [2022-11-19 08:17:23,988 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-19 08:17:24,014 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-19 08:17:24,019 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-19 08:17:24,020 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-19 08:17:24,021 INFO L275 PluginConnector]: CDTParser initialized [2022-11-19 08:17:24,022 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6e44796-45bc-4379-a106-2f17d8ef6b3c/bin/utaipan-I9t0OCRTmS/../../sv-benchmarks/c/aws-c-common/aws_linked_list_prev_harness.i [2022-11-19 08:17:24,091 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6e44796-45bc-4379-a106-2f17d8ef6b3c/bin/utaipan-I9t0OCRTmS/data/e81a6752f/4193fec6cd524f668d48aab089e114eb/FLAG5e1903f20 [2022-11-19 08:17:24,777 INFO L306 CDTParser]: Found 1 translation units. [2022-11-19 08:17:24,778 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6e44796-45bc-4379-a106-2f17d8ef6b3c/sv-benchmarks/c/aws-c-common/aws_linked_list_prev_harness.i [2022-11-19 08:17:24,803 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6e44796-45bc-4379-a106-2f17d8ef6b3c/bin/utaipan-I9t0OCRTmS/data/e81a6752f/4193fec6cd524f668d48aab089e114eb/FLAG5e1903f20 [2022-11-19 08:17:24,916 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6e44796-45bc-4379-a106-2f17d8ef6b3c/bin/utaipan-I9t0OCRTmS/data/e81a6752f/4193fec6cd524f668d48aab089e114eb [2022-11-19 08:17:24,918 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-19 08:17:24,920 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-19 08:17:24,922 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-19 08:17:24,922 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-19 08:17:24,926 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-19 08:17:24,927 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:17:24" (1/1) ... [2022-11-19 08:17:24,928 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71dca385 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:17:24, skipping insertion in model container [2022-11-19 08:17:24,936 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:17:24" (1/1) ... [2022-11-19 08:17:24,944 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-19 08:17:25,055 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-19 08:17:25,389 WARN L234 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6e44796-45bc-4379-a106-2f17d8ef6b3c/sv-benchmarks/c/aws-c-common/aws_linked_list_prev_harness.i[4494,4507] [2022-11-19 08:17:25,398 WARN L234 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6e44796-45bc-4379-a106-2f17d8ef6b3c/sv-benchmarks/c/aws-c-common/aws_linked_list_prev_harness.i[4554,4567] [2022-11-19 08:17:26,205 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-19 08:17:26,207 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-19 08:17:26,208 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-19 08:17:26,210 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-19 08:17:26,214 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-19 08:17:26,238 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-19 08:17:26,243 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-19 08:17:26,246 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-19 08:17:26,248 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-19 08:17:26,251 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-19 08:17:26,252 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-19 08:17:26,254 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-19 08:17:26,255 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-19 08:17:26,618 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-11-19 08:17:26,624 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-11-19 08:17:26,626 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-11-19 08:17:26,629 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-11-19 08:17:26,632 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-11-19 08:17:26,633 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-11-19 08:17:26,636 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-11-19 08:17:26,637 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-11-19 08:17:26,639 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-11-19 08:17:26,640 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-11-19 08:17:26,779 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-11-19 08:17:26,820 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 08:17:26,837 INFO L203 MainTranslator]: Completed pre-run [2022-11-19 08:17:26,851 WARN L234 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6e44796-45bc-4379-a106-2f17d8ef6b3c/sv-benchmarks/c/aws-c-common/aws_linked_list_prev_harness.i[4494,4507] [2022-11-19 08:17:26,875 WARN L234 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6e44796-45bc-4379-a106-2f17d8ef6b3c/sv-benchmarks/c/aws-c-common/aws_linked_list_prev_harness.i[4554,4567] [2022-11-19 08:17:26,919 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-19 08:17:26,919 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-19 08:17:26,920 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-19 08:17:26,920 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-19 08:17:26,921 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-19 08:17:26,936 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-19 08:17:26,937 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-19 08:17:26,938 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-19 08:17:26,939 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-19 08:17:26,940 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-19 08:17:26,941 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-19 08:17:26,941 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-19 08:17:26,942 WARN L1568 CHandler]: Possible shadowing of function index [2022-11-19 08:17:26,985 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-11-19 08:17:26,986 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-11-19 08:17:26,987 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-11-19 08:17:26,988 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-11-19 08:17:26,989 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-11-19 08:17:26,990 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-11-19 08:17:26,991 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-11-19 08:17:26,992 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-11-19 08:17:26,992 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-11-19 08:17:26,993 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-11-19 08:17:27,022 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-11-19 08:17:27,041 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 08:17:27,371 INFO L208 MainTranslator]: Completed translation [2022-11-19 08:17:27,371 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:17:27 WrapperNode [2022-11-19 08:17:27,371 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-19 08:17:27,372 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-19 08:17:27,373 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-19 08:17:27,373 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-19 08:17:27,380 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:17:27" (1/1) ... [2022-11-19 08:17:27,478 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:17:27" (1/1) ... [2022-11-19 08:17:27,537 INFO L138 Inliner]: procedures = 679, calls = 1038, calls flagged for inlining = 50, calls inlined = 4, statements flattened = 57 [2022-11-19 08:17:27,538 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-19 08:17:27,540 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-19 08:17:27,540 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-19 08:17:27,541 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-19 08:17:27,553 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:17:27" (1/1) ... [2022-11-19 08:17:27,553 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:17:27" (1/1) ... [2022-11-19 08:17:27,569 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:17:27" (1/1) ... [2022-11-19 08:17:27,570 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:17:27" (1/1) ... [2022-11-19 08:17:27,587 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:17:27" (1/1) ... [2022-11-19 08:17:27,604 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:17:27" (1/1) ... [2022-11-19 08:17:27,608 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:17:27" (1/1) ... [2022-11-19 08:17:27,610 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:17:27" (1/1) ... [2022-11-19 08:17:27,614 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-19 08:17:27,620 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-19 08:17:27,621 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-19 08:17:27,621 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-19 08:17:27,622 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:17:27" (1/1) ... [2022-11-19 08:17:27,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 08:17:27,645 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6e44796-45bc-4379-a106-2f17d8ef6b3c/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:17:27,659 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6e44796-45bc-4379-a106-2f17d8ef6b3c/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-19 08:17:27,695 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6e44796-45bc-4379-a106-2f17d8ef6b3c/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-19 08:17:27,717 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-19 08:17:27,717 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-19 08:17:27,717 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-19 08:17:27,717 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2022-11-19 08:17:27,717 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2022-11-19 08:17:27,718 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-19 08:17:27,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-19 08:17:27,718 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-19 08:17:27,718 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-19 08:17:27,718 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-11-19 08:17:27,718 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-11-19 08:17:27,719 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-19 08:17:27,719 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-19 08:17:27,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-19 08:17:27,719 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_prev_is_valid [2022-11-19 08:17:27,719 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_prev_is_valid [2022-11-19 08:17:27,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-19 08:17:28,060 INFO L235 CfgBuilder]: Building ICFG [2022-11-19 08:17:28,063 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-19 08:17:28,310 INFO L276 CfgBuilder]: Performing block encoding [2022-11-19 08:17:28,411 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-19 08:17:28,411 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-19 08:17:28,415 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:17:28 BoogieIcfgContainer [2022-11-19 08:17:28,417 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-19 08:17:28,420 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-19 08:17:28,421 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-19 08:17:28,425 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-19 08:17:28,425 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 08:17:24" (1/3) ... [2022-11-19 08:17:28,427 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ebf5aed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:17:28, skipping insertion in model container [2022-11-19 08:17:28,427 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:17:27" (2/3) ... [2022-11-19 08:17:28,429 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ebf5aed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:17:28, skipping insertion in model container [2022-11-19 08:17:28,430 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:17:28" (3/3) ... [2022-11-19 08:17:28,431 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_linked_list_prev_harness.i [2022-11-19 08:17:28,452 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-19 08:17:28,453 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-19 08:17:28,518 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-19 08:17:28,526 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=FINITE_AUTOMATA, 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;@6cd9a8c4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-19 08:17:28,527 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-19 08:17:28,532 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-11-19 08:17:28,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-19 08:17:28,540 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:17:28,553 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:17:28,553 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 08:17:28,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:17:28,563 INFO L85 PathProgramCache]: Analyzing trace with hash 846701445, now seen corresponding path program 1 times [2022-11-19 08:17:28,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:17:28,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265421174] [2022-11-19 08:17:28,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:17:28,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:17:28,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:17:31,684 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-19 08:17:31,685 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:17:31,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265421174] [2022-11-19 08:17:31,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265421174] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:17:31,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [804325185] [2022-11-19 08:17:31,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:17:31,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:17:31,688 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6e44796-45bc-4379-a106-2f17d8ef6b3c/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:17:31,706 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6e44796-45bc-4379-a106-2f17d8ef6b3c/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:17:31,731 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6e44796-45bc-4379-a106-2f17d8ef6b3c/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-19 08:17:31,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:17:31,919 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 66 conjunts are in the unsatisfiable core [2022-11-19 08:17:31,934 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:17:32,043 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-11-19 08:17:32,056 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-11-19 08:17:32,069 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-19 08:17:32,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:17:32,086 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-19 08:17:32,095 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-19 08:17:34,273 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:17:34,273 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 08:17:34,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [804325185] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:17:34,274 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-19 08:17:34,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [11] total 20 [2022-11-19 08:17:34,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877547814] [2022-11-19 08:17:34,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:17:34,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-19 08:17:34,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:17:34,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-19 08:17:34,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=319, Unknown=0, NotChecked=0, Total=380 [2022-11-19 08:17:34,342 INFO L87 Difference]: Start difference. First operand has 33 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 13 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-19 08:17:34,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:17:34,532 INFO L93 Difference]: Finished difference Result 66 states and 83 transitions. [2022-11-19 08:17:34,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-19 08:17:34,535 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 15 [2022-11-19 08:17:34,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:17:34,544 INFO L225 Difference]: With dead ends: 66 [2022-11-19 08:17:34,544 INFO L226 Difference]: Without dead ends: 39 [2022-11-19 08:17:34,548 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=66, Invalid=354, Unknown=0, NotChecked=0, Total=420 [2022-11-19 08:17:34,552 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 7 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 32 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 08:17:34,553 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 228 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 72 Invalid, 0 Unknown, 32 Unchecked, 0.1s Time] [2022-11-19 08:17:34,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-11-19 08:17:34,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-11-19 08:17:34,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 20 states have internal predecessors, (20), 12 states have call successors, (12), 7 states have call predecessors, (12), 7 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-19 08:17:34,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2022-11-19 08:17:34,613 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 15 [2022-11-19 08:17:34,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:17:34,614 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2022-11-19 08:17:34,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-19 08:17:34,614 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-11-19 08:17:34,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-19 08:17:34,617 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:17:34,617 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:17:34,630 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6e44796-45bc-4379-a106-2f17d8ef6b3c/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-19 08:17:34,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6e44796-45bc-4379-a106-2f17d8ef6b3c/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2022-11-19 08:17:34,825 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 08:17:34,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:17:34,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1013014958, now seen corresponding path program 1 times [2022-11-19 08:17:34,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:17:34,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756076380] [2022-11-19 08:17:34,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:17:34,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:17:34,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:17:36,911 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-19 08:17:36,911 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:17:36,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756076380] [2022-11-19 08:17:36,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756076380] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:17:36,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [926708827] [2022-11-19 08:17:36,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:17:36,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:17:36,913 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6e44796-45bc-4379-a106-2f17d8ef6b3c/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:17:36,914 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6e44796-45bc-4379-a106-2f17d8ef6b3c/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:17:36,949 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6e44796-45bc-4379-a106-2f17d8ef6b3c/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-19 08:17:37,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:17:37,090 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 90 conjunts are in the unsatisfiable core [2022-11-19 08:17:37,105 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:17:37,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:17:37,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:17:37,141 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-11-19 08:17:37,152 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2022-11-19 08:17:37,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:17:37,162 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 20 [2022-11-19 08:17:37,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:17:37,174 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2022-11-19 08:17:37,184 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-11-19 08:17:37,198 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-11-19 08:17:39,457 INFO L321 Elim1Store]: treesize reduction 69, result has 25.0 percent of original size [2022-11-19 08:17:39,458 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 10 new quantified variables, introduced 15 case distinctions, treesize of input 304 treesize of output 176 [2022-11-19 08:17:39,524 INFO L321 Elim1Store]: treesize reduction 74, result has 8.6 percent of original size [2022-11-19 08:17:39,525 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 118 treesize of output 64 [2022-11-19 08:17:39,604 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-19 08:17:39,605 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:17:50,692 WARN L233 SmtUtils]: Spent 8.08s on a formula simplification that was a NOOP. DAG size: 43 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-19 08:17:52,774 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-19 08:17:52,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [926708827] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:17:52,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [290958551] [2022-11-19 08:17:52,799 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2022-11-19 08:17:52,799 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 08:17:52,805 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 08:17:52,811 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 08:17:52,812 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 08:17:52,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:17:52,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:17:52,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:17:52,907 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 30 [2022-11-19 08:17:52,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:17:52,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:17:52,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:17:52,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:17:52,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:17:52,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:17:52,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:17:52,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:17:52,935 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 08:17:52,964 INFO L321 Elim1Store]: treesize reduction 26, result has 49.0 percent of original size [2022-11-19 08:17:52,965 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 75 treesize of output 83 [2022-11-19 08:17:52,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:17:52,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:17:53,100 INFO L321 Elim1Store]: treesize reduction 136, result has 24.9 percent of original size [2022-11-19 08:17:53,101 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 14 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 12 case distinctions, treesize of input 49 treesize of output 85 [2022-11-19 08:17:53,139 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 9 [2022-11-19 08:17:53,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:17:53,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:17:53,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:17:53,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:17:53,165 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 19 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 75 [2022-11-19 08:17:53,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:17:53,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 08:17:53,191 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 17 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 43 [2022-11-19 08:17:54,079 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 19 for LOIs [2022-11-19 08:17:54,087 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 19 for LOIs [2022-11-19 08:17:54,089 INFO L197 IcfgInterpreter]: Interpreting procedure aws_linked_list_node_prev_is_valid with input of size 34 for LOIs [2022-11-19 08:17:54,182 INFO L197 IcfgInterpreter]: Interpreting procedure aws_linked_list_node_next_is_valid with input of size 15 for LOIs [2022-11-19 08:17:54,252 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 08:17:56,582 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '428#(and (<= 0 |__VERIFIER_assert_#in~cond|) (= |~#s_can_fail_allocator_static~0.base| 4) (= (mod __VERIFIER_assert_~cond 256) 0) (= |~#s_can_fail_allocator_static~0.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (= ~tl_last_error~0 0) (= |#NULL.offset| 0) (<= |__VERIFIER_assert_#in~cond| 1) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-11-19 08:17:56,582 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-19 08:17:56,582 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 08:17:56,583 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 11] total 31 [2022-11-19 08:17:56,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595165106] [2022-11-19 08:17:56,583 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 08:17:56,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-19 08:17:56,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:17:56,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-19 08:17:56,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=2151, Unknown=0, NotChecked=0, Total=2352 [2022-11-19 08:17:56,586 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand has 31 states, 14 states have (on average 2.357142857142857) internal successors, (33), 22 states have internal predecessors, (33), 13 states have call successors, (17), 4 states have call predecessors, (17), 11 states have return successors, (15), 11 states have call predecessors, (15), 11 states have call successors, (15) [2022-11-19 08:17:57,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:17:57,222 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2022-11-19 08:17:57,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-19 08:17:57,222 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 14 states have (on average 2.357142857142857) internal successors, (33), 22 states have internal predecessors, (33), 13 states have call successors, (17), 4 states have call predecessors, (17), 11 states have return successors, (15), 11 states have call predecessors, (15), 11 states have call successors, (15) Word has length 24 [2022-11-19 08:17:57,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:17:57,224 INFO L225 Difference]: With dead ends: 47 [2022-11-19 08:17:57,224 INFO L226 Difference]: Without dead ends: 45 [2022-11-19 08:17:57,225 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 30 SyntacticMatches, 6 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 879 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=231, Invalid=2631, Unknown=0, NotChecked=0, Total=2862 [2022-11-19 08:17:57,231 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 10 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 66 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 08:17:57,231 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 347 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 178 Invalid, 0 Unknown, 66 Unchecked, 0.2s Time] [2022-11-19 08:17:57,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-11-19 08:17:57,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-11-19 08:17:57,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 24 states have internal predecessors, (24), 12 states have call successors, (12), 9 states have call predecessors, (12), 9 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-19 08:17:57,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2022-11-19 08:17:57,242 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 24 [2022-11-19 08:17:57,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:17:57,243 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2022-11-19 08:17:57,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 14 states have (on average 2.357142857142857) internal successors, (33), 22 states have internal predecessors, (33), 13 states have call successors, (17), 4 states have call predecessors, (17), 11 states have return successors, (15), 11 states have call predecessors, (15), 11 states have call successors, (15) [2022-11-19 08:17:57,243 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2022-11-19 08:17:57,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-19 08:17:57,244 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:17:57,244 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:17:57,250 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6e44796-45bc-4379-a106-2f17d8ef6b3c/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-19 08:17:57,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6e44796-45bc-4379-a106-2f17d8ef6b3c/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:17:57,445 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 08:17:57,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:17:57,446 INFO L85 PathProgramCache]: Analyzing trace with hash 615597899, now seen corresponding path program 1 times [2022-11-19 08:17:57,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:17:57,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697484518] [2022-11-19 08:17:57,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:17:57,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:17:57,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:17:57,725 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-19 08:17:57,726 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:17:57,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697484518] [2022-11-19 08:17:57,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697484518] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:17:57,726 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:17:57,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-19 08:17:57,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954154469] [2022-11-19 08:17:57,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:17:57,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-19 08:17:57,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:17:57,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-19 08:17:57,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-19 08:17:57,729 INFO L87 Difference]: Start difference. First operand 45 states and 47 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-19 08:17:57,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:17:57,890 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2022-11-19 08:17:57,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-19 08:17:57,892 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 30 [2022-11-19 08:17:57,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:17:57,893 INFO L225 Difference]: With dead ends: 51 [2022-11-19 08:17:57,893 INFO L226 Difference]: Without dead ends: 49 [2022-11-19 08:17:57,893 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-19 08:17:57,894 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 9 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 08:17:57,895 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 108 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 08:17:57,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-11-19 08:17:57,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2022-11-19 08:17:57,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 27 states have internal predecessors, (27), 12 states have call successors, (12), 10 states have call predecessors, (12), 10 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-19 08:17:57,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2022-11-19 08:17:57,912 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 30 [2022-11-19 08:17:57,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:17:57,913 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2022-11-19 08:17:57,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-19 08:17:57,913 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2022-11-19 08:17:57,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-19 08:17:57,914 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:17:57,915 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 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] [2022-11-19 08:17:57,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-19 08:17:57,915 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 08:17:57,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:17:57,916 INFO L85 PathProgramCache]: Analyzing trace with hash 584950545, now seen corresponding path program 1 times [2022-11-19 08:17:57,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:17:57,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592660761] [2022-11-19 08:17:57,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:17:57,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:17:57,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:17:59,406 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-19 08:17:59,407 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:17:59,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592660761] [2022-11-19 08:17:59,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592660761] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:17:59,407 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:17:59,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-19 08:17:59,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351368416] [2022-11-19 08:17:59,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:17:59,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-19 08:17:59,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:17:59,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-19 08:17:59,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-19 08:17:59,410 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand has 8 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-19 08:17:59,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:17:59,665 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2022-11-19 08:17:59,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-19 08:17:59,666 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 39 [2022-11-19 08:17:59,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:17:59,668 INFO L225 Difference]: With dead ends: 55 [2022-11-19 08:17:59,668 INFO L226 Difference]: Without dead ends: 53 [2022-11-19 08:17:59,668 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-11-19 08:17:59,669 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 11 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 08:17:59,670 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 109 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 08:17:59,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-11-19 08:17:59,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-11-19 08:17:59,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 30 states have internal predecessors, (30), 12 states have call successors, (12), 11 states have call predecessors, (12), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-19 08:17:59,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2022-11-19 08:17:59,685 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 39 [2022-11-19 08:17:59,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:17:59,686 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2022-11-19 08:17:59,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-19 08:17:59,686 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2022-11-19 08:17:59,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-19 08:17:59,688 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:17:59,688 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:17:59,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-19 08:17:59,688 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 08:17:59,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:17:59,689 INFO L85 PathProgramCache]: Analyzing trace with hash -1736704596, now seen corresponding path program 1 times [2022-11-19 08:17:59,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:17:59,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432840211] [2022-11-19 08:17:59,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:17:59,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:17:59,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:18:01,703 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-11-19 08:18:01,704 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:18:01,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432840211] [2022-11-19 08:18:01,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432840211] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 08:18:01,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [207940540] [2022-11-19 08:18:01,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:18:01,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:18:01,705 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6e44796-45bc-4379-a106-2f17d8ef6b3c/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:18:01,706 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6e44796-45bc-4379-a106-2f17d8ef6b3c/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:18:01,727 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6e44796-45bc-4379-a106-2f17d8ef6b3c/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-19 08:18:01,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:18:01,925 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 63 conjunts are in the unsatisfiable core [2022-11-19 08:18:01,932 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:18:05,204 WARN L859 $PredicateComparison]: unable to prove that (or (exists ((|ULTIMATE.start_aws_linked_list_prev_~node#1.base| Int) (|ULTIMATE.start_aws_linked_list_prev_~node#1.offset| Int)) (let ((.cse5 (+ |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 8))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) .cse5)) (.cse0 (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) .cse5))) (let ((.cse1 (select (select |c_#memory_$Pointer$.offset| .cse4) .cse0))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse4) .cse0)) (.cse3 (+ .cse1 8))) (and (not (= .cse0 0)) (not (= .cse1 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse2) .cse3) .cse0) (= (select (select |c_#memory_$Pointer$.base| .cse2) .cse3) .cse4))))))) (exists ((|ULTIMATE.start_aws_linked_list_prev_~node#1.base| Int) (|ULTIMATE.start_aws_linked_list_prev_~node#1.offset| Int)) (let ((.cse10 (+ |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 8))) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) .cse10)) (.cse9 (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) .cse10))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| .cse7) .cse9)) (.cse8 (+ (select (select |c_#memory_$Pointer$.offset| .cse7) .cse9) 8))) (and (not (= .cse6 0)) (not (= .cse7 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse6) .cse8) .cse9) (= (select (select |c_#memory_$Pointer$.base| .cse6) .cse8) .cse7)))))) (exists ((|ULTIMATE.start_aws_linked_list_prev_~node#1.base| Int) (|ULTIMATE.start_aws_linked_list_prev_~node#1.offset| Int)) (let ((.cse15 (+ |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 8))) (let ((.cse14 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) .cse15)) (.cse11 (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) .cse15))) (let ((.cse12 (select (select |c_#memory_$Pointer$.base| .cse14) .cse11)) (.cse13 (+ (select (select |c_#memory_$Pointer$.offset| .cse14) .cse11) 8))) (and (not (= .cse11 0)) (not (= .cse12 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse12) .cse13) .cse11) (= (select (select |c_#memory_$Pointer$.base| .cse12) .cse13) .cse14)))))) (exists ((|ULTIMATE.start_aws_linked_list_prev_~node#1.base| Int) (|ULTIMATE.start_aws_linked_list_prev_~node#1.offset| Int)) (let ((.cse21 (+ |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 8))) (let ((.cse16 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) .cse21)) (.cse20 (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) .cse21))) (let ((.cse17 (select (select |c_#memory_$Pointer$.offset| .cse16) .cse20))) (let ((.cse18 (select (select |c_#memory_$Pointer$.base| .cse16) .cse20)) (.cse19 (+ .cse17 8))) (and (not (= .cse16 0)) (not (= .cse17 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse18) .cse19) .cse20) (= (select (select |c_#memory_$Pointer$.base| .cse18) .cse19) .cse16)))))))) is different from true [2022-11-19 08:18:25,454 WARN L233 SmtUtils]: Spent 18.07s on a formula simplification that was a NOOP. DAG size: 43 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-19 08:18:50,125 WARN L233 SmtUtils]: Spent 20.08s on a formula simplification that was a NOOP. DAG size: 45 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-19 08:18:53,238 WARN L859 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_1| Int)) (and (not (= |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_1| 0)) (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_1| Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_1|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_1|)) (.cse1 (+ .cse2 8))) (and (= (select (select |c_#memory_$Pointer$.base| .cse0) .cse1) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_1|) (not (= .cse2 0)) (= |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_1| (select (select |c_#memory_$Pointer$.offset| .cse0) .cse1)))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_1| Int)) (and (not (= |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_1| 0)) (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_1| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_1|)) (.cse4 (+ (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_1|) 8))) (and (= (select (select |c_#memory_$Pointer$.base| .cse3) .cse4) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_1|) (not (= .cse3 0)) (= |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_1| (select (select |c_#memory_$Pointer$.offset| .cse3) .cse4))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_1| Int)) (and (not (= |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_1| 0)) (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_1| Int)) (let ((.cse7 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_1|))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_1|)) (.cse6 (+ .cse7 8))) (and (= (select (select |c_#memory_$Pointer$.base| .cse5) .cse6) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_1|) (not (= .cse7 0)) (= |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_1| (select (select |c_#memory_$Pointer$.offset| .cse5) .cse6)))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_1| Int)) (and (not (= |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_1| 0)) (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_1| Int)) (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_1|)) (.cse9 (+ (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_1|) 8))) (and (= (select (select |c_#memory_$Pointer$.base| .cse8) .cse9) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_1|) (not (= .cse8 0)) (= |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_1| (select (select |c_#memory_$Pointer$.offset| .cse8) .cse9)))))))) is different from true [2022-11-19 08:18:56,345 WARN L859 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_2| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_2| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_2|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_2|)) (.cse2 (+ .cse0 8))) (and (not (= .cse0 0)) (= (select (select |c_#memory_$Pointer$.base| .cse1) .cse2) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_2|) (= (select (select |c_#memory_$Pointer$.offset| .cse1) .cse2) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_2|))))) (not (= |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_2| 0)))) (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_2| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_2| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_2|)) (.cse4 (+ (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_2|) 8))) (and (= (select (select |c_#memory_$Pointer$.base| .cse3) .cse4) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_2|) (not (= .cse3 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse3) .cse4) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_2|)))) (not (= |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_2| 0)))) (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_2| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_2| Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_2|)) (.cse6 (+ (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_2|) 8))) (and (= (select (select |c_#memory_$Pointer$.base| .cse5) .cse6) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_2|) (not (= .cse5 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse5) .cse6) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_2|)))) (not (= |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_2| 0)))) (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_2| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_2| Int)) (let ((.cse7 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_2|))) (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_2|)) (.cse9 (+ .cse7 8))) (and (not (= .cse7 0)) (= (select (select |c_#memory_$Pointer$.base| .cse8) .cse9) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_2|) (= (select (select |c_#memory_$Pointer$.offset| .cse8) .cse9) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_2|))))) (not (= |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_2| 0))))) is different from true [2022-11-19 08:19:02,401 WARN L859 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_3| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_3| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_3|) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_3|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_3|) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_3|)) (.cse2 (+ .cse0 8))) (and (not (= .cse0 0)) (= |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_3| (select (select |c_#memory_$Pointer$.offset| .cse1) .cse2)) (= (select (select |c_#memory_$Pointer$.base| .cse1) .cse2) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_3|))))) (not (= |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_3| 0)))) (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_3| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_3| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_3|) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_3|)) (.cse4 (+ (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_3|) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_3|) 8))) (and (not (= .cse3 0)) (= |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_3| (select (select |c_#memory_$Pointer$.offset| .cse3) .cse4)) (= (select (select |c_#memory_$Pointer$.base| .cse3) .cse4) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_3|)))) (not (= |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_3| 0)))) (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_3| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_3| Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_3|) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_3|))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_3|) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_3|)) (.cse7 (+ .cse5 8))) (and (not (= .cse5 0)) (= |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_3| (select (select |c_#memory_$Pointer$.offset| .cse6) .cse7)) (= (select (select |c_#memory_$Pointer$.base| .cse6) .cse7) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_3|))))) (not (= |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_3| 0)))) (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_3| Int)) (and (not (= |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_3| 0)) (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_3| Int)) (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_3|) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_3|)) (.cse9 (+ (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_3|) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_3|) 8))) (and (not (= .cse8 0)) (= |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_3| (select (select |c_#memory_$Pointer$.offset| .cse8) .cse9)) (= (select (select |c_#memory_$Pointer$.base| .cse8) .cse9) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_3|))))))) is different from true [2022-11-19 08:19:05,728 WARN L859 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_3| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_3| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_3|) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_3|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_3|) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_3|)) (.cse2 (+ .cse0 8))) (and (not (= .cse0 0)) (= |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_3| (select (select |c_#memory_$Pointer$.offset| .cse1) .cse2)) (= (select (select |c_#memory_$Pointer$.base| .cse1) .cse2) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_3|))))) (not (= |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_3| 0)))) (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_3| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_3| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_3|) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_3|)) (.cse4 (+ (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_3|) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_3|) 8))) (and (not (= .cse3 0)) (= |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_3| (select (select |c_#memory_$Pointer$.offset| .cse3) .cse4)) (= (select (select |c_#memory_$Pointer$.base| .cse3) .cse4) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_3|)))) (not (= |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_3| 0)))) (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_3| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_3| Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_3|) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_3|))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_3|) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_3|)) (.cse7 (+ .cse5 8))) (and (not (= .cse5 0)) (= |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_3| (select (select |c_#memory_$Pointer$.offset| .cse6) .cse7)) (= (select (select |c_#memory_$Pointer$.base| .cse6) .cse7) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_3|))))) (not (= |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_3| 0)))) (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_3| Int)) (and (not (= |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_3| 0)) (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_3| Int)) (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_3|) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_3|)) (.cse9 (+ (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_3|) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_3|) 8))) (and (not (= .cse8 0)) (= |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_3| (select (select |c_#memory_$Pointer$.offset| .cse8) .cse9)) (= (select (select |c_#memory_$Pointer$.base| .cse8) .cse9) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_3|))))))) (let ((.cse12 (= |c_aws_linked_list_node_next_is_valid_#res| 0)) (.cse11 (= |c_aws_linked_list_node_next_is_valid_#in~node.offset| 0)) (.cse10 (= 0 |c_aws_linked_list_node_next_is_valid_#in~node.base|))) (or (and .cse10 .cse11 .cse12) (and (let ((.cse19 (select (select |c_#memory_$Pointer$.offset| |c_aws_linked_list_node_next_is_valid_#in~node.base|) |c_aws_linked_list_node_next_is_valid_#in~node.offset|))) (let ((.cse17 (select (select |c_#memory_$Pointer$.base| |c_aws_linked_list_node_next_is_valid_#in~node.base|) |c_aws_linked_list_node_next_is_valid_#in~node.offset|)) (.cse18 (+ 8 .cse19))) (let ((.cse13 (= |c_aws_linked_list_node_next_is_valid_#in~node.offset| (select (select |c_#memory_$Pointer$.offset| .cse17) .cse18))) (.cse14 (= .cse19 0)) (.cse15 (= .cse17 0)) (.cse16 (= (select (select |c_#memory_$Pointer$.base| .cse17) .cse18) |c_aws_linked_list_node_next_is_valid_#in~node.base|))) (or (and (or (not .cse13) (and .cse14 .cse15) (not .cse16)) .cse12) (and .cse13 (or (not .cse14) (not .cse15)) .cse16 (= |c_aws_linked_list_node_next_is_valid_#res| 1)))))) (or (not .cse11) (not .cse10)))))) is different from true [2022-11-19 08:19:10,500 INFO L321 Elim1Store]: treesize reduction 18, result has 97.7 percent of original size [2022-11-19 08:19:10,501 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 15 new quantified variables, introduced 45 case distinctions, treesize of input 273 treesize of output 934 [2022-11-19 08:19:10,979 INFO L217 Elim1Store]: Index analysis took 404 ms [2022-11-19 08:19:16,082 WARN L233 SmtUtils]: Spent 5.02s on a formula simplification. DAG size of input: 301 DAG size of output: 300 (called from [L 318] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-11-19 08:19:16,084 INFO L321 Elim1Store]: treesize reduction 3, result has 99.4 percent of original size [2022-11-19 08:19:16,085 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 15 new quantified variables, introduced 45 case distinctions, treesize of input 796 treesize of output 1116