./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/aws-c-common/aws_linked_list_begin_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cf1a7837 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebb4a0e1-4e06-4801-9789-3a8264e576be/bin/utaipan-verify-NcY6lQBIFX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebb4a0e1-4e06-4801-9789-3a8264e576be/bin/utaipan-verify-NcY6lQBIFX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebb4a0e1-4e06-4801-9789-3a8264e576be/bin/utaipan-verify-NcY6lQBIFX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebb4a0e1-4e06-4801-9789-3a8264e576be/bin/utaipan-verify-NcY6lQBIFX/config/TaipanReach.xml -i ../../sv-benchmarks/c/aws-c-common/aws_linked_list_begin_harness.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebb4a0e1-4e06-4801-9789-3a8264e576be/bin/utaipan-verify-NcY6lQBIFX/config/svcomp-Reach-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebb4a0e1-4e06-4801-9789-3a8264e576be/bin/utaipan-verify-NcY6lQBIFX --witnessprinter.witness.filename witness --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 b8488bc4b38d88c79bc520e9824284003ed2f71ce856a53cf11e7fc61dbeef4b --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 01:02:31,311 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 01:02:31,430 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebb4a0e1-4e06-4801-9789-3a8264e576be/bin/utaipan-verify-NcY6lQBIFX/config/svcomp-Reach-64bit-Taipan_Default.epf [2023-11-12 01:02:31,440 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 01:02:31,441 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 01:02:31,491 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 01:02:31,492 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 01:02:31,492 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 01:02:31,493 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 01:02:31,500 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 01:02:31,501 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-12 01:02:31,502 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-12 01:02:31,503 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-12 01:02:31,504 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-12 01:02:31,505 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-12 01:02:31,505 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-12 01:02:31,506 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-12 01:02:31,506 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-12 01:02:31,507 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-12 01:02:31,507 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-12 01:02:31,508 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-12 01:02:31,508 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-12 01:02:31,510 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 01:02:31,510 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-12 01:02:31,510 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-12 01:02:31,511 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 01:02:31,511 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-12 01:02:31,512 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 01:02:31,512 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-12 01:02:31,513 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-12 01:02:31,514 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 01:02:31,514 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 01:02:31,515 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 01:02:31,515 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 01:02:31,515 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 01:02:31,516 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 01:02:31,516 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-12 01:02:31,516 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-12 01:02:31,516 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-12 01:02:31,517 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-12 01:02:31,517 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-12 01:02:31,517 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 01:02:31,518 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_ebb4a0e1-4e06-4801-9789-3a8264e576be/bin/utaipan-verify-NcY6lQBIFX/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_ebb4a0e1-4e06-4801-9789-3a8264e576be/bin/utaipan-verify-NcY6lQBIFX Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> b8488bc4b38d88c79bc520e9824284003ed2f71ce856a53cf11e7fc61dbeef4b [2023-11-12 01:02:31,806 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 01:02:31,838 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 01:02:31,841 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 01:02:31,842 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 01:02:31,843 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 01:02:31,845 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebb4a0e1-4e06-4801-9789-3a8264e576be/bin/utaipan-verify-NcY6lQBIFX/../../sv-benchmarks/c/aws-c-common/aws_linked_list_begin_harness.i [2023-11-12 01:02:35,053 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 01:02:35,589 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 01:02:35,591 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebb4a0e1-4e06-4801-9789-3a8264e576be/sv-benchmarks/c/aws-c-common/aws_linked_list_begin_harness.i [2023-11-12 01:02:35,625 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebb4a0e1-4e06-4801-9789-3a8264e576be/bin/utaipan-verify-NcY6lQBIFX/data/2da7dbf2d/b1d34124aab347f49f5935ca0b48566b/FLAGfc081760a [2023-11-12 01:02:35,641 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebb4a0e1-4e06-4801-9789-3a8264e576be/bin/utaipan-verify-NcY6lQBIFX/data/2da7dbf2d/b1d34124aab347f49f5935ca0b48566b [2023-11-12 01:02:35,644 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 01:02:35,646 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 01:02:35,647 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 01:02:35,647 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 01:02:35,653 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 01:02:35,656 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:02:35" (1/1) ... [2023-11-12 01:02:35,658 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4087e8a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:02:35, skipping insertion in model container [2023-11-12 01:02:35,658 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:02:35" (1/1) ... [2023-11-12 01:02:35,789 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 01:02:36,096 WARN L240 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_ebb4a0e1-4e06-4801-9789-3a8264e576be/sv-benchmarks/c/aws-c-common/aws_linked_list_begin_harness.i[4495,4508] [2023-11-12 01:02:36,105 WARN L240 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_ebb4a0e1-4e06-4801-9789-3a8264e576be/sv-benchmarks/c/aws-c-common/aws_linked_list_begin_harness.i[4555,4568] [2023-11-12 01:02:37,260 WARN L1577 CHandler]: Possible shadowing of function index [2023-11-12 01:02:37,264 WARN L1577 CHandler]: Possible shadowing of function index [2023-11-12 01:02:37,265 WARN L1577 CHandler]: Possible shadowing of function index [2023-11-12 01:02:37,266 WARN L1577 CHandler]: Possible shadowing of function index [2023-11-12 01:02:37,267 WARN L1577 CHandler]: Possible shadowing of function index [2023-11-12 01:02:37,282 WARN L1577 CHandler]: Possible shadowing of function index [2023-11-12 01:02:37,283 WARN L1577 CHandler]: Possible shadowing of function index [2023-11-12 01:02:37,285 WARN L1577 CHandler]: Possible shadowing of function index [2023-11-12 01:02:37,286 WARN L1577 CHandler]: Possible shadowing of function index [2023-11-12 01:02:37,309 WARN L1577 CHandler]: Possible shadowing of function index [2023-11-12 01:02:37,314 WARN L1577 CHandler]: Possible shadowing of function index [2023-11-12 01:02:37,317 WARN L1577 CHandler]: Possible shadowing of function index [2023-11-12 01:02:37,318 WARN L1577 CHandler]: Possible shadowing of function index [2023-11-12 01:02:37,681 WARN L635 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-12 01:02:37,685 WARN L635 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-12 01:02:37,686 WARN L635 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-12 01:02:37,688 WARN L635 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-12 01:02:37,690 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-12 01:02:37,691 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-12 01:02:37,692 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-12 01:02:37,693 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-12 01:02:37,705 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-12 01:02:37,706 WARN L635 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-12 01:02:37,954 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 01:02:37,975 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 01:02:38,001 WARN L240 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_ebb4a0e1-4e06-4801-9789-3a8264e576be/sv-benchmarks/c/aws-c-common/aws_linked_list_begin_harness.i[4495,4508] [2023-11-12 01:02:38,003 WARN L240 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_ebb4a0e1-4e06-4801-9789-3a8264e576be/sv-benchmarks/c/aws-c-common/aws_linked_list_begin_harness.i[4555,4568] [2023-11-12 01:02:38,068 WARN L1577 CHandler]: Possible shadowing of function index [2023-11-12 01:02:38,071 WARN L1577 CHandler]: Possible shadowing of function index [2023-11-12 01:02:38,071 WARN L1577 CHandler]: Possible shadowing of function index [2023-11-12 01:02:38,072 WARN L1577 CHandler]: Possible shadowing of function index [2023-11-12 01:02:38,073 WARN L1577 CHandler]: Possible shadowing of function index [2023-11-12 01:02:38,084 WARN L1577 CHandler]: Possible shadowing of function index [2023-11-12 01:02:38,084 WARN L1577 CHandler]: Possible shadowing of function index [2023-11-12 01:02:38,085 WARN L1577 CHandler]: Possible shadowing of function index [2023-11-12 01:02:38,086 WARN L1577 CHandler]: Possible shadowing of function index [2023-11-12 01:02:38,087 WARN L1577 CHandler]: Possible shadowing of function index [2023-11-12 01:02:38,088 WARN L1577 CHandler]: Possible shadowing of function index [2023-11-12 01:02:38,089 WARN L1577 CHandler]: Possible shadowing of function index [2023-11-12 01:02:38,089 WARN L1577 CHandler]: Possible shadowing of function index [2023-11-12 01:02:38,130 WARN L635 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-12 01:02:38,131 WARN L635 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-12 01:02:38,132 WARN L635 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-12 01:02:38,133 WARN L635 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-12 01:02:38,134 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-12 01:02:38,135 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-12 01:02:38,135 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-12 01:02:38,136 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-12 01:02:38,137 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-12 01:02:38,137 WARN L635 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-12 01:02:38,194 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 01:02:38,511 WARN L672 CHandler]: The function __atomic_fetch_or is called, but not defined or handled by StandardFunctionHandler. [2023-11-12 01:02:38,511 WARN L672 CHandler]: The function __atomic_fetch_sub is called, but not defined or handled by StandardFunctionHandler. [2023-11-12 01:02:38,511 WARN L672 CHandler]: The function __atomic_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-12 01:02:38,512 WARN L672 CHandler]: The function __atomic_fetch_xor is called, but not defined or handled by StandardFunctionHandler. [2023-11-12 01:02:38,512 WARN L672 CHandler]: The function htons is called, but not defined or handled by StandardFunctionHandler. [2023-11-12 01:02:38,512 WARN L672 CHandler]: The function ntohl is called, but not defined or handled by StandardFunctionHandler. [2023-11-12 01:02:38,512 WARN L672 CHandler]: The function __atomic_compare_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-12 01:02:38,513 WARN L672 CHandler]: The function __atomic_fetch_add is called, but not defined or handled by StandardFunctionHandler. [2023-11-12 01:02:38,513 WARN L672 CHandler]: The function htonl is called, but not defined or handled by StandardFunctionHandler. [2023-11-12 01:02:38,514 WARN L672 CHandler]: The function __atomic_store_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-12 01:02:38,514 WARN L672 CHandler]: The function ntohs is called, but not defined or handled by StandardFunctionHandler. [2023-11-12 01:02:38,514 WARN L672 CHandler]: The function __atomic_load_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-12 01:02:38,514 WARN L672 CHandler]: The function memcmp is called, but not defined or handled by StandardFunctionHandler. [2023-11-12 01:02:38,515 WARN L672 CHandler]: The function __atomic_thread_fence is called, but not defined or handled by StandardFunctionHandler. [2023-11-12 01:02:38,515 WARN L672 CHandler]: The function __atomic_fetch_and is called, but not defined or handled by StandardFunctionHandler. [2023-11-12 01:02:38,515 WARN L672 CHandler]: The function aws_array_list_ensure_capacity is called, but not defined or handled by StandardFunctionHandler. [2023-11-12 01:02:38,523 INFO L206 MainTranslator]: Completed translation [2023-11-12 01:02:38,524 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:02:38 WrapperNode [2023-11-12 01:02:38,524 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 01:02:38,526 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 01:02:38,527 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 01:02:38,527 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 01:02:38,534 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:02:38" (1/1) ... [2023-11-12 01:02:38,642 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:02:38" (1/1) ... [2023-11-12 01:02:38,690 INFO L138 Inliner]: procedures = 678, calls = 1041, calls flagged for inlining = 52, calls inlined = 6, statements flattened = 141 [2023-11-12 01:02:38,691 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 01:02:38,692 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 01:02:38,692 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 01:02:38,692 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 01:02:38,703 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:02:38" (1/1) ... [2023-11-12 01:02:38,703 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:02:38" (1/1) ... [2023-11-12 01:02:38,708 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:02:38" (1/1) ... [2023-11-12 01:02:38,709 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:02:38" (1/1) ... [2023-11-12 01:02:38,726 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:02:38" (1/1) ... [2023-11-12 01:02:38,742 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:02:38" (1/1) ... [2023-11-12 01:02:38,748 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:02:38" (1/1) ... [2023-11-12 01:02:38,762 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:02:38" (1/1) ... [2023-11-12 01:02:38,768 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 01:02:38,772 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 01:02:38,772 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 01:02:38,773 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 01:02:38,773 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:02:38" (1/1) ... [2023-11-12 01:02:38,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 01:02:38,791 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebb4a0e1-4e06-4801-9789-3a8264e576be/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 01:02:38,811 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebb4a0e1-4e06-4801-9789-3a8264e576be/bin/utaipan-verify-NcY6lQBIFX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-12 01:02:38,824 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebb4a0e1-4e06-4801-9789-3a8264e576be/bin/utaipan-verify-NcY6lQBIFX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-12 01:02:38,855 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-12 01:02:38,855 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-11-12 01:02:38,855 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-11-12 01:02:38,855 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2023-11-12 01:02:38,855 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2023-11-12 01:02:38,856 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-12 01:02:38,856 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_is_valid [2023-11-12 01:02:38,856 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_is_valid [2023-11-12 01:02:38,856 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-12 01:02:38,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-12 01:02:38,856 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 01:02:38,856 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 01:02:38,857 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-12 01:02:38,857 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-12 01:02:38,857 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-12 01:02:38,857 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-12 01:02:38,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-12 01:02:38,857 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2023-11-12 01:02:38,857 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2023-11-12 01:02:38,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-12 01:02:39,089 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 01:02:39,092 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 01:02:39,405 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 01:02:39,539 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 01:02:39,540 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-12 01:02:39,543 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:02:39 BoogieIcfgContainer [2023-11-12 01:02:39,543 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 01:02:39,547 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-12 01:02:39,547 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-12 01:02:39,556 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-12 01:02:39,557 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 01:02:35" (1/3) ... [2023-11-12 01:02:39,557 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49910f2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:02:39, skipping insertion in model container [2023-11-12 01:02:39,558 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:02:38" (2/3) ... [2023-11-12 01:02:39,561 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49910f2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:02:39, skipping insertion in model container [2023-11-12 01:02:39,561 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:02:39" (3/3) ... [2023-11-12 01:02:39,563 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_linked_list_begin_harness.i [2023-11-12 01:02:39,583 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-12 01:02:39,583 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-12 01:02:39,645 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-12 01:02:39,651 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=LoopHeads, 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;@2556dd21, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-12 01:02:39,651 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-12 01:02:39,655 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 27 states have internal predecessors, (34), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2023-11-12 01:02:39,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-11-12 01:02:39,665 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 01:02:39,665 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2023-11-12 01:02:39,666 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 01:02:39,671 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 01:02:39,671 INFO L85 PathProgramCache]: Analyzing trace with hash -1901947457, now seen corresponding path program 1 times [2023-11-12 01:02:39,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 01:02:39,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356424827] [2023-11-12 01:02:39,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 01:02:39,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 01:02:40,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 01:02:40,530 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-12 01:02:40,531 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 01:02:40,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356424827] [2023-11-12 01:02:40,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356424827] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 01:02:40,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2146814829] [2023-11-12 01:02:40,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 01:02:40,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 01:02:40,533 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebb4a0e1-4e06-4801-9789-3a8264e576be/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 01:02:40,537 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebb4a0e1-4e06-4801-9789-3a8264e576be/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 01:02:40,541 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebb4a0e1-4e06-4801-9789-3a8264e576be/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-12 01:02:40,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 01:02:40,797 INFO L262 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 65 conjunts are in the unsatisfiable core [2023-11-12 01:02:40,810 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 01:02:41,055 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2023-11-12 01:02:41,077 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2023-11-12 01:02:41,225 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35 [2023-11-12 01:02:41,252 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 21 [2023-11-12 01:02:43,224 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-12 01:02:43,224 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-12 01:02:43,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2146814829] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 01:02:43,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-12 01:02:43,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [5] total 11 [2023-11-12 01:02:43,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102994990] [2023-11-12 01:02:43,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 01:02:43,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-12 01:02:43,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 01:02:43,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-12 01:02:43,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-11-12 01:02:43,276 INFO L87 Difference]: Start difference. First operand has 46 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 27 states have internal predecessors, (34), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-12 01:02:43,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 01:02:43,824 INFO L93 Difference]: Finished difference Result 124 states and 173 transitions. [2023-11-12 01:02:43,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-12 01:02:43,826 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) Word has length 37 [2023-11-12 01:02:43,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 01:02:43,836 INFO L225 Difference]: With dead ends: 124 [2023-11-12 01:02:43,837 INFO L226 Difference]: Without dead ends: 83 [2023-11-12 01:02:43,840 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-11-12 01:02:43,844 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 44 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-12 01:02:43,845 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 161 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-12 01:02:43,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2023-11-12 01:02:43,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2023-11-12 01:02:43,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 46 states have (on average 1.3043478260869565) internal successors, (60), 49 states have internal predecessors, (60), 24 states have call successors, (24), 9 states have call predecessors, (24), 10 states have return successors, (24), 22 states have call predecessors, (24), 22 states have call successors, (24) [2023-11-12 01:02:43,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 108 transitions. [2023-11-12 01:02:43,902 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 108 transitions. Word has length 37 [2023-11-12 01:02:43,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 01:02:43,903 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 108 transitions. [2023-11-12 01:02:43,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-12 01:02:43,903 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 108 transitions. [2023-11-12 01:02:43,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-11-12 01:02:43,907 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 01:02:43,907 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2023-11-12 01:02:43,919 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebb4a0e1-4e06-4801-9789-3a8264e576be/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-12 01:02:44,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebb4a0e1-4e06-4801-9789-3a8264e576be/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2023-11-12 01:02:44,114 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 01:02:44,115 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 01:02:44,115 INFO L85 PathProgramCache]: Analyzing trace with hash -25443914, now seen corresponding path program 1 times [2023-11-12 01:02:44,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 01:02:44,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827445393] [2023-11-12 01:02:44,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 01:02:44,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 01:02:44,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 01:02:44,485 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-11-12 01:02:44,485 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 01:02:44,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827445393] [2023-11-12 01:02:44,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827445393] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 01:02:44,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1529207839] [2023-11-12 01:02:44,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 01:02:44,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 01:02:44,487 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebb4a0e1-4e06-4801-9789-3a8264e576be/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 01:02:44,488 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebb4a0e1-4e06-4801-9789-3a8264e576be/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 01:02:44,513 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebb4a0e1-4e06-4801-9789-3a8264e576be/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-12 01:02:44,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 01:02:44,704 INFO L262 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 81 conjunts are in the unsatisfiable core [2023-11-12 01:02:44,717 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 01:02:44,840 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2023-11-12 01:02:44,855 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2023-11-12 01:02:44,994 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 36 [2023-11-12 01:02:45,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 01:02:45,003 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2023-11-12 01:02:45,021 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 36 [2023-11-12 01:02:45,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 01:02:45,032 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2023-11-12 01:02:45,201 INFO L322 Elim1Store]: treesize reduction 96, result has 23.2 percent of original size [2023-11-12 01:02:45,201 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 142 treesize of output 93 [2023-11-12 01:02:45,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 01:02:45,226 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 21 [2023-11-12 01:02:48,121 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-12 01:02:48,122 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 01:02:56,744 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 01:02:56,745 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 388 treesize of output 473 [2023-11-12 01:02:58,224 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 01:02:58,225 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 364 treesize of output 449 [2023-11-12 01:02:58,521 INFO L322 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2023-11-12 01:02:58,522 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 58 [2023-11-12 01:02:58,674 INFO L322 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2023-11-12 01:02:58,675 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 58 [2023-11-12 01:02:58,866 INFO L322 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2023-11-12 01:02:58,867 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 58 [2023-11-12 01:02:58,996 INFO L322 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2023-11-12 01:02:58,996 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 58 [2023-11-12 01:02:59,157 INFO L322 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2023-11-12 01:02:59,157 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 58 [2023-11-12 01:02:59,353 INFO L217 Elim1Store]: Index analysis took 142 ms [2023-11-12 01:02:59,372 INFO L322 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2023-11-12 01:02:59,373 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 58 [2023-11-12 01:02:59,461 INFO L322 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2023-11-12 01:02:59,462 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 49 treesize of output 62 [2023-11-12 01:02:59,544 INFO L322 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2023-11-12 01:02:59,545 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 49 treesize of output 62 [2023-11-12 01:02:59,692 INFO L322 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2023-11-12 01:02:59,693 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 49 treesize of output 62 [2023-11-12 01:02:59,813 INFO L322 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2023-11-12 01:02:59,813 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 49 treesize of output 62 [2023-11-12 01:03:00,061 INFO L322 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2023-11-12 01:03:00,061 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 49 treesize of output 62 [2023-11-12 01:03:00,190 INFO L322 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2023-11-12 01:03:00,191 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 49 treesize of output 62 [2023-11-12 01:03:00,929 INFO L322 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2023-11-12 01:03:00,930 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 24 [2023-11-12 01:03:01,008 INFO L322 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2023-11-12 01:03:01,009 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 24 [2023-11-12 01:03:01,043 INFO L322 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2023-11-12 01:03:01,044 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 24 [2023-11-12 01:03:01,825 INFO L322 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2023-11-12 01:03:01,826 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 24 [2023-11-12 01:03:01,863 INFO L322 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2023-11-12 01:03:01,863 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 24 [2023-11-12 01:03:02,085 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-12 01:03:02,085 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 4 [2023-11-12 01:03:02,435 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-12 01:03:02,436 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 4 [2023-11-12 01:03:02,458 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-12 01:03:02,458 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 4 [2023-11-12 01:03:02,544 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 21 treesize of output 4 [2023-11-12 01:03:02,557 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-12 01:03:02,557 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 4 [2023-11-12 01:03:02,697 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-12 01:03:02,698 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 4 [2023-11-12 01:03:02,952 INFO L322 Elim1Store]: treesize reduction 73, result has 7.6 percent of original size [2023-11-12 01:03:02,953 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 124 treesize of output 109 [2023-11-12 01:03:03,307 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-12 01:03:03,308 INFO L351 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 14 treesize of output 1 [2023-11-12 01:03:03,391 INFO L322 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2023-11-12 01:03:03,392 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 35 [2023-11-12 01:03:03,527 INFO L322 Elim1Store]: treesize reduction 73, result has 7.6 percent of original size [2023-11-12 01:03:03,528 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 230 treesize of output 189 [2023-11-12 01:03:03,753 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-12 01:03:03,754 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 1 [2023-11-12 01:03:03,947 INFO L322 Elim1Store]: treesize reduction 73, result has 7.6 percent of original size [2023-11-12 01:03:03,948 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 230 treesize of output 189 [2023-11-12 01:03:04,717 INFO L322 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2023-11-12 01:03:04,718 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 35 [2023-11-12 01:03:04,806 INFO L322 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2023-11-12 01:03:04,806 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 19 [2023-11-12 01:03:05,362 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-11-12 01:03:05,768 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-11-12 01:03:05,779 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-11-12 01:03:06,641 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse9 (+ |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset| 24)) (.cse5 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|)) (.cse23 (+ |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset| 16)) (.cse1 (+ |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 24)) (.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|)) (.cse7 (+ |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset| 8))) (and (forall ((v_ArrVal_178 Int)) (or (< |c_#StackHeapBarrier| (+ v_ArrVal_178 1)) (forall ((v_arrayElimArr_7 (Array Int Int))) (or (not (= (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse2 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| v_ArrVal_178)) v_ArrVal_178 v_arrayElimArr_7))) (store .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_ArrVal_178))) |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base|) |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset|) 0)) (forall ((v_subst_4 Int)) (or (not (= |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (select v_arrayElimArr_7 v_subst_4))) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_44 Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~node~0#1.offset_16| Int) (v_DerPreprocessor_45 Int) (v_subst_6 Int) (v_subst_5 Int) (v_ArrVal_182 Int) (v_DerPreprocessor_4 Int) (v_DerPreprocessor_3 Int)) (let ((.cse3 (store (store (store v_arrayElimArr_6 v_subst_4 (select (store (store v_arrayElimArr_6 v_subst_4 v_DerPreprocessor_44) v_subst_5 v_DerPreprocessor_45) v_subst_4)) v_subst_5 v_DerPreprocessor_3) v_subst_6 v_DerPreprocessor_4))) (or (not (= v_DerPreprocessor_3 (select .cse3 v_subst_5))) (not (= (select (select (let ((.cse4 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse5 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~node~0#1.offset_16|)) v_ArrVal_178 v_arrayElimArr_6))) (store .cse4 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse4 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_ArrVal_182))) |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base|) |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset|) 0)) (not (= .cse3 (store (store v_arrayElimArr_6 v_subst_4 (select .cse3 v_subst_4)) v_subst_6 v_DerPreprocessor_4))) (= v_subst_5 v_subst_4)))))))) (= v_ArrVal_178 0))) (forall ((v_ArrVal_178 Int)) (or (< |c_#StackHeapBarrier| (+ v_ArrVal_178 1)) (= v_ArrVal_178 0) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~node~0#1.offset_16| Int) (v_arrayElimArr_4 (Array Int Int)) (v_prenex_1 Int)) (= (select (select (let ((.cse6 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse5 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~node~0#1.offset_16|)) v_ArrVal_178 v_arrayElimArr_4))) (store .cse6 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse6 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_prenex_1))) |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base|) .cse7) 0)))) (forall ((v_arrayElimArr_5 (Array Int Int)) (v_arrayElimArr_10 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~node~0#1.offset_16| Int) (v_ArrVal_178 Int) (v_prenex_5 Int) (v_subst_6 Int)) (or (< |c_#StackHeapBarrier| (+ v_ArrVal_178 1)) (not (= (select v_arrayElimArr_10 v_subst_6) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|)) (not (= (select (select (let ((.cse8 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse5 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~node~0#1.offset_16|)) v_ArrVal_178 v_arrayElimArr_5))) (store .cse8 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse8 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_prenex_5))) |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base|) .cse9) 0)) (not (= (select (select (let ((.cse10 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse2 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| v_ArrVal_178)) v_ArrVal_178 v_arrayElimArr_10))) (store .cse10 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse10 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_ArrVal_178))) |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base|) .cse9) 0)) (= v_ArrVal_178 0))) (or (not (= |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base| 0)) (not (= |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset| 0))) (forall ((v_ArrVal_178 Int)) (or (< |c_#StackHeapBarrier| (+ v_ArrVal_178 1)) (forall ((v_DerPreprocessor_35 Int) (v_arrayElimArr_5 (Array Int Int)) (v_arrayElimArr_10 (Array Int Int)) (v_DerPreprocessor_36 Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~node~0#1.offset_16| Int) (v_prenex_5 Int) (v_DerPreprocessor_60 Int) (v_subst_5 Int) (v_subst_4 Int) (v_subst_2 Int)) (or (not (= v_DerPreprocessor_35 (select (store (store v_arrayElimArr_5 v_subst_2 v_DerPreprocessor_35) v_subst_5 v_DerPreprocessor_36) v_subst_2))) (not (= (select (select (let ((.cse11 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse5 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~node~0#1.offset_16|)) v_ArrVal_178 v_arrayElimArr_5))) (store .cse11 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse11 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_prenex_5))) |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base|) .cse9) 0)) (not (= (select (select (let ((.cse12 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse2 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| v_ArrVal_178)) v_ArrVal_178 v_arrayElimArr_10))) (store .cse12 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse12 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_ArrVal_178))) |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base|) .cse9) 0)) (not (= |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (select v_arrayElimArr_10 v_subst_2))) (not (= (select (store (store v_arrayElimArr_10 v_subst_2 v_DerPreprocessor_60) v_subst_4 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) v_subst_2) v_DerPreprocessor_60)))) (= v_ArrVal_178 0))) (forall ((v_DerPreprocessor_57 Int) (v_arrayElimArr_5 (Array Int Int)) (v_arrayElimArr_10 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~node~0#1.offset_16| Int) (v_ArrVal_178 Int) (v_prenex_5 Int) (v_DerPreprocessor_56 Int) (v_subst_5 Int) (v_subst_1 Int)) (or (< |c_#StackHeapBarrier| (+ v_ArrVal_178 1)) (not (= (select (select (let ((.cse13 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse5 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~node~0#1.offset_16|)) v_ArrVal_178 v_arrayElimArr_5))) (store .cse13 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse13 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_prenex_5))) |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base|) .cse9) 0)) (not (= |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (select v_arrayElimArr_10 v_subst_1))) (not (= (select (store (store v_arrayElimArr_5 v_subst_1 v_DerPreprocessor_56) v_subst_5 v_DerPreprocessor_57) v_subst_1) v_DerPreprocessor_56)) (not (= (select (select (let ((.cse14 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse2 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| v_ArrVal_178)) v_ArrVal_178 v_arrayElimArr_10))) (store .cse14 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse14 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_ArrVal_178))) |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base|) .cse9) 0)) (= v_ArrVal_178 0))) (forall ((v_ArrVal_178 Int)) (or (< |c_#StackHeapBarrier| (+ v_ArrVal_178 1)) (forall ((v_arrayElimArr_5 (Array Int Int)) (v_arrayElimArr_10 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~node~0#1.offset_16| Int) (v_prenex_5 Int) (v_DerPreprocessor_39 Int) (v_subst_5 Int) (v_subst_4 Int) (v_subst_3 Int) (v_subst_2 Int) (v_DerPreprocessor_65 Int) (v_DerPreprocessor_40 Int)) (let ((.cse15 (store (store v_arrayElimArr_5 v_subst_2 v_DerPreprocessor_39) v_subst_5 v_DerPreprocessor_40))) (or (not (= v_DerPreprocessor_40 (select .cse15 v_subst_3))) (not (= v_DerPreprocessor_65 (select (store (store v_arrayElimArr_10 v_subst_2 v_DerPreprocessor_65) v_subst_4 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) v_subst_2))) (not (= v_DerPreprocessor_39 (select .cse15 v_subst_2))) (not (= (select (select (let ((.cse16 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse5 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~node~0#1.offset_16|)) v_ArrVal_178 v_arrayElimArr_5))) (store .cse16 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse16 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_prenex_5))) |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base|) .cse9) 0)) (not (= (select (select (let ((.cse17 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse2 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| v_ArrVal_178)) v_ArrVal_178 v_arrayElimArr_10))) (store .cse17 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse17 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_ArrVal_178))) |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base|) .cse9) 0)) (not (= |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (select v_arrayElimArr_10 v_subst_2)))))) (= v_ArrVal_178 0))) (forall ((v_ArrVal_178 Int)) (or (< |c_#StackHeapBarrier| (+ v_ArrVal_178 1)) (forall ((v_arrayElimArr_5 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~node~0#1.offset_16| Int) (v_prenex_5 Int)) (or (not (= (select (select (let ((.cse18 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse5 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~node~0#1.offset_16|)) v_ArrVal_178 v_arrayElimArr_5))) (store .cse18 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse18 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_prenex_5))) |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base|) .cse9) 0)) (forall ((v_DerPreprocessor_55 Int) (v_subst_5 Int) (v_subst_4 Int) (v_DerPreprocessor_54 Int)) (or (forall ((v_DerPreprocessor_13 Int) (v_arrayElimArr_10 (Array Int Int)) (v_subst_2 Int)) (or (not (= |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (select v_arrayElimArr_10 v_subst_4))) (not (= (select (store (store v_arrayElimArr_10 v_subst_4 v_DerPreprocessor_13) v_subst_2 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) v_subst_4) v_DerPreprocessor_13)) (not (= (select (select (let ((.cse19 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse2 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| v_ArrVal_178)) v_ArrVal_178 v_arrayElimArr_10))) (store .cse19 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse19 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_ArrVal_178))) |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base|) .cse9) 0)))) (not (= v_DerPreprocessor_54 (select (store (store v_arrayElimArr_5 v_subst_4 v_DerPreprocessor_54) v_subst_5 v_DerPreprocessor_55) v_subst_4))))))) (= v_ArrVal_178 0))) (forall ((v_ArrVal_178 Int)) (or (< |c_#StackHeapBarrier| (+ v_ArrVal_178 1)) (forall ((v_arrayElimArr_10 (Array Int Int)) (v_arrayElimArr_5 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~node~0#1.offset_16| Int) (v_prenex_5 Int) (v_DerPreprocessor_28 Int) (v_DerPreprocessor_17 Int) (v_DerPreprocessor_27 Int) (v_subst_5 Int) (v_subst_4 Int) (v_subst_1 Int)) (or (not (= (select (select (let ((.cse20 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse5 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~node~0#1.offset_16|)) v_ArrVal_178 v_arrayElimArr_5))) (store .cse20 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse20 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_prenex_5))) |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base|) .cse9) 0)) (not (= |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (select v_arrayElimArr_10 v_subst_4))) (not (= (select (select (let ((.cse21 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse2 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| v_ArrVal_178)) v_ArrVal_178 v_arrayElimArr_10))) (store .cse21 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse21 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_ArrVal_178))) |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base|) .cse9) 0)) (not (= (select (store (store v_arrayElimArr_5 v_subst_4 v_DerPreprocessor_27) v_subst_5 v_DerPreprocessor_28) v_subst_4) v_DerPreprocessor_27)) (not (= (select (store (store v_arrayElimArr_10 v_subst_4 v_DerPreprocessor_17) v_subst_1 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) v_subst_4) v_DerPreprocessor_17)))) (= v_ArrVal_178 0))) (forall ((v_arrayElimArr_8 (Array Int Int)) (v_ArrVal_178 Int) (v_subst_2 Int)) (or (< |c_#StackHeapBarrier| (+ v_ArrVal_178 1)) (not (= |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (select v_arrayElimArr_8 v_subst_2))) (= v_ArrVal_178 0) (= (select (select (let ((.cse22 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse2 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| v_ArrVal_178)) v_ArrVal_178 v_arrayElimArr_8))) (store .cse22 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse22 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_ArrVal_178))) |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base|) .cse23) 0))) (forall ((v_ArrVal_178 Int)) (or (< |c_#StackHeapBarrier| (+ v_ArrVal_178 1)) (= v_ArrVal_178 0) (forall ((v_arrayElimArr_7 (Array Int Int))) (or (not (= (select (select (let ((.cse24 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse2 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| v_ArrVal_178)) v_ArrVal_178 v_arrayElimArr_7))) (store .cse24 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse24 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_ArrVal_178))) |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base|) |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset|) 0)) (forall ((v_subst_4 Int)) (or (not (= |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (select v_arrayElimArr_7 v_subst_4))) (forall ((v_arrayElimArr_6 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~node~0#1.offset_16| Int) (v_DerPreprocessor_50 Int) (v_subst_5 Int) (v_ArrVal_182 Int) (v_subst_3 Int) (v_DerPreprocessor_53 Int) (v_DerPreprocessor_51 Int) (v_DerPreprocessor_52 Int)) (let ((.cse26 (store v_arrayElimArr_6 v_subst_4 v_DerPreprocessor_52)) (.cse27 (store (store v_arrayElimArr_6 v_subst_4 v_DerPreprocessor_50) v_subst_5 v_DerPreprocessor_51))) (or (not (= (select (select (let ((.cse25 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse5 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~node~0#1.offset_16|)) v_ArrVal_178 v_arrayElimArr_6))) (store .cse25 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse25 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_ArrVal_182))) |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base|) |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset|) 0)) (not (= v_DerPreprocessor_52 (select (store .cse26 v_subst_3 v_DerPreprocessor_53) v_subst_4))) (not (= (select .cse27 v_subst_4) v_DerPreprocessor_50)) (not (= (store (store .cse26 v_subst_3 (select .cse27 v_subst_3)) v_subst_5 v_DerPreprocessor_51) .cse27))))))))))) (forall ((v_arrayElimArr_5 (Array Int Int)) (v_arrayElimArr_10 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~node~0#1.offset_16| Int) (v_ArrVal_178 Int) (v_prenex_5 Int) (v_subst_2 Int)) (or (< |c_#StackHeapBarrier| (+ v_ArrVal_178 1)) (not (= (select (select (let ((.cse28 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse5 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~node~0#1.offset_16|)) v_ArrVal_178 v_arrayElimArr_5))) (store .cse28 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse28 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_prenex_5))) |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base|) .cse9) 0)) (not (= (select (select (let ((.cse29 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse2 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| v_ArrVal_178)) v_ArrVal_178 v_arrayElimArr_10))) (store .cse29 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse29 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_ArrVal_178))) |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base|) .cse9) 0)) (= v_ArrVal_178 0) (not (= |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (select v_arrayElimArr_10 v_subst_2))))) (forall ((v_ArrVal_178 Int)) (or (< |c_#StackHeapBarrier| (+ v_ArrVal_178 1)) (= v_ArrVal_178 0) (forall ((v_arrayElimArr_5 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~node~0#1.offset_16| Int) (v_prenex_5 Int)) (or (not (= (select (select (let ((.cse30 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse5 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~node~0#1.offset_16|)) v_ArrVal_178 v_arrayElimArr_5))) (store .cse30 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse30 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_prenex_5))) |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base|) .cse9) 0)) (forall ((v_DerPreprocessor_55 Int) (v_subst_5 Int) (v_subst_4 Int) (v_DerPreprocessor_54 Int)) (or (not (= v_DerPreprocessor_54 (select (store (store v_arrayElimArr_5 v_subst_4 v_DerPreprocessor_54) v_subst_5 v_DerPreprocessor_55) v_subst_4))) (forall ((v_arrayElimArr_10 (Array Int Int))) (or (not (= |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (select v_arrayElimArr_10 v_subst_4))) (not (= (select (select (let ((.cse31 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse2 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| v_ArrVal_178)) v_ArrVal_178 v_arrayElimArr_10))) (store .cse31 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse31 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_ArrVal_178))) |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base|) .cse9) 0)))))))))) (forall ((v_ArrVal_178 Int)) (or (< |c_#StackHeapBarrier| (+ v_ArrVal_178 1)) (forall ((v_arrayElimArr_8 (Array Int Int)) (v_subst_4 Int) (v_DerPreprocessor_19 Int) (v_subst_1 Int)) (or (not (= (select (store (store v_arrayElimArr_8 v_subst_4 v_DerPreprocessor_19) v_subst_1 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) v_subst_4) v_DerPreprocessor_19)) (= (select (select (let ((.cse32 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse2 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| v_ArrVal_178)) v_ArrVal_178 v_arrayElimArr_8))) (store .cse32 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse32 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_ArrVal_178))) |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base|) .cse23) 0) (not (= |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (select v_arrayElimArr_8 v_subst_4))))) (= v_ArrVal_178 0))) (forall ((v_ArrVal_178 Int)) (or (< |c_#StackHeapBarrier| (+ v_ArrVal_178 1)) (forall ((v_arrayElimArr_7 (Array Int Int))) (or (forall ((v_subst_4 Int)) (or (forall ((v_arrayElimArr_6 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~node~0#1.offset_16| Int) (v_subst_6 Int) (v_ArrVal_182 Int) (v_DerPreprocessor_4 Int) (v_DerPreprocessor_3 Int)) (or (not (= (select (store (store v_arrayElimArr_6 v_subst_4 v_DerPreprocessor_3) v_subst_6 v_DerPreprocessor_4) v_subst_4) v_DerPreprocessor_3)) (not (= (select (select (let ((.cse33 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse5 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~node~0#1.offset_16|)) v_ArrVal_178 v_arrayElimArr_6))) (store .cse33 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse33 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_ArrVal_182))) |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base|) |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset|) 0)))) (not (= |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (select v_arrayElimArr_7 v_subst_4))))) (not (= (select (select (let ((.cse34 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse2 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| v_ArrVal_178)) v_ArrVal_178 v_arrayElimArr_7))) (store .cse34 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse34 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_ArrVal_178))) |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base|) |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset|) 0)))) (= v_ArrVal_178 0))) (forall ((v_ArrVal_178 Int)) (or (< |c_#StackHeapBarrier| (+ v_ArrVal_178 1)) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~node~0#1.offset_16| Int) (v_prenex_3 Int) (v_arrayElimArr_3 (Array Int Int)) (v_subst_5 Int) (v_subst_3 Int) (v_DerPreprocessor_31 Int) (v_DerPreprocessor_32 Int)) (or (not (= v_DerPreprocessor_31 (select (store (store v_arrayElimArr_3 v_subst_3 v_DerPreprocessor_31) v_subst_5 v_DerPreprocessor_32) v_subst_3))) (= (select (select (let ((.cse35 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse5 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~node~0#1.offset_16|)) v_ArrVal_178 v_arrayElimArr_3))) (store .cse35 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse35 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_prenex_3))) |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base|) .cse23) 0))) (= v_ArrVal_178 0))) (forall ((v_ArrVal_178 Int)) (or (< |c_#StackHeapBarrier| (+ v_ArrVal_178 1)) (forall ((v_arrayElimArr_5 (Array Int Int)) (v_arrayElimArr_10 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~node~0#1.offset_16| Int) (v_prenex_5 Int) (v_DerPreprocessor_37 Int) (v_DerPreprocessor_38 Int) (v_subst_5 Int) (v_subst_4 Int) (v_subst_3 Int) (v_subst_2 Int) (v_DerPreprocessor_76 Int)) (or (not (= v_DerPreprocessor_37 (select (store (store v_arrayElimArr_5 v_subst_2 v_DerPreprocessor_37) v_subst_5 v_DerPreprocessor_38) v_subst_3))) (not (= (select (select (let ((.cse36 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse5 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~node~0#1.offset_16|)) v_ArrVal_178 v_arrayElimArr_5))) (store .cse36 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse36 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_prenex_5))) |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base|) .cse9) 0)) (not (= v_DerPreprocessor_76 (select (store (store v_arrayElimArr_10 v_subst_2 v_DerPreprocessor_76) v_subst_4 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) v_subst_2))) (not (= (select (select (let ((.cse37 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse2 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| v_ArrVal_178)) v_ArrVal_178 v_arrayElimArr_10))) (store .cse37 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse37 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_ArrVal_178))) |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base|) .cse9) 0)) (not (= |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (select v_arrayElimArr_10 v_subst_2))))) (= v_ArrVal_178 0))) (forall ((v_ArrVal_178 Int)) (or (< |c_#StackHeapBarrier| (+ v_ArrVal_178 1)) (forall ((v_arrayElimArr_7 (Array Int Int))) (or (not (= (select (select (let ((.cse38 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse2 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| v_ArrVal_178)) v_ArrVal_178 v_arrayElimArr_7))) (store .cse38 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse38 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_ArrVal_178))) |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base|) |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset|) 0)) (forall ((v_subst_4 Int)) (or (forall ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_46 Int) (v_DerPreprocessor_47 Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~node~0#1.offset_16| Int) (v_DerPreprocessor_48 Int) (v_DerPreprocessor_49 Int) (v_subst_6 Int) (v_subst_5 Int) (v_ArrVal_182 Int) (v_subst_3 Int) (v_DerPreprocessor_4 Int)) (let ((.cse41 (store v_arrayElimArr_6 v_subst_4 v_DerPreprocessor_48))) (or (not (= (select (select (let ((.cse39 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse5 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~node~0#1.offset_16|)) v_ArrVal_178 v_arrayElimArr_6))) (store .cse39 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse39 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_ArrVal_182))) |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base|) |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset|) 0)) (not (let ((.cse40 (store (store .cse41 v_subst_3 (select (store (store .cse41 v_subst_3 v_DerPreprocessor_46) v_subst_5 v_DerPreprocessor_47) v_subst_3)) v_subst_6 v_DerPreprocessor_4))) (= (store (store v_arrayElimArr_6 v_subst_4 (select .cse40 v_subst_4)) v_subst_6 v_DerPreprocessor_4) .cse40))) (= v_subst_5 v_subst_3) (not (= (select (store .cse41 v_subst_3 v_DerPreprocessor_49) v_subst_4) v_DerPreprocessor_48)) (= v_subst_6 v_subst_3)))) (not (= |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (select v_arrayElimArr_7 v_subst_4))))))) (= v_ArrVal_178 0))) (forall ((v_ArrVal_178 Int)) (or (< |c_#StackHeapBarrier| (+ v_ArrVal_178 1)) (forall ((v_arrayElimArr_8 (Array Int Int)) (v_DerPreprocessor_78 Int) (v_subst_4 Int) (v_subst_1 Int)) (or (not (= v_DerPreprocessor_78 (select (store (store v_arrayElimArr_8 v_subst_1 v_DerPreprocessor_78) v_subst_4 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) v_subst_1))) (not (= |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (select v_arrayElimArr_8 v_subst_1))) (= (select (select (let ((.cse42 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse2 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| v_ArrVal_178)) v_ArrVal_178 v_arrayElimArr_8))) (store .cse42 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse42 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_ArrVal_178))) |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base|) .cse23) 0))) (= v_ArrVal_178 0))) (forall ((v_ArrVal_178 Int)) (or (< |c_#StackHeapBarrier| (+ v_ArrVal_178 1)) (forall ((v_subst_4 Int) (v_arrayElimArr_9 (Array Int Int)) (v_subst_1 Int) (v_DerPreprocessor_63 Int)) (or (not (= (select v_arrayElimArr_9 v_subst_1) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|)) (not (= (select (store (store v_arrayElimArr_9 v_subst_1 v_DerPreprocessor_63) v_subst_4 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) v_subst_1) v_DerPreprocessor_63)) (= (select (select (let ((.cse43 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse2 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| v_ArrVal_178)) v_ArrVal_178 v_arrayElimArr_9))) (store .cse43 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse43 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_ArrVal_178))) |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base|) .cse7) 0))) (= v_ArrVal_178 0))))) is different from false [2023-11-12 01:03:08,662 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse9 (+ |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset| 24)) (.cse5 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|)) (.cse23 (+ |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset| 16)) (.cse1 (+ |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 24)) (.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|)) (.cse7 (+ |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset| 8))) (and (forall ((v_ArrVal_178 Int)) (or (< |c_#StackHeapBarrier| (+ v_ArrVal_178 1)) (forall ((v_arrayElimArr_7 (Array Int Int))) (or (not (= (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse2 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| v_ArrVal_178)) v_ArrVal_178 v_arrayElimArr_7))) (store .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_ArrVal_178))) |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base|) |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset|) 0)) (forall ((v_subst_4 Int)) (or (not (= |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (select v_arrayElimArr_7 v_subst_4))) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_44 Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~node~0#1.offset_16| Int) (v_DerPreprocessor_45 Int) (v_subst_6 Int) (v_subst_5 Int) (v_ArrVal_182 Int) (v_DerPreprocessor_4 Int) (v_DerPreprocessor_3 Int)) (let ((.cse3 (store (store (store v_arrayElimArr_6 v_subst_4 (select (store (store v_arrayElimArr_6 v_subst_4 v_DerPreprocessor_44) v_subst_5 v_DerPreprocessor_45) v_subst_4)) v_subst_5 v_DerPreprocessor_3) v_subst_6 v_DerPreprocessor_4))) (or (not (= v_DerPreprocessor_3 (select .cse3 v_subst_5))) (not (= (select (select (let ((.cse4 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse5 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~node~0#1.offset_16|)) v_ArrVal_178 v_arrayElimArr_6))) (store .cse4 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse4 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_ArrVal_182))) |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base|) |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset|) 0)) (not (= .cse3 (store (store v_arrayElimArr_6 v_subst_4 (select .cse3 v_subst_4)) v_subst_6 v_DerPreprocessor_4))) (= v_subst_5 v_subst_4)))))))) (= v_ArrVal_178 0))) (forall ((v_ArrVal_178 Int)) (or (< |c_#StackHeapBarrier| (+ v_ArrVal_178 1)) (= v_ArrVal_178 0) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~node~0#1.offset_16| Int) (v_arrayElimArr_4 (Array Int Int)) (v_prenex_1 Int)) (= (select (select (let ((.cse6 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse5 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~node~0#1.offset_16|)) v_ArrVal_178 v_arrayElimArr_4))) (store .cse6 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse6 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_prenex_1))) |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base|) .cse7) 0)))) (forall ((v_arrayElimArr_5 (Array Int Int)) (v_arrayElimArr_10 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~node~0#1.offset_16| Int) (v_ArrVal_178 Int) (v_prenex_5 Int) (v_subst_6 Int)) (or (< |c_#StackHeapBarrier| (+ v_ArrVal_178 1)) (not (= (select v_arrayElimArr_10 v_subst_6) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|)) (not (= (select (select (let ((.cse8 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse5 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~node~0#1.offset_16|)) v_ArrVal_178 v_arrayElimArr_5))) (store .cse8 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse8 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_prenex_5))) |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base|) .cse9) 0)) (not (= (select (select (let ((.cse10 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse2 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| v_ArrVal_178)) v_ArrVal_178 v_arrayElimArr_10))) (store .cse10 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse10 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_ArrVal_178))) |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base|) .cse9) 0)) (= v_ArrVal_178 0))) (or (not (= |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base| 0)) (not (= |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset| 0))) (forall ((v_ArrVal_178 Int)) (or (< |c_#StackHeapBarrier| (+ v_ArrVal_178 1)) (forall ((v_DerPreprocessor_35 Int) (v_arrayElimArr_5 (Array Int Int)) (v_arrayElimArr_10 (Array Int Int)) (v_DerPreprocessor_36 Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~node~0#1.offset_16| Int) (v_prenex_5 Int) (v_DerPreprocessor_60 Int) (v_subst_5 Int) (v_subst_4 Int) (v_subst_2 Int)) (or (not (= v_DerPreprocessor_35 (select (store (store v_arrayElimArr_5 v_subst_2 v_DerPreprocessor_35) v_subst_5 v_DerPreprocessor_36) v_subst_2))) (not (= (select (select (let ((.cse11 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse5 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~node~0#1.offset_16|)) v_ArrVal_178 v_arrayElimArr_5))) (store .cse11 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse11 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_prenex_5))) |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base|) .cse9) 0)) (not (= (select (select (let ((.cse12 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse2 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| v_ArrVal_178)) v_ArrVal_178 v_arrayElimArr_10))) (store .cse12 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse12 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_ArrVal_178))) |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base|) .cse9) 0)) (not (= |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (select v_arrayElimArr_10 v_subst_2))) (not (= (select (store (store v_arrayElimArr_10 v_subst_2 v_DerPreprocessor_60) v_subst_4 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) v_subst_2) v_DerPreprocessor_60)))) (= v_ArrVal_178 0))) (forall ((v_DerPreprocessor_57 Int) (v_arrayElimArr_5 (Array Int Int)) (v_arrayElimArr_10 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~node~0#1.offset_16| Int) (v_ArrVal_178 Int) (v_prenex_5 Int) (v_DerPreprocessor_56 Int) (v_subst_5 Int) (v_subst_1 Int)) (or (< |c_#StackHeapBarrier| (+ v_ArrVal_178 1)) (not (= (select (select (let ((.cse13 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse5 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~node~0#1.offset_16|)) v_ArrVal_178 v_arrayElimArr_5))) (store .cse13 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse13 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_prenex_5))) |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base|) .cse9) 0)) (not (= |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (select v_arrayElimArr_10 v_subst_1))) (not (= (select (store (store v_arrayElimArr_5 v_subst_1 v_DerPreprocessor_56) v_subst_5 v_DerPreprocessor_57) v_subst_1) v_DerPreprocessor_56)) (not (= (select (select (let ((.cse14 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse2 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| v_ArrVal_178)) v_ArrVal_178 v_arrayElimArr_10))) (store .cse14 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse14 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_ArrVal_178))) |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base|) .cse9) 0)) (= v_ArrVal_178 0))) (forall ((v_ArrVal_178 Int)) (or (< |c_#StackHeapBarrier| (+ v_ArrVal_178 1)) (forall ((v_arrayElimArr_5 (Array Int Int)) (v_arrayElimArr_10 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~node~0#1.offset_16| Int) (v_prenex_5 Int) (v_DerPreprocessor_39 Int) (v_subst_5 Int) (v_subst_4 Int) (v_subst_3 Int) (v_subst_2 Int) (v_DerPreprocessor_65 Int) (v_DerPreprocessor_40 Int)) (let ((.cse15 (store (store v_arrayElimArr_5 v_subst_2 v_DerPreprocessor_39) v_subst_5 v_DerPreprocessor_40))) (or (not (= v_DerPreprocessor_40 (select .cse15 v_subst_3))) (not (= v_DerPreprocessor_65 (select (store (store v_arrayElimArr_10 v_subst_2 v_DerPreprocessor_65) v_subst_4 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) v_subst_2))) (not (= v_DerPreprocessor_39 (select .cse15 v_subst_2))) (not (= (select (select (let ((.cse16 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse5 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~node~0#1.offset_16|)) v_ArrVal_178 v_arrayElimArr_5))) (store .cse16 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse16 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_prenex_5))) |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base|) .cse9) 0)) (not (= (select (select (let ((.cse17 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse2 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| v_ArrVal_178)) v_ArrVal_178 v_arrayElimArr_10))) (store .cse17 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse17 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_ArrVal_178))) |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base|) .cse9) 0)) (not (= |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (select v_arrayElimArr_10 v_subst_2)))))) (= v_ArrVal_178 0))) (forall ((v_ArrVal_178 Int)) (or (< |c_#StackHeapBarrier| (+ v_ArrVal_178 1)) (forall ((v_arrayElimArr_5 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~node~0#1.offset_16| Int) (v_prenex_5 Int)) (or (not (= (select (select (let ((.cse18 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse5 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~node~0#1.offset_16|)) v_ArrVal_178 v_arrayElimArr_5))) (store .cse18 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse18 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_prenex_5))) |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base|) .cse9) 0)) (forall ((v_DerPreprocessor_55 Int) (v_subst_5 Int) (v_subst_4 Int) (v_DerPreprocessor_54 Int)) (or (forall ((v_DerPreprocessor_13 Int) (v_arrayElimArr_10 (Array Int Int)) (v_subst_2 Int)) (or (not (= |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (select v_arrayElimArr_10 v_subst_4))) (not (= (select (store (store v_arrayElimArr_10 v_subst_4 v_DerPreprocessor_13) v_subst_2 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) v_subst_4) v_DerPreprocessor_13)) (not (= (select (select (let ((.cse19 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse2 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| v_ArrVal_178)) v_ArrVal_178 v_arrayElimArr_10))) (store .cse19 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse19 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_ArrVal_178))) |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base|) .cse9) 0)))) (not (= v_DerPreprocessor_54 (select (store (store v_arrayElimArr_5 v_subst_4 v_DerPreprocessor_54) v_subst_5 v_DerPreprocessor_55) v_subst_4))))))) (= v_ArrVal_178 0))) (forall ((v_ArrVal_178 Int)) (or (< |c_#StackHeapBarrier| (+ v_ArrVal_178 1)) (forall ((v_arrayElimArr_10 (Array Int Int)) (v_arrayElimArr_5 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~node~0#1.offset_16| Int) (v_prenex_5 Int) (v_DerPreprocessor_28 Int) (v_DerPreprocessor_17 Int) (v_DerPreprocessor_27 Int) (v_subst_5 Int) (v_subst_4 Int) (v_subst_1 Int)) (or (not (= (select (select (let ((.cse20 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse5 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~node~0#1.offset_16|)) v_ArrVal_178 v_arrayElimArr_5))) (store .cse20 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse20 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_prenex_5))) |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base|) .cse9) 0)) (not (= |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (select v_arrayElimArr_10 v_subst_4))) (not (= (select (select (let ((.cse21 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse2 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| v_ArrVal_178)) v_ArrVal_178 v_arrayElimArr_10))) (store .cse21 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse21 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_ArrVal_178))) |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base|) .cse9) 0)) (not (= (select (store (store v_arrayElimArr_5 v_subst_4 v_DerPreprocessor_27) v_subst_5 v_DerPreprocessor_28) v_subst_4) v_DerPreprocessor_27)) (not (= (select (store (store v_arrayElimArr_10 v_subst_4 v_DerPreprocessor_17) v_subst_1 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) v_subst_4) v_DerPreprocessor_17)))) (= v_ArrVal_178 0))) (forall ((v_arrayElimArr_8 (Array Int Int)) (v_ArrVal_178 Int) (v_subst_2 Int)) (or (< |c_#StackHeapBarrier| (+ v_ArrVal_178 1)) (not (= |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (select v_arrayElimArr_8 v_subst_2))) (= v_ArrVal_178 0) (= (select (select (let ((.cse22 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse2 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| v_ArrVal_178)) v_ArrVal_178 v_arrayElimArr_8))) (store .cse22 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse22 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_ArrVal_178))) |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base|) .cse23) 0))) (forall ((v_ArrVal_178 Int)) (or (< |c_#StackHeapBarrier| (+ v_ArrVal_178 1)) (= v_ArrVal_178 0) (forall ((v_arrayElimArr_7 (Array Int Int))) (or (not (= (select (select (let ((.cse24 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse2 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| v_ArrVal_178)) v_ArrVal_178 v_arrayElimArr_7))) (store .cse24 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse24 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_ArrVal_178))) |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base|) |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset|) 0)) (forall ((v_subst_4 Int)) (or (not (= |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (select v_arrayElimArr_7 v_subst_4))) (forall ((v_arrayElimArr_6 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~node~0#1.offset_16| Int) (v_DerPreprocessor_50 Int) (v_subst_5 Int) (v_ArrVal_182 Int) (v_subst_3 Int) (v_DerPreprocessor_53 Int) (v_DerPreprocessor_51 Int) (v_DerPreprocessor_52 Int)) (let ((.cse26 (store v_arrayElimArr_6 v_subst_4 v_DerPreprocessor_52)) (.cse27 (store (store v_arrayElimArr_6 v_subst_4 v_DerPreprocessor_50) v_subst_5 v_DerPreprocessor_51))) (or (not (= (select (select (let ((.cse25 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse5 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~node~0#1.offset_16|)) v_ArrVal_178 v_arrayElimArr_6))) (store .cse25 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse25 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_ArrVal_182))) |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base|) |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset|) 0)) (not (= v_DerPreprocessor_52 (select (store .cse26 v_subst_3 v_DerPreprocessor_53) v_subst_4))) (not (= (select .cse27 v_subst_4) v_DerPreprocessor_50)) (not (= (store (store .cse26 v_subst_3 (select .cse27 v_subst_3)) v_subst_5 v_DerPreprocessor_51) .cse27))))))))))) (forall ((v_arrayElimArr_5 (Array Int Int)) (v_arrayElimArr_10 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~node~0#1.offset_16| Int) (v_ArrVal_178 Int) (v_prenex_5 Int) (v_subst_2 Int)) (or (< |c_#StackHeapBarrier| (+ v_ArrVal_178 1)) (not (= (select (select (let ((.cse28 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse5 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~node~0#1.offset_16|)) v_ArrVal_178 v_arrayElimArr_5))) (store .cse28 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse28 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_prenex_5))) |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base|) .cse9) 0)) (not (= (select (select (let ((.cse29 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse2 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| v_ArrVal_178)) v_ArrVal_178 v_arrayElimArr_10))) (store .cse29 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse29 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_ArrVal_178))) |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base|) .cse9) 0)) (= v_ArrVal_178 0) (not (= |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (select v_arrayElimArr_10 v_subst_2))))) (forall ((v_ArrVal_178 Int)) (or (< |c_#StackHeapBarrier| (+ v_ArrVal_178 1)) (= v_ArrVal_178 0) (forall ((v_arrayElimArr_5 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~node~0#1.offset_16| Int) (v_prenex_5 Int)) (or (not (= (select (select (let ((.cse30 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse5 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~node~0#1.offset_16|)) v_ArrVal_178 v_arrayElimArr_5))) (store .cse30 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse30 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_prenex_5))) |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base|) .cse9) 0)) (forall ((v_DerPreprocessor_55 Int) (v_subst_5 Int) (v_subst_4 Int) (v_DerPreprocessor_54 Int)) (or (not (= v_DerPreprocessor_54 (select (store (store v_arrayElimArr_5 v_subst_4 v_DerPreprocessor_54) v_subst_5 v_DerPreprocessor_55) v_subst_4))) (forall ((v_arrayElimArr_10 (Array Int Int))) (or (not (= |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (select v_arrayElimArr_10 v_subst_4))) (not (= (select (select (let ((.cse31 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse2 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| v_ArrVal_178)) v_ArrVal_178 v_arrayElimArr_10))) (store .cse31 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse31 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_ArrVal_178))) |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base|) .cse9) 0)))))))))) (forall ((v_ArrVal_178 Int)) (or (< |c_#StackHeapBarrier| (+ v_ArrVal_178 1)) (forall ((v_arrayElimArr_8 (Array Int Int)) (v_subst_4 Int) (v_DerPreprocessor_19 Int) (v_subst_1 Int)) (or (not (= (select (store (store v_arrayElimArr_8 v_subst_4 v_DerPreprocessor_19) v_subst_1 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) v_subst_4) v_DerPreprocessor_19)) (= (select (select (let ((.cse32 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse2 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| v_ArrVal_178)) v_ArrVal_178 v_arrayElimArr_8))) (store .cse32 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse32 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_ArrVal_178))) |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base|) .cse23) 0) (not (= |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (select v_arrayElimArr_8 v_subst_4))))) (= v_ArrVal_178 0))) (forall ((v_ArrVal_178 Int)) (or (< |c_#StackHeapBarrier| (+ v_ArrVal_178 1)) (forall ((v_arrayElimArr_7 (Array Int Int))) (or (forall ((v_subst_4 Int)) (or (forall ((v_arrayElimArr_6 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~node~0#1.offset_16| Int) (v_subst_6 Int) (v_ArrVal_182 Int) (v_DerPreprocessor_4 Int) (v_DerPreprocessor_3 Int)) (or (not (= (select (store (store v_arrayElimArr_6 v_subst_4 v_DerPreprocessor_3) v_subst_6 v_DerPreprocessor_4) v_subst_4) v_DerPreprocessor_3)) (not (= (select (select (let ((.cse33 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse5 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~node~0#1.offset_16|)) v_ArrVal_178 v_arrayElimArr_6))) (store .cse33 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse33 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_ArrVal_182))) |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base|) |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset|) 0)))) (not (= |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (select v_arrayElimArr_7 v_subst_4))))) (not (= (select (select (let ((.cse34 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse2 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| v_ArrVal_178)) v_ArrVal_178 v_arrayElimArr_7))) (store .cse34 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse34 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_ArrVal_178))) |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base|) |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset|) 0)))) (= v_ArrVal_178 0))) (forall ((v_ArrVal_178 Int)) (or (< |c_#StackHeapBarrier| (+ v_ArrVal_178 1)) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~node~0#1.offset_16| Int) (v_prenex_3 Int) (v_arrayElimArr_3 (Array Int Int)) (v_subst_5 Int) (v_subst_3 Int) (v_DerPreprocessor_31 Int) (v_DerPreprocessor_32 Int)) (or (not (= v_DerPreprocessor_31 (select (store (store v_arrayElimArr_3 v_subst_3 v_DerPreprocessor_31) v_subst_5 v_DerPreprocessor_32) v_subst_3))) (= (select (select (let ((.cse35 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse5 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~node~0#1.offset_16|)) v_ArrVal_178 v_arrayElimArr_3))) (store .cse35 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse35 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_prenex_3))) |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base|) .cse23) 0))) (= v_ArrVal_178 0))) (forall ((v_ArrVal_178 Int)) (or (< |c_#StackHeapBarrier| (+ v_ArrVal_178 1)) (forall ((v_arrayElimArr_5 (Array Int Int)) (v_arrayElimArr_10 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~node~0#1.offset_16| Int) (v_prenex_5 Int) (v_DerPreprocessor_37 Int) (v_DerPreprocessor_38 Int) (v_subst_5 Int) (v_subst_4 Int) (v_subst_3 Int) (v_subst_2 Int) (v_DerPreprocessor_76 Int)) (or (not (= v_DerPreprocessor_37 (select (store (store v_arrayElimArr_5 v_subst_2 v_DerPreprocessor_37) v_subst_5 v_DerPreprocessor_38) v_subst_3))) (not (= (select (select (let ((.cse36 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse5 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~node~0#1.offset_16|)) v_ArrVal_178 v_arrayElimArr_5))) (store .cse36 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse36 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_prenex_5))) |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base|) .cse9) 0)) (not (= v_DerPreprocessor_76 (select (store (store v_arrayElimArr_10 v_subst_2 v_DerPreprocessor_76) v_subst_4 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) v_subst_2))) (not (= (select (select (let ((.cse37 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse2 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| v_ArrVal_178)) v_ArrVal_178 v_arrayElimArr_10))) (store .cse37 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse37 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_ArrVal_178))) |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base|) .cse9) 0)) (not (= |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (select v_arrayElimArr_10 v_subst_2))))) (= v_ArrVal_178 0))) (forall ((v_ArrVal_178 Int)) (or (< |c_#StackHeapBarrier| (+ v_ArrVal_178 1)) (forall ((v_arrayElimArr_7 (Array Int Int))) (or (not (= (select (select (let ((.cse38 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse2 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| v_ArrVal_178)) v_ArrVal_178 v_arrayElimArr_7))) (store .cse38 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse38 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_ArrVal_178))) |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base|) |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset|) 0)) (forall ((v_subst_4 Int)) (or (forall ((v_arrayElimArr_6 (Array Int Int)) (v_DerPreprocessor_46 Int) (v_DerPreprocessor_47 Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~node~0#1.offset_16| Int) (v_DerPreprocessor_48 Int) (v_DerPreprocessor_49 Int) (v_subst_6 Int) (v_subst_5 Int) (v_ArrVal_182 Int) (v_subst_3 Int) (v_DerPreprocessor_4 Int)) (let ((.cse41 (store v_arrayElimArr_6 v_subst_4 v_DerPreprocessor_48))) (or (not (= (select (select (let ((.cse39 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse5 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~node~0#1.offset_16|)) v_ArrVal_178 v_arrayElimArr_6))) (store .cse39 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse39 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_ArrVal_182))) |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base|) |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset|) 0)) (not (let ((.cse40 (store (store .cse41 v_subst_3 (select (store (store .cse41 v_subst_3 v_DerPreprocessor_46) v_subst_5 v_DerPreprocessor_47) v_subst_3)) v_subst_6 v_DerPreprocessor_4))) (= (store (store v_arrayElimArr_6 v_subst_4 (select .cse40 v_subst_4)) v_subst_6 v_DerPreprocessor_4) .cse40))) (= v_subst_5 v_subst_3) (not (= (select (store .cse41 v_subst_3 v_DerPreprocessor_49) v_subst_4) v_DerPreprocessor_48)) (= v_subst_6 v_subst_3)))) (not (= |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (select v_arrayElimArr_7 v_subst_4))))))) (= v_ArrVal_178 0))) (forall ((v_ArrVal_178 Int)) (or (< |c_#StackHeapBarrier| (+ v_ArrVal_178 1)) (forall ((v_arrayElimArr_8 (Array Int Int)) (v_DerPreprocessor_78 Int) (v_subst_4 Int) (v_subst_1 Int)) (or (not (= v_DerPreprocessor_78 (select (store (store v_arrayElimArr_8 v_subst_1 v_DerPreprocessor_78) v_subst_4 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) v_subst_1))) (not (= |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (select v_arrayElimArr_8 v_subst_1))) (= (select (select (let ((.cse42 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse2 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| v_ArrVal_178)) v_ArrVal_178 v_arrayElimArr_8))) (store .cse42 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse42 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_ArrVal_178))) |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base|) .cse23) 0))) (= v_ArrVal_178 0))) (forall ((v_ArrVal_178 Int)) (or (< |c_#StackHeapBarrier| (+ v_ArrVal_178 1)) (forall ((v_subst_4 Int) (v_arrayElimArr_9 (Array Int Int)) (v_subst_1 Int) (v_DerPreprocessor_63 Int)) (or (not (= (select v_arrayElimArr_9 v_subst_1) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|)) (not (= (select (store (store v_arrayElimArr_9 v_subst_1 v_DerPreprocessor_63) v_subst_4 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) v_subst_1) v_DerPreprocessor_63)) (= (select (select (let ((.cse43 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse2 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| v_ArrVal_178)) v_ArrVal_178 v_arrayElimArr_9))) (store .cse43 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse43 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_ArrVal_178))) |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base|) .cse7) 0))) (= v_ArrVal_178 0))))) is different from true [2023-11-12 01:03:09,201 INFO L322 Elim1Store]: treesize reduction 90, result has 44.8 percent of original size [2023-11-12 01:03:09,202 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 250 treesize of output 239 [2023-11-12 01:03:09,244 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 01:03:09,244 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 183 treesize of output 181 [2023-11-12 01:03:09,264 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 120 [2023-11-12 01:03:09,398 INFO L322 Elim1Store]: treesize reduction 90, result has 44.8 percent of original size [2023-11-12 01:03:09,398 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 120 treesize of output 151 [2023-11-12 01:03:09,435 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 01:03:09,436 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 391 treesize of output 349 [2023-11-12 01:03:09,471 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 01:03:09,471 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 159 treesize of output 155 [2023-11-12 01:03:09,849 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-11-12 01:03:09,898 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-11-12 01:03:09,929 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 01:03:09,929 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 56 [2023-11-12 01:03:09,980 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 01:03:09,981 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 66 treesize of output 76 [2023-11-12 01:03:10,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 01:03:10,076 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 01:03:10,077 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 46 [2023-11-12 01:03:10,085 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 70 [2023-11-12 01:03:10,090 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 01:03:10,095 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 01:03:10,096 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 01:03:10,105 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 01:03:10,106 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 49 [2023-11-12 01:03:10,113 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 01:03:10,125 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 01:03:10,125 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 35 [2023-11-12 01:03:10,168 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 01:03:10,168 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 01:03:10,172 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-11-12 01:03:10,176 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 01:03:10,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 01:03:10,181 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 01:03:10,181 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 01:03:10,185 INFO L322 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2023-11-12 01:03:10,186 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 1 [2023-11-12 01:03:10,189 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 01:03:10,190 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 01:03:10,193 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-11-12 01:03:10,198 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 01:03:10,199 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 01:03:10,202 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-11-12 01:03:10,210 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 01:03:10,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 01:03:10,217 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 01:03:10,218 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 01:03:10,223 INFO L322 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2023-11-12 01:03:10,224 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 1 [2023-11-12 01:03:10,230 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 01:03:10,231 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 01:03:10,235 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-11-12 01:03:10,241 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 01:03:10,241 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 01:03:10,245 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-11-12 01:03:10,250 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 01:03:10,250 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 01:03:10,254 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-11-12 01:03:10,258 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 01:03:10,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 01:03:10,264 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 01:03:10,265 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 01:03:10,269 INFO L322 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2023-11-12 01:03:10,269 INFO L351 Elim1Store]: Elim1 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 1 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 1 [2023-11-12 01:03:10,273 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 01:03:10,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 01:03:10,278 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 01:03:10,279 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 01:03:10,283 INFO L322 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2023-11-12 01:03:10,283 INFO L351 Elim1Store]: Elim1 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 1 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 1 [2023-11-12 01:03:10,288 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 01:03:10,289 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 01:03:10,292 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-11-12 01:03:10,297 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 01:03:10,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 01:03:10,302 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 01:03:10,303 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 01:03:10,307 INFO L322 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2023-11-12 01:03:10,307 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 1 [2023-11-12 01:03:10,312 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 01:03:10,313 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 01:03:10,317 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-11-12 01:03:10,323 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 01:03:10,324 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 01:03:10,329 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-11-12 01:03:10,335 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 01:03:10,336 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 01:03:10,339 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-11-12 01:03:10,344 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 01:03:10,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 01:03:10,349 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 01:03:10,350 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 01:03:10,354 INFO L322 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2023-11-12 01:03:10,355 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 1 [2023-11-12 01:03:10,365 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 01:03:10,366 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 01:03:10,370 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-11-12 01:03:10,485 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 1 not checked. [2023-11-12 01:03:10,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1529207839] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 01:03:10,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2041111970] [2023-11-12 01:03:10,505 INFO L159 IcfgInterpreter]: Started Sifa with 26 locations of interest [2023-11-12 01:03:10,505 INFO L166 IcfgInterpreter]: Building call graph [2023-11-12 01:03:10,509 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-12 01:03:10,514 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-12 01:03:10,514 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-12 01:03:13,337 INFO L197 IcfgInterpreter]: Interpreting procedure aws_linked_list_is_valid with input of size 106 for LOIs [2023-11-12 01:03:13,461 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 17 for LOIs [2023-11-12 01:03:13,466 INFO L197 IcfgInterpreter]: Interpreting procedure nondet_uint64_t with input of size 94 for LOIs [2023-11-12 01:03:13,485 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-12 01:03:17,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [2041111970] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 01:03:17,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2023-11-12 01:03:17,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [5, 10, 9] total 30 [2023-11-12 01:03:17,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730784282] [2023-11-12 01:03:17,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 01:03:17,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-12 01:03:17,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 01:03:17,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-12 01:03:17,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=723, Unknown=3, NotChecked=54, Total=870 [2023-11-12 01:03:17,598 INFO L87 Difference]: Start difference. First operand 81 states and 108 transitions. Second operand has 12 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2023-11-12 01:03:20,692 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-12 01:03:22,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 01:03:22,765 INFO L93 Difference]: Finished difference Result 148 states and 194 transitions. [2023-11-12 01:03:22,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-12 01:03:22,766 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 38 [2023-11-12 01:03:22,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 01:03:22,768 INFO L225 Difference]: With dead ends: 148 [2023-11-12 01:03:22,768 INFO L226 Difference]: Without dead ends: 107 [2023-11-12 01:03:22,770 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 80 SyntacticMatches, 10 SemanticMatches, 32 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=117, Invalid=940, Unknown=3, NotChecked=62, Total=1122 [2023-11-12 01:03:22,771 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 21 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2023-11-12 01:03:22,771 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 239 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 362 Invalid, 1 Unknown, 0 Unchecked, 4.0s Time] [2023-11-12 01:03:22,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2023-11-12 01:03:22,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 105. [2023-11-12 01:03:22,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 65 states have (on average 1.3384615384615384) internal successors, (87), 68 states have internal predecessors, (87), 26 states have call successors, (26), 12 states have call predecessors, (26), 13 states have return successors, (26), 24 states have call predecessors, (26), 24 states have call successors, (26) [2023-11-12 01:03:22,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 139 transitions. [2023-11-12 01:03:22,807 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 139 transitions. Word has length 38 [2023-11-12 01:03:22,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 01:03:22,808 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 139 transitions. [2023-11-12 01:03:22,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2023-11-12 01:03:22,808 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 139 transitions. [2023-11-12 01:03:22,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-11-12 01:03:22,811 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 01:03:22,811 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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] [2023-11-12 01:03:22,820 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebb4a0e1-4e06-4801-9789-3a8264e576be/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-12 01:03:23,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebb4a0e1-4e06-4801-9789-3a8264e576be/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 01:03:23,017 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 01:03:23,017 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 01:03:23,017 INFO L85 PathProgramCache]: Analyzing trace with hash 936457051, now seen corresponding path program 1 times [2023-11-12 01:03:23,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 01:03:23,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082123401] [2023-11-12 01:03:23,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 01:03:23,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 01:03:23,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 01:03:23,273 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-12 01:03:23,273 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 01:03:23,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082123401] [2023-11-12 01:03:23,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082123401] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 01:03:23,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [148496223] [2023-11-12 01:03:23,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 01:03:23,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 01:03:23,274 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebb4a0e1-4e06-4801-9789-3a8264e576be/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 01:03:23,275 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebb4a0e1-4e06-4801-9789-3a8264e576be/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 01:03:23,283 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebb4a0e1-4e06-4801-9789-3a8264e576be/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-12 01:03:23,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 01:03:23,465 INFO L262 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-12 01:03:23,468 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 01:03:23,540 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-12 01:03:23,540 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-12 01:03:23,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [148496223] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 01:03:23,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-12 01:03:23,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2023-11-12 01:03:23,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762718118] [2023-11-12 01:03:23,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 01:03:23,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 01:03:23,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 01:03:23,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 01:03:23,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-11-12 01:03:23,543 INFO L87 Difference]: Start difference. First operand 105 states and 139 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-12 01:03:23,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 01:03:23,748 INFO L93 Difference]: Finished difference Result 187 states and 247 transitions. [2023-11-12 01:03:23,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 01:03:23,749 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 39 [2023-11-12 01:03:23,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 01:03:23,752 INFO L225 Difference]: With dead ends: 187 [2023-11-12 01:03:23,753 INFO L226 Difference]: Without dead ends: 111 [2023-11-12 01:03:23,754 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2023-11-12 01:03:23,755 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 30 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 01:03:23,756 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 151 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 01:03:23,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2023-11-12 01:03:23,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 109. [2023-11-12 01:03:23,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 68 states have (on average 1.2941176470588236) internal successors, (88), 72 states have internal predecessors, (88), 26 states have call successors, (26), 12 states have call predecessors, (26), 14 states have return successors, (28), 24 states have call predecessors, (28), 24 states have call successors, (28)