./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 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d941d138-887d-4133-a4e8-a62faa2e3f04/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d941d138-887d-4133-a4e8-a62faa2e3f04/bin/utaipan-7li7fVZpFI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d941d138-887d-4133-a4e8-a62faa2e3f04/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d941d138-887d-4133-a4e8-a62faa2e3f04/bin/utaipan-7li7fVZpFI/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_d941d138-887d-4133-a4e8-a62faa2e3f04/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d941d138-887d-4133-a4e8-a62faa2e3f04/bin/utaipan-7li7fVZpFI --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-5e519f3 [2022-11-03 03:31:08,601 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 03:31:08,604 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 03:31:08,637 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 03:31:08,647 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 03:31:08,648 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 03:31:08,650 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 03:31:08,656 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 03:31:08,658 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 03:31:08,666 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 03:31:08,667 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 03:31:08,669 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 03:31:08,669 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 03:31:08,671 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 03:31:08,672 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 03:31:08,675 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 03:31:08,679 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 03:31:08,684 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 03:31:08,686 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 03:31:08,689 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 03:31:08,697 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 03:31:08,703 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 03:31:08,705 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 03:31:08,706 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 03:31:08,710 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 03:31:08,718 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 03:31:08,719 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 03:31:08,720 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 03:31:08,721 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 03:31:08,722 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 03:31:08,722 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 03:31:08,723 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 03:31:08,724 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 03:31:08,728 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 03:31:08,729 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 03:31:08,730 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 03:31:08,732 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 03:31:08,733 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 03:31:08,734 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 03:31:08,735 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 03:31:08,736 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 03:31:08,737 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d941d138-887d-4133-a4e8-a62faa2e3f04/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-64bit-Taipan_Default.epf [2022-11-03 03:31:08,785 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 03:31:08,785 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 03:31:08,786 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 03:31:08,787 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 03:31:08,788 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 03:31:08,788 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 03:31:08,788 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 03:31:08,789 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 03:31:08,789 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 03:31:08,789 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-03 03:31:08,791 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 03:31:08,791 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 03:31:08,791 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-03 03:31:08,791 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-03 03:31:08,792 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 03:31:08,792 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-03 03:31:08,792 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-03 03:31:08,793 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-03 03:31:08,793 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 03:31:08,794 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-03 03:31:08,794 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 03:31:08,794 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-03 03:31:08,795 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 03:31:08,795 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-03 03:31:08,795 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-03 03:31:08,795 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 03:31:08,796 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-03 03:31:08,796 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 03:31:08,796 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 03:31:08,797 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 03:31:08,797 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 03:31:08,797 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-03 03:31:08,798 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 03:31:08,799 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-03 03:31:08,799 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-03 03:31:08,799 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-03 03:31:08,800 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-03 03:31:08,800 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 03:31:08,800 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_d941d138-887d-4133-a4e8-a62faa2e3f04/bin/utaipan-7li7fVZpFI/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_d941d138-887d-4133-a4e8-a62faa2e3f04/bin/utaipan-7li7fVZpFI 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-03 03:31:09,126 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 03:31:09,158 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 03:31:09,163 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 03:31:09,164 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 03:31:09,165 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 03:31:09,167 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d941d138-887d-4133-a4e8-a62faa2e3f04/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/aws-c-common/aws_linked_list_prev_harness.i [2022-11-03 03:31:09,264 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d941d138-887d-4133-a4e8-a62faa2e3f04/bin/utaipan-7li7fVZpFI/data/4be916cc3/2f40b3a3351549d498dde02764c9e0c2/FLAG319c33dd4 [2022-11-03 03:31:10,278 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 03:31:10,279 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d941d138-887d-4133-a4e8-a62faa2e3f04/sv-benchmarks/c/aws-c-common/aws_linked_list_prev_harness.i [2022-11-03 03:31:10,316 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d941d138-887d-4133-a4e8-a62faa2e3f04/bin/utaipan-7li7fVZpFI/data/4be916cc3/2f40b3a3351549d498dde02764c9e0c2/FLAG319c33dd4 [2022-11-03 03:31:10,790 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d941d138-887d-4133-a4e8-a62faa2e3f04/bin/utaipan-7li7fVZpFI/data/4be916cc3/2f40b3a3351549d498dde02764c9e0c2 [2022-11-03 03:31:10,793 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 03:31:10,794 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 03:31:10,796 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 03:31:10,797 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 03:31:10,801 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 03:31:10,802 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 03:31:10" (1/1) ... [2022-11-03 03:31:10,803 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23e229bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:31:10, skipping insertion in model container [2022-11-03 03:31:10,803 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 03:31:10" (1/1) ... [2022-11-03 03:31:10,813 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 03:31:10,903 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 03:31:11,245 WARN L230 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_d941d138-887d-4133-a4e8-a62faa2e3f04/sv-benchmarks/c/aws-c-common/aws_linked_list_prev_harness.i[4494,4507] [2022-11-03 03:31:11,252 WARN L230 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_d941d138-887d-4133-a4e8-a62faa2e3f04/sv-benchmarks/c/aws-c-common/aws_linked_list_prev_harness.i[4554,4567] [2022-11-03 03:31:12,264 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-03 03:31:12,271 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-03 03:31:12,272 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-03 03:31:12,276 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-03 03:31:12,278 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-03 03:31:12,296 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-03 03:31:12,297 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-03 03:31:12,299 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-03 03:31:12,300 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-03 03:31:12,302 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-03 03:31:12,304 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-03 03:31:12,305 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-03 03:31:12,305 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-03 03:31:12,747 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-11-03 03:31:12,749 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-11-03 03:31:12,750 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-11-03 03:31:12,752 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-11-03 03:31:12,754 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-11-03 03:31:12,755 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-11-03 03:31:12,756 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-11-03 03:31:12,757 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-11-03 03:31:12,758 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-11-03 03:31:12,759 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-11-03 03:31:12,970 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-11-03 03:31:13,008 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 03:31:13,027 INFO L203 MainTranslator]: Completed pre-run [2022-11-03 03:31:13,045 WARN L230 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_d941d138-887d-4133-a4e8-a62faa2e3f04/sv-benchmarks/c/aws-c-common/aws_linked_list_prev_harness.i[4494,4507] [2022-11-03 03:31:13,046 WARN L230 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_d941d138-887d-4133-a4e8-a62faa2e3f04/sv-benchmarks/c/aws-c-common/aws_linked_list_prev_harness.i[4554,4567] [2022-11-03 03:31:13,101 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-03 03:31:13,102 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-03 03:31:13,102 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-03 03:31:13,103 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-03 03:31:13,104 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-03 03:31:13,114 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-03 03:31:13,114 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-03 03:31:13,116 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-03 03:31:13,117 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-03 03:31:13,119 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-03 03:31:13,120 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-03 03:31:13,120 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-03 03:31:13,121 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-03 03:31:13,206 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-11-03 03:31:13,207 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-11-03 03:31:13,208 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-11-03 03:31:13,210 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-11-03 03:31:13,211 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-11-03 03:31:13,212 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-11-03 03:31:13,212 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-11-03 03:31:13,213 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-11-03 03:31:13,213 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-11-03 03:31:13,214 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-11-03 03:31:13,243 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-11-03 03:31:13,291 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 03:31:13,508 INFO L208 MainTranslator]: Completed translation [2022-11-03 03:31:13,509 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:31:13 WrapperNode [2022-11-03 03:31:13,510 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 03:31:13,512 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-03 03:31:13,513 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-03 03:31:13,513 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-03 03:31:13,522 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:31:13" (1/1) ... [2022-11-03 03:31:13,635 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:31:13" (1/1) ... [2022-11-03 03:31:13,690 INFO L138 Inliner]: procedures = 679, calls = 1039, calls flagged for inlining = 50, calls inlined = 4, statements flattened = 58 [2022-11-03 03:31:13,690 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-03 03:31:13,692 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-03 03:31:13,692 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-03 03:31:13,692 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-03 03:31:13,704 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:31:13" (1/1) ... [2022-11-03 03:31:13,704 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:31:13" (1/1) ... [2022-11-03 03:31:13,717 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:31:13" (1/1) ... [2022-11-03 03:31:13,718 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:31:13" (1/1) ... [2022-11-03 03:31:13,735 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:31:13" (1/1) ... [2022-11-03 03:31:13,753 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:31:13" (1/1) ... [2022-11-03 03:31:13,756 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:31:13" (1/1) ... [2022-11-03 03:31:13,773 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:31:13" (1/1) ... [2022-11-03 03:31:13,777 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-03 03:31:13,779 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-03 03:31:13,779 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-03 03:31:13,779 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-03 03:31:13,780 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:31:13" (1/1) ... [2022-11-03 03:31:13,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 03:31:13,809 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d941d138-887d-4133-a4e8-a62faa2e3f04/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:31:13,829 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d941d138-887d-4133-a4e8-a62faa2e3f04/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-03 03:31:13,863 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d941d138-887d-4133-a4e8-a62faa2e3f04/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-03 03:31:13,889 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-03 03:31:13,890 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-03 03:31:13,891 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-03 03:31:13,891 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2022-11-03 03:31:13,892 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2022-11-03 03:31:13,892 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-03 03:31:13,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-03 03:31:13,893 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-03 03:31:13,893 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-03 03:31:13,894 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-11-03 03:31:13,894 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-11-03 03:31:13,895 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-03 03:31:13,895 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-03 03:31:13,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-03 03:31:13,895 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_prev_is_valid [2022-11-03 03:31:13,895 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_prev_is_valid [2022-11-03 03:31:13,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-03 03:31:14,202 INFO L235 CfgBuilder]: Building ICFG [2022-11-03 03:31:14,205 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-03 03:31:14,520 INFO L276 CfgBuilder]: Performing block encoding [2022-11-03 03:31:14,669 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-03 03:31:14,670 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-03 03:31:14,673 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 03:31:14 BoogieIcfgContainer [2022-11-03 03:31:14,673 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-03 03:31:14,684 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-03 03:31:14,684 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-03 03:31:14,691 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-03 03:31:14,691 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 03:31:10" (1/3) ... [2022-11-03 03:31:14,692 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16fdbb9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 03:31:14, skipping insertion in model container [2022-11-03 03:31:14,693 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:31:13" (2/3) ... [2022-11-03 03:31:14,694 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16fdbb9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 03:31:14, skipping insertion in model container [2022-11-03 03:31:14,695 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 03:31:14" (3/3) ... [2022-11-03 03:31:14,698 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_linked_list_prev_harness.i [2022-11-03 03:31:14,724 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-03 03:31:14,724 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-03 03:31:14,796 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 03:31:14,807 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;@1d28f89f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 03:31:14,807 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-03 03:31:14,813 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-03 03:31:14,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-03 03:31:14,823 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:31:14,824 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:31:14,826 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:31:14,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:31:14,835 INFO L85 PathProgramCache]: Analyzing trace with hash 846701445, now seen corresponding path program 1 times [2022-11-03 03:31:14,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:31:14,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647786508] [2022-11-03 03:31:14,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:31:14,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:31:15,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:31:18,062 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-03 03:31:18,063 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:31:18,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647786508] [2022-11-03 03:31:18,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647786508] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:31:18,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [470147904] [2022-11-03 03:31:18,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:31:18,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:31:18,066 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d941d138-887d-4133-a4e8-a62faa2e3f04/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:31:18,071 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d941d138-887d-4133-a4e8-a62faa2e3f04/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:31:18,076 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d941d138-887d-4133-a4e8-a62faa2e3f04/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-03 03:31:18,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:31:18,259 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 62 conjunts are in the unsatisfiable core [2022-11-03 03:31:18,271 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:31:18,378 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:31:18,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:31:18,392 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:31:18,402 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:31:21,174 INFO L356 Elim1Store]: treesize reduction 3, result has 98.7 percent of original size [2022-11-03 03:31:21,175 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 9 new quantified variables, introduced 15 case distinctions, treesize of input 156 treesize of output 334 [2022-11-03 03:31:21,506 INFO L356 Elim1Store]: treesize reduction 12, result has 92.9 percent of original size [2022-11-03 03:31:21,507 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 9 new quantified variables, introduced 15 case distinctions, treesize of input 319 treesize of output 376 [2022-11-03 03:31:47,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-03 03:31:47,273 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 03:31:47,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [470147904] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:31:47,274 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 03:31:47,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [11] total 20 [2022-11-03 03:31:47,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131321645] [2022-11-03 03:31:47,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:31:47,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-03 03:31:47,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:31:47,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-03 03:31:47,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2022-11-03 03:31:47,322 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-03 03:31:47,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:31:47,535 INFO L93 Difference]: Finished difference Result 66 states and 83 transitions. [2022-11-03 03:31:47,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-03 03:31:47,538 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-03 03:31:47,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:31:47,548 INFO L225 Difference]: With dead ends: 66 [2022-11-03 03:31:47,548 INFO L226 Difference]: Without dead ends: 39 [2022-11-03 03:31:47,565 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=68, Invalid=352, Unknown=0, NotChecked=0, Total=420 [2022-11-03 03:31:47,574 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 7 mSDsluCounter, 220 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-03 03:31:47,576 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-03 03:31:47,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-11-03 03:31:47,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-11-03 03:31:47,626 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-03 03:31:47,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2022-11-03 03:31:47,631 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 15 [2022-11-03 03:31:47,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:31:47,632 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2022-11-03 03:31:47,632 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-03 03:31:47,633 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-11-03 03:31:47,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-03 03:31:47,634 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:31:47,635 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-03 03:31:47,680 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d941d138-887d-4133-a4e8-a62faa2e3f04/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-03 03:31:47,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d941d138-887d-4133-a4e8-a62faa2e3f04/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2022-11-03 03:31:47,852 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:31:47,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:31:47,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1013014958, now seen corresponding path program 1 times [2022-11-03 03:31:47,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:31:47,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274453523] [2022-11-03 03:31:47,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:31:47,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:31:47,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:31:50,033 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-03 03:31:50,033 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:31:50,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274453523] [2022-11-03 03:31:50,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274453523] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:31:50,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1874656194] [2022-11-03 03:31:50,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:31:50,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:31:50,035 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d941d138-887d-4133-a4e8-a62faa2e3f04/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:31:50,036 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d941d138-887d-4133-a4e8-a62faa2e3f04/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:31:50,055 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d941d138-887d-4133-a4e8-a62faa2e3f04/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-03 03:31:50,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:31:50,208 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 85 conjunts are in the unsatisfiable core [2022-11-03 03:31:50,233 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:31:50,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:31:50,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:31:50,270 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 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-03 03:31:50,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:31:50,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:31:50,291 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 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-03 03:31:50,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:31:50,300 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 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-03 03:31:50,309 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2022-11-03 03:31:50,316 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 12 [2022-11-03 03:31:50,334 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2022-11-03 03:31:50,339 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:31:50,347 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 12 treesize of output 11 [2022-11-03 03:31:50,358 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 12 treesize of output 11 [2022-11-03 03:31:52,592 INFO L356 Elim1Store]: treesize reduction 69, result has 25.0 percent of original size [2022-11-03 03:31:52,592 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 301 treesize of output 173 [2022-11-03 03:31:52,639 INFO L356 Elim1Store]: treesize reduction 74, result has 8.6 percent of original size [2022-11-03 03:31:52,639 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 5 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 114 treesize of output 60 [2022-11-03 03:31:52,722 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-03 03:31:52,722 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:32:03,394 WARN L234 SmtUtils]: Spent 8.08s on a formula simplification that was a NOOP. DAG size: 43 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 03:32:05,432 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-03 03:32:05,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1874656194] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:32:05,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [360468643] [2022-11-03 03:32:05,457 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2022-11-03 03:32:05,457 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 03:32:05,462 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 03:32:05,468 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 03:32:05,468 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 03:32:05,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:32:05,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:32:05,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:32:05,556 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:32:05,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:32:05,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:32:05,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:32:05,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:32:05,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:32:05,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:32:05,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:32:05,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:32:05,588 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:32:05,621 INFO L356 Elim1Store]: treesize reduction 26, result has 49.0 percent of original size [2022-11-03 03:32:05,622 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:32:05,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:32:05,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:32:05,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:32:05,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:32:05,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:32:05,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:32:05,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:32:05,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:32:05,659 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:32:05,697 INFO L356 Elim1Store]: treesize reduction 26, result has 49.0 percent of original size [2022-11-03 03:32:05,698 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:32:05,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:32:05,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:32:05,851 INFO L356 Elim1Store]: treesize reduction 106, result has 33.8 percent of original size [2022-11-03 03:32:05,852 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 35 treesize of output 79 [2022-11-03 03:32:05,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:32:05,893 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 9 [2022-11-03 03:32:05,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:32:05,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:32:06,090 INFO L356 Elim1Store]: treesize reduction 174, result has 25.0 percent of original size [2022-11-03 03:32:06,091 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 19 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 15 case distinctions, treesize of input 54 treesize of output 101 [2022-11-03 03:32:07,379 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 19 for LOIs [2022-11-03 03:32:07,388 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 19 for LOIs [2022-11-03 03:32:07,391 INFO L197 IcfgInterpreter]: Interpreting procedure aws_linked_list_node_prev_is_valid with input of size 34 for LOIs [2022-11-03 03:32:07,485 INFO L197 IcfgInterpreter]: Interpreting procedure aws_linked_list_node_next_is_valid with input of size 15 for LOIs [2022-11-03 03:32:07,549 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 03:32:10,373 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '428#(and (<= 0 |__VERIFIER_assert_#in~cond|) (= (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) (= 5 |~#s_can_fail_allocator_static~0.base|) (<= |__VERIFIER_assert_#in~cond| 1) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-11-03 03:32:10,374 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 03:32:10,374 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:32:10,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 11] total 31 [2022-11-03 03:32:10,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616832155] [2022-11-03 03:32:10,375 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:32:10,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-03 03:32:10,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:32:10,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-03 03:32:10,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=2160, Unknown=0, NotChecked=0, Total=2352 [2022-11-03 03:32:10,378 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-03 03:32:11,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:32:11,135 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2022-11-03 03:32:11,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-03 03:32:11,136 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-03 03:32:11,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:32:11,137 INFO L225 Difference]: With dead ends: 47 [2022-11-03 03:32:11,137 INFO L226 Difference]: Without dead ends: 45 [2022-11-03 03:32:11,139 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 30 SyntacticMatches, 6 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 897 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=236, Invalid=2734, Unknown=0, NotChecked=0, Total=2970 [2022-11-03 03:32:11,140 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 10 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 72 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 03:32:11,142 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 348 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 166 Invalid, 0 Unknown, 72 Unchecked, 0.2s Time] [2022-11-03 03:32:11,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-11-03 03:32:11,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-11-03 03:32:11,156 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-03 03:32:11,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2022-11-03 03:32:11,160 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 24 [2022-11-03 03:32:11,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:32:11,161 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2022-11-03 03:32:11,161 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-03 03:32:11,162 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2022-11-03 03:32:11,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-03 03:32:11,163 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:32:11,163 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-03 03:32:11,210 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d941d138-887d-4133-a4e8-a62faa2e3f04/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-03 03:32:11,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d941d138-887d-4133-a4e8-a62faa2e3f04/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:32:11,391 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:32:11,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:32:11,392 INFO L85 PathProgramCache]: Analyzing trace with hash 615597899, now seen corresponding path program 1 times [2022-11-03 03:32:11,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:32:11,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940708322] [2022-11-03 03:32:11,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:32:11,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:32:11,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:32:11,686 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-03 03:32:11,686 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:32:11,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940708322] [2022-11-03 03:32:11,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940708322] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:32:11,687 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:32:11,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-03 03:32:11,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412222680] [2022-11-03 03:32:11,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:32:11,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 03:32:11,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:32:11,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 03:32:11,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-03 03:32:11,690 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-03 03:32:11,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:32:11,857 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2022-11-03 03:32:11,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 03:32:11,859 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-03 03:32:11,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:32:11,860 INFO L225 Difference]: With dead ends: 51 [2022-11-03 03:32:11,860 INFO L226 Difference]: Without dead ends: 49 [2022-11-03 03:32:11,861 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-03 03:32:11,862 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 8 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:32:11,862 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 108 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 03:32:11,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-11-03 03:32:11,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2022-11-03 03:32:11,883 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-03 03:32:11,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2022-11-03 03:32:11,889 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 30 [2022-11-03 03:32:11,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:32:11,890 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2022-11-03 03:32:11,891 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-03 03:32:11,891 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2022-11-03 03:32:11,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-03 03:32:11,893 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:32:11,894 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-03 03:32:11,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-03 03:32:11,895 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:32:11,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:32:11,895 INFO L85 PathProgramCache]: Analyzing trace with hash 584950545, now seen corresponding path program 1 times [2022-11-03 03:32:11,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:32:11,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380912599] [2022-11-03 03:32:11,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:32:11,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:32:11,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:32:14,622 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-03 03:32:14,622 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:32:14,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380912599] [2022-11-03 03:32:14,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380912599] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:32:14,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1816407074] [2022-11-03 03:32:14,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:32:14,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:32:14,623 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d941d138-887d-4133-a4e8-a62faa2e3f04/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:32:14,625 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d941d138-887d-4133-a4e8-a62faa2e3f04/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:32:14,629 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d941d138-887d-4133-a4e8-a62faa2e3f04/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-03 03:32:14,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:32:14,835 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 90 conjunts are in the unsatisfiable core [2022-11-03 03:32:14,844 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:32:14,864 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 16 [2022-11-03 03:32:14,871 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 16 [2022-11-03 03:32:14,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:32:14,880 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 18 [2022-11-03 03:32:14,888 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:32:14,894 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 18 [2022-11-03 03:32:19,633 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:32:19,633 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 9 new quantified variables, introduced 15 case distinctions, treesize of input 175 treesize of output 292 [2022-11-03 03:32:19,898 INFO L356 Elim1Store]: treesize reduction 36, result has 78.7 percent of original size [2022-11-03 03:32:19,899 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 9 new quantified variables, introduced 15 case distinctions, treesize of input 234 treesize of output 291 [2022-11-03 03:32:23,707 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 13 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-03 03:32:23,707 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:32:28,941 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-03 03:32:28,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1816407074] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:32:28,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [622794905] [2022-11-03 03:32:28,945 INFO L159 IcfgInterpreter]: Started Sifa with 26 locations of interest [2022-11-03 03:32:28,945 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 03:32:28,946 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 03:32:28,946 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 03:32:28,946 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 03:32:28,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:32:29,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:32:29,141 INFO L356 Elim1Store]: treesize reduction 174, result has 25.0 percent of original size [2022-11-03 03:32:29,141 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 19 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 15 case distinctions, treesize of input 54 treesize of output 101 [2022-11-03 03:32:29,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:32:29,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:32:29,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:32:29,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:32:29,167 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 21 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-03 03:32:29,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:32:29,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:32:29,200 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 14 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-03 03:32:29,225 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 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-03 03:32:29,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:32:29,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:32:29,255 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 23 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 51 [2022-11-03 03:32:29,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:32:29,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:32:29,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:32:29,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:32:29,294 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 21 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-03 03:32:30,250 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 15 for LOIs [2022-11-03 03:32:30,257 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 19 for LOIs [2022-11-03 03:32:30,259 INFO L197 IcfgInterpreter]: Interpreting procedure aws_linked_list_node_prev_is_valid with input of size 34 for LOIs [2022-11-03 03:32:30,353 INFO L197 IcfgInterpreter]: Interpreting procedure aws_linked_list_node_next_is_valid with input of size 15 for LOIs [2022-11-03 03:32:30,428 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 03:32:34,096 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1021#(and (= (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) (= 5 |~#s_can_fail_allocator_static~0.base|) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-11-03 03:32:34,096 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 03:32:34,096 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:32:34,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18, 16] total 43 [2022-11-03 03:32:34,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857477635] [2022-11-03 03:32:34,097 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:32:34,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-11-03 03:32:34,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:32:34,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-11-03 03:32:34,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=338, Invalid=3822, Unknown=0, NotChecked=0, Total=4160 [2022-11-03 03:32:34,101 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand has 43 states, 27 states have (on average 2.0) internal successors, (54), 36 states have internal predecessors, (54), 20 states have call successors, (26), 5 states have call predecessors, (26), 13 states have return successors, (24), 15 states have call predecessors, (24), 18 states have call successors, (24) [2022-11-03 03:32:35,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:32:35,350 INFO L93 Difference]: Finished difference Result 53 states and 54 transitions. [2022-11-03 03:32:35,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-03 03:32:35,351 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 27 states have (on average 2.0) internal successors, (54), 36 states have internal predecessors, (54), 20 states have call successors, (26), 5 states have call predecessors, (26), 13 states have return successors, (24), 15 states have call predecessors, (24), 18 states have call successors, (24) Word has length 39 [2022-11-03 03:32:35,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:32:35,353 INFO L225 Difference]: With dead ends: 53 [2022-11-03 03:32:35,353 INFO L226 Difference]: Without dead ends: 51 [2022-11-03 03:32:35,356 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 56 SyntacticMatches, 14 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2056 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=453, Invalid=4949, Unknown=0, NotChecked=0, Total=5402 [2022-11-03 03:32:35,357 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 38 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 46 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 03:32:35,357 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 206 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 216 Invalid, 0 Unknown, 46 Unchecked, 0.3s Time] [2022-11-03 03:32:35,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-11-03 03:32:35,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-11-03 03:32:35,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 11 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-03 03:32:35,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2022-11-03 03:32:35,372 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 39 [2022-11-03 03:32:35,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:32:35,373 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2022-11-03 03:32:35,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 27 states have (on average 2.0) internal successors, (54), 36 states have internal predecessors, (54), 20 states have call successors, (26), 5 states have call predecessors, (26), 13 states have return successors, (24), 15 states have call predecessors, (24), 18 states have call successors, (24) [2022-11-03 03:32:35,374 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2022-11-03 03:32:35,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-03 03:32:35,375 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:32:35,375 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-03 03:32:35,421 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d941d138-887d-4133-a4e8-a62faa2e3f04/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-03 03:32:35,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d941d138-887d-4133-a4e8-a62faa2e3f04/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:32:35,604 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:32:35,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:32:35,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1736704596, now seen corresponding path program 1 times [2022-11-03 03:32:35,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:32:35,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331825005] [2022-11-03 03:32:35,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:32:35,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:32:35,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:32:37,351 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-03 03:32:37,352 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:32:37,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331825005] [2022-11-03 03:32:37,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331825005] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:32:37,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1942439872] [2022-11-03 03:32:37,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:32:37,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:32:37,353 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d941d138-887d-4133-a4e8-a62faa2e3f04/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:32:37,358 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d941d138-887d-4133-a4e8-a62faa2e3f04/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:32:37,375 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d941d138-887d-4133-a4e8-a62faa2e3f04/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-03 03:32:37,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:32:37,598 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 105 conjunts are in the unsatisfiable core [2022-11-03 03:32:37,610 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:32:37,639 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 16 [2022-11-03 03:32:37,649 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 36 treesize of output 28 [2022-11-03 03:32:37,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:32:37,657 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 43 treesize of output 23 [2022-11-03 03:32:37,673 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 03:32:37,677 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 60 [2022-11-03 03:32:41,364 INFO L356 Elim1Store]: treesize reduction 53, result has 27.4 percent of original size [2022-11-03 03:32:41,365 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 10 case distinctions, treesize of input 282 treesize of output 151 [2022-11-03 03:32:41,400 INFO L356 Elim1Store]: treesize reduction 74, result has 3.9 percent of original size [2022-11-03 03:32:41,401 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 7 case distinctions, treesize of input 97 treesize of output 51 [2022-11-03 03:32:41,488 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 16 proven. 8 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-03 03:32:41,488 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:33:02,930 WARN L234 SmtUtils]: Spent 14.75s on a formula simplification that was a NOOP. DAG size: 42 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 03:33:19,705 WARN L234 SmtUtils]: Spent 16.18s on a formula simplification that was a NOOP. DAG size: 46 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 03:33:21,005 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 24 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-03 03:33:21,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1942439872] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:33:21,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1477499635] [2022-11-03 03:33:21,009 INFO L159 IcfgInterpreter]: Started Sifa with 29 locations of interest [2022-11-03 03:33:21,009 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 03:33:21,010 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 03:33:21,010 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 03:33:21,010 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 03:33:21,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:33:21,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:33:21,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:33:21,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:33:21,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:33:21,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:33:21,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:33:21,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:33:21,073 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:33:21,109 INFO L356 Elim1Store]: treesize reduction 26, result has 49.0 percent of original size [2022-11-03 03:33:21,109 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:33:21,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:33:21,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:33:21,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:33:21,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:33:21,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:33:21,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:33:21,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:33:21,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:33:21,146 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:33:21,182 INFO L356 Elim1Store]: treesize reduction 26, result has 49.0 percent of original size [2022-11-03 03:33:21,184 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:33:21,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:33:21,214 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 9 [2022-11-03 03:33:21,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:33:21,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:33:21,337 INFO L356 Elim1Store]: treesize reduction 106, result has 33.8 percent of original size [2022-11-03 03:33:21,338 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 35 treesize of output 79 [2022-11-03 03:33:21,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:33:21,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:33:21,526 INFO L356 Elim1Store]: treesize reduction 174, result has 25.0 percent of original size [2022-11-03 03:33:21,526 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 19 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 15 case distinctions, treesize of input 54 treesize of output 101 [2022-11-03 03:33:21,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:33:21,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:33:21,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:33:21,562 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 14 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-03 03:33:22,785 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 15 for LOIs [2022-11-03 03:33:22,792 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 19 for LOIs [2022-11-03 03:33:22,795 INFO L197 IcfgInterpreter]: Interpreting procedure aws_linked_list_node_prev_is_valid with input of size 34 for LOIs [2022-11-03 03:33:22,890 INFO L197 IcfgInterpreter]: Interpreting procedure aws_linked_list_node_next_is_valid with input of size 15 for LOIs [2022-11-03 03:33:22,951 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 03:33:27,047 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1535#(and (= (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) (= 5 |~#s_can_fail_allocator_static~0.base|) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-11-03 03:33:27,047 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 03:33:27,047 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:33:27,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 17, 17] total 40 [2022-11-03 03:33:27,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855704914] [2022-11-03 03:33:27,048 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:33:27,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-11-03 03:33:27,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:33:27,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-11-03 03:33:27,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=270, Invalid=3761, Unknown=1, NotChecked=0, Total=4032 [2022-11-03 03:33:27,052 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand has 40 states, 25 states have (on average 2.16) internal successors, (54), 31 states have internal predecessors, (54), 17 states have call successors, (31), 5 states have call predecessors, (31), 12 states have return successors, (30), 15 states have call predecessors, (30), 15 states have call successors, (30) [2022-11-03 03:33:28,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:33:28,648 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2022-11-03 03:33:28,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-03 03:33:28,649 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 25 states have (on average 2.16) internal successors, (54), 31 states have internal predecessors, (54), 17 states have call successors, (31), 5 states have call predecessors, (31), 12 states have return successors, (30), 15 states have call predecessors, (30), 15 states have call successors, (30) Word has length 48 [2022-11-03 03:33:28,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:33:28,651 INFO L225 Difference]: With dead ends: 57 [2022-11-03 03:33:28,651 INFO L226 Difference]: Without dead ends: 55 [2022-11-03 03:33:28,653 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 75 SyntacticMatches, 17 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1822 ImplicationChecksByTransitivity, 41.9s TimeCoverageRelationStatistics Valid=387, Invalid=5014, Unknown=1, NotChecked=0, Total=5402 [2022-11-03 03:33:28,654 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 30 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 83 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 03:33:28,655 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 141 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 228 Invalid, 0 Unknown, 83 Unchecked, 0.4s Time] [2022-11-03 03:33:28,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-11-03 03:33:28,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-11-03 03:33:28,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 31 states have (on average 1.032258064516129) internal successors, (32), 31 states have internal predecessors, (32), 12 states have call successors, (12), 12 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-03 03:33:28,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2022-11-03 03:33:28,676 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 48 [2022-11-03 03:33:28,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:33:28,677 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2022-11-03 03:33:28,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 25 states have (on average 2.16) internal successors, (54), 31 states have internal predecessors, (54), 17 states have call successors, (31), 5 states have call predecessors, (31), 12 states have return successors, (30), 15 states have call predecessors, (30), 15 states have call successors, (30) [2022-11-03 03:33:28,677 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2022-11-03 03:33:28,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-11-03 03:33:28,678 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:33:28,679 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 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, 1, 1, 1] [2022-11-03 03:33:28,705 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d941d138-887d-4133-a4e8-a62faa2e3f04/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-03 03:33:28,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d941d138-887d-4133-a4e8-a62faa2e3f04/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:33:28,883 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:33:28,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:33:28,884 INFO L85 PathProgramCache]: Analyzing trace with hash 2033998271, now seen corresponding path program 1 times [2022-11-03 03:33:28,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:33:28,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175241672] [2022-11-03 03:33:28,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:33:28,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:33:29,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:33:29,860 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-11-03 03:33:29,861 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:33:29,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175241672] [2022-11-03 03:33:29,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175241672] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:33:29,861 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:33:29,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-03 03:33:29,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386741415] [2022-11-03 03:33:29,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:33:29,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-03 03:33:29,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:33:29,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-03 03:33:29,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-11-03 03:33:29,863 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand has 10 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 6 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 4 states have call predecessors, (11), 6 states have call successors, (11) [2022-11-03 03:33:30,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:33:30,157 INFO L93 Difference]: Finished difference Result 57 states and 56 transitions. [2022-11-03 03:33:30,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 03:33:30,158 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 6 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 4 states have call predecessors, (11), 6 states have call successors, (11) Word has length 54 [2022-11-03 03:33:30,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:33:30,159 INFO L225 Difference]: With dead ends: 57 [2022-11-03 03:33:30,159 INFO L226 Difference]: Without dead ends: 0 [2022-11-03 03:33:30,160 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2022-11-03 03:33:30,160 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 18 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 03:33:30,161 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 113 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 03:33:30,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-03 03:33:30,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-03 03:33:30,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:33:30,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-03 03:33:30,162 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 54 [2022-11-03 03:33:30,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:33:30,162 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-03 03:33:30,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 6 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 4 states have call predecessors, (11), 6 states have call successors, (11) [2022-11-03 03:33:30,163 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-03 03:33:30,163 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-03 03:33:30,166 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-03 03:33:30,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-03 03:33:30,169 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-03 03:33:31,562 INFO L899 garLoopResultBuilder]: For program point aws_linked_list_node_next_is_validEXIT(lines 4717 4721) no Hoare annotation was computed. [2022-11-03 03:33:31,562 INFO L902 garLoopResultBuilder]: At program point aws_linked_list_node_next_is_validENTRY(lines 4717 4721) the Hoare annotation is: true [2022-11-03 03:33:31,562 INFO L899 garLoopResultBuilder]: For program point aws_linked_list_node_prev_is_validEXIT(lines 4728 4732) no Hoare annotation was computed. [2022-11-03 03:33:31,563 INFO L902 garLoopResultBuilder]: At program point aws_linked_list_node_prev_is_validENTRY(lines 4728 4732) the Hoare annotation is: true [2022-11-03 03:33:31,563 INFO L902 garLoopResultBuilder]: At program point L7391-1(line 7391) the Hoare annotation is: true [2022-11-03 03:33:31,563 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-03 03:33:31,563 INFO L895 garLoopResultBuilder]: At program point L7391(line 7391) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 8))) (and (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) .cse0) |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset|) (= |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base|) (not (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|)) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) .cse0)) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset|) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset|))) [2022-11-03 03:33:31,563 INFO L899 garLoopResultBuilder]: For program point L7389-2(line 7389) no Hoare annotation was computed. [2022-11-03 03:33:31,564 INFO L895 garLoopResultBuilder]: At program point L7389-1(line 7389) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 8))) (and (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) .cse0) |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_harness_#t~ret675#1| 1) (exists ((|ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base| Int)) (let ((.cse1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) 8)) (.cse2 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) 8))) (and (= |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base| .cse1) (not (= .cse1 |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|)) (= .cse2 0) (= (select (select |#memory_$Pointer$.base| .cse1) .cse2) |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (<= 2 |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (= .cse2 |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset|) (<= 2 .cse1) (= (select (select |#memory_$Pointer$.offset| .cse1) .cse2) 0)))) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset|) (= |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base|) (not (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|)) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) .cse0)) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset|) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset|))) [2022-11-03 03:33:31,564 INFO L895 garLoopResultBuilder]: At program point L7389(line 7389) the Hoare annotation is: (let ((.cse2 (+ |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| 8))) (let ((.cse1 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) .cse2)) (.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) .cse2))) (and (= |ULTIMATE.start_aws_linked_list_prev_~node#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (= (select (select |#memory_$Pointer$.base| .cse0) .cse1) |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset|) (<= 2 |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (= .cse1 0) (= |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base|) (not (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|)) (= |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base| .cse0) (= (select (select |#memory_$Pointer$.offset| .cse0) 0) |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset|) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (+ |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 8))) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset|) (<= 2 .cse0) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base| .cse0) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset|)))) [2022-11-03 03:33:31,564 INFO L895 garLoopResultBuilder]: At program point L4852-1(line 4852) the Hoare annotation is: (let ((.cse3 (+ |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 8))) (let ((.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) .cse3)) (.cse2 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) .cse3)) (.cse1 (+ |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| 8))) (and (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (= .cse0 |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset|) (<= 2 |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (<= 1 |ULTIMATE.start_aws_linked_list_prev_#t~ret337#1|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) .cse1) 0) (= (select (select |#memory_$Pointer$.base| .cse0) .cse2) |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (not (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|)) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| (select (select |#memory_$Pointer$.offset| .cse0) .cse2)) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset| .cse2) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset|) (<= 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) .cse1)) (<= |ULTIMATE.start_aws_linked_list_prev_#t~ret337#1| 1)))) [2022-11-03 03:33:31,564 INFO L899 garLoopResultBuilder]: For program point L4852-2(line 4852) no Hoare annotation was computed. [2022-11-03 03:33:31,565 INFO L895 garLoopResultBuilder]: At program point L4852(line 4852) the Hoare annotation is: (let ((.cse3 (+ |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 8))) (let ((.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) .cse3)) (.cse2 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) .cse3)) (.cse1 (+ |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| 8))) (and (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (= .cse0 |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset|) (<= 2 |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) .cse1) 0) (= (select (select |#memory_$Pointer$.base| .cse0) .cse2) |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (not (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|)) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| (select (select |#memory_$Pointer$.offset| .cse0) .cse2)) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset| .cse2) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset|) (<= 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) .cse1))))) [2022-11-03 03:33:31,565 INFO L895 garLoopResultBuilder]: At program point L7390(line 7390) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 8))) (and (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) .cse0) |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base|) (exists ((|ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base| Int)) (let ((.cse1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) 8)) (.cse2 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) 8))) (and (= |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base| .cse1) (not (= .cse1 |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|)) (= .cse2 0) (= (select (select |#memory_$Pointer$.base| .cse1) .cse2) |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (<= 2 |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (= .cse2 |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset|) (<= 2 .cse1) (= (select (select |#memory_$Pointer$.offset| .cse1) .cse2) 0)))) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset|) (= |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base|) (not (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|)) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) .cse0)) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset|) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset|))) [2022-11-03 03:33:31,565 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-03 03:33:31,565 INFO L899 garLoopResultBuilder]: For program point L7390-2(line 7390) no Hoare annotation was computed. [2022-11-03 03:33:31,565 INFO L895 garLoopResultBuilder]: At program point L7390-1(line 7390) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 8))) (and (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (<= 1 |ULTIMATE.start_aws_linked_list_prev_harness_#t~ret676#1|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) .cse0) |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset|) (<= |ULTIMATE.start_aws_linked_list_prev_harness_#t~ret676#1| 1) (= |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base|) (not (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|)) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) .cse0)) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset|) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset|))) [2022-11-03 03:33:31,566 INFO L895 garLoopResultBuilder]: At program point L4851(line 4851) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 8))) (and (= |ULTIMATE.start_aws_linked_list_prev_~node#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) .cse0) |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base|) |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset|) |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 0) (exists ((|ULTIMATE.start_aws_linked_list_prev_~node#1.base| Int)) (let ((.cse1 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|))) (let ((.cse2 (select .cse1 8)) (.cse3 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|))) (and (= (select .cse1 .cse0) |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base|) (= (select (select |#memory_$Pointer$.offset| .cse2) 0) 0) (<= 2 |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (= (select (select |#memory_$Pointer$.base| .cse2) 0) |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (= (select .cse3 8) 0) (not (= .cse2 0)) (not (= .cse2 |ULTIMATE.start_aws_linked_list_prev_~node#1.base|)) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset| (select .cse3 .cse0)))))) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset|) (<= 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (+ |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| 8))))) [2022-11-03 03:33:31,566 INFO L895 garLoopResultBuilder]: At program point L4851-1(line 4851) the Hoare annotation is: (let ((.cse1 (+ |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| 8)) (.cse4 (+ |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 8))) (let ((.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) .cse4)) (.cse2 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) .cse4)) (.cse3 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) .cse1))) (and (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (= .cse0 |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base|) (<= |ULTIMATE.start_aws_linked_list_prev_#t~ret336#1| 1) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset|) (<= 2 |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) .cse1) 0) (= (select (select |#memory_$Pointer$.base| .cse0) .cse2) |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (not (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|)) (= (select (select |#memory_$Pointer$.offset| .cse3) 0) |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset|) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset| .cse2) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset|) (<= 2 .cse3) (<= 1 |ULTIMATE.start_aws_linked_list_prev_#t~ret336#1|)))) [2022-11-03 03:33:31,566 INFO L895 garLoopResultBuilder]: At program point L4853(line 4853) the Hoare annotation is: (let ((.cse4 (+ |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| 8)) (.cse5 (+ |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 8))) (let ((.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) .cse5)) (.cse1 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) .cse4)) (.cse2 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) .cse5)) (.cse3 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) .cse4))) (and (= |ULTIMATE.start_aws_linked_list_prev_~node#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (= .cse0 |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset|) (<= 2 |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (= .cse1 0) (= (select (select |#memory_$Pointer$.base| .cse0) .cse2) |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (not (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|)) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base| |ULTIMATE.start_aws_linked_list_prev_#t~mem338#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| (select (select |#memory_$Pointer$.offset| .cse0) .cse2)) (= |ULTIMATE.start_aws_linked_list_prev_#t~mem338#1.offset| .cse1) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset| .cse2) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset|) (<= 2 .cse3) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base| .cse3)))) [2022-11-03 03:33:31,567 INFO L895 garLoopResultBuilder]: At program point L4853-1(line 4853) the Hoare annotation is: (let ((.cse3 (+ |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| 8))) (let ((.cse2 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) .cse3)) (.cse0 (+ |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 8)) (.cse1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) .cse3))) (and (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset| |ULTIMATE.start_aws_linked_list_prev_#t~mem338#1.offset|) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) .cse0) |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base|) (= (select (select |#memory_$Pointer$.base| .cse1) .cse2) |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset|) (<= 2 |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (= .cse2 0) (not (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|)) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base| |ULTIMATE.start_aws_linked_list_prev_#t~mem338#1.base|) (= (select (select |#memory_$Pointer$.offset| .cse1) 0) |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset|) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) .cse0)) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset|) (<= 2 .cse1) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base| .cse1)))) [2022-11-03 03:33:31,567 INFO L899 garLoopResultBuilder]: For program point L4849-2(line 4849) no Hoare annotation was computed. [2022-11-03 03:33:31,567 INFO L895 garLoopResultBuilder]: At program point L4849(line 4849) the Hoare annotation is: (let ((.cse3 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|)) (.cse4 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|)) (.cse5 (+ |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 8))) (let ((.cse0 (select .cse4 .cse5)) (.cse2 (select .cse3 .cse5)) (.cse1 (select .cse4 8))) (and (= |ULTIMATE.start_aws_linked_list_prev_~node#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (= .cse0 |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset|) (<= 2 |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 0) (= (select (select |#memory_$Pointer$.base| .cse1) 0) |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| .cse2) (= (select .cse3 8) 0) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| (select (select |#memory_$Pointer$.offset| .cse0) .cse2)) (not (= .cse1 |ULTIMATE.start_aws_linked_list_prev_~node#1.base|)) (<= 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (+ |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| 8)))))) [2022-11-03 03:33:31,567 INFO L899 garLoopResultBuilder]: For program point L4851-2(line 4851) no Hoare annotation was computed. [2022-11-03 03:33:31,567 INFO L895 garLoopResultBuilder]: At program point L4849-1(line 4849) the Hoare annotation is: (let ((.cse0 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|))) (let ((.cse1 (+ |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 8)) (.cse3 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|)) (.cse2 (select .cse0 8)) (.cse4 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (+ |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| 8)))) (and (= |ULTIMATE.start_aws_linked_list_prev_~node#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (= (select .cse0 .cse1) |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset|) (<= 2 |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 0) (= (select (select |#memory_$Pointer$.base| .cse2) 0) |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| (select .cse3 .cse1)) (= (select .cse3 8) 0) (= (select (select |#memory_$Pointer$.offset| .cse4) 0) |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset|) (not (= .cse2 |ULTIMATE.start_aws_linked_list_prev_~node#1.base|)) (= |ULTIMATE.start_aws_linked_list_prev_#t~ret334#1| 1) (<= 2 .cse4)))) [2022-11-03 03:33:31,568 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 210 212) the Hoare annotation is: true [2022-11-03 03:33:31,568 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 210 212) no Hoare annotation was computed. [2022-11-03 03:33:31,568 INFO L899 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2022-11-03 03:33:31,568 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 222 224) the Hoare annotation is: true [2022-11-03 03:33:31,568 INFO L899 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2022-11-03 03:33:31,568 INFO L899 garLoopResultBuilder]: For program point L223-3(lines 222 224) no Hoare annotation was computed. [2022-11-03 03:33:31,568 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 222 224) no Hoare annotation was computed. [2022-11-03 03:33:31,568 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2022-11-03 03:33:31,574 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2022-11-03 03:33:31,576 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-03 03:33:31,593 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 03:33:31,596 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 03:33:31,596 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 03:33:31,597 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 03:33:31,598 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 03:33:31,599 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 03:33:31,599 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 03:33:31,599 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 03:33:31,600 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 03:33:31,600 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 03:33:31,611 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 03:33:31,611 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 03:33:31,612 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 03:33:31,612 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 03:33:31,612 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 03:33:31,614 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 03:33:31,614 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 03:33:31,614 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 03:33:31,615 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 03:33:31,615 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 03:33:31,621 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.11 03:33:31 BoogieIcfgContainer [2022-11-03 03:33:31,621 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-03 03:33:31,622 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-03 03:33:31,622 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-03 03:33:31,622 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-03 03:33:31,623 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 03:31:14" (3/4) ... [2022-11-03 03:33:31,626 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-03 03:33:31,633 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_linked_list_node_next_is_valid [2022-11-03 03:33:31,633 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_linked_list_node_prev_is_valid [2022-11-03 03:33:31,634 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2022-11-03 03:33:31,634 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2022-11-03 03:33:31,641 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 30 nodes and edges [2022-11-03 03:33:31,642 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2022-11-03 03:33:31,642 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-11-03 03:33:31,643 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-03 03:33:31,697 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d941d138-887d-4133-a4e8-a62faa2e3f04/bin/utaipan-7li7fVZpFI/witness.graphml [2022-11-03 03:33:31,697 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-03 03:33:31,698 INFO L158 Benchmark]: Toolchain (without parser) took 140903.76ms. Allocated memory was 100.7MB in the beginning and 394.3MB in the end (delta: 293.6MB). Free memory was 64.5MB in the beginning and 312.1MB in the end (delta: -247.5MB). Peak memory consumption was 45.9MB. Max. memory is 16.1GB. [2022-11-03 03:33:31,699 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 100.7MB. Free memory is still 56.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-03 03:33:31,699 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2713.99ms. Allocated memory was 100.7MB in the beginning and 142.6MB in the end (delta: 41.9MB). Free memory was 64.2MB in the beginning and 83.2MB in the end (delta: -18.9MB). Peak memory consumption was 49.4MB. Max. memory is 16.1GB. [2022-11-03 03:33:31,699 INFO L158 Benchmark]: Boogie Procedure Inliner took 178.20ms. Allocated memory is still 142.6MB. Free memory was 83.2MB in the beginning and 78.2MB in the end (delta: 4.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-03 03:33:31,700 INFO L158 Benchmark]: Boogie Preprocessor took 85.92ms. Allocated memory is still 142.6MB. Free memory was 78.2MB in the beginning and 75.4MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-03 03:33:31,701 INFO L158 Benchmark]: RCFGBuilder took 894.65ms. Allocated memory was 142.6MB in the beginning and 188.7MB in the end (delta: 46.1MB). Free memory was 75.4MB in the beginning and 135.7MB in the end (delta: -60.3MB). Peak memory consumption was 18.8MB. Max. memory is 16.1GB. [2022-11-03 03:33:31,701 INFO L158 Benchmark]: TraceAbstraction took 136937.28ms. Allocated memory was 188.7MB in the beginning and 394.3MB in the end (delta: 205.5MB). Free memory was 135.7MB in the beginning and 315.2MB in the end (delta: -179.5MB). Peak memory consumption was 229.4MB. Max. memory is 16.1GB. [2022-11-03 03:33:31,702 INFO L158 Benchmark]: Witness Printer took 75.66ms. Allocated memory is still 394.3MB. Free memory was 315.2MB in the beginning and 312.1MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-03 03:33:31,704 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.32ms. Allocated memory is still 100.7MB. Free memory is still 56.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2713.99ms. Allocated memory was 100.7MB in the beginning and 142.6MB in the end (delta: 41.9MB). Free memory was 64.2MB in the beginning and 83.2MB in the end (delta: -18.9MB). Peak memory consumption was 49.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 178.20ms. Allocated memory is still 142.6MB. Free memory was 83.2MB in the beginning and 78.2MB in the end (delta: 4.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 85.92ms. Allocated memory is still 142.6MB. Free memory was 78.2MB in the beginning and 75.4MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 894.65ms. Allocated memory was 142.6MB in the beginning and 188.7MB in the end (delta: 46.1MB). Free memory was 75.4MB in the beginning and 135.7MB in the end (delta: -60.3MB). Peak memory consumption was 18.8MB. Max. memory is 16.1GB. * TraceAbstraction took 136937.28ms. Allocated memory was 188.7MB in the beginning and 394.3MB in the end (delta: 205.5MB). Free memory was 135.7MB in the beginning and 315.2MB in the end (delta: -179.5MB). Peak memory consumption was 229.4MB. Max. memory is 16.1GB. * Witness Printer took 75.66ms. Allocated memory is still 394.3MB. Free memory was 315.2MB in the beginning and 312.1MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 33 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 136.8s, OverallIterations: 6, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 121 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 111 mSDsluCounter, 1144 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 233 IncrementalHoareTripleChecker+Unchecked, 1081 mSDsCounter, 56 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 906 IncrementalHoareTripleChecker+Invalid, 1195 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 56 mSolverCounterUnsat, 153 mSDtfsCounter, 906 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 443 GetRequests, 171 SyntacticMatches, 39 SemanticMatches, 233 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4857 ImplicationChecksByTransitivity, 64.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=55occurred in iteration=5, InterpolantAutomatonStates: 93, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 18 LocationsWithAnnotation, 34 PreInvPairs, 44 NumberOfFragments, 1211 HoareAnnotationTreeSize, 34 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 18 FomulaSimplificationsInter, 4604 FormulaSimplificationTreeSizeReductionInter, 1.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 112.1s InterpolantComputationTime, 336 NumberOfCodeBlocks, 336 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 434 ConstructedInterpolants, 79 QuantifiedInterpolants, 16072 SizeOfPredicates, 131 NumberOfNonLiveVariables, 944 ConjunctsInSsa, 342 ConjunctsInUnsatCore, 13 InterpolantComputations, 3 PerfectInterpolantSequences, 226/276 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 7391]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4853]: Loop Invariant [2022-11-03 03:33:31,721 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 03:33:31,721 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 03:33:31,723 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 03:33:31,723 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 03:33:31,730 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 03:33:31,730 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 03:33:31,730 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 03:33:31,730 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 03:33:31,731 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 03:33:31,731 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 03:33:31,732 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 03:33:31,733 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 03:33:31,733 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 03:33:31,733 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 03:33:31,733 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 03:33:31,734 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 03:33:31,734 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 03:33:31,734 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-03 03:33:31,734 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-03 03:33:31,735 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: (((((((((((((rval == node->prev && node == node) && #memory_$Pointer$[node][node + 8] == before) && #memory_$Pointer$[#memory_$Pointer$[node][node + 8]][#memory_$Pointer$[node][node + 8]] == node) && node == 0) && node == node) && 2 <= node) && #memory_$Pointer$[node][node + 8] == 0) && !(before == node)) && rval == node->prev) && #memory_$Pointer$[#memory_$Pointer$[node][node + 8]][0] == node) && rval == #memory_$Pointer$[node][node + 8]) && before == rval) && 2 <= #memory_$Pointer$[node][node + 8]) && rval == #memory_$Pointer$[node][node + 8] RESULT: Ultimate proved your program to be correct! [2022-11-03 03:33:31,789 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d941d138-887d-4133-a4e8-a62faa2e3f04/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE