./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_linked_list_pop_back_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/aws-c-common/aws_linked_list_pop_back_harness.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --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 Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 4c102a8320469121bebf24ca3406288a96f198533855b78a0cc2eda1e300f8b5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 17:21:54,673 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 17:21:54,731 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-01-09 17:21:54,734 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 17:21:54,734 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 17:21:54,755 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 17:21:54,756 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 17:21:54,756 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 17:21:54,756 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 17:21:54,757 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 17:21:54,757 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 17:21:54,757 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 17:21:54,758 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 17:21:54,758 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 17:21:54,758 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 17:21:54,758 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 17:21:54,759 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 17:21:54,759 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 17:21:54,759 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 17:21:54,759 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 17:21:54,759 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 17:21:54,759 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 17:21:54,759 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 17:21:54,759 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 17:21:54,759 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 17:21:54,759 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 17:21:54,759 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 17:21:54,759 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 17:21:54,760 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 17:21:54,760 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 17:21:54,760 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 17:21:54,760 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 17:21:54,760 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 17:21:54,760 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 17:21:54,760 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 17:21:54,761 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 17:21:54,761 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 17:21:54,761 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 17:21:54,761 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 17:21:54,761 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 17:21:54,761 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 17:21:54,761 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 17:21:54,761 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 17:21:54,761 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 17:21:54,761 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 17:21:54,761 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux 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 -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4c102a8320469121bebf24ca3406288a96f198533855b78a0cc2eda1e300f8b5 [2025-01-09 17:21:54,966 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 17:21:54,972 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 17:21:54,973 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 17:21:54,974 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 17:21:54,974 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 17:21:54,975 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_linked_list_pop_back_harness.i [2025-01-09 17:21:56,057 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6aba29e13/da026440cc274a8fa3c71ab5bf9f3793/FLAG26f37c567 [2025-01-09 17:21:56,474 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 17:21:56,475 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_pop_back_harness.i [2025-01-09 17:21:56,501 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6aba29e13/da026440cc274a8fa3c71ab5bf9f3793/FLAG26f37c567 [2025-01-09 17:21:56,514 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6aba29e13/da026440cc274a8fa3c71ab5bf9f3793 [2025-01-09 17:21:56,515 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 17:21:56,516 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 17:21:56,518 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 17:21:56,518 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 17:21:56,521 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 17:21:56,521 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:21:56" (1/1) ... [2025-01-09 17:21:56,522 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@152815aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:21:56, skipping insertion in model container [2025-01-09 17:21:56,522 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:21:56" (1/1) ... [2025-01-09 17:21:56,567 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 17:21:56,717 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_pop_back_harness.i[4498,4511] [2025-01-09 17:21:56,722 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_pop_back_harness.i[4558,4571] [2025-01-09 17:21:57,098 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:21:57,099 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:21:57,099 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:21:57,101 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:21:57,102 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:21:57,111 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:21:57,112 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:21:57,113 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:21:57,113 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:21:57,114 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:21:57,115 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:21:57,115 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:21:57,116 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:21:57,389 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_pop_back_harness.i[150656,150669] [2025-01-09 17:21:57,390 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 17:21:57,405 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 17:21:57,414 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_pop_back_harness.i[4498,4511] [2025-01-09 17:21:57,418 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_pop_back_harness.i[4558,4571] [2025-01-09 17:21:57,457 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:21:57,457 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:21:57,457 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:21:57,457 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:21:57,459 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:21:57,464 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:21:57,464 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:21:57,465 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:21:57,466 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:21:57,466 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:21:57,467 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:21:57,468 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:21:57,468 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:21:57,539 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_pop_back_harness.i[150656,150669] [2025-01-09 17:21:57,540 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 17:21:57,654 INFO L204 MainTranslator]: Completed translation [2025-01-09 17:21:57,655 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:21:57 WrapperNode [2025-01-09 17:21:57,655 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 17:21:57,656 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 17:21:57,656 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 17:21:57,656 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 17:21:57,660 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:21:57" (1/1) ... [2025-01-09 17:21:57,692 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:21:57" (1/1) ... [2025-01-09 17:21:57,736 INFO L138 Inliner]: procedures = 668, calls = 1044, calls flagged for inlining = 53, calls inlined = 8, statements flattened = 219 [2025-01-09 17:21:57,737 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 17:21:57,737 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 17:21:57,737 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 17:21:57,737 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 17:21:57,746 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:21:57" (1/1) ... [2025-01-09 17:21:57,746 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:21:57" (1/1) ... [2025-01-09 17:21:57,748 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:21:57" (1/1) ... [2025-01-09 17:21:57,770 INFO L175 MemorySlicer]: Split 43 memory accesses to 3 slices as follows [2, 5, 36]. 84 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5, 0]. The 9 writes are split as follows [0, 0, 9]. [2025-01-09 17:21:57,771 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:21:57" (1/1) ... [2025-01-09 17:21:57,771 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:21:57" (1/1) ... [2025-01-09 17:21:57,786 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:21:57" (1/1) ... [2025-01-09 17:21:57,787 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:21:57" (1/1) ... [2025-01-09 17:21:57,789 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:21:57" (1/1) ... [2025-01-09 17:21:57,792 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:21:57" (1/1) ... [2025-01-09 17:21:57,793 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:21:57" (1/1) ... [2025-01-09 17:21:57,796 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 17:21:57,796 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 17:21:57,796 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 17:21:57,796 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 17:21:57,797 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:21:57" (1/1) ... [2025-01-09 17:21:57,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 17:21:57,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 17:21:57,822 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 17:21:57,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 17:21:57,840 INFO L130 BoogieDeclarations]: Found specification of procedure aws_is_mem_zeroed [2025-01-09 17:21:57,840 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_is_mem_zeroed [2025-01-09 17:21:57,840 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_remove [2025-01-09 17:21:57,841 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_remove [2025-01-09 17:21:57,841 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 17:21:57,841 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 17:21:57,841 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 17:21:57,841 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 17:21:57,841 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-01-09 17:21:57,841 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-01-09 17:21:57,841 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2025-01-09 17:21:57,841 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2025-01-09 17:21:57,842 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 17:21:57,842 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_is_valid [2025-01-09 17:21:57,842 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_is_valid [2025-01-09 17:21:57,842 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 17:21:57,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 17:21:57,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 17:21:57,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-09 17:21:57,842 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 17:21:57,842 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 17:21:57,842 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_empty [2025-01-09 17:21:57,842 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_empty [2025-01-09 17:21:57,842 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-01-09 17:21:57,842 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-01-09 17:21:57,843 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-01-09 17:21:57,843 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-01-09 17:21:57,843 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-01-09 17:21:57,843 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-01-09 17:21:57,843 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 17:21:57,843 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 17:21:57,843 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 17:21:57,843 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 17:21:57,843 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 17:21:57,843 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-09 17:21:57,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-01-09 17:21:57,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-01-09 17:21:57,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-01-09 17:21:57,843 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2025-01-09 17:21:57,843 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2025-01-09 17:21:57,843 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_prev_is_valid [2025-01-09 17:21:57,843 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_prev_is_valid [2025-01-09 17:21:57,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 17:21:57,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 17:21:57,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 17:21:58,017 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 17:21:58,018 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 17:21:58,282 INFO L? ?]: Removed 104 outVars from TransFormulas that were not future-live. [2025-01-09 17:21:58,282 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 17:21:58,289 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 17:21:58,290 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 17:21:58,290 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:21:58 BoogieIcfgContainer [2025-01-09 17:21:58,290 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 17:21:58,291 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 17:21:58,291 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 17:21:58,294 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 17:21:58,295 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 05:21:56" (1/3) ... [2025-01-09 17:21:58,295 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b2310e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:21:58, skipping insertion in model container [2025-01-09 17:21:58,295 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:21:57" (2/3) ... [2025-01-09 17:21:58,295 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b2310e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:21:58, skipping insertion in model container [2025-01-09 17:21:58,295 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:21:58" (3/3) ... [2025-01-09 17:21:58,296 INFO L128 eAbstractionObserver]: Analyzing ICFG aws_linked_list_pop_back_harness.i [2025-01-09 17:21:58,306 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 17:21:58,307 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG aws_linked_list_pop_back_harness.i that has 13 procedures, 141 locations, 1 initial locations, 7 loop locations, and 1 error locations. [2025-01-09 17:21:58,350 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 17:21:58,358 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, 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;@2a47699f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 17:21:58,358 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 17:21:58,361 INFO L276 IsEmpty]: Start isEmpty. Operand has 133 states, 85 states have (on average 1.2823529411764707) internal successors, (109), 86 states have internal predecessors, (109), 37 states have call successors, (37), 10 states have call predecessors, (37), 10 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2025-01-09 17:21:58,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-01-09 17:21:58,368 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:21:58,368 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 17:21:58,368 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:21:58,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:21:58,373 INFO L85 PathProgramCache]: Analyzing trace with hash 622833282, now seen corresponding path program 1 times [2025-01-09 17:21:58,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:21:58,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086275155] [2025-01-09 17:21:58,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:21:58,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:21:58,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-01-09 17:21:58,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-01-09 17:21:58,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:21:58,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:21:58,667 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2025-01-09 17:21:58,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:21:58,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086275155] [2025-01-09 17:21:58,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086275155] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 17:21:58,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1174976315] [2025-01-09 17:21:58,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:21:58,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 17:21:58,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 17:21:58,671 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 17:21:58,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 17:21:58,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-01-09 17:21:58,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-01-09 17:21:58,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:21:58,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:21:58,860 INFO L256 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 17:21:58,864 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 17:21:58,875 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2025-01-09 17:21:58,875 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 17:21:58,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1174976315] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:21:58,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 17:21:58,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 17:21:58,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454864594] [2025-01-09 17:21:58,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:21:58,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 17:21:58,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:21:58,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 17:21:58,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 17:21:58,894 INFO L87 Difference]: Start difference. First operand has 133 states, 85 states have (on average 1.2823529411764707) internal successors, (109), 86 states have internal predecessors, (109), 37 states have call successors, (37), 10 states have call predecessors, (37), 10 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 17:21:58,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:21:58,917 INFO L93 Difference]: Finished difference Result 258 states and 381 transitions. [2025-01-09 17:21:58,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 17:21:58,918 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 115 [2025-01-09 17:21:58,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:21:58,923 INFO L225 Difference]: With dead ends: 258 [2025-01-09 17:21:58,924 INFO L226 Difference]: Without dead ends: 128 [2025-01-09 17:21:58,927 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 17:21:58,928 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 17:21:58,929 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 17:21:58,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2025-01-09 17:21:58,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2025-01-09 17:21:58,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 80 states have (on average 1.2625) internal successors, (101), 81 states have internal predecessors, (101), 37 states have call successors, (37), 10 states have call predecessors, (37), 10 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-01-09 17:21:58,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 174 transitions. [2025-01-09 17:21:58,961 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 174 transitions. Word has length 115 [2025-01-09 17:21:58,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:21:58,961 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 174 transitions. [2025-01-09 17:21:58,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 17:21:58,961 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 174 transitions. [2025-01-09 17:21:58,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-01-09 17:21:58,963 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:21:58,963 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 17:21:58,970 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 17:21:59,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 17:21:59,164 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:21:59,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:21:59,164 INFO L85 PathProgramCache]: Analyzing trace with hash 332023088, now seen corresponding path program 1 times [2025-01-09 17:21:59,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:21:59,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161396252] [2025-01-09 17:21:59,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:21:59,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:21:59,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-01-09 17:21:59,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-01-09 17:21:59,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:21:59,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:21:59,799 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 20 proven. 8 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2025-01-09 17:21:59,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:21:59,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161396252] [2025-01-09 17:21:59,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161396252] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 17:21:59,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1689257501] [2025-01-09 17:21:59,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:21:59,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 17:21:59,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 17:21:59,802 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 17:21:59,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 17:21:59,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-01-09 17:21:59,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-01-09 17:21:59,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:21:59,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:21:59,983 INFO L256 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-01-09 17:21:59,991 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 17:22:00,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 24 treesize of output 32 [2025-01-09 17:22:00,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2025-01-09 17:22:00,163 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2025-01-09 17:22:00,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 15 [2025-01-09 17:22:00,297 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7| Int)) (let ((.cse0 (select v_DerPreprocessor_2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7|))) (let ((.cse2 (select |c_#memory_$Pointer$#2.base| .cse0))) (let ((.cse1 (select .cse2 24))) (and (<= 2 .cse0) (<= .cse0 .cse1) (= (store (select (store (store |c_#memory_$Pointer$#2.base| .cse0 v_DerPreprocessor_1) .cse1 v_DerPreprocessor_2) .cse0) 24 .cse1) .cse2) (not (= .cse0 .cse1))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_3| Int)) (let ((.cse3 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_3|))) (and (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_3| (select .cse3 24)) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_3|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_3| (select .cse3 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7|))))))) is different from true [2025-01-09 17:22:00,663 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7| Int)) (let ((.cse3 (select v_DerPreprocessor_2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7|))) (let ((.cse5 (select |c_#memory_$Pointer$#2.base| .cse3))) (let ((.cse4 (select .cse5 24))) (and (<= 2 .cse3) (<= .cse3 .cse4) (= (store (select (store (store |c_#memory_$Pointer$#2.base| .cse3 v_DerPreprocessor_1) .cse4 v_DerPreprocessor_2) .cse3) 24 .cse4) .cse5) (not (= .cse3 .cse4))))))))) (and (or .cse0 (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_4| Int)) (let ((.cse1 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_4|))) (and (= (select .cse1 24) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_4|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7| Int)) (= (select .cse1 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7|) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_4|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_4|))))) (or .cse0 (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_3| Int)) (let ((.cse2 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_3|))) (and (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_3| (select .cse2 24)) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_3|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_3| (select .cse2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7|))))))))) is different from true [2025-01-09 17:22:01,175 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7| Int)) (let ((.cse4 (select v_DerPreprocessor_2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7|))) (let ((.cse6 (select |c_#memory_$Pointer$#2.base| .cse4))) (let ((.cse5 (select .cse6 24))) (and (<= 2 .cse4) (<= .cse4 .cse5) (= (store (select (store (store |c_#memory_$Pointer$#2.base| .cse4 v_DerPreprocessor_1) .cse5 v_DerPreprocessor_2) .cse4) 24 .cse5) .cse6) (not (= .cse4 .cse5))))))))) (and (or .cse0 (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_1| Int)) (let ((.cse1 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_1|))) (and (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_1| (select .cse1 24)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7| Int)) (= (select .cse1 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7|) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_1|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_1|))))) (or .cse0 (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_4| Int)) (let ((.cse2 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_4|))) (and (= (select .cse2 24) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_4|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7| Int)) (= (select .cse2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7|) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_4|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_4|))))) (or .cse0 (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_3| Int)) (let ((.cse3 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_3|))) (and (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_3| (select .cse3 24)) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_3|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_3| (select .cse3 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7|))))))))) is different from true [2025-01-09 17:22:01,922 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7| Int)) (let ((.cse5 (select v_DerPreprocessor_2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7|))) (let ((.cse7 (select |c_#memory_$Pointer$#2.base| .cse5))) (let ((.cse6 (select .cse7 24))) (and (<= 2 .cse5) (<= .cse5 .cse6) (= (store (select (store (store |c_#memory_$Pointer$#2.base| .cse5 v_DerPreprocessor_1) .cse6 v_DerPreprocessor_2) .cse5) 24 .cse6) .cse7) (not (= .cse5 .cse6))))))))) (and (or .cse0 (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_1| Int)) (let ((.cse1 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_1|))) (and (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_1| (select .cse1 24)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7| Int)) (= (select .cse1 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7|) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_1|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_1|))))) (or .cse0 (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_4| Int)) (let ((.cse2 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_4|))) (and (= (select .cse2 24) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_4|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7| Int)) (= (select .cse2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7|) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_4|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_4|))))) (or .cse0 (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_2| Int)) (let ((.cse3 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_2|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_2| (select .cse3 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7|))) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_2|) (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_2| (select .cse3 24)))))) (or .cse0 (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_3| Int)) (let ((.cse4 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_3|))) (and (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_3| (select .cse4 24)) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_3|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_3| (select .cse4 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7|))))))))) is different from true [2025-01-09 17:22:02,203 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7| Int)) (let ((.cse8 (select v_DerPreprocessor_2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7|))) (let ((.cse10 (select |c_#memory_$Pointer$#2.base| .cse8))) (let ((.cse9 (select .cse10 24))) (and (<= 2 .cse8) (<= .cse8 .cse9) (= (store (select (store (store |c_#memory_$Pointer$#2.base| .cse8 v_DerPreprocessor_1) .cse9 v_DerPreprocessor_2) .cse8) 24 .cse9) .cse10) (not (= .cse8 .cse9))))))))) (and (<= 2 |c_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base|) (or .cse0 (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_1| Int)) (let ((.cse1 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_1|))) (and (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_1| (select .cse1 24)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7| Int)) (= (select .cse1 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7|) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_1|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_1|))))) (let ((.cse2 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base|))) (let ((.cse4 (select .cse2 24))) (let ((.cse3 (= |c_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base| .cse4))) (or (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7| Int)) (= |c_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base| (select .cse2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7|))) .cse3) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7| Int)) (and (= .cse2 (store (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base| v_DerPreprocessor_1) .cse4 v_DerPreprocessor_2) |c_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base|) 24 .cse4)) (= |c_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base| (select v_DerPreprocessor_2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7|)))) (not .cse3) (<= |c_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base| .cse4)))))) (or .cse0 (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_4| Int)) (let ((.cse5 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_4|))) (and (= (select .cse5 24) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_4|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7| Int)) (= (select .cse5 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7|) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_4|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_4|))))) (= |c_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset| 0) (or .cse0 (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_2| Int)) (let ((.cse6 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_2|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_2| (select .cse6 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7|))) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_2|) (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_2| (select .cse6 24)))))) (or .cse0 (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_3| Int)) (let ((.cse7 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_3|))) (and (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_3| (select .cse7 24)) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_3|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_3| (select .cse7 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7|))))))))) is different from true [2025-01-09 17:22:02,405 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7| Int)) (let ((.cse6 (select v_DerPreprocessor_2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7|))) (let ((.cse8 (select |c_#memory_$Pointer$#2.base| .cse6))) (let ((.cse7 (select .cse8 24))) (and (<= 2 .cse6) (<= .cse6 .cse7) (= (store (select (store (store |c_#memory_$Pointer$#2.base| .cse6 v_DerPreprocessor_1) .cse7 v_DerPreprocessor_2) .cse6) 24 .cse7) .cse8) (not (= .cse6 .cse7))))))))) (and (or .cse0 (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_1| Int)) (let ((.cse1 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_1|))) (and (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_1| (select .cse1 24)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7| Int)) (= (select .cse1 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7|) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_1|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_1|))))) (or .cse0 (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_4| Int)) (let ((.cse2 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_4|))) (and (= (select .cse2 24) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_4|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7| Int)) (= (select .cse2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7|) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_4|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_4|))))) (or .cse0 (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_2| Int)) (let ((.cse3 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_2|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_2| (select .cse3 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7|))) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_2|) (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_2| (select .cse3 24)))))) (or .cse0 (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_3| Int)) (let ((.cse4 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_3|))) (and (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_3| (select .cse4 24)) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_3|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_3| (select .cse4 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7|))))))) (or .cse0 (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_3| Int)) (let ((.cse5 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_3|))) (and (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_3| (select .cse5 24)) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_3|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_3| (select .cse5 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7|))))))))) is different from true [2025-01-09 17:22:03,410 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7| Int)) (let ((.cse7 (select v_DerPreprocessor_2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7|))) (let ((.cse9 (select |c_#memory_$Pointer$#2.base| .cse7))) (let ((.cse8 (select .cse9 24))) (and (<= 2 .cse7) (<= .cse7 .cse8) (= (store (select (store (store |c_#memory_$Pointer$#2.base| .cse7 v_DerPreprocessor_1) .cse8 v_DerPreprocessor_2) .cse7) 24 .cse8) .cse9) (not (= .cse7 .cse8))))))))) (and (or .cse0 (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_1| Int)) (let ((.cse1 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_1|))) (and (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_1| (select .cse1 24)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7| Int)) (= (select .cse1 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7|) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_1|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_1|))))) (or .cse0 (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_4| Int)) (let ((.cse2 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_4|))) (and (= (select .cse2 24) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_4|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7| Int)) (= (select .cse2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7|) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_4|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_4|))))) (or .cse0 (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_2| Int)) (let ((.cse3 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_2|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_2| (select .cse3 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7|))) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_2|) (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_2| (select .cse3 24)))))) (or .cse0 (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_4| Int)) (let ((.cse4 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_4|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_4| (select .cse4 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7|))) (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_4| (select .cse4 24)) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_4|))))) (or .cse0 (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_3| Int)) (let ((.cse5 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_3|))) (and (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_3| (select .cse5 24)) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_3|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_3| (select .cse5 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7|))))))) (or .cse0 (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_3| Int)) (let ((.cse6 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_3|))) (and (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_3| (select .cse6 24)) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_3|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_3| (select .cse6 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7|))))))))) is different from true [2025-01-09 17:22:03,760 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7| Int)) (let ((.cse10 (select v_DerPreprocessor_2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7|))) (let ((.cse12 (select |c_#memory_$Pointer$#2.base| .cse10))) (let ((.cse11 (select .cse12 24))) (and (<= 2 .cse10) (<= .cse10 .cse11) (= (store (select (store (store |c_#memory_$Pointer$#2.base| .cse10 v_DerPreprocessor_1) .cse11 v_DerPreprocessor_2) .cse10) 24 .cse11) .cse12) (not (= .cse10 .cse11))))))))) (and (<= 2 |c_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base|) (or .cse0 (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_1| Int)) (let ((.cse1 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_1|))) (and (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_1| (select .cse1 24)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7| Int)) (= (select .cse1 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7|) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_1|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_1|))))) (let ((.cse2 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base|))) (let ((.cse4 (select .cse2 24))) (let ((.cse3 (= |c_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base| .cse4))) (or (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7| Int)) (= |c_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base| (select .cse2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7|))) .cse3) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7| Int)) (and (= .cse2 (store (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base| v_DerPreprocessor_1) .cse4 v_DerPreprocessor_2) |c_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base|) 24 .cse4)) (= |c_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base| (select v_DerPreprocessor_2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7|)))) (not .cse3) (<= |c_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base| .cse4)))))) (or .cse0 (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_4| Int)) (let ((.cse5 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_4|))) (and (= (select .cse5 24) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_4|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7| Int)) (= (select .cse5 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7|) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_4|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_4|))))) (= |c_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset| 0) (or .cse0 (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_2| Int)) (let ((.cse6 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_2|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_2| (select .cse6 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7|))) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_2|) (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_2| (select .cse6 24)))))) (or .cse0 (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_4| Int)) (let ((.cse7 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_4|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_4| (select .cse7 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7|))) (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_4| (select .cse7 24)) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_4|))))) (or .cse0 (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_3| Int)) (let ((.cse8 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_3|))) (and (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_3| (select .cse8 24)) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_3|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_3| (select .cse8 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7|))))))) (or .cse0 (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_3| Int)) (let ((.cse9 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_3|))) (and (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_3| (select .cse9 24)) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_3|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_3| (select .cse9 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7|))))))))) is different from true [2025-01-09 17:22:04,148 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7| Int)) (let ((.cse8 (select v_DerPreprocessor_2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7|))) (let ((.cse10 (select |c_#memory_$Pointer$#2.base| .cse8))) (let ((.cse9 (select .cse10 24))) (and (<= 2 .cse8) (<= .cse8 .cse9) (= (store (select (store (store |c_#memory_$Pointer$#2.base| .cse8 v_DerPreprocessor_1) .cse9 v_DerPreprocessor_2) .cse8) 24 .cse9) .cse10) (not (= .cse8 .cse9))))))))) (and (or .cse0 (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_1| Int)) (let ((.cse1 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_1|))) (and (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_1| (select .cse1 24)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7| Int)) (= (select .cse1 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7|) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_1|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_1|))))) (or .cse0 (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_4| Int)) (let ((.cse2 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_4|))) (and (= (select .cse2 24) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_4|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7| Int)) (= (select .cse2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7|) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_4|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_4|))))) (or .cse0 (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_2| Int)) (let ((.cse3 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_2|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_2| (select .cse3 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7|))) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_2|) (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_2| (select .cse3 24)))))) (or .cse0 (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_4| Int)) (let ((.cse4 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_4|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_4| (select .cse4 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7|))) (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_4| (select .cse4 24)) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_4|))))) (or .cse0 (exists ((|v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_1| Int)) (let ((.cse5 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_1|))) (and (= |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_1| (select .cse5 24)) (<= 2 |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_1|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7| Int)) (= |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_1| (select .cse5 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7|))))))) (or .cse0 (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_3| Int)) (let ((.cse6 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_3|))) (and (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_3| (select .cse6 24)) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_3|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_3| (select .cse6 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7|))))))) (or .cse0 (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_3| Int)) (let ((.cse7 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_3|))) (and (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_3| (select .cse7 24)) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_3|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_3| (select .cse7 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7|))))))))) is different from true [2025-01-09 17:22:05,313 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7| Int)) (let ((.cse9 (select v_DerPreprocessor_2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7|))) (let ((.cse11 (select |c_#memory_$Pointer$#2.base| .cse9))) (let ((.cse10 (select .cse11 24))) (and (<= 2 .cse9) (<= .cse9 .cse10) (= (store (select (store (store |c_#memory_$Pointer$#2.base| .cse9 v_DerPreprocessor_1) .cse10 v_DerPreprocessor_2) .cse9) 24 .cse10) .cse11) (not (= .cse9 .cse10))))))))) (and (or .cse0 (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_1| Int)) (let ((.cse1 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_1|))) (and (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_1| (select .cse1 24)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7| Int)) (= (select .cse1 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7|) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_1|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_1|))))) (or .cse0 (exists ((|v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_2| Int)) (let ((.cse2 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_2|))) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_2|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7| Int)) (= (select .cse2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7|) |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_2|)) (= |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_2| (select .cse2 24)))))) (or .cse0 (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_4| Int)) (let ((.cse3 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_4|))) (and (= (select .cse3 24) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_4|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7| Int)) (= (select .cse3 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7|) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_4|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_4|))))) (or .cse0 (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_2| Int)) (let ((.cse4 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_2|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_2| (select .cse4 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7|))) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_2|) (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_2| (select .cse4 24)))))) (or .cse0 (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_4| Int)) (let ((.cse5 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_4|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_4| (select .cse5 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7|))) (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_4| (select .cse5 24)) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_4|))))) (or .cse0 (exists ((|v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_1| Int)) (let ((.cse6 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_1|))) (and (= |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_1| (select .cse6 24)) (<= 2 |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_1|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7| Int)) (= |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_1| (select .cse6 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7|))))))) (or .cse0 (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_3| Int)) (let ((.cse7 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_3|))) (and (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_3| (select .cse7 24)) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_3|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_3| (select .cse7 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7|))))))) (or .cse0 (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_3| Int)) (let ((.cse8 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_3|))) (and (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_3| (select .cse8 24)) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_3|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_3| (select .cse8 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7|))))))))) is different from true [2025-01-09 17:22:05,736 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7| Int)) (let ((.cse12 (select v_DerPreprocessor_2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7|))) (let ((.cse14 (select |c_#memory_$Pointer$#2.base| .cse12))) (let ((.cse13 (select .cse14 24))) (and (<= 2 .cse12) (<= .cse12 .cse13) (= (store (select (store (store |c_#memory_$Pointer$#2.base| .cse12 v_DerPreprocessor_1) .cse13 v_DerPreprocessor_2) .cse12) 24 .cse13) .cse14) (not (= .cse12 .cse13))))))))) (and (or .cse0 (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_1| Int)) (let ((.cse1 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_1|))) (and (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_1| (select .cse1 24)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7| Int)) (= (select .cse1 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7|) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_1|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_1|))))) (or .cse0 (exists ((|v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_2| Int)) (let ((.cse2 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_2|))) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_2|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7| Int)) (= (select .cse2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7|) |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_2|)) (= |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_2| (select .cse2 24)))))) (<= 2 |c_ULTIMATE.start_aws_linked_list_back_~list#1.base|) (= |c_ULTIMATE.start_aws_linked_list_back_~list#1.offset| 0) (or .cse0 (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_4| Int)) (let ((.cse3 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_4|))) (and (= (select .cse3 24) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_4|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7| Int)) (= (select .cse3 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7|) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_4|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_4|))))) (or .cse0 (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_2| Int)) (let ((.cse4 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_2|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_2| (select .cse4 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7|))) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_2|) (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_2| (select .cse4 24)))))) (or .cse0 (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_4| Int)) (let ((.cse5 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_4|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_4| (select .cse5 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7|))) (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_4| (select .cse5 24)) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_4|))))) (or .cse0 (exists ((|v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_1| Int)) (let ((.cse6 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_1|))) (and (= |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_1| (select .cse6 24)) (<= 2 |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_1|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7| Int)) (= |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_1| (select .cse6 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7|))))))) (or .cse0 (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_3| Int)) (let ((.cse7 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_3|))) (and (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_3| (select .cse7 24)) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_3|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_3| (select .cse7 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7|))))))) (or .cse0 (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_3| Int)) (let ((.cse8 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_3|))) (and (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_3| (select .cse8 24)) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_3|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_3| (select .cse8 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7|))))))) (let ((.cse9 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_linked_list_back_~list#1.base|))) (let ((.cse11 (select .cse9 24))) (let ((.cse10 (= .cse11 |c_ULTIMATE.start_aws_linked_list_back_~list#1.base|))) (or (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7| Int)) (= |c_ULTIMATE.start_aws_linked_list_back_~list#1.base| (select .cse9 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7|))) .cse10) (and (<= |c_ULTIMATE.start_aws_linked_list_back_~list#1.base| .cse11) (not .cse10) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7| Int)) (and (= |c_ULTIMATE.start_aws_linked_list_back_~list#1.base| (select v_DerPreprocessor_2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7|)) (= (store (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_linked_list_back_~list#1.base| v_DerPreprocessor_1) .cse11 v_DerPreprocessor_2) |c_ULTIMATE.start_aws_linked_list_back_~list#1.base|) 24 .cse11) .cse9)))))))))) is different from true [2025-01-09 17:22:05,960 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7| Int)) (let ((.cse10 (select v_DerPreprocessor_2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7|))) (let ((.cse12 (select |c_#memory_$Pointer$#2.base| .cse10))) (let ((.cse11 (select .cse12 24))) (and (<= 2 .cse10) (<= .cse10 .cse11) (= (store (select (store (store |c_#memory_$Pointer$#2.base| .cse10 v_DerPreprocessor_1) .cse11 v_DerPreprocessor_2) .cse10) 24 .cse11) .cse12) (not (= .cse10 .cse11))))))))) (and (or .cse0 (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_1| Int)) (let ((.cse1 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_1|))) (and (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_1| (select .cse1 24)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7| Int)) (= (select .cse1 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7|) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_1|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_1|))))) (or .cse0 (exists ((|v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_2| Int)) (let ((.cse2 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_2|))) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_2|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7| Int)) (= (select .cse2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7|) |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_2|)) (= |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_2| (select .cse2 24)))))) (or .cse0 (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_4| Int)) (let ((.cse3 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_4|))) (and (= (select .cse3 24) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_4|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7| Int)) (= (select .cse3 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7|) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_4|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_4|))))) (or .cse0 (exists ((|v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_3| Int)) (let ((.cse4 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_3|))) (and (= |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_3| (select .cse4 24)) (<= 2 |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_3|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7| Int)) (= (select .cse4 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7|) |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_3|)))))) (or .cse0 (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_2| Int)) (let ((.cse5 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_2|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_2| (select .cse5 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7|))) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_2|) (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_2| (select .cse5 24)))))) (or .cse0 (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_4| Int)) (let ((.cse6 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_4|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_4| (select .cse6 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7|))) (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_4| (select .cse6 24)) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_4|))))) (or .cse0 (exists ((|v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_1| Int)) (let ((.cse7 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_1|))) (and (= |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_1| (select .cse7 24)) (<= 2 |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_1|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7| Int)) (= |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_1| (select .cse7 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7|))))))) (or .cse0 (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_3| Int)) (let ((.cse8 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_3|))) (and (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_3| (select .cse8 24)) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_3|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_3| (select .cse8 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7|))))))) (or .cse0 (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_3| Int)) (let ((.cse9 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_3|))) (and (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_3| (select .cse9 24)) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_3|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_3| (select .cse9 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7|))))))))) is different from true [2025-01-09 17:22:07,304 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7| Int)) (let ((.cse11 (select v_DerPreprocessor_2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7|))) (let ((.cse13 (select |c_#memory_$Pointer$#2.base| .cse11))) (let ((.cse12 (select .cse13 24))) (and (<= 2 .cse11) (<= .cse11 .cse12) (= (store (select (store (store |c_#memory_$Pointer$#2.base| .cse11 v_DerPreprocessor_1) .cse12 v_DerPreprocessor_2) .cse11) 24 .cse12) .cse13) (not (= .cse11 .cse12))))))))) (and (or .cse0 (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_1| Int)) (let ((.cse1 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_1|))) (and (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_1| (select .cse1 24)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7| Int)) (= (select .cse1 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7|) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_1|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_1|))))) (or .cse0 (exists ((|v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_4| Int)) (let ((.cse2 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_4|))) (and (= (select .cse2 24) |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_4|) (<= 2 |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_4|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7| Int)) (= |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_4| (select .cse2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7|))))))) (or .cse0 (exists ((|v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_2| Int)) (let ((.cse3 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_2|))) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_2|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7| Int)) (= (select .cse3 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7|) |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_2|)) (= |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_2| (select .cse3 24)))))) (or .cse0 (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_4| Int)) (let ((.cse4 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_4|))) (and (= (select .cse4 24) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_4|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7| Int)) (= (select .cse4 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7|) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_4|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_4|))))) (or .cse0 (exists ((|v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_3| Int)) (let ((.cse5 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_3|))) (and (= |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_3| (select .cse5 24)) (<= 2 |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_3|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7| Int)) (= (select .cse5 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7|) |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_3|)))))) (or .cse0 (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_2| Int)) (let ((.cse6 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_2|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_2| (select .cse6 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7|))) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_2|) (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_2| (select .cse6 24)))))) (or .cse0 (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_4| Int)) (let ((.cse7 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_4|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_4| (select .cse7 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7|))) (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_4| (select .cse7 24)) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_4|))))) (or .cse0 (exists ((|v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_1| Int)) (let ((.cse8 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_1|))) (and (= |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_1| (select .cse8 24)) (<= 2 |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_1|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7| Int)) (= |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_1| (select .cse8 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7|))))))) (or .cse0 (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_3| Int)) (let ((.cse9 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_3|))) (and (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_3| (select .cse9 24)) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_3|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_3| (select .cse9 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7|))))))) (or .cse0 (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_3| Int)) (let ((.cse10 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_3|))) (and (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_3| (select .cse10 24)) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_3|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_3| (select .cse10 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7|))))))))) is different from true [2025-01-09 17:22:08,211 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7| Int)) (let ((.cse12 (select v_DerPreprocessor_2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7|))) (let ((.cse14 (select |c_#memory_$Pointer$#2.base| .cse12))) (let ((.cse13 (select .cse14 24))) (and (<= 2 .cse12) (<= .cse12 .cse13) (= (store (select (store (store |c_#memory_$Pointer$#2.base| .cse12 v_DerPreprocessor_1) .cse13 v_DerPreprocessor_2) .cse12) 24 .cse13) .cse14) (not (= .cse12 .cse13))))))))) (and (or .cse0 (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_1| Int)) (let ((.cse1 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_1|))) (and (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_1| (select .cse1 24)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7| Int)) (= (select .cse1 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7|) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_1|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_1|))))) (or .cse0 (exists ((|v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_4| Int)) (let ((.cse2 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_4|))) (and (= (select .cse2 24) |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_4|) (<= 2 |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_4|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7| Int)) (= |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_4| (select .cse2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7|))))))) (or .cse0 (exists ((|v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_2| Int)) (let ((.cse3 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_2|))) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_2|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7| Int)) (= (select .cse3 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7|) |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_2|)) (= |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_2| (select .cse3 24)))))) (or .cse0 (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_4| Int)) (let ((.cse4 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_4|))) (and (= (select .cse4 24) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_4|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7| Int)) (= (select .cse4 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7|) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_4|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_4|))))) (or .cse0 (exists ((|v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_3| Int)) (let ((.cse5 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_3|))) (and (= |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_3| (select .cse5 24)) (<= 2 |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_3|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7| Int)) (= (select .cse5 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7|) |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_3|)))))) (or .cse0 (exists ((|v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_5| Int)) (let ((.cse6 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_5|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7| Int)) (= |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_5| (select .cse6 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7|))) (= |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_5| (select .cse6 24)) (<= 2 |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_5|))))) (or .cse0 (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_2| Int)) (let ((.cse7 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_2|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_2| (select .cse7 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7|))) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_2|) (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_2| (select .cse7 24)))))) (or .cse0 (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_4| Int)) (let ((.cse8 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_4|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_4| (select .cse8 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7|))) (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_4| (select .cse8 24)) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_4|))))) (or .cse0 (exists ((|v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_1| Int)) (let ((.cse9 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_1|))) (and (= |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_1| (select .cse9 24)) (<= 2 |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_1|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7| Int)) (= |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_1| (select .cse9 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7|))))))) (or .cse0 (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_3| Int)) (let ((.cse10 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_3|))) (and (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_3| (select .cse10 24)) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_3|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_3| (select .cse10 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7|))))))) (or .cse0 (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_3| Int)) (let ((.cse11 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_3|))) (and (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_3| (select .cse11 24)) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_3|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_3| (select .cse11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7|))))))))) is different from true [2025-01-09 17:22:09,210 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7| Int)) (let ((.cse12 (select v_DerPreprocessor_2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7|))) (let ((.cse14 (select |c_#memory_$Pointer$#2.base| .cse12))) (let ((.cse13 (select .cse14 24))) (and (<= 2 .cse12) (<= .cse12 .cse13) (= (store (select (store (store |c_#memory_$Pointer$#2.base| .cse12 v_DerPreprocessor_1) .cse13 v_DerPreprocessor_2) .cse12) 24 .cse13) .cse14) (not (= .cse12 .cse13))))))))) (and (or .cse0 (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_1| Int)) (let ((.cse1 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_1|))) (and (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_1| (select .cse1 24)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7| Int)) (= (select .cse1 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7|) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_1|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_1|))))) (or .cse0 (exists ((|v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_4| Int)) (let ((.cse2 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_4|))) (and (= (select .cse2 24) |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_4|) (<= 2 |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_4|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7| Int)) (= |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_4| (select .cse2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7|))))))) (or .cse0 (exists ((|v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_2| Int)) (let ((.cse3 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_2|))) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_2|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7| Int)) (= (select .cse3 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7|) |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_2|)) (= |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_2| (select .cse3 24)))))) (or |c_aws_linked_list_is_valid_#t~short308#1| (< (select (select |c_#memory_$Pointer$#2.base| |c_aws_linked_list_is_valid_#in~list#1.base|) (+ |c_aws_linked_list_is_valid_#in~list#1.offset| 24)) 1)) (or .cse0 (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_4| Int)) (let ((.cse4 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_4|))) (and (= (select .cse4 24) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_4|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7| Int)) (= (select .cse4 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7|) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_4|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_4|))))) (or .cse0 (exists ((|v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_3| Int)) (let ((.cse5 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_3|))) (and (= |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_3| (select .cse5 24)) (<= 2 |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_3|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7| Int)) (= (select .cse5 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7|) |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_3|)))))) (or .cse0 (exists ((|v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_5| Int)) (let ((.cse6 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_5|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7| Int)) (= |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_5| (select .cse6 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7|))) (= |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_5| (select .cse6 24)) (<= 2 |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_5|))))) (or .cse0 (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_2| Int)) (let ((.cse7 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_2|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_2| (select .cse7 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7|))) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_2|) (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_2| (select .cse7 24)))))) (or .cse0 (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_4| Int)) (let ((.cse8 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_4|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_4| (select .cse8 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7|))) (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_4| (select .cse8 24)) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_4|))))) (or .cse0 (exists ((|v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_1| Int)) (let ((.cse9 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_1|))) (and (= |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_1| (select .cse9 24)) (<= 2 |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_1|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7| Int)) (= |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_1| (select .cse9 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7|))))))) (or .cse0 (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_3| Int)) (let ((.cse10 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_3|))) (and (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_3| (select .cse10 24)) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_3|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_3| (select .cse10 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7|))))))) (or .cse0 (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_3| Int)) (let ((.cse11 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_3|))) (and (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_3| (select .cse11 24)) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_3|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_3| (select .cse11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7|))))))))) is different from true [2025-01-09 17:22:09,367 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7| Int)) (let ((.cse12 (select v_DerPreprocessor_2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7|))) (let ((.cse14 (select |c_#memory_$Pointer$#2.base| .cse12))) (let ((.cse13 (select .cse14 24))) (and (<= 2 .cse12) (<= .cse12 .cse13) (= (store (select (store (store |c_#memory_$Pointer$#2.base| .cse12 v_DerPreprocessor_1) .cse13 v_DerPreprocessor_2) .cse12) 24 .cse13) .cse14) (not (= .cse12 .cse13))))))))) (and (or .cse0 (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_1| Int)) (let ((.cse1 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_1|))) (and (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_1| (select .cse1 24)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7| Int)) (= (select .cse1 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7|) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_1|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_1|))))) (or .cse0 (exists ((|v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_4| Int)) (let ((.cse2 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_4|))) (and (= (select .cse2 24) |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_4|) (<= 2 |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_4|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7| Int)) (= |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_4| (select .cse2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7|))))))) (or .cse0 (exists ((|v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_2| Int)) (let ((.cse3 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_2|))) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_2|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7| Int)) (= (select .cse3 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7|) |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_2|)) (= |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_2| (select .cse3 24)))))) (or .cse0 (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_4| Int)) (let ((.cse4 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_4|))) (and (= (select .cse4 24) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_4|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7| Int)) (= (select .cse4 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7|) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_4|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_4|))))) (or .cse0 (exists ((|v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_3| Int)) (let ((.cse5 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_3|))) (and (= |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_3| (select .cse5 24)) (<= 2 |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_3|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7| Int)) (= (select .cse5 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7|) |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_3|)))))) (or .cse0 (exists ((|v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_5| Int)) (let ((.cse6 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_5|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7| Int)) (= |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_5| (select .cse6 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7|))) (= |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_5| (select .cse6 24)) (<= 2 |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_5|))))) (or .cse0 (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_2| Int)) (let ((.cse7 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_2|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_2| (select .cse7 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7|))) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_2|) (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_2| (select .cse7 24)))))) (or .cse0 (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_4| Int)) (let ((.cse8 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_4|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_4| (select .cse8 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7|))) (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_4| (select .cse8 24)) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_4|))))) (or |c_aws_linked_list_is_valid_#t~short310#1| (< (select (select |c_#memory_$Pointer$#2.base| |c_aws_linked_list_is_valid_#in~list#1.base|) (+ |c_aws_linked_list_is_valid_#in~list#1.offset| 24)) 1)) (or .cse0 (exists ((|v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_1| Int)) (let ((.cse9 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_1|))) (and (= |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_1| (select .cse9 24)) (<= 2 |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_1|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7| Int)) (= |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_1| (select .cse9 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7|))))))) (or .cse0 (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_3| Int)) (let ((.cse10 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_3|))) (and (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_3| (select .cse10 24)) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_3|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_3| (select .cse10 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7|))))))) (or .cse0 (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_3| Int)) (let ((.cse11 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_3|))) (and (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_3| (select .cse11 24)) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_3|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_3| (select .cse11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7|))))))))) is different from true [2025-01-09 17:22:09,519 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7| Int)) (let ((.cse12 (select v_DerPreprocessor_2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7|))) (let ((.cse14 (select |c_#memory_$Pointer$#2.base| .cse12))) (let ((.cse13 (select .cse14 24))) (and (<= 2 .cse12) (<= .cse12 .cse13) (= (store (select (store (store |c_#memory_$Pointer$#2.base| .cse12 v_DerPreprocessor_1) .cse13 v_DerPreprocessor_2) .cse12) 24 .cse13) .cse14) (not (= .cse12 .cse13))))))))) (and (or .cse0 (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_1| Int)) (let ((.cse1 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_1|))) (and (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_1| (select .cse1 24)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7| Int)) (= (select .cse1 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7|) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_1|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_1|))))) (or .cse0 (exists ((|v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_4| Int)) (let ((.cse2 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_4|))) (and (= (select .cse2 24) |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_4|) (<= 2 |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_4|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7| Int)) (= |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_4| (select .cse2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7|))))))) (or .cse0 (exists ((|v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_2| Int)) (let ((.cse3 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_2|))) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_2|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7| Int)) (= (select .cse3 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7|) |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_2|)) (= |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_2| (select .cse3 24)))))) (or .cse0 (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_4| Int)) (let ((.cse4 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_4|))) (and (= (select .cse4 24) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_4|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7| Int)) (= (select .cse4 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7|) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_4|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_4|))))) (or .cse0 (exists ((|v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_3| Int)) (let ((.cse5 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_3|))) (and (= |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_3| (select .cse5 24)) (<= 2 |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_3|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7| Int)) (= (select .cse5 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7|) |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_3|)))))) (or .cse0 (exists ((|v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_5| Int)) (let ((.cse6 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_5|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7| Int)) (= |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_5| (select .cse6 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7|))) (= |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_5| (select .cse6 24)) (<= 2 |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_5|))))) (or .cse0 (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_2| Int)) (let ((.cse7 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_2|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_2| (select .cse7 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7|))) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_2|) (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_2| (select .cse7 24)))))) (or .cse0 (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_4| Int)) (let ((.cse8 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_4|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_4| (select .cse8 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7|))) (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_4| (select .cse8 24)) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_4|))))) (or .cse0 (exists ((|v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_1| Int)) (let ((.cse9 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_1|))) (and (= |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_1| (select .cse9 24)) (<= 2 |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_1|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7| Int)) (= |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_1| (select .cse9 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7|))))))) (<= (select (select |c_#memory_$Pointer$#2.base| |c_aws_linked_list_is_valid_#in~list#1.base|) (+ |c_aws_linked_list_is_valid_#in~list#1.offset| 24)) 0) (or .cse0 (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_3| Int)) (let ((.cse10 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_3|))) (and (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_3| (select .cse10 24)) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_3|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_3| (select .cse10 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7|))))))) (or .cse0 (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_3| Int)) (let ((.cse11 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_3|))) (and (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_3| (select .cse11 24)) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_3|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_3| (select .cse11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_7|))))))))) is different from true [2025-01-09 17:22:09,812 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 160 not checked. [2025-01-09 17:22:09,812 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 17:22:10,256 INFO L349 Elim1Store]: treesize reduction 19, result has 62.0 percent of original size [2025-01-09 17:22:10,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 90 treesize of output 98 [2025-01-09 17:22:10,278 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 17:22:10,279 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 98 treesize of output 114 [2025-01-09 17:22:10,286 INFO L378 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 33 treesize of output 29 [2025-01-09 17:22:10,320 INFO L378 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 [2025-01-09 17:22:10,360 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 17:22:10,360 INFO L378 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 19 treesize of output 23 [2025-01-09 17:22:10,387 INFO L378 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 7 treesize of output 3 [2025-01-09 17:22:10,415 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 17:22:10,416 INFO L378 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 137 treesize of output 165 [2025-01-09 17:22:10,660 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2025-01-09 17:22:10,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1689257501] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 17:22:10,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 17:22:10,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [6, 33] total 47 [2025-01-09 17:22:10,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538970912] [2025-01-09 17:22:10,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:22:10,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 17:22:10,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:22:10,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 17:22:10,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=712, Unknown=104, NotChecked=1224, Total=2162 [2025-01-09 17:22:10,663 INFO L87 Difference]: Start difference. First operand 128 states and 174 transitions. Second operand has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 6 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14) [2025-01-09 17:22:11,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:22:11,295 INFO L93 Difference]: Finished difference Result 280 states and 404 transitions. [2025-01-09 17:22:11,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 17:22:11,295 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 6 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14) Word has length 115 [2025-01-09 17:22:11,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:22:11,298 INFO L225 Difference]: With dead ends: 280 [2025-01-09 17:22:11,298 INFO L226 Difference]: Without dead ends: 170 [2025-01-09 17:22:11,300 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 17 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=176, Invalid=1262, Unknown=112, NotChecked=1530, Total=3080 [2025-01-09 17:22:11,300 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 251 mSDsluCounter, 1121 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 1291 SdHoareTripleChecker+Invalid, 571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 17:22:11,300 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 1291 Invalid, 571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 17:22:11,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2025-01-09 17:22:11,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 158. [2025-01-09 17:22:11,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 97 states have (on average 1.288659793814433) internal successors, (125), 100 states have internal predecessors, (125), 49 states have call successors, (49), 10 states have call predecessors, (49), 11 states have return successors, (53), 47 states have call predecessors, (53), 48 states have call successors, (53) [2025-01-09 17:22:11,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 227 transitions. [2025-01-09 17:22:11,317 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 227 transitions. Word has length 115 [2025-01-09 17:22:11,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:22:11,317 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 227 transitions. [2025-01-09 17:22:11,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 6 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14) [2025-01-09 17:22:11,317 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 227 transitions. [2025-01-09 17:22:11,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-01-09 17:22:11,319 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:22:11,319 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 17:22:11,326 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 17:22:11,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 17:22:11,520 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:22:11,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:22:11,521 INFO L85 PathProgramCache]: Analyzing trace with hash 691399286, now seen corresponding path program 1 times [2025-01-09 17:22:11,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:22:11,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039446816] [2025-01-09 17:22:11,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:22:11,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:22:11,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-01-09 17:22:11,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-01-09 17:22:11,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:22:11,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:22:11,859 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 15 proven. 13 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2025-01-09 17:22:11,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:22:11,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039446816] [2025-01-09 17:22:11,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039446816] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 17:22:11,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1450382981] [2025-01-09 17:22:11,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:22:11,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 17:22:11,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 17:22:11,865 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 17:22:11,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 17:22:11,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-01-09 17:22:12,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-01-09 17:22:12,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:22:12,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:22:12,005 INFO L256 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 63 conjuncts are in the unsatisfiable core [2025-01-09 17:22:12,008 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 17:22:12,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2025-01-09 17:22:12,097 INFO L378 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 16 treesize of output 17 [2025-01-09 17:22:13,650 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 79 proven. 28 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2025-01-09 17:22:13,651 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 17:22:26,246 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2025-01-09 17:22:26,246 INFO L378 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 174 treesize of output 160 [2025-01-09 17:22:26,251 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2025-01-09 17:22:26,266 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 17:22:26,266 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 65 treesize of output 81 [2025-01-09 17:22:26,298 INFO L378 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 [2025-01-09 17:22:26,310 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 17:22:26,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2025-01-09 17:22:26,328 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-01-09 17:22:26,335 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 17:22:26,335 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 71 [2025-01-09 17:22:26,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 17:22:26,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 17:22:26,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 60 treesize of output 56 [2025-01-09 17:22:26,470 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2025-01-09 17:22:26,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1450382981] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 17:22:26,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 17:22:26,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [6, 17] total 34 [2025-01-09 17:22:26,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474179539] [2025-01-09 17:22:26,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:22:26,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-09 17:22:26,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:22:26,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-09 17:22:26,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=1013, Unknown=3, NotChecked=0, Total=1122 [2025-01-09 17:22:26,472 INFO L87 Difference]: Start difference. First operand 158 states and 227 transitions. Second operand has 17 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 14 states have internal predecessors, (41), 8 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (15), 8 states have call predecessors, (15), 8 states have call successors, (15) [2025-01-09 17:22:27,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:22:27,001 INFO L93 Difference]: Finished difference Result 266 states and 376 transitions. [2025-01-09 17:22:27,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 17:22:27,002 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 14 states have internal predecessors, (41), 8 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (15), 8 states have call predecessors, (15), 8 states have call successors, (15) Word has length 115 [2025-01-09 17:22:27,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:22:27,005 INFO L225 Difference]: With dead ends: 266 [2025-01-09 17:22:27,005 INFO L226 Difference]: Without dead ends: 141 [2025-01-09 17:22:27,006 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 186 SyntacticMatches, 16 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 334 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=129, Invalid=1274, Unknown=3, NotChecked=0, Total=1406 [2025-01-09 17:22:27,009 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 9 mSDsluCounter, 1852 mSDsCounter, 0 mSdLazyCounter, 618 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 2018 SdHoareTripleChecker+Invalid, 629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 17:22:27,009 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 2018 Invalid, 629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 618 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 17:22:27,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2025-01-09 17:22:27,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 129. [2025-01-09 17:22:27,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 81 states have (on average 1.2592592592592593) internal successors, (102), 82 states have internal predecessors, (102), 37 states have call successors, (37), 10 states have call predecessors, (37), 10 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-01-09 17:22:27,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 175 transitions. [2025-01-09 17:22:27,022 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 175 transitions. Word has length 115 [2025-01-09 17:22:27,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:22:27,022 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 175 transitions. [2025-01-09 17:22:27,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 14 states have internal predecessors, (41), 8 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (15), 8 states have call predecessors, (15), 8 states have call successors, (15) [2025-01-09 17:22:27,023 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 175 transitions. [2025-01-09 17:22:27,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-01-09 17:22:27,025 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:22:27,025 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 17:22:27,035 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 17:22:27,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 17:22:27,225 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:22:27,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:22:27,226 INFO L85 PathProgramCache]: Analyzing trace with hash -272627548, now seen corresponding path program 1 times [2025-01-09 17:22:27,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:22:27,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20053836] [2025-01-09 17:22:27,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:22:27,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:22:27,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-01-09 17:22:27,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-01-09 17:22:27,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:22:27,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:22:27,504 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 15 proven. 13 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2025-01-09 17:22:27,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:22:27,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20053836] [2025-01-09 17:22:27,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20053836] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 17:22:27,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [415269895] [2025-01-09 17:22:27,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:22:27,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 17:22:27,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 17:22:27,507 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 17:22:27,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 17:22:27,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-01-09 17:22:27,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-01-09 17:22:27,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:22:27,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:22:27,672 INFO L256 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 86 conjuncts are in the unsatisfiable core [2025-01-09 17:22:27,677 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 17:22:27,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-09 17:22:27,788 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 17:22:27,788 INFO L378 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 11 treesize of output 11 [2025-01-09 17:22:27,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2025-01-09 17:22:27,796 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-01-09 17:22:27,802 INFO L378 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2025-01-09 17:22:27,805 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-01-09 17:22:27,842 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2025-01-09 17:22:27,842 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 46 [2025-01-09 17:22:27,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 17:22:27,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 23 [2025-01-09 17:22:27,853 INFO L378 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 14 treesize of output 18 [2025-01-09 17:22:28,715 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 112 proven. 17 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-01-09 17:22:28,715 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 17:22:29,223 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 17:22:29,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 134 treesize of output 110 [2025-01-09 17:22:29,230 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 17:22:29,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 82 [2025-01-09 17:22:29,244 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 17:22:29,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 919 treesize of output 801 [2025-01-09 17:22:29,261 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 17:22:29,262 INFO L378 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 605 treesize of output 581 [2025-01-09 17:22:29,292 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 17:22:29,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 508 treesize of output 520 [2025-01-09 17:22:29,314 INFO L378 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 427 treesize of output 419 [2025-01-09 17:22:29,453 INFO L378 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 [2025-01-09 17:22:29,871 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 17:22:29,871 INFO L378 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 89 treesize of output 91 [2025-01-09 17:22:29,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-01-09 17:22:30,077 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 17:22:30,077 INFO L378 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 76 treesize of output 78 [2025-01-09 17:22:30,275 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 17:22:30,275 INFO L378 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 93 treesize of output 87 [2025-01-09 17:22:30,345 INFO L378 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 [2025-01-09 17:22:30,351 INFO L378 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 [2025-01-09 17:22:30,435 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 17:22:30,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 326 treesize of output 282 [2025-01-09 17:22:31,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [415269895] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 17:22:31,576 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 17:22:31,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 16] total 20 [2025-01-09 17:22:31,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850197799] [2025-01-09 17:22:31,576 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 17:22:31,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-01-09 17:22:31,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:22:31,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-01-09 17:22:31,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=881, Unknown=0, NotChecked=0, Total=992 [2025-01-09 17:22:31,579 INFO L87 Difference]: Start difference. First operand 129 states and 175 transitions. Second operand has 20 states, 19 states have (on average 4.368421052631579) internal successors, (83), 19 states have internal predecessors, (83), 7 states have call successors, (30), 4 states have call predecessors, (30), 7 states have return successors, (29), 7 states have call predecessors, (29), 7 states have call successors, (29) [2025-01-09 17:22:33,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:22:33,321 INFO L93 Difference]: Finished difference Result 351 states and 492 transitions. [2025-01-09 17:22:33,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-01-09 17:22:33,322 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 4.368421052631579) internal successors, (83), 19 states have internal predecessors, (83), 7 states have call successors, (30), 4 states have call predecessors, (30), 7 states have return successors, (29), 7 states have call predecessors, (29), 7 states have call successors, (29) Word has length 116 [2025-01-09 17:22:33,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:22:33,323 INFO L225 Difference]: With dead ends: 351 [2025-01-09 17:22:33,323 INFO L226 Difference]: Without dead ends: 239 [2025-01-09 17:22:33,324 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 191 SyntacticMatches, 11 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 546 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=341, Invalid=2521, Unknown=0, NotChecked=0, Total=2862 [2025-01-09 17:22:33,325 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 375 mSDsluCounter, 1193 mSDsCounter, 0 mSdLazyCounter, 997 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 1323 SdHoareTripleChecker+Invalid, 1157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 997 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 17:22:33,325 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 1323 Invalid, 1157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 997 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 17:22:33,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2025-01-09 17:22:33,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 226. [2025-01-09 17:22:33,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 146 states have (on average 1.3013698630136987) internal successors, (190), 150 states have internal predecessors, (190), 61 states have call successors, (61), 17 states have call predecessors, (61), 18 states have return successors, (66), 58 states have call predecessors, (66), 60 states have call successors, (66) [2025-01-09 17:22:33,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 317 transitions. [2025-01-09 17:22:33,351 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 317 transitions. Word has length 116 [2025-01-09 17:22:33,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:22:33,352 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 317 transitions. [2025-01-09 17:22:33,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 4.368421052631579) internal successors, (83), 19 states have internal predecessors, (83), 7 states have call successors, (30), 4 states have call predecessors, (30), 7 states have return successors, (29), 7 states have call predecessors, (29), 7 states have call successors, (29) [2025-01-09 17:22:33,352 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 317 transitions. [2025-01-09 17:22:33,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-01-09 17:22:33,353 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:22:33,353 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 17:22:33,360 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 17:22:33,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 17:22:33,557 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:22:33,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:22:33,557 INFO L85 PathProgramCache]: Analyzing trace with hash 597321282, now seen corresponding path program 1 times [2025-01-09 17:22:33,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:22:33,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950875836] [2025-01-09 17:22:33,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:22:33,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:22:33,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-01-09 17:22:33,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-01-09 17:22:33,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:22:33,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:22:33,713 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2025-01-09 17:22:33,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:22:33,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950875836] [2025-01-09 17:22:33,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950875836] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 17:22:33,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1737219276] [2025-01-09 17:22:33,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:22:33,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 17:22:33,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 17:22:33,716 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 17:22:33,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 17:22:33,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-01-09 17:22:33,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-01-09 17:22:33,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:22:33,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:22:33,860 INFO L256 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-09 17:22:33,862 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 17:22:33,930 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2025-01-09 17:22:33,930 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 17:22:33,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1737219276] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:22:33,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 17:22:33,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [7] total 13 [2025-01-09 17:22:33,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629661386] [2025-01-09 17:22:33,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:22:33,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 17:22:33,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:22:33,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 17:22:33,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-01-09 17:22:33,931 INFO L87 Difference]: Start difference. First operand 226 states and 317 transitions. Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2025-01-09 17:22:34,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:22:34,134 INFO L93 Difference]: Finished difference Result 441 states and 618 transitions. [2025-01-09 17:22:34,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 17:22:34,134 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) Word has length 118 [2025-01-09 17:22:34,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:22:34,136 INFO L225 Difference]: With dead ends: 441 [2025-01-09 17:22:34,136 INFO L226 Difference]: Without dead ends: 243 [2025-01-09 17:22:34,137 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2025-01-09 17:22:34,137 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 195 mSDsluCounter, 612 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 748 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 17:22:34,137 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 748 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 17:22:34,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2025-01-09 17:22:34,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 229. [2025-01-09 17:22:34,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 148 states have (on average 1.2972972972972974) internal successors, (192), 153 states have internal predecessors, (192), 61 states have call successors, (61), 17 states have call predecessors, (61), 19 states have return successors, (68), 58 states have call predecessors, (68), 60 states have call successors, (68) [2025-01-09 17:22:34,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 321 transitions. [2025-01-09 17:22:34,157 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 321 transitions. Word has length 118 [2025-01-09 17:22:34,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:22:34,157 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 321 transitions. [2025-01-09 17:22:34,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2025-01-09 17:22:34,157 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 321 transitions. [2025-01-09 17:22:34,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-01-09 17:22:34,158 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:22:34,158 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 17:22:34,165 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-09 17:22:34,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 17:22:34,359 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:22:34,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:22:34,359 INFO L85 PathProgramCache]: Analyzing trace with hash 1513008446, now seen corresponding path program 1 times [2025-01-09 17:22:34,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:22:34,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436014042] [2025-01-09 17:22:34,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:22:34,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:22:34,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-01-09 17:22:34,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-01-09 17:22:34,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:22:34,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:22:34,589 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2025-01-09 17:22:34,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:22:34,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436014042] [2025-01-09 17:22:34,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436014042] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 17:22:34,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1627112156] [2025-01-09 17:22:34,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:22:34,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 17:22:34,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 17:22:34,616 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 17:22:34,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 17:22:34,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-01-09 17:22:34,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-01-09 17:22:34,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:22:34,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:22:34,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 499 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-09 17:22:34,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 17:22:34,857 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2025-01-09 17:22:34,858 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 17:22:34,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1627112156] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:22:34,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 17:22:34,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [8] total 15 [2025-01-09 17:22:34,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015268167] [2025-01-09 17:22:34,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:22:34,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 17:22:34,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:22:34,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 17:22:34,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2025-01-09 17:22:34,860 INFO L87 Difference]: Start difference. First operand 229 states and 321 transitions. Second operand has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2025-01-09 17:22:35,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:22:35,123 INFO L93 Difference]: Finished difference Result 466 states and 657 transitions. [2025-01-09 17:22:35,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 17:22:35,123 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) Word has length 120 [2025-01-09 17:22:35,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:22:35,125 INFO L225 Difference]: With dead ends: 466 [2025-01-09 17:22:35,126 INFO L226 Difference]: Without dead ends: 265 [2025-01-09 17:22:35,126 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=399, Unknown=0, NotChecked=0, Total=462 [2025-01-09 17:22:35,127 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 210 mSDsluCounter, 731 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 865 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 17:22:35,127 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 865 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 17:22:35,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2025-01-09 17:22:35,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 232. [2025-01-09 17:22:35,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 151 states have (on average 1.304635761589404) internal successors, (197), 156 states have internal predecessors, (197), 61 states have call successors, (61), 17 states have call predecessors, (61), 19 states have return successors, (68), 58 states have call predecessors, (68), 60 states have call successors, (68) [2025-01-09 17:22:35,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 326 transitions. [2025-01-09 17:22:35,145 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 326 transitions. Word has length 120 [2025-01-09 17:22:35,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:22:35,145 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 326 transitions. [2025-01-09 17:22:35,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2025-01-09 17:22:35,146 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 326 transitions. [2025-01-09 17:22:35,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-01-09 17:22:35,147 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:22:35,147 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 17:22:35,154 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-09 17:22:35,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-01-09 17:22:35,347 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:22:35,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:22:35,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1593303789, now seen corresponding path program 1 times [2025-01-09 17:22:35,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:22:35,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385557298] [2025-01-09 17:22:35,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:22:35,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:22:35,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-01-09 17:22:35,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-01-09 17:22:35,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:22:35,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:22:35,572 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2025-01-09 17:22:35,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:22:35,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385557298] [2025-01-09 17:22:35,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385557298] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 17:22:35,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1450218846] [2025-01-09 17:22:35,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:22:35,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 17:22:35,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 17:22:35,575 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 17:22:35,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-09 17:22:35,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-01-09 17:22:35,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-01-09 17:22:35,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:22:35,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:22:35,735 INFO L256 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 17:22:35,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 17:22:35,752 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2025-01-09 17:22:35,752 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 17:22:35,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1450218846] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:22:35,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 17:22:35,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2025-01-09 17:22:35,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107242002] [2025-01-09 17:22:35,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:22:35,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 17:22:35,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:22:35,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 17:22:35,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 17:22:35,753 INFO L87 Difference]: Start difference. First operand 232 states and 326 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 17:22:35,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:22:35,816 INFO L93 Difference]: Finished difference Result 449 states and 644 transitions. [2025-01-09 17:22:35,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 17:22:35,816 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 121 [2025-01-09 17:22:35,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:22:35,819 INFO L225 Difference]: With dead ends: 449 [2025-01-09 17:22:35,819 INFO L226 Difference]: Without dead ends: 245 [2025-01-09 17:22:35,820 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 17:22:35,820 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 2 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 17:22:35,820 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 336 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 17:22:35,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2025-01-09 17:22:35,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 236. [2025-01-09 17:22:35,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 155 states have (on average 1.303225806451613) internal successors, (202), 160 states have internal predecessors, (202), 61 states have call successors, (61), 17 states have call predecessors, (61), 19 states have return successors, (68), 58 states have call predecessors, (68), 60 states have call successors, (68) [2025-01-09 17:22:35,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 331 transitions. [2025-01-09 17:22:35,844 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 331 transitions. Word has length 121 [2025-01-09 17:22:35,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:22:35,845 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 331 transitions. [2025-01-09 17:22:35,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 17:22:35,845 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 331 transitions. [2025-01-09 17:22:35,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-01-09 17:22:35,847 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:22:35,847 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 17:22:35,855 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-01-09 17:22:36,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 17:22:36,048 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:22:36,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:22:36,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1056682353, now seen corresponding path program 1 times [2025-01-09 17:22:36,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:22:36,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057270681] [2025-01-09 17:22:36,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:22:36,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:22:36,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-01-09 17:22:36,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-01-09 17:22:36,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:22:36,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:22:36,312 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 20 proven. 8 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2025-01-09 17:22:36,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:22:36,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057270681] [2025-01-09 17:22:36,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057270681] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 17:22:36,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [252644658] [2025-01-09 17:22:36,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:22:36,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 17:22:36,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 17:22:36,314 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 17:22:36,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-09 17:22:36,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-01-09 17:22:36,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-01-09 17:22:36,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:22:36,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:22:36,506 INFO L256 TraceCheckSpWp]: Trace formula consists of 532 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-01-09 17:22:36,508 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 17:22:36,617 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 126 proven. 3 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-01-09 17:22:36,617 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 17:22:36,774 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 15 proven. 13 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2025-01-09 17:22:36,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [252644658] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 17:22:36,775 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 17:22:36,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 13, 7] total 19 [2025-01-09 17:22:36,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469882611] [2025-01-09 17:22:36,775 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 17:22:36,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-09 17:22:36,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:22:36,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-09 17:22:36,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2025-01-09 17:22:36,776 INFO L87 Difference]: Start difference. First operand 236 states and 331 transitions. Second operand has 19 states, 14 states have (on average 6.285714285714286) internal successors, (88), 15 states have internal predecessors, (88), 8 states have call successors, (32), 2 states have call predecessors, (32), 7 states have return successors, (34), 7 states have call predecessors, (34), 8 states have call successors, (34) [2025-01-09 17:22:37,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:22:37,168 INFO L93 Difference]: Finished difference Result 458 states and 645 transitions. [2025-01-09 17:22:37,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 17:22:37,168 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 14 states have (on average 6.285714285714286) internal successors, (88), 15 states have internal predecessors, (88), 8 states have call successors, (32), 2 states have call predecessors, (32), 7 states have return successors, (34), 7 states have call predecessors, (34), 8 states have call successors, (34) Word has length 129 [2025-01-09 17:22:37,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:22:37,170 INFO L225 Difference]: With dead ends: 458 [2025-01-09 17:22:37,170 INFO L226 Difference]: Without dead ends: 248 [2025-01-09 17:22:37,171 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=768, Unknown=0, NotChecked=0, Total=870 [2025-01-09 17:22:37,171 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 167 mSDsluCounter, 1425 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 1560 SdHoareTripleChecker+Invalid, 532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 17:22:37,171 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 1560 Invalid, 532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 440 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 17:22:37,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2025-01-09 17:22:37,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 243. [2025-01-09 17:22:37,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 160 states have (on average 1.29375) internal successors, (207), 167 states have internal predecessors, (207), 61 states have call successors, (61), 17 states have call predecessors, (61), 21 states have return successors, (69), 58 states have call predecessors, (69), 60 states have call successors, (69) [2025-01-09 17:22:37,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 337 transitions. [2025-01-09 17:22:37,194 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 337 transitions. Word has length 129 [2025-01-09 17:22:37,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:22:37,195 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 337 transitions. [2025-01-09 17:22:37,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 14 states have (on average 6.285714285714286) internal successors, (88), 15 states have internal predecessors, (88), 8 states have call successors, (32), 2 states have call predecessors, (32), 7 states have return successors, (34), 7 states have call predecessors, (34), 8 states have call successors, (34) [2025-01-09 17:22:37,195 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 337 transitions. [2025-01-09 17:22:37,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-01-09 17:22:37,197 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:22:37,197 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 17:22:37,204 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-01-09 17:22:37,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 17:22:37,397 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:22:37,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:22:37,398 INFO L85 PathProgramCache]: Analyzing trace with hash -816307933, now seen corresponding path program 1 times [2025-01-09 17:22:37,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:22:37,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025332902] [2025-01-09 17:22:37,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:22:37,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:22:37,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-01-09 17:22:37,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-01-09 17:22:37,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:22:37,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:22:37,458 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2025-01-09 17:22:37,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:22:37,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025332902] [2025-01-09 17:22:37,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025332902] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 17:22:37,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1425897474] [2025-01-09 17:22:37,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:22:37,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 17:22:37,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 17:22:37,460 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 17:22:37,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-09 17:22:37,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-01-09 17:22:37,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-01-09 17:22:37,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:22:37,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:22:37,664 INFO L256 TraceCheckSpWp]: Trace formula consists of 560 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 17:22:37,665 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 17:22:37,669 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2025-01-09 17:22:37,670 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 17:22:37,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1425897474] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:22:37,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 17:22:37,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2025-01-09 17:22:37,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119669616] [2025-01-09 17:22:37,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:22:37,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 17:22:37,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:22:37,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 17:22:37,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 17:22:37,672 INFO L87 Difference]: Start difference. First operand 243 states and 337 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-01-09 17:22:37,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:22:37,691 INFO L93 Difference]: Finished difference Result 453 states and 641 transitions. [2025-01-09 17:22:37,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 17:22:37,692 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 135 [2025-01-09 17:22:37,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:22:37,693 INFO L225 Difference]: With dead ends: 453 [2025-01-09 17:22:37,693 INFO L226 Difference]: Without dead ends: 238 [2025-01-09 17:22:37,694 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 17:22:37,695 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 0 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 17:22:37,695 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 342 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 17:22:37,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2025-01-09 17:22:37,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 231. [2025-01-09 17:22:37,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 149 states have (on average 1.25503355704698) internal successors, (187), 156 states have internal predecessors, (187), 60 states have call successors, (60), 17 states have call predecessors, (60), 21 states have return successors, (68), 57 states have call predecessors, (68), 59 states have call successors, (68) [2025-01-09 17:22:37,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 315 transitions. [2025-01-09 17:22:37,713 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 315 transitions. Word has length 135 [2025-01-09 17:22:37,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:22:37,714 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 315 transitions. [2025-01-09 17:22:37,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-01-09 17:22:37,714 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 315 transitions. [2025-01-09 17:22:37,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-01-09 17:22:37,715 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:22:37,715 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 17:22:37,722 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-01-09 17:22:37,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 17:22:37,920 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:22:37,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:22:37,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1550386661, now seen corresponding path program 2 times [2025-01-09 17:22:37,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:22:37,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755144848] [2025-01-09 17:22:37,921 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 17:22:37,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:22:37,972 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 135 statements into 2 equivalence classes. [2025-01-09 17:22:37,993 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 135 of 135 statements. [2025-01-09 17:22:37,993 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 17:22:37,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:22:38,294 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2025-01-09 17:22:38,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:22:38,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755144848] [2025-01-09 17:22:38,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755144848] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 17:22:38,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1907900268] [2025-01-09 17:22:38,295 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 17:22:38,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 17:22:38,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 17:22:38,298 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 17:22:38,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-01-09 17:22:38,433 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 135 statements into 2 equivalence classes. [2025-01-09 17:22:38,507 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 135 of 135 statements. [2025-01-09 17:22:38,507 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 17:22:38,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:22:38,509 INFO L256 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-09 17:22:38,512 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 17:22:38,610 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2025-01-09 17:22:38,610 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 17:22:38,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1907900268] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:22:38,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 17:22:38,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [8] total 16 [2025-01-09 17:22:38,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204299700] [2025-01-09 17:22:38,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:22:38,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 17:22:38,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:22:38,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 17:22:38,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2025-01-09 17:22:38,611 INFO L87 Difference]: Start difference. First operand 231 states and 315 transitions. Second operand has 10 states, 9 states have (on average 8.444444444444445) internal successors, (76), 10 states have internal predecessors, (76), 5 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 4 states have call predecessors, (16), 5 states have call successors, (16) [2025-01-09 17:22:38,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:22:38,908 INFO L93 Difference]: Finished difference Result 445 states and 600 transitions. [2025-01-09 17:22:38,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 17:22:38,909 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 8.444444444444445) internal successors, (76), 10 states have internal predecessors, (76), 5 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 4 states have call predecessors, (16), 5 states have call successors, (16) Word has length 135 [2025-01-09 17:22:38,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:22:38,910 INFO L225 Difference]: With dead ends: 445 [2025-01-09 17:22:38,910 INFO L226 Difference]: Without dead ends: 234 [2025-01-09 17:22:38,911 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=478, Unknown=0, NotChecked=0, Total=552 [2025-01-09 17:22:38,911 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 217 mSDsluCounter, 853 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 986 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 17:22:38,912 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 986 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 17:22:38,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2025-01-09 17:22:38,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 220. [2025-01-09 17:22:38,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 141 states have (on average 1.2411347517730495) internal successors, (175), 145 states have internal predecessors, (175), 60 states have call successors, (60), 17 states have call predecessors, (60), 18 states have return successors, (63), 57 states have call predecessors, (63), 59 states have call successors, (63) [2025-01-09 17:22:38,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 298 transitions. [2025-01-09 17:22:38,931 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 298 transitions. Word has length 135 [2025-01-09 17:22:38,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:22:38,931 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 298 transitions. [2025-01-09 17:22:38,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 8.444444444444445) internal successors, (76), 10 states have internal predecessors, (76), 5 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 4 states have call predecessors, (16), 5 states have call successors, (16) [2025-01-09 17:22:38,931 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 298 transitions. [2025-01-09 17:22:38,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-01-09 17:22:38,932 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:22:38,932 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 17:22:38,940 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-01-09 17:22:39,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-01-09 17:22:39,133 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:22:39,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:22:39,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1029882476, now seen corresponding path program 3 times [2025-01-09 17:22:39,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:22:39,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089580376] [2025-01-09 17:22:39,134 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 17:22:39,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:22:39,153 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 146 statements into 7 equivalence classes. [2025-01-09 17:22:39,191 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 67 of 146 statements. [2025-01-09 17:22:39,191 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-01-09 17:22:39,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:22:39,508 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 29 proven. 8 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2025-01-09 17:22:39,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:22:39,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089580376] [2025-01-09 17:22:39,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089580376] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 17:22:39,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1374416436] [2025-01-09 17:22:39,509 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 17:22:39,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 17:22:39,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 17:22:39,511 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 17:22:39,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-01-09 17:22:39,655 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 146 statements into 7 equivalence classes. [2025-01-09 17:22:39,681 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 67 of 146 statements. [2025-01-09 17:22:39,681 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-01-09 17:22:39,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:22:39,683 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-01-09 17:22:39,685 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 17:22:39,726 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2025-01-09 17:22:39,726 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 17:22:39,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1374416436] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:22:39,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 17:22:39,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 12 [2025-01-09 17:22:39,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645889054] [2025-01-09 17:22:39,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:22:39,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 17:22:39,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:22:39,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 17:22:39,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-01-09 17:22:39,727 INFO L87 Difference]: Start difference. First operand 220 states and 298 transitions. Second operand has 8 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 4 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2025-01-09 17:22:39,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:22:39,819 INFO L93 Difference]: Finished difference Result 414 states and 559 transitions. [2025-01-09 17:22:39,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 17:22:39,819 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 4 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) Word has length 146 [2025-01-09 17:22:39,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:22:39,821 INFO L225 Difference]: With dead ends: 414 [2025-01-09 17:22:39,822 INFO L226 Difference]: Without dead ends: 228 [2025-01-09 17:22:39,822 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-01-09 17:22:39,823 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 1 mSDsluCounter, 922 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1082 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 17:22:39,823 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1082 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 17:22:39,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2025-01-09 17:22:39,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 228. [2025-01-09 17:22:39,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 147 states have (on average 1.2312925170068028) internal successors, (181), 153 states have internal predecessors, (181), 60 states have call successors, (60), 17 states have call predecessors, (60), 20 states have return successors, (69), 57 states have call predecessors, (69), 59 states have call successors, (69) [2025-01-09 17:22:39,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 310 transitions. [2025-01-09 17:22:39,840 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 310 transitions. Word has length 146 [2025-01-09 17:22:39,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:22:39,840 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 310 transitions. [2025-01-09 17:22:39,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 4 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2025-01-09 17:22:39,841 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 310 transitions. [2025-01-09 17:22:39,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-01-09 17:22:39,842 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:22:39,842 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 17:22:39,849 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-01-09 17:22:40,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-01-09 17:22:40,043 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:22:40,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:22:40,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1886926297, now seen corresponding path program 1 times [2025-01-09 17:22:40,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:22:40,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419704992] [2025-01-09 17:22:40,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:22:40,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:22:40,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-01-09 17:22:40,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-01-09 17:22:40,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:22:40,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:22:40,414 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2025-01-09 17:22:40,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:22:40,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419704992] [2025-01-09 17:22:40,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419704992] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 17:22:40,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1387942336] [2025-01-09 17:22:40,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:22:40,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 17:22:40,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 17:22:40,417 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 17:22:40,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-01-09 17:22:40,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-01-09 17:22:40,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-01-09 17:22:40,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:22:40,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:22:40,623 INFO L256 TraceCheckSpWp]: Trace formula consists of 608 conjuncts, 75 conjuncts are in the unsatisfiable core [2025-01-09 17:22:40,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 17:22:40,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-01-09 17:22:41,030 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 145 proven. 11 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2025-01-09 17:22:41,030 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 17:22:41,571 INFO L378 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 111 treesize of output 103 [2025-01-09 17:22:41,574 INFO L378 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 103 treesize of output 95 [2025-01-09 17:22:41,576 INFO L378 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 49 treesize of output 45 [2025-01-09 17:22:41,620 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2025-01-09 17:22:41,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1387942336] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 17:22:41,621 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 17:22:41,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 18, 17] total 39 [2025-01-09 17:22:41,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418187472] [2025-01-09 17:22:41,621 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 17:22:41,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-01-09 17:22:41,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:22:41,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-01-09 17:22:41,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1351, Unknown=0, NotChecked=0, Total=1482 [2025-01-09 17:22:41,623 INFO L87 Difference]: Start difference. First operand 228 states and 310 transitions. Second operand has 39 states, 37 states have (on average 4.756756756756757) internal successors, (176), 37 states have internal predecessors, (176), 17 states have call successors, (44), 3 states have call predecessors, (44), 7 states have return successors, (43), 15 states have call predecessors, (43), 17 states have call successors, (43) [2025-01-09 17:22:44,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:22:44,270 INFO L93 Difference]: Finished difference Result 837 states and 1169 transitions. [2025-01-09 17:22:44,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2025-01-09 17:22:44,271 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 37 states have (on average 4.756756756756757) internal successors, (176), 37 states have internal predecessors, (176), 17 states have call successors, (44), 3 states have call predecessors, (44), 7 states have return successors, (43), 15 states have call predecessors, (43), 17 states have call successors, (43) Word has length 147 [2025-01-09 17:22:44,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:22:44,274 INFO L225 Difference]: With dead ends: 837 [2025-01-09 17:22:44,274 INFO L226 Difference]: Without dead ends: 629 [2025-01-09 17:22:44,276 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 377 GetRequests, 296 SyntacticMatches, 2 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1351 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=760, Invalid=5720, Unknown=0, NotChecked=0, Total=6480 [2025-01-09 17:22:44,276 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 522 mSDsluCounter, 3116 mSDsCounter, 0 mSdLazyCounter, 2715 mSolverCounterSat, 265 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 527 SdHoareTripleChecker+Valid, 3301 SdHoareTripleChecker+Invalid, 2980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 265 IncrementalHoareTripleChecker+Valid, 2715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-09 17:22:44,276 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [527 Valid, 3301 Invalid, 2980 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [265 Valid, 2715 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-09 17:22:44,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2025-01-09 17:22:44,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 496. [2025-01-09 17:22:44,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 345 states have (on average 1.2869565217391303) internal successors, (444), 356 states have internal predecessors, (444), 112 states have call successors, (112), 32 states have call predecessors, (112), 38 states have return successors, (130), 107 states have call predecessors, (130), 110 states have call successors, (130) [2025-01-09 17:22:44,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 686 transitions. [2025-01-09 17:22:44,334 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 686 transitions. Word has length 147 [2025-01-09 17:22:44,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:22:44,334 INFO L471 AbstractCegarLoop]: Abstraction has 496 states and 686 transitions. [2025-01-09 17:22:44,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 37 states have (on average 4.756756756756757) internal successors, (176), 37 states have internal predecessors, (176), 17 states have call successors, (44), 3 states have call predecessors, (44), 7 states have return successors, (43), 15 states have call predecessors, (43), 17 states have call successors, (43) [2025-01-09 17:22:44,335 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 686 transitions. [2025-01-09 17:22:44,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-01-09 17:22:44,336 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:22:44,336 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 17:22:44,347 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-01-09 17:22:44,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 17:22:44,537 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:22:44,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:22:44,538 INFO L85 PathProgramCache]: Analyzing trace with hash -45021860, now seen corresponding path program 1 times [2025-01-09 17:22:44,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:22:44,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799125003] [2025-01-09 17:22:44,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:22:44,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:22:44,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-01-09 17:22:44,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-01-09 17:22:44,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:22:44,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:22:45,383 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 5 proven. 31 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2025-01-09 17:22:45,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:22:45,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799125003] [2025-01-09 17:22:45,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799125003] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 17:22:45,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1507169507] [2025-01-09 17:22:45,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:22:45,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 17:22:45,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 17:22:45,386 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 17:22:45,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-01-09 17:22:45,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-01-09 17:22:45,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-01-09 17:22:45,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:22:45,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:22:45,591 INFO L256 TraceCheckSpWp]: Trace formula consists of 611 conjuncts, 83 conjuncts are in the unsatisfiable core [2025-01-09 17:22:45,596 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 17:22:45,605 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-09 17:22:45,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2025-01-09 17:22:45,704 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-01-09 17:22:45,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2025-01-09 17:22:45,718 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 17:22:45,719 INFO L378 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 11 treesize of output 11 [2025-01-09 17:22:45,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 17:22:45,747 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 19 [2025-01-09 17:22:45,748 INFO L378 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 14 treesize of output 18 [2025-01-09 17:22:46,545 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 127 proven. 23 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2025-01-09 17:22:46,545 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 17:22:46,834 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1217 (Array Int Int))) (not (= (+ 16 |c_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset|) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_1217))) (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|) (+ |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 24) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset|))) |c_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base|) |c_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset|)))) is different from false [2025-01-09 17:22:46,840 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 17:22:46,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 35 [2025-01-09 17:22:46,850 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 17:22:46,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 255 treesize of output 267 [2025-01-09 17:22:46,862 INFO L378 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 184 treesize of output 176 [2025-01-09 17:22:46,908 INFO L378 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 [2025-01-09 17:22:46,927 INFO L378 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 [2025-01-09 17:22:46,936 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 17:22:46,936 INFO L378 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 42 treesize of output 44 [2025-01-09 17:22:46,958 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 17:22:46,958 INFO L378 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 112 treesize of output 112 [2025-01-09 17:22:47,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1507169507] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 17:22:47,223 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 17:22:47,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15] total 24 [2025-01-09 17:22:47,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546731404] [2025-01-09 17:22:47,223 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 17:22:47,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-01-09 17:22:47,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:22:47,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-01-09 17:22:47,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1020, Unknown=1, NotChecked=64, Total=1190 [2025-01-09 17:22:47,224 INFO L87 Difference]: Start difference. First operand 496 states and 686 transitions. Second operand has 24 states, 23 states have (on average 6.173913043478261) internal successors, (142), 24 states have internal predecessors, (142), 11 states have call successors, (34), 4 states have call predecessors, (34), 6 states have return successors, (33), 10 states have call predecessors, (33), 11 states have call successors, (33) [2025-01-09 17:22:48,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:22:48,545 INFO L93 Difference]: Finished difference Result 928 states and 1259 transitions. [2025-01-09 17:22:48,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-09 17:22:48,546 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 6.173913043478261) internal successors, (142), 24 states have internal predecessors, (142), 11 states have call successors, (34), 4 states have call predecessors, (34), 6 states have return successors, (33), 10 states have call predecessors, (33), 11 states have call successors, (33) Word has length 148 [2025-01-09 17:22:48,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:22:48,551 INFO L225 Difference]: With dead ends: 928 [2025-01-09 17:22:48,551 INFO L226 Difference]: Without dead ends: 624 [2025-01-09 17:22:48,553 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 261 SyntacticMatches, 15 SemanticMatches, 48 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 382 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=243, Invalid=2112, Unknown=1, NotChecked=94, Total=2450 [2025-01-09 17:22:48,553 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 319 mSDsluCounter, 1637 mSDsCounter, 0 mSdLazyCounter, 1395 mSolverCounterSat, 156 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 1773 SdHoareTripleChecker+Invalid, 1551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 1395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 17:22:48,553 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 1773 Invalid, 1551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 1395 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 17:22:48,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2025-01-09 17:22:48,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 357. [2025-01-09 17:22:48,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 259 states have (on average 1.3011583011583012) internal successors, (337), 265 states have internal predecessors, (337), 69 states have call successors, (69), 24 states have call predecessors, (69), 28 states have return successors, (75), 67 states have call predecessors, (75), 67 states have call successors, (75) [2025-01-09 17:22:48,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 481 transitions. [2025-01-09 17:22:48,587 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 481 transitions. Word has length 148 [2025-01-09 17:22:48,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:22:48,587 INFO L471 AbstractCegarLoop]: Abstraction has 357 states and 481 transitions. [2025-01-09 17:22:48,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 6.173913043478261) internal successors, (142), 24 states have internal predecessors, (142), 11 states have call successors, (34), 4 states have call predecessors, (34), 6 states have return successors, (33), 10 states have call predecessors, (33), 11 states have call successors, (33) [2025-01-09 17:22:48,587 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 481 transitions. [2025-01-09 17:22:48,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-01-09 17:22:48,589 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:22:48,589 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 17:22:48,597 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-01-09 17:22:48,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 17:22:48,790 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:22:48,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:22:48,790 INFO L85 PathProgramCache]: Analyzing trace with hash 759286435, now seen corresponding path program 2 times [2025-01-09 17:22:48,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:22:48,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767867939] [2025-01-09 17:22:48,790 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 17:22:48,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:22:48,813 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 169 statements into 2 equivalence classes. [2025-01-09 17:22:48,832 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 169 of 169 statements. [2025-01-09 17:22:48,832 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 17:22:48,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:22:49,164 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 9 proven. 23 refuted. 0 times theorem prover too weak. 243 trivial. 0 not checked. [2025-01-09 17:22:49,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:22:49,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767867939] [2025-01-09 17:22:49,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767867939] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 17:22:49,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1069142760] [2025-01-09 17:22:49,165 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 17:22:49,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 17:22:49,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 17:22:49,167 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 17:22:49,168 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-01-09 17:22:49,324 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 169 statements into 2 equivalence classes. [2025-01-09 17:22:49,377 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 169 of 169 statements. [2025-01-09 17:22:49,377 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 17:22:49,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:22:49,380 INFO L256 TraceCheckSpWp]: Trace formula consists of 688 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-01-09 17:22:49,383 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 17:22:49,441 INFO L349 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2025-01-09 17:22:49,441 INFO L378 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 1 case distinctions, treesize of input 16 treesize of output 17 [2025-01-09 17:22:49,446 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2025-01-09 17:22:49,449 INFO L378 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 53 [2025-01-09 17:22:49,467 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset| 24))) (let ((.cse0 (select .cse2 .cse1))) (let ((.cse3 (= .cse0 |c_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base|))) (or (and (exists ((v_arrayElimArr_11 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (and (= (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |c_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base|) (= (store (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base| v_DerPreprocessor_3) .cse0 v_arrayElimArr_11) |c_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base|) .cse1 .cse0) .cse2))) (not .cse3) (not (= .cse0 0))) (and .cse3 (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |c_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base|)) (not (= |c_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base| 0))))))) is different from true [2025-01-09 17:22:49,493 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_43| Int) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_51| Int)) (let ((.cse0 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_51|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse0 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_51|)) (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_51| 0)) (= (select .cse0 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_43| 24)) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_51|)))) (exists ((v_arrayElimArr_11 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_43| Int) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (let ((.cse2 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse1 (select |c_#memory_$Pointer$#2.base| .cse2)) (.cse4 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_43| 24))) (let ((.cse3 (select .cse1 .cse4))) (and (= .cse1 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse2 v_DerPreprocessor_3) .cse3 v_arrayElimArr_11) .cse2) .cse4 .cse3)) (not (= .cse3 .cse2)) (not (= .cse3 0)))))))) is different from true [2025-01-09 17:22:49,665 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((v_arrayElimArr_11 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_44| Int) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (let ((.cse1 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse2 (select |c_#memory_$Pointer$#2.base| .cse1)) (.cse3 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_44| 24))) (let ((.cse0 (select .cse2 .cse3))) (and (not (= .cse0 0)) (not (= .cse1 .cse0)) (= .cse2 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse1 v_DerPreprocessor_3) .cse0 v_arrayElimArr_11) .cse1) .cse3 .cse0))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_44| Int) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_52| Int)) (let ((.cse4 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_52|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_52| (select .cse4 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_52| 0)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_52| (select .cse4 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_44| 24))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_43| Int) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_51| Int)) (let ((.cse5 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_51|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse5 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_51|)) (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_51| 0)) (= (select .cse5 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_43| 24)) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_51|)))) (exists ((v_arrayElimArr_11 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_43| Int) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (let ((.cse7 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse6 (select |c_#memory_$Pointer$#2.base| .cse7)) (.cse9 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_43| 24))) (let ((.cse8 (select .cse6 .cse9))) (and (= .cse6 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse7 v_DerPreprocessor_3) .cse8 v_arrayElimArr_11) .cse7) .cse9 .cse8)) (not (= .cse8 .cse7)) (not (= .cse8 0))))))))) is different from true [2025-01-09 17:22:49,764 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((v_arrayElimArr_11 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_44| Int) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (let ((.cse1 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse2 (select |c_#memory_$Pointer$#2.base| .cse1)) (.cse3 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_44| 24))) (let ((.cse0 (select .cse2 .cse3))) (and (not (= .cse0 0)) (not (= .cse1 .cse0)) (= .cse2 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse1 v_DerPreprocessor_3) .cse0 v_arrayElimArr_11) .cse1) .cse3 .cse0))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_44| Int) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_52| Int)) (let ((.cse4 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_52|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_52| (select .cse4 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_52| 0)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_52| (select .cse4 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_44| 24))))))) (let ((.cse7 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base|)) (.cse6 (+ |c_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset| 24))) (let ((.cse5 (select .cse7 .cse6))) (let ((.cse8 (= .cse5 |c_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base|))) (or (and (exists ((v_arrayElimArr_11 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (and (= (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |c_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base|) (= (store (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base| v_DerPreprocessor_3) .cse5 v_arrayElimArr_11) |c_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base|) .cse6 .cse5) .cse7))) (not .cse8) (not (= .cse5 0))) (and .cse8 (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse7 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |c_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base|)) (not (= |c_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base| 0))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_43| Int) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_51| Int)) (let ((.cse9 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_51|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse9 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_51|)) (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_51| 0)) (= (select .cse9 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_43| 24)) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_51|)))) (exists ((v_arrayElimArr_11 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_43| Int) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (let ((.cse11 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse10 (select |c_#memory_$Pointer$#2.base| .cse11)) (.cse13 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_43| 24))) (let ((.cse12 (select .cse10 .cse13))) (and (= .cse10 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse11 v_DerPreprocessor_3) .cse12 v_arrayElimArr_11) .cse11) .cse13 .cse12)) (not (= .cse12 .cse11)) (not (= .cse12 0))))))))) is different from true [2025-01-09 17:22:49,826 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((v_arrayElimArr_11 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_44| Int) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (let ((.cse1 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse2 (select |c_#memory_$Pointer$#2.base| .cse1)) (.cse3 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_44| 24))) (let ((.cse0 (select .cse2 .cse3))) (and (not (= .cse0 0)) (not (= .cse1 .cse0)) (= .cse2 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse1 v_DerPreprocessor_3) .cse0 v_arrayElimArr_11) .cse1) .cse3 .cse0))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_44| Int) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_52| Int)) (let ((.cse4 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_52|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_52| (select .cse4 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_52| 0)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_52| (select .cse4 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_44| 24))))))) (let ((.cse6 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base|)) (.cse8 (+ |c_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset| 24))) (let ((.cse7 (select .cse6 .cse8))) (let ((.cse5 (= |c_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base| .cse7))) (or (and .cse5 (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |c_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base| (select .cse6 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (not (= |c_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base| 0))) (and (exists ((v_arrayElimArr_11 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (and (= |c_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base| (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|)) (= .cse6 (store (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base| v_DerPreprocessor_3) .cse7 v_arrayElimArr_11) |c_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base|) .cse8 .cse7)))) (not (= 0 .cse7)) (not .cse5)))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_43| Int) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_51| Int)) (let ((.cse9 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_51|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse9 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_51|)) (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_51| 0)) (= (select .cse9 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_43| 24)) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_51|)))) (exists ((v_arrayElimArr_11 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_43| Int) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (let ((.cse11 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse10 (select |c_#memory_$Pointer$#2.base| .cse11)) (.cse13 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_43| 24))) (let ((.cse12 (select .cse10 .cse13))) (and (= .cse10 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse11 v_DerPreprocessor_3) .cse12 v_arrayElimArr_11) .cse11) .cse13 .cse12)) (not (= .cse12 .cse11)) (not (= .cse12 0))))))))) is different from true [2025-01-09 17:22:49,857 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((v_arrayElimArr_11 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_44| Int) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (let ((.cse1 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse2 (select |c_#memory_$Pointer$#2.base| .cse1)) (.cse3 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_44| 24))) (let ((.cse0 (select .cse2 .cse3))) (and (not (= .cse0 0)) (not (= .cse1 .cse0)) (= .cse2 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse1 v_DerPreprocessor_3) .cse0 v_arrayElimArr_11) .cse1) .cse3 .cse0))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_44| Int) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_52| Int)) (let ((.cse4 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_52|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_52| (select .cse4 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_52| 0)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_52| (select .cse4 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_44| 24))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_48| Int) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_41| Int)) (let ((.cse5 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_48|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_48| (select .cse5 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (= (select .cse5 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_41| 24)) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_48|) (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_48| 0))))) (exists ((v_arrayElimArr_11 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_41| Int)) (let ((.cse8 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse7 (select |c_#memory_$Pointer$#2.base| .cse8)) (.cse9 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_41| 24))) (let ((.cse6 (select .cse7 .cse9))) (and (not (= .cse6 0)) (= .cse7 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse8 v_DerPreprocessor_3) .cse6 v_arrayElimArr_11) .cse8) .cse9 .cse6)) (not (= .cse6 .cse8)))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_43| Int) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_51| Int)) (let ((.cse10 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_51|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse10 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_51|)) (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_51| 0)) (= (select .cse10 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_43| 24)) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_51|)))) (exists ((v_arrayElimArr_11 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_43| Int) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (let ((.cse12 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse11 (select |c_#memory_$Pointer$#2.base| .cse12)) (.cse14 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_43| 24))) (let ((.cse13 (select .cse11 .cse14))) (and (= .cse11 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse12 v_DerPreprocessor_3) .cse13 v_arrayElimArr_11) .cse12) .cse14 .cse13)) (not (= .cse13 .cse12)) (not (= .cse13 0))))))))) is different from true [2025-01-09 17:22:50,153 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((v_arrayElimArr_11 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_44| Int) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (let ((.cse1 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse2 (select |c_#memory_$Pointer$#2.base| .cse1)) (.cse3 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_44| 24))) (let ((.cse0 (select .cse2 .cse3))) (and (not (= .cse0 0)) (not (= .cse1 .cse0)) (= .cse2 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse1 v_DerPreprocessor_3) .cse0 v_arrayElimArr_11) .cse1) .cse3 .cse0))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_44| Int) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_52| Int)) (let ((.cse4 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_52|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_52| (select .cse4 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_52| 0)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_52| (select .cse4 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_44| 24))))))) (let ((.cse6 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base|)) (.cse8 (+ |c_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset| 24))) (let ((.cse7 (select .cse6 .cse8))) (let ((.cse5 (= |c_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base| .cse7))) (or (and .cse5 (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |c_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base| (select .cse6 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (not (= |c_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base| 0))) (and (exists ((v_arrayElimArr_11 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (and (= |c_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base| (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|)) (= .cse6 (store (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base| v_DerPreprocessor_3) .cse7 v_arrayElimArr_11) |c_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base|) .cse8 .cse7)))) (not (= 0 .cse7)) (not .cse5)))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_48| Int) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_41| Int)) (let ((.cse9 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_48|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_48| (select .cse9 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (= (select .cse9 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_41| 24)) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_48|) (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_48| 0))))) (exists ((v_arrayElimArr_11 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_41| Int)) (let ((.cse12 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse11 (select |c_#memory_$Pointer$#2.base| .cse12)) (.cse13 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_41| 24))) (let ((.cse10 (select .cse11 .cse13))) (and (not (= .cse10 0)) (= .cse11 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse12 v_DerPreprocessor_3) .cse10 v_arrayElimArr_11) .cse12) .cse13 .cse10)) (not (= .cse10 .cse12)))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_43| Int) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_51| Int)) (let ((.cse14 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_51|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse14 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_51|)) (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_51| 0)) (= (select .cse14 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_43| 24)) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_51|)))) (exists ((v_arrayElimArr_11 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_43| Int) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (let ((.cse16 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse15 (select |c_#memory_$Pointer$#2.base| .cse16)) (.cse18 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_43| 24))) (let ((.cse17 (select .cse15 .cse18))) (and (= .cse15 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse16 v_DerPreprocessor_3) .cse17 v_arrayElimArr_11) .cse16) .cse18 .cse17)) (not (= .cse17 .cse16)) (not (= .cse17 0))))))))) is different from true [2025-01-09 17:22:50,193 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((v_arrayElimArr_11 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_44| Int) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (let ((.cse1 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse2 (select |c_#memory_$Pointer$#2.base| .cse1)) (.cse3 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_44| 24))) (let ((.cse0 (select .cse2 .cse3))) (and (not (= .cse0 0)) (not (= .cse1 .cse0)) (= .cse2 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse1 v_DerPreprocessor_3) .cse0 v_arrayElimArr_11) .cse1) .cse3 .cse0))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_44| Int) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_52| Int)) (let ((.cse4 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_52|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_52| (select .cse4 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_52| 0)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_52| (select .cse4 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_44| 24))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_48| Int) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_41| Int)) (let ((.cse5 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_48|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_48| (select .cse5 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (= (select .cse5 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_41| 24)) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_48|) (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_48| 0))))) (exists ((v_arrayElimArr_11 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_41| Int)) (let ((.cse8 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse7 (select |c_#memory_$Pointer$#2.base| .cse8)) (.cse9 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_41| 24))) (let ((.cse6 (select .cse7 .cse9))) (and (not (= .cse6 0)) (= .cse7 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse8 v_DerPreprocessor_3) .cse6 v_arrayElimArr_11) .cse8) .cse9 .cse6)) (not (= .cse6 .cse8)))))))) (or (exists ((v_arrayElimArr_11 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_42| Int)) (let ((.cse10 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse13 (select |c_#memory_$Pointer$#2.base| .cse10)) (.cse12 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_42| 24))) (let ((.cse11 (select .cse13 .cse12))) (and (not (= .cse10 .cse11)) (= (store (select (store (store |c_#memory_$Pointer$#2.base| .cse10 v_DerPreprocessor_3) .cse11 v_arrayElimArr_11) .cse10) .cse12 .cse11) .cse13) (not (= .cse11 0))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_49| Int) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_42| Int)) (let ((.cse14 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_49|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_49| 0)) (= (select .cse14 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_42| 24)) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_49|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse14 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_49|)))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_43| Int) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_51| Int)) (let ((.cse15 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_51|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse15 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_51|)) (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_51| 0)) (= (select .cse15 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_43| 24)) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_51|)))) (exists ((v_arrayElimArr_11 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_43| Int) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (let ((.cse17 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse16 (select |c_#memory_$Pointer$#2.base| .cse17)) (.cse19 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_43| 24))) (let ((.cse18 (select .cse16 .cse19))) (and (= .cse16 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse17 v_DerPreprocessor_3) .cse18 v_arrayElimArr_11) .cse17) .cse19 .cse18)) (not (= .cse18 .cse17)) (not (= .cse18 0))))))))) is different from true [2025-01-09 17:22:50,365 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((v_arrayElimArr_11 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_44| Int) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (let ((.cse1 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse2 (select |c_#memory_$Pointer$#2.base| .cse1)) (.cse3 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_44| 24))) (let ((.cse0 (select .cse2 .cse3))) (and (not (= .cse0 0)) (not (= .cse1 .cse0)) (= .cse2 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse1 v_DerPreprocessor_3) .cse0 v_arrayElimArr_11) .cse1) .cse3 .cse0))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_44| Int) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_52| Int)) (let ((.cse4 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_52|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_52| (select .cse4 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_52| 0)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_52| (select .cse4 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_44| 24))))))) (let ((.cse6 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base|)) (.cse8 (+ |c_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset| 24))) (let ((.cse7 (select .cse6 .cse8))) (let ((.cse5 (= |c_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base| .cse7))) (or (and .cse5 (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |c_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base| (select .cse6 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (not (= |c_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base| 0))) (and (exists ((v_arrayElimArr_11 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (and (= |c_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base| (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|)) (= .cse6 (store (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base| v_DerPreprocessor_3) .cse7 v_arrayElimArr_11) |c_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base|) .cse8 .cse7)))) (not (= 0 .cse7)) (not .cse5)))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_48| Int) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_41| Int)) (let ((.cse9 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_48|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_48| (select .cse9 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (= (select .cse9 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_41| 24)) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_48|) (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_48| 0))))) (exists ((v_arrayElimArr_11 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_41| Int)) (let ((.cse12 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse11 (select |c_#memory_$Pointer$#2.base| .cse12)) (.cse13 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_41| 24))) (let ((.cse10 (select .cse11 .cse13))) (and (not (= .cse10 0)) (= .cse11 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse12 v_DerPreprocessor_3) .cse10 v_arrayElimArr_11) .cse12) .cse13 .cse10)) (not (= .cse10 .cse12)))))))) (or (exists ((v_arrayElimArr_11 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_42| Int)) (let ((.cse14 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse17 (select |c_#memory_$Pointer$#2.base| .cse14)) (.cse16 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_42| 24))) (let ((.cse15 (select .cse17 .cse16))) (and (not (= .cse14 .cse15)) (= (store (select (store (store |c_#memory_$Pointer$#2.base| .cse14 v_DerPreprocessor_3) .cse15 v_arrayElimArr_11) .cse14) .cse16 .cse15) .cse17) (not (= .cse15 0))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_49| Int) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_42| Int)) (let ((.cse18 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_49|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_49| 0)) (= (select .cse18 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_42| 24)) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_49|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse18 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_49|)))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_43| Int) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_51| Int)) (let ((.cse19 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_51|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse19 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_51|)) (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_51| 0)) (= (select .cse19 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_43| 24)) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_51|)))) (exists ((v_arrayElimArr_11 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_43| Int) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (let ((.cse21 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse20 (select |c_#memory_$Pointer$#2.base| .cse21)) (.cse23 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_43| 24))) (let ((.cse22 (select .cse20 .cse23))) (and (= .cse20 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse21 v_DerPreprocessor_3) .cse22 v_arrayElimArr_11) .cse21) .cse23 .cse22)) (not (= .cse22 .cse21)) (not (= .cse22 0))))))))) is different from true [2025-01-09 17:22:50,472 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((v_arrayElimArr_11 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_44| Int) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (let ((.cse1 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse2 (select |c_#memory_$Pointer$#2.base| .cse1)) (.cse3 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_44| 24))) (let ((.cse0 (select .cse2 .cse3))) (and (not (= .cse0 0)) (not (= .cse1 .cse0)) (= .cse2 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse1 v_DerPreprocessor_3) .cse0 v_arrayElimArr_11) .cse1) .cse3 .cse0))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_44| Int) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_52| Int)) (let ((.cse4 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_52|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_52| (select .cse4 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_52| 0)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_52| (select .cse4 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_44| 24))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_48| Int) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_41| Int)) (let ((.cse5 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_48|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_48| (select .cse5 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (= (select .cse5 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_41| 24)) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_48|) (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_48| 0))))) (exists ((v_arrayElimArr_11 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_41| Int)) (let ((.cse8 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse7 (select |c_#memory_$Pointer$#2.base| .cse8)) (.cse9 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_41| 24))) (let ((.cse6 (select .cse7 .cse9))) (and (not (= .cse6 0)) (= .cse7 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse8 v_DerPreprocessor_3) .cse6 v_arrayElimArr_11) .cse8) .cse9 .cse6)) (not (= .cse6 .cse8)))))))) (or (exists ((v_arrayElimArr_11 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_42| Int)) (let ((.cse10 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse13 (select |c_#memory_$Pointer$#2.base| .cse10)) (.cse12 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_42| 24))) (let ((.cse11 (select .cse13 .cse12))) (and (not (= .cse10 .cse11)) (= (store (select (store (store |c_#memory_$Pointer$#2.base| .cse10 v_DerPreprocessor_3) .cse11 v_arrayElimArr_11) .cse10) .cse12 .cse11) .cse13) (not (= .cse11 0))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_49| Int) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_42| Int)) (let ((.cse14 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_49|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_49| 0)) (= (select .cse14 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_42| 24)) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_49|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse14 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_49|)))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_50| Int) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_43| Int)) (let ((.cse15 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_50|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_50| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse15 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_50|)) (= (select .cse15 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_43| 24)) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_50|)))) (exists ((v_arrayElimArr_11 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_43| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (let ((.cse17 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse16 (select |c_#memory_$Pointer$#2.base| .cse17)) (.cse19 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_43| 24))) (let ((.cse18 (select .cse16 .cse19))) (and (= .cse16 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse17 v_DerPreprocessor_3) .cse18 v_arrayElimArr_11) .cse17) .cse19 .cse18)) (not (= 0 .cse18)) (not (= .cse17 .cse18)))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_43| Int) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_51| Int)) (let ((.cse20 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_51|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse20 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_51|)) (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_51| 0)) (= (select .cse20 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_43| 24)) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_51|)))) (exists ((v_arrayElimArr_11 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_43| Int) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (let ((.cse22 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse21 (select |c_#memory_$Pointer$#2.base| .cse22)) (.cse24 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_43| 24))) (let ((.cse23 (select .cse21 .cse24))) (and (= .cse21 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse22 v_DerPreprocessor_3) .cse23 v_arrayElimArr_11) .cse22) .cse24 .cse23)) (not (= .cse23 .cse22)) (not (= .cse23 0))))))))) is different from true [2025-01-09 17:22:52,320 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((v_arrayElimArr_11 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_44| Int) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (let ((.cse1 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse2 (select |c_#memory_$Pointer$#2.base| .cse1)) (.cse3 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_44| 24))) (let ((.cse0 (select .cse2 .cse3))) (and (not (= .cse0 0)) (not (= .cse1 .cse0)) (= .cse2 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse1 v_DerPreprocessor_3) .cse0 v_arrayElimArr_11) .cse1) .cse3 .cse0))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_44| Int) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_52| Int)) (let ((.cse4 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_52|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_52| (select .cse4 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_52| 0)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_52| (select .cse4 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_44| 24))))))) (let ((.cse6 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base|)) (.cse8 (+ |c_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset| 24))) (let ((.cse7 (select .cse6 .cse8))) (let ((.cse5 (= |c_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base| .cse7))) (or (and .cse5 (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |c_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base| (select .cse6 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (not (= |c_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base| 0))) (and (exists ((v_arrayElimArr_11 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (and (= |c_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base| (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|)) (= .cse6 (store (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base| v_DerPreprocessor_3) .cse7 v_arrayElimArr_11) |c_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base|) .cse8 .cse7)))) (not (= 0 .cse7)) (not .cse5)))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_48| Int) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_41| Int)) (let ((.cse9 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_48|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_48| (select .cse9 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (= (select .cse9 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_41| 24)) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_48|) (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_48| 0))))) (exists ((v_arrayElimArr_11 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_41| Int)) (let ((.cse12 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse11 (select |c_#memory_$Pointer$#2.base| .cse12)) (.cse13 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_41| 24))) (let ((.cse10 (select .cse11 .cse13))) (and (not (= .cse10 0)) (= .cse11 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse12 v_DerPreprocessor_3) .cse10 v_arrayElimArr_11) .cse12) .cse13 .cse10)) (not (= .cse10 .cse12)))))))) (or (exists ((v_arrayElimArr_11 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_42| Int)) (let ((.cse14 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse17 (select |c_#memory_$Pointer$#2.base| .cse14)) (.cse16 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_42| 24))) (let ((.cse15 (select .cse17 .cse16))) (and (not (= .cse14 .cse15)) (= (store (select (store (store |c_#memory_$Pointer$#2.base| .cse14 v_DerPreprocessor_3) .cse15 v_arrayElimArr_11) .cse14) .cse16 .cse15) .cse17) (not (= .cse15 0))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_49| Int) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_42| Int)) (let ((.cse18 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_49|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_49| 0)) (= (select .cse18 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_42| 24)) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_49|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse18 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_49|)))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_50| Int) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_43| Int)) (let ((.cse19 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_50|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_50| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse19 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_50|)) (= (select .cse19 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_43| 24)) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_50|)))) (exists ((v_arrayElimArr_11 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_43| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (let ((.cse21 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse20 (select |c_#memory_$Pointer$#2.base| .cse21)) (.cse23 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_43| 24))) (let ((.cse22 (select .cse20 .cse23))) (and (= .cse20 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse21 v_DerPreprocessor_3) .cse22 v_arrayElimArr_11) .cse21) .cse23 .cse22)) (not (= 0 .cse22)) (not (= .cse21 .cse22)))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_43| Int) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_51| Int)) (let ((.cse24 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_51|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse24 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_51|)) (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_51| 0)) (= (select .cse24 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_43| 24)) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_51|)))) (exists ((v_arrayElimArr_11 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_43| Int) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (let ((.cse26 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse25 (select |c_#memory_$Pointer$#2.base| .cse26)) (.cse28 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_43| 24))) (let ((.cse27 (select .cse25 .cse28))) (and (= .cse25 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse26 v_DerPreprocessor_3) .cse27 v_arrayElimArr_11) .cse26) .cse28 .cse27)) (not (= .cse27 .cse26)) (not (= .cse27 0))))))))) is different from true [2025-01-09 17:22:52,395 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((v_arrayElimArr_11 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_44| Int) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (let ((.cse1 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse2 (select |c_#memory_$Pointer$#2.base| .cse1)) (.cse3 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_44| 24))) (let ((.cse0 (select .cse2 .cse3))) (and (not (= .cse0 0)) (not (= .cse1 .cse0)) (= .cse2 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse1 v_DerPreprocessor_3) .cse0 v_arrayElimArr_11) .cse1) .cse3 .cse0))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_44| Int) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_52| Int)) (let ((.cse4 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_52|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_52| (select .cse4 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_52| 0)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_52| (select .cse4 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_44| 24))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_48| Int) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_41| Int)) (let ((.cse5 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_48|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_48| (select .cse5 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (= (select .cse5 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_41| 24)) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_48|) (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_48| 0))))) (exists ((v_arrayElimArr_11 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_41| Int)) (let ((.cse8 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse7 (select |c_#memory_$Pointer$#2.base| .cse8)) (.cse9 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_41| 24))) (let ((.cse6 (select .cse7 .cse9))) (and (not (= .cse6 0)) (= .cse7 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse8 v_DerPreprocessor_3) .cse6 v_arrayElimArr_11) .cse8) .cse9 .cse6)) (not (= .cse6 .cse8)))))))) (or (exists ((v_arrayElimArr_11 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_42| Int)) (let ((.cse10 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse13 (select |c_#memory_$Pointer$#2.base| .cse10)) (.cse12 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_42| 24))) (let ((.cse11 (select .cse13 .cse12))) (and (not (= .cse10 .cse11)) (= (store (select (store (store |c_#memory_$Pointer$#2.base| .cse10 v_DerPreprocessor_3) .cse11 v_arrayElimArr_11) .cse10) .cse12 .cse11) .cse13) (not (= .cse11 0))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_49| Int) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_42| Int)) (let ((.cse14 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_49|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_49| 0)) (= (select .cse14 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_42| 24)) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_49|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse14 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_49|)))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_50| Int) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_43| Int)) (let ((.cse15 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_50|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_50| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse15 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_50|)) (= (select .cse15 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_43| 24)) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_50|)))) (exists ((v_arrayElimArr_11 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_43| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (let ((.cse17 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse16 (select |c_#memory_$Pointer$#2.base| .cse17)) (.cse19 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_43| 24))) (let ((.cse18 (select .cse16 .cse19))) (and (= .cse16 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse17 v_DerPreprocessor_3) .cse18 v_arrayElimArr_11) .cse17) .cse19 .cse18)) (not (= 0 .cse18)) (not (= .cse17 .cse18)))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_51| Int) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_44| Int)) (let ((.cse20 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_51|))) (and (= (select .cse20 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_44| 24)) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_51|) (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_51| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse20 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_51|))))) (exists ((v_arrayElimArr_11 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_44| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (let ((.cse21 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse23 (select |c_#memory_$Pointer$#2.base| .cse21)) (.cse24 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_44| 24))) (let ((.cse22 (select .cse23 .cse24))) (and (not (= .cse21 .cse22)) (= .cse23 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse21 v_DerPreprocessor_3) .cse22 v_arrayElimArr_11) .cse21) .cse24 .cse22)) (not (= .cse22 0)))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_43| Int) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_51| Int)) (let ((.cse25 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_51|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse25 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_51|)) (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_51| 0)) (= (select .cse25 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_43| 24)) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_51|)))) (exists ((v_arrayElimArr_11 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_43| Int) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (let ((.cse27 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse26 (select |c_#memory_$Pointer$#2.base| .cse27)) (.cse29 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_43| 24))) (let ((.cse28 (select .cse26 .cse29))) (and (= .cse26 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse27 v_DerPreprocessor_3) .cse28 v_arrayElimArr_11) .cse27) .cse29 .cse28)) (not (= .cse28 .cse27)) (not (= .cse28 0))))))))) is different from true [2025-01-09 17:22:52,890 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((v_arrayElimArr_11 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_44| Int) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (let ((.cse1 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse2 (select |c_#memory_$Pointer$#2.base| .cse1)) (.cse3 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_44| 24))) (let ((.cse0 (select .cse2 .cse3))) (and (not (= .cse0 0)) (not (= .cse1 .cse0)) (= .cse2 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse1 v_DerPreprocessor_3) .cse0 v_arrayElimArr_11) .cse1) .cse3 .cse0))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_44| Int) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_52| Int)) (let ((.cse4 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_52|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_52| (select .cse4 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_52| 0)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_52| (select .cse4 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_44| 24))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_48| Int) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_41| Int)) (let ((.cse5 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_48|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_48| (select .cse5 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (= (select .cse5 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_41| 24)) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_48|) (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_48| 0))))) (exists ((v_arrayElimArr_11 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_41| Int)) (let ((.cse8 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse7 (select |c_#memory_$Pointer$#2.base| .cse8)) (.cse9 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_41| 24))) (let ((.cse6 (select .cse7 .cse9))) (and (not (= .cse6 0)) (= .cse7 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse8 v_DerPreprocessor_3) .cse6 v_arrayElimArr_11) .cse8) .cse9 .cse6)) (not (= .cse6 .cse8)))))))) (or (exists ((v_arrayElimArr_11 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_42| Int)) (let ((.cse10 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse13 (select |c_#memory_$Pointer$#2.base| .cse10)) (.cse12 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_42| 24))) (let ((.cse11 (select .cse13 .cse12))) (and (not (= .cse10 .cse11)) (= (store (select (store (store |c_#memory_$Pointer$#2.base| .cse10 v_DerPreprocessor_3) .cse11 v_arrayElimArr_11) .cse10) .cse12 .cse11) .cse13) (not (= .cse11 0))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_49| Int) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_42| Int)) (let ((.cse14 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_49|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_49| 0)) (= (select .cse14 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_42| 24)) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_49|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse14 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_49|)))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_50| Int) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_43| Int)) (let ((.cse15 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_50|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_50| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse15 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_50|)) (= (select .cse15 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_43| 24)) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_50|)))) (exists ((v_arrayElimArr_11 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_43| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (let ((.cse17 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse16 (select |c_#memory_$Pointer$#2.base| .cse17)) (.cse19 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_43| 24))) (let ((.cse18 (select .cse16 .cse19))) (and (= .cse16 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse17 v_DerPreprocessor_3) .cse18 v_arrayElimArr_11) .cse17) .cse19 .cse18)) (not (= 0 .cse18)) (not (= .cse17 .cse18)))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_51| Int) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_44| Int)) (let ((.cse20 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_51|))) (and (= (select .cse20 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_44| 24)) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_51|) (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_51| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse20 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_51|))))) (exists ((v_arrayElimArr_11 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_44| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (let ((.cse21 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse23 (select |c_#memory_$Pointer$#2.base| .cse21)) (.cse24 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_44| 24))) (let ((.cse22 (select .cse23 .cse24))) (and (not (= .cse21 .cse22)) (= .cse23 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse21 v_DerPreprocessor_3) .cse22 v_arrayElimArr_11) .cse21) .cse24 .cse22)) (not (= .cse22 0)))))))) (let ((.cse25 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_linked_list_back_~list#1.base|)) (.cse28 (+ |c_ULTIMATE.start_aws_linked_list_back_~list#1.offset| 24))) (let ((.cse27 (select .cse25 .cse28))) (let ((.cse26 (= |c_ULTIMATE.start_aws_linked_list_back_~list#1.base| .cse27))) (or (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse25 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |c_ULTIMATE.start_aws_linked_list_back_~list#1.base|)) (not (= |c_ULTIMATE.start_aws_linked_list_back_~list#1.base| 0)) .cse26) (and (exists ((v_arrayElimArr_11 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (and (= (store (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_linked_list_back_~list#1.base| v_DerPreprocessor_3) .cse27 v_arrayElimArr_11) |c_ULTIMATE.start_aws_linked_list_back_~list#1.base|) .cse28 .cse27) .cse25) (= (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |c_ULTIMATE.start_aws_linked_list_back_~list#1.base|))) (not (= .cse27 0)) (not .cse26)))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_43| Int) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_51| Int)) (let ((.cse29 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_51|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse29 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_51|)) (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_51| 0)) (= (select .cse29 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_43| 24)) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_51|)))) (exists ((v_arrayElimArr_11 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_43| Int) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (let ((.cse31 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse30 (select |c_#memory_$Pointer$#2.base| .cse31)) (.cse33 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_43| 24))) (let ((.cse32 (select .cse30 .cse33))) (and (= .cse30 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse31 v_DerPreprocessor_3) .cse32 v_arrayElimArr_11) .cse31) .cse33 .cse32)) (not (= .cse32 .cse31)) (not (= .cse32 0))))))))) is different from true [2025-01-09 17:22:52,958 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((v_arrayElimArr_11 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_44| Int) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (let ((.cse1 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse2 (select |c_#memory_$Pointer$#2.base| .cse1)) (.cse3 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_44| 24))) (let ((.cse0 (select .cse2 .cse3))) (and (not (= .cse0 0)) (not (= .cse1 .cse0)) (= .cse2 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse1 v_DerPreprocessor_3) .cse0 v_arrayElimArr_11) .cse1) .cse3 .cse0))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_44| Int) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_52| Int)) (let ((.cse4 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_52|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_52| (select .cse4 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_52| 0)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_52| (select .cse4 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_44| 24))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_26| Int)) (let ((.cse5 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_26|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_26| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_26| (select .cse5 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (= |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_26| (select .cse5 (+ |v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_25| 24)))))) (exists ((v_arrayElimArr_11 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (let ((.cse8 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse7 (select |c_#memory_$Pointer$#2.base| .cse8)) (.cse9 (+ |v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_25| 24))) (let ((.cse6 (select .cse7 .cse9))) (and (not (= .cse6 0)) (= .cse7 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse8 v_DerPreprocessor_3) .cse6 v_arrayElimArr_11) .cse8) .cse9 .cse6)) (not (= .cse6 .cse8)))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_48| Int) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_41| Int)) (let ((.cse10 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_48|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_48| (select .cse10 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (= (select .cse10 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_41| 24)) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_48|) (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_48| 0))))) (exists ((v_arrayElimArr_11 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_41| Int)) (let ((.cse13 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse12 (select |c_#memory_$Pointer$#2.base| .cse13)) (.cse14 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_41| 24))) (let ((.cse11 (select .cse12 .cse14))) (and (not (= .cse11 0)) (= .cse12 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse13 v_DerPreprocessor_3) .cse11 v_arrayElimArr_11) .cse13) .cse14 .cse11)) (not (= .cse11 .cse13)))))))) (or (exists ((v_arrayElimArr_11 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_42| Int)) (let ((.cse15 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse18 (select |c_#memory_$Pointer$#2.base| .cse15)) (.cse17 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_42| 24))) (let ((.cse16 (select .cse18 .cse17))) (and (not (= .cse15 .cse16)) (= (store (select (store (store |c_#memory_$Pointer$#2.base| .cse15 v_DerPreprocessor_3) .cse16 v_arrayElimArr_11) .cse15) .cse17 .cse16) .cse18) (not (= .cse16 0))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_49| Int) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_42| Int)) (let ((.cse19 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_49|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_49| 0)) (= (select .cse19 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_42| 24)) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_49|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse19 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_49|)))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_50| Int) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_43| Int)) (let ((.cse20 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_50|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_50| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse20 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_50|)) (= (select .cse20 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_43| 24)) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_50|)))) (exists ((v_arrayElimArr_11 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_43| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (let ((.cse22 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse21 (select |c_#memory_$Pointer$#2.base| .cse22)) (.cse24 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_43| 24))) (let ((.cse23 (select .cse21 .cse24))) (and (= .cse21 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse22 v_DerPreprocessor_3) .cse23 v_arrayElimArr_11) .cse22) .cse24 .cse23)) (not (= 0 .cse23)) (not (= .cse22 .cse23)))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_51| Int) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_44| Int)) (let ((.cse25 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_51|))) (and (= (select .cse25 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_44| 24)) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_51|) (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_51| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse25 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_51|))))) (exists ((v_arrayElimArr_11 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_44| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (let ((.cse26 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse28 (select |c_#memory_$Pointer$#2.base| .cse26)) (.cse29 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_44| 24))) (let ((.cse27 (select .cse28 .cse29))) (and (not (= .cse26 .cse27)) (= .cse28 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse26 v_DerPreprocessor_3) .cse27 v_arrayElimArr_11) .cse26) .cse29 .cse27)) (not (= .cse27 0)))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_43| Int) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_51| Int)) (let ((.cse30 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_51|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse30 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_51|)) (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_51| 0)) (= (select .cse30 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_43| 24)) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_51|)))) (exists ((v_arrayElimArr_11 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_43| Int) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (let ((.cse32 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse31 (select |c_#memory_$Pointer$#2.base| .cse32)) (.cse34 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_43| 24))) (let ((.cse33 (select .cse31 .cse34))) (and (= .cse31 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse32 v_DerPreprocessor_3) .cse33 v_arrayElimArr_11) .cse32) .cse34 .cse33)) (not (= .cse33 .cse32)) (not (= .cse33 0))))))))) is different from true [2025-01-09 17:22:55,466 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((v_arrayElimArr_11 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_44| Int) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (let ((.cse1 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse2 (select |c_#memory_$Pointer$#2.base| .cse1)) (.cse3 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_44| 24))) (let ((.cse0 (select .cse2 .cse3))) (and (not (= .cse0 0)) (not (= .cse1 .cse0)) (= .cse2 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse1 v_DerPreprocessor_3) .cse0 v_arrayElimArr_11) .cse1) .cse3 .cse0))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_44| Int) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_52| Int)) (let ((.cse4 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_52|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_52| (select .cse4 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_52| 0)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_52| (select .cse4 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_44| 24))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_26| Int)) (let ((.cse5 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_26|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_26| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_26| (select .cse5 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (= |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_26| (select .cse5 (+ |v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_25| 24)))))) (exists ((v_arrayElimArr_11 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (let ((.cse8 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse7 (select |c_#memory_$Pointer$#2.base| .cse8)) (.cse9 (+ |v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_25| 24))) (let ((.cse6 (select .cse7 .cse9))) (and (not (= .cse6 0)) (= .cse7 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse8 v_DerPreprocessor_3) .cse6 v_arrayElimArr_11) .cse8) .cse9 .cse6)) (not (= .cse6 .cse8)))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_48| Int) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_41| Int)) (let ((.cse10 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_48|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_48| (select .cse10 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (= (select .cse10 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_41| 24)) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_48|) (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_48| 0))))) (exists ((v_arrayElimArr_11 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_41| Int)) (let ((.cse13 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse12 (select |c_#memory_$Pointer$#2.base| .cse13)) (.cse14 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_41| 24))) (let ((.cse11 (select .cse12 .cse14))) (and (not (= .cse11 0)) (= .cse12 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse13 v_DerPreprocessor_3) .cse11 v_arrayElimArr_11) .cse13) .cse14 .cse11)) (not (= .cse11 .cse13)))))))) (or (exists ((v_arrayElimArr_11 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_42| Int)) (let ((.cse15 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse18 (select |c_#memory_$Pointer$#2.base| .cse15)) (.cse17 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_42| 24))) (let ((.cse16 (select .cse18 .cse17))) (and (not (= .cse15 .cse16)) (= (store (select (store (store |c_#memory_$Pointer$#2.base| .cse15 v_DerPreprocessor_3) .cse16 v_arrayElimArr_11) .cse15) .cse17 .cse16) .cse18) (not (= .cse16 0))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_49| Int) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_42| Int)) (let ((.cse19 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_49|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_49| 0)) (= (select .cse19 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_42| 24)) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_49|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse19 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_49|)))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_50| Int) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_43| Int)) (let ((.cse20 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_50|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_50| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse20 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_50|)) (= (select .cse20 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_43| 24)) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_50|)))) (exists ((v_arrayElimArr_11 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_43| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (let ((.cse22 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse21 (select |c_#memory_$Pointer$#2.base| .cse22)) (.cse24 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_43| 24))) (let ((.cse23 (select .cse21 .cse24))) (and (= .cse21 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse22 v_DerPreprocessor_3) .cse23 v_arrayElimArr_11) .cse22) .cse24 .cse23)) (not (= 0 .cse23)) (not (= .cse22 .cse23)))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_51| Int) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_44| Int)) (let ((.cse25 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_51|))) (and (= (select .cse25 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_44| 24)) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_51|) (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_51| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse25 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_51|))))) (exists ((v_arrayElimArr_11 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_44| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (let ((.cse26 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse28 (select |c_#memory_$Pointer$#2.base| .cse26)) (.cse29 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_44| 24))) (let ((.cse27 (select .cse28 .cse29))) (and (not (= .cse26 .cse27)) (= .cse28 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse26 v_DerPreprocessor_3) .cse27 v_arrayElimArr_11) .cse26) .cse29 .cse27)) (not (= .cse27 0)))))))) (let ((.cse30 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_linked_list_back_~list#1.base|)) (.cse33 (+ |c_ULTIMATE.start_aws_linked_list_back_~list#1.offset| 24))) (let ((.cse32 (select .cse30 .cse33))) (let ((.cse31 (= |c_ULTIMATE.start_aws_linked_list_back_~list#1.base| .cse32))) (or (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse30 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |c_ULTIMATE.start_aws_linked_list_back_~list#1.base|)) (not (= |c_ULTIMATE.start_aws_linked_list_back_~list#1.base| 0)) .cse31) (and (exists ((v_arrayElimArr_11 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (and (= (store (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_linked_list_back_~list#1.base| v_DerPreprocessor_3) .cse32 v_arrayElimArr_11) |c_ULTIMATE.start_aws_linked_list_back_~list#1.base|) .cse33 .cse32) .cse30) (= (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |c_ULTIMATE.start_aws_linked_list_back_~list#1.base|))) (not (= .cse32 0)) (not .cse31)))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_43| Int) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_51| Int)) (let ((.cse34 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_51|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse34 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_51|)) (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_51| 0)) (= (select .cse34 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_43| 24)) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_51|)))) (exists ((v_arrayElimArr_11 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_43| Int) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (let ((.cse36 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse35 (select |c_#memory_$Pointer$#2.base| .cse36)) (.cse38 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_43| 24))) (let ((.cse37 (select .cse35 .cse38))) (and (= .cse35 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse36 v_DerPreprocessor_3) .cse37 v_arrayElimArr_11) .cse36) .cse38 .cse37)) (not (= .cse37 .cse36)) (not (= .cse37 0))))))))) is different from true [2025-01-09 17:22:55,546 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((v_arrayElimArr_11 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_44| Int) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (let ((.cse1 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse2 (select |c_#memory_$Pointer$#2.base| .cse1)) (.cse3 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_44| 24))) (let ((.cse0 (select .cse2 .cse3))) (and (not (= .cse0 0)) (not (= .cse1 .cse0)) (= .cse2 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse1 v_DerPreprocessor_3) .cse0 v_arrayElimArr_11) .cse1) .cse3 .cse0))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_44| Int) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_52| Int)) (let ((.cse4 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_52|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_52| (select .cse4 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_52| 0)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_52| (select .cse4 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_44| 24))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_26| Int)) (let ((.cse5 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_26|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_26| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_26| (select .cse5 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (= |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_26| (select .cse5 (+ |v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_25| 24)))))) (exists ((v_arrayElimArr_11 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (let ((.cse8 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse7 (select |c_#memory_$Pointer$#2.base| .cse8)) (.cse9 (+ |v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_25| 24))) (let ((.cse6 (select .cse7 .cse9))) (and (not (= .cse6 0)) (= .cse7 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse8 v_DerPreprocessor_3) .cse6 v_arrayElimArr_11) .cse8) .cse9 .cse6)) (not (= .cse6 .cse8)))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_48| Int) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_41| Int)) (let ((.cse10 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_48|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_48| (select .cse10 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (= (select .cse10 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_41| 24)) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_48|) (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_48| 0))))) (exists ((v_arrayElimArr_11 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_41| Int)) (let ((.cse13 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse12 (select |c_#memory_$Pointer$#2.base| .cse13)) (.cse14 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_41| 24))) (let ((.cse11 (select .cse12 .cse14))) (and (not (= .cse11 0)) (= .cse12 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse13 v_DerPreprocessor_3) .cse11 v_arrayElimArr_11) .cse13) .cse14 .cse11)) (not (= .cse11 .cse13)))))))) (or (exists ((v_arrayElimArr_11 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_42| Int)) (let ((.cse15 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse18 (select |c_#memory_$Pointer$#2.base| .cse15)) (.cse17 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_42| 24))) (let ((.cse16 (select .cse18 .cse17))) (and (not (= .cse15 .cse16)) (= (store (select (store (store |c_#memory_$Pointer$#2.base| .cse15 v_DerPreprocessor_3) .cse16 v_arrayElimArr_11) .cse15) .cse17 .cse16) .cse18) (not (= .cse16 0))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_49| Int) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_42| Int)) (let ((.cse19 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_49|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_49| 0)) (= (select .cse19 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_42| 24)) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_49|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse19 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_49|)))))) (or (exists ((v_arrayElimArr_11 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_26| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (let ((.cse22 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse21 (select |c_#memory_$Pointer$#2.base| .cse22)) (.cse23 (+ |v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_26| 24))) (let ((.cse20 (select .cse21 .cse23))) (and (not (= .cse20 0)) (= .cse21 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse22 v_DerPreprocessor_3) .cse20 v_arrayElimArr_11) .cse22) .cse23 .cse20)) (not (= .cse20 .cse22))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_26| Int) (|v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_27| Int)) (let ((.cse24 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_27|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_27| (select .cse24 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (= |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_27| (select .cse24 (+ |v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_26| 24))) (not (= |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_27| 0)))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_50| Int) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_43| Int)) (let ((.cse25 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_50|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_50| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse25 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_50|)) (= (select .cse25 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_43| 24)) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_50|)))) (exists ((v_arrayElimArr_11 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_43| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (let ((.cse27 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse26 (select |c_#memory_$Pointer$#2.base| .cse27)) (.cse29 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_43| 24))) (let ((.cse28 (select .cse26 .cse29))) (and (= .cse26 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse27 v_DerPreprocessor_3) .cse28 v_arrayElimArr_11) .cse27) .cse29 .cse28)) (not (= 0 .cse28)) (not (= .cse27 .cse28)))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_51| Int) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_44| Int)) (let ((.cse30 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_51|))) (and (= (select .cse30 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_44| 24)) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_51|) (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_51| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse30 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_51|))))) (exists ((v_arrayElimArr_11 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_44| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (let ((.cse31 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse33 (select |c_#memory_$Pointer$#2.base| .cse31)) (.cse34 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_44| 24))) (let ((.cse32 (select .cse33 .cse34))) (and (not (= .cse31 .cse32)) (= .cse33 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse31 v_DerPreprocessor_3) .cse32 v_arrayElimArr_11) .cse31) .cse34 .cse32)) (not (= .cse32 0)))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_43| Int) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_51| Int)) (let ((.cse35 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_51|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse35 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_51|)) (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_51| 0)) (= (select .cse35 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_43| 24)) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_51|)))) (exists ((v_arrayElimArr_11 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_43| Int) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (let ((.cse37 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse36 (select |c_#memory_$Pointer$#2.base| .cse37)) (.cse39 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_43| 24))) (let ((.cse38 (select .cse36 .cse39))) (and (= .cse36 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse37 v_DerPreprocessor_3) .cse38 v_arrayElimArr_11) .cse37) .cse39 .cse38)) (not (= .cse38 .cse37)) (not (= .cse38 0))))))))) is different from true [2025-01-09 17:22:55,849 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((v_arrayElimArr_11 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_44| Int) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (let ((.cse1 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse2 (select |c_#memory_$Pointer$#2.base| .cse1)) (.cse3 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_44| 24))) (let ((.cse0 (select .cse2 .cse3))) (and (not (= .cse0 0)) (not (= .cse1 .cse0)) (= .cse2 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse1 v_DerPreprocessor_3) .cse0 v_arrayElimArr_11) .cse1) .cse3 .cse0))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_44| Int) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_52| Int)) (let ((.cse4 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_52|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_52| (select .cse4 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_52| 0)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_52| (select .cse4 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_44| 24))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_26| Int)) (let ((.cse5 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_26|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_26| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_26| (select .cse5 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (= |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_26| (select .cse5 (+ |v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_25| 24)))))) (exists ((v_arrayElimArr_11 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (let ((.cse8 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse7 (select |c_#memory_$Pointer$#2.base| .cse8)) (.cse9 (+ |v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_25| 24))) (let ((.cse6 (select .cse7 .cse9))) (and (not (= .cse6 0)) (= .cse7 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse8 v_DerPreprocessor_3) .cse6 v_arrayElimArr_11) .cse8) .cse9 .cse6)) (not (= .cse6 .cse8)))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_48| Int) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_41| Int)) (let ((.cse10 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_48|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_48| (select .cse10 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (= (select .cse10 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_41| 24)) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_48|) (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_48| 0))))) (exists ((v_arrayElimArr_11 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_41| Int)) (let ((.cse13 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse12 (select |c_#memory_$Pointer$#2.base| .cse13)) (.cse14 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_41| 24))) (let ((.cse11 (select .cse12 .cse14))) (and (not (= .cse11 0)) (= .cse12 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse13 v_DerPreprocessor_3) .cse11 v_arrayElimArr_11) .cse13) .cse14 .cse11)) (not (= .cse11 .cse13)))))))) (or (exists ((v_arrayElimArr_11 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_42| Int)) (let ((.cse15 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse18 (select |c_#memory_$Pointer$#2.base| .cse15)) (.cse17 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_42| 24))) (let ((.cse16 (select .cse18 .cse17))) (and (not (= .cse15 .cse16)) (= (store (select (store (store |c_#memory_$Pointer$#2.base| .cse15 v_DerPreprocessor_3) .cse16 v_arrayElimArr_11) .cse15) .cse17 .cse16) .cse18) (not (= .cse16 0))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_49| Int) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_42| Int)) (let ((.cse19 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_49|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_49| 0)) (= (select .cse19 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_42| 24)) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_49|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse19 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_49|)))))) (or (exists ((v_arrayElimArr_11 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_26| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (let ((.cse22 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse21 (select |c_#memory_$Pointer$#2.base| .cse22)) (.cse23 (+ |v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_26| 24))) (let ((.cse20 (select .cse21 .cse23))) (and (not (= .cse20 0)) (= .cse21 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse22 v_DerPreprocessor_3) .cse20 v_arrayElimArr_11) .cse22) .cse23 .cse20)) (not (= .cse20 .cse22))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_26| Int) (|v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_27| Int)) (let ((.cse24 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_27|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_27| (select .cse24 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (= |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_27| (select .cse24 (+ |v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_26| 24))) (not (= |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_27| 0)))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_50| Int) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_43| Int)) (let ((.cse25 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_50|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_50| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse25 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_50|)) (= (select .cse25 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_43| 24)) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_50|)))) (exists ((v_arrayElimArr_11 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_43| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (let ((.cse27 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse26 (select |c_#memory_$Pointer$#2.base| .cse27)) (.cse29 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_43| 24))) (let ((.cse28 (select .cse26 .cse29))) (and (= .cse26 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse27 v_DerPreprocessor_3) .cse28 v_arrayElimArr_11) .cse27) .cse29 .cse28)) (not (= 0 .cse28)) (not (= .cse27 .cse28)))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_51| Int) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_44| Int)) (let ((.cse30 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_51|))) (and (= (select .cse30 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_44| 24)) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_51|) (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_51| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse30 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_51|))))) (exists ((v_arrayElimArr_11 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_44| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (let ((.cse31 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse33 (select |c_#memory_$Pointer$#2.base| .cse31)) (.cse34 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_44| 24))) (let ((.cse32 (select .cse33 .cse34))) (and (not (= .cse31 .cse32)) (= .cse33 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse31 v_DerPreprocessor_3) .cse32 v_arrayElimArr_11) .cse31) .cse34 .cse32)) (not (= .cse32 0)))))))) (let ((.cse35 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_linked_list_back_~list#1.base|)) (.cse38 (+ |c_ULTIMATE.start_aws_linked_list_back_~list#1.offset| 24))) (let ((.cse37 (select .cse35 .cse38))) (let ((.cse36 (= |c_ULTIMATE.start_aws_linked_list_back_~list#1.base| .cse37))) (or (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse35 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |c_ULTIMATE.start_aws_linked_list_back_~list#1.base|)) (not (= |c_ULTIMATE.start_aws_linked_list_back_~list#1.base| 0)) .cse36) (and (exists ((v_arrayElimArr_11 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (and (= (store (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_linked_list_back_~list#1.base| v_DerPreprocessor_3) .cse37 v_arrayElimArr_11) |c_ULTIMATE.start_aws_linked_list_back_~list#1.base|) .cse38 .cse37) .cse35) (= (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |c_ULTIMATE.start_aws_linked_list_back_~list#1.base|))) (not (= .cse37 0)) (not .cse36)))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_43| Int) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_51| Int)) (let ((.cse39 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_51|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse39 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_51|)) (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_51| 0)) (= (select .cse39 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_43| 24)) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_51|)))) (exists ((v_arrayElimArr_11 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_43| Int) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (let ((.cse41 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse40 (select |c_#memory_$Pointer$#2.base| .cse41)) (.cse43 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_43| 24))) (let ((.cse42 (select .cse40 .cse43))) (and (= .cse40 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse41 v_DerPreprocessor_3) .cse42 v_arrayElimArr_11) .cse41) .cse43 .cse42)) (not (= .cse42 .cse41)) (not (= .cse42 0))))))))) is different from true [2025-01-09 17:22:56,014 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((v_arrayElimArr_11 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_27| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (let ((.cse1 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse3 (select |c_#memory_$Pointer$#2.base| .cse1)) (.cse2 (+ |v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_27| 24))) (let ((.cse0 (select .cse3 .cse2))) (and (not (= .cse0 0)) (not (= .cse0 .cse1)) (= (store (select (store (store |c_#memory_$Pointer$#2.base| .cse1 v_DerPreprocessor_3) .cse0 v_arrayElimArr_11) .cse1) .cse2 .cse0) .cse3)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_28| Int) (|v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_27| Int)) (let ((.cse4 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_28|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse4 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_28|)) (= (select .cse4 (+ |v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_27| 24)) |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_28|) (not (= |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_28| 0)))))) (or (exists ((v_arrayElimArr_11 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_44| Int) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (let ((.cse6 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse7 (select |c_#memory_$Pointer$#2.base| .cse6)) (.cse8 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_44| 24))) (let ((.cse5 (select .cse7 .cse8))) (and (not (= .cse5 0)) (not (= .cse6 .cse5)) (= .cse7 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse6 v_DerPreprocessor_3) .cse5 v_arrayElimArr_11) .cse6) .cse8 .cse5))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_44| Int) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_52| Int)) (let ((.cse9 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_52|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_52| (select .cse9 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_52| 0)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_52| (select .cse9 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_44| 24))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_26| Int)) (let ((.cse10 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_26|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_26| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_26| (select .cse10 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (= |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_26| (select .cse10 (+ |v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_25| 24)))))) (exists ((v_arrayElimArr_11 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (let ((.cse13 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse12 (select |c_#memory_$Pointer$#2.base| .cse13)) (.cse14 (+ |v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_25| 24))) (let ((.cse11 (select .cse12 .cse14))) (and (not (= .cse11 0)) (= .cse12 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse13 v_DerPreprocessor_3) .cse11 v_arrayElimArr_11) .cse13) .cse14 .cse11)) (not (= .cse11 .cse13)))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_48| Int) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_41| Int)) (let ((.cse15 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_48|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_48| (select .cse15 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (= (select .cse15 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_41| 24)) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_48|) (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_48| 0))))) (exists ((v_arrayElimArr_11 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_41| Int)) (let ((.cse18 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse17 (select |c_#memory_$Pointer$#2.base| .cse18)) (.cse19 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_41| 24))) (let ((.cse16 (select .cse17 .cse19))) (and (not (= .cse16 0)) (= .cse17 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse18 v_DerPreprocessor_3) .cse16 v_arrayElimArr_11) .cse18) .cse19 .cse16)) (not (= .cse16 .cse18)))))))) (or (exists ((v_arrayElimArr_11 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_42| Int)) (let ((.cse20 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse23 (select |c_#memory_$Pointer$#2.base| .cse20)) (.cse22 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_42| 24))) (let ((.cse21 (select .cse23 .cse22))) (and (not (= .cse20 .cse21)) (= (store (select (store (store |c_#memory_$Pointer$#2.base| .cse20 v_DerPreprocessor_3) .cse21 v_arrayElimArr_11) .cse20) .cse22 .cse21) .cse23) (not (= .cse21 0))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_49| Int) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_42| Int)) (let ((.cse24 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_49|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_49| 0)) (= (select .cse24 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_42| 24)) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_49|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse24 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_49|)))))) (or (exists ((v_arrayElimArr_11 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_26| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (let ((.cse27 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse26 (select |c_#memory_$Pointer$#2.base| .cse27)) (.cse28 (+ |v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_26| 24))) (let ((.cse25 (select .cse26 .cse28))) (and (not (= .cse25 0)) (= .cse26 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse27 v_DerPreprocessor_3) .cse25 v_arrayElimArr_11) .cse27) .cse28 .cse25)) (not (= .cse25 .cse27))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_26| Int) (|v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_27| Int)) (let ((.cse29 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_27|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_27| (select .cse29 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (= |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_27| (select .cse29 (+ |v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_26| 24))) (not (= |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_27| 0)))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_50| Int) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_43| Int)) (let ((.cse30 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_50|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_50| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse30 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_50|)) (= (select .cse30 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_43| 24)) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_50|)))) (exists ((v_arrayElimArr_11 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_43| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (let ((.cse32 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse31 (select |c_#memory_$Pointer$#2.base| .cse32)) (.cse34 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_43| 24))) (let ((.cse33 (select .cse31 .cse34))) (and (= .cse31 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse32 v_DerPreprocessor_3) .cse33 v_arrayElimArr_11) .cse32) .cse34 .cse33)) (not (= 0 .cse33)) (not (= .cse32 .cse33)))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_51| Int) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_44| Int)) (let ((.cse35 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_51|))) (and (= (select .cse35 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_44| 24)) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_51|) (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_51| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse35 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_51|))))) (exists ((v_arrayElimArr_11 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_44| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (let ((.cse36 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse38 (select |c_#memory_$Pointer$#2.base| .cse36)) (.cse39 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_44| 24))) (let ((.cse37 (select .cse38 .cse39))) (and (not (= .cse36 .cse37)) (= .cse38 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse36 v_DerPreprocessor_3) .cse37 v_arrayElimArr_11) .cse36) .cse39 .cse37)) (not (= .cse37 0)))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_43| Int) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_51| Int)) (let ((.cse40 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_51|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse40 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_51|)) (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_51| 0)) (= (select .cse40 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_43| 24)) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_51|)))) (exists ((v_arrayElimArr_11 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_43| Int) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (let ((.cse42 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse41 (select |c_#memory_$Pointer$#2.base| .cse42)) (.cse44 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_43| 24))) (let ((.cse43 (select .cse41 .cse44))) (and (= .cse41 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse42 v_DerPreprocessor_3) .cse43 v_arrayElimArr_11) .cse42) .cse44 .cse43)) (not (= .cse43 .cse42)) (not (= .cse43 0))))))))) is different from true [2025-01-09 17:22:56,772 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((v_arrayElimArr_11 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_27| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (let ((.cse1 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse3 (select |c_#memory_$Pointer$#2.base| .cse1)) (.cse2 (+ |v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_27| 24))) (let ((.cse0 (select .cse3 .cse2))) (and (not (= .cse0 0)) (not (= .cse0 .cse1)) (= (store (select (store (store |c_#memory_$Pointer$#2.base| .cse1 v_DerPreprocessor_3) .cse0 v_arrayElimArr_11) .cse1) .cse2 .cse0) .cse3)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_28| Int) (|v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_27| Int)) (let ((.cse4 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_28|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse4 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_28|)) (= (select .cse4 (+ |v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_27| 24)) |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_28|) (not (= |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_28| 0)))))) (or (exists ((v_arrayElimArr_11 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_44| Int) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (let ((.cse6 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse7 (select |c_#memory_$Pointer$#2.base| .cse6)) (.cse8 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_44| 24))) (let ((.cse5 (select .cse7 .cse8))) (and (not (= .cse5 0)) (not (= .cse6 .cse5)) (= .cse7 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse6 v_DerPreprocessor_3) .cse5 v_arrayElimArr_11) .cse6) .cse8 .cse5))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_44| Int) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_52| Int)) (let ((.cse9 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_52|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_52| (select .cse9 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_52| 0)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_52| (select .cse9 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_44| 24))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_26| Int)) (let ((.cse10 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_26|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_26| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_26| (select .cse10 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (= |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_26| (select .cse10 (+ |v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_25| 24)))))) (exists ((v_arrayElimArr_11 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (let ((.cse13 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse12 (select |c_#memory_$Pointer$#2.base| .cse13)) (.cse14 (+ |v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_25| 24))) (let ((.cse11 (select .cse12 .cse14))) (and (not (= .cse11 0)) (= .cse12 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse13 v_DerPreprocessor_3) .cse11 v_arrayElimArr_11) .cse13) .cse14 .cse11)) (not (= .cse11 .cse13)))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_48| Int) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_41| Int)) (let ((.cse15 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_48|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_48| (select .cse15 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (= (select .cse15 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_41| 24)) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_48|) (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_48| 0))))) (exists ((v_arrayElimArr_11 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_41| Int)) (let ((.cse18 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse17 (select |c_#memory_$Pointer$#2.base| .cse18)) (.cse19 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_41| 24))) (let ((.cse16 (select .cse17 .cse19))) (and (not (= .cse16 0)) (= .cse17 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse18 v_DerPreprocessor_3) .cse16 v_arrayElimArr_11) .cse18) .cse19 .cse16)) (not (= .cse16 .cse18)))))))) (or (exists ((v_arrayElimArr_11 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_42| Int)) (let ((.cse20 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse23 (select |c_#memory_$Pointer$#2.base| .cse20)) (.cse22 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_42| 24))) (let ((.cse21 (select .cse23 .cse22))) (and (not (= .cse20 .cse21)) (= (store (select (store (store |c_#memory_$Pointer$#2.base| .cse20 v_DerPreprocessor_3) .cse21 v_arrayElimArr_11) .cse20) .cse22 .cse21) .cse23) (not (= .cse21 0))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_49| Int) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_42| Int)) (let ((.cse24 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_49|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_49| 0)) (= (select .cse24 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_42| 24)) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_49|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse24 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_49|)))))) (or (exists ((v_arrayElimArr_11 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_26| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (let ((.cse27 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse26 (select |c_#memory_$Pointer$#2.base| .cse27)) (.cse28 (+ |v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_26| 24))) (let ((.cse25 (select .cse26 .cse28))) (and (not (= .cse25 0)) (= .cse26 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse27 v_DerPreprocessor_3) .cse25 v_arrayElimArr_11) .cse27) .cse28 .cse25)) (not (= .cse25 .cse27))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_26| Int) (|v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_27| Int)) (let ((.cse29 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_27|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_27| (select .cse29 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (= |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_27| (select .cse29 (+ |v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_26| 24))) (not (= |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_27| 0)))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_50| Int) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_43| Int)) (let ((.cse30 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_50|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_50| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse30 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_50|)) (= (select .cse30 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_43| 24)) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_50|)))) (exists ((v_arrayElimArr_11 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_43| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (let ((.cse32 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse31 (select |c_#memory_$Pointer$#2.base| .cse32)) (.cse34 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_43| 24))) (let ((.cse33 (select .cse31 .cse34))) (and (= .cse31 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse32 v_DerPreprocessor_3) .cse33 v_arrayElimArr_11) .cse32) .cse34 .cse33)) (not (= 0 .cse33)) (not (= .cse32 .cse33)))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_51| Int) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_44| Int)) (let ((.cse35 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_51|))) (and (= (select .cse35 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_44| 24)) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_51|) (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_51| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse35 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_51|))))) (exists ((v_arrayElimArr_11 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_44| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (let ((.cse36 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse38 (select |c_#memory_$Pointer$#2.base| .cse36)) (.cse39 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_44| 24))) (let ((.cse37 (select .cse38 .cse39))) (and (not (= .cse36 .cse37)) (= .cse38 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse36 v_DerPreprocessor_3) .cse37 v_arrayElimArr_11) .cse36) .cse39 .cse37)) (not (= .cse37 0)))))))) (let ((.cse40 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_linked_list_back_~list#1.base|)) (.cse43 (+ |c_ULTIMATE.start_aws_linked_list_back_~list#1.offset| 24))) (let ((.cse42 (select .cse40 .cse43))) (let ((.cse41 (= |c_ULTIMATE.start_aws_linked_list_back_~list#1.base| .cse42))) (or (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse40 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |c_ULTIMATE.start_aws_linked_list_back_~list#1.base|)) (not (= |c_ULTIMATE.start_aws_linked_list_back_~list#1.base| 0)) .cse41) (and (exists ((v_arrayElimArr_11 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (and (= (store (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_linked_list_back_~list#1.base| v_DerPreprocessor_3) .cse42 v_arrayElimArr_11) |c_ULTIMATE.start_aws_linked_list_back_~list#1.base|) .cse43 .cse42) .cse40) (= (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |c_ULTIMATE.start_aws_linked_list_back_~list#1.base|))) (not (= .cse42 0)) (not .cse41)))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_43| Int) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_51| Int)) (let ((.cse44 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_51|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse44 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_51|)) (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_51| 0)) (= (select .cse44 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_43| 24)) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_51|)))) (exists ((v_arrayElimArr_11 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_43| Int) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (let ((.cse46 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse45 (select |c_#memory_$Pointer$#2.base| .cse46)) (.cse48 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_43| 24))) (let ((.cse47 (select .cse45 .cse48))) (and (= .cse45 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse46 v_DerPreprocessor_3) .cse47 v_arrayElimArr_11) .cse46) .cse48 .cse47)) (not (= .cse47 .cse46)) (not (= .cse47 0))))))))) is different from true [2025-01-09 17:22:56,866 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((v_arrayElimArr_11 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_27| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (let ((.cse1 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse3 (select |c_#memory_$Pointer$#2.base| .cse1)) (.cse2 (+ |v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_27| 24))) (let ((.cse0 (select .cse3 .cse2))) (and (not (= .cse0 0)) (not (= .cse0 .cse1)) (= (store (select (store (store |c_#memory_$Pointer$#2.base| .cse1 v_DerPreprocessor_3) .cse0 v_arrayElimArr_11) .cse1) .cse2 .cse0) .cse3)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_28| Int) (|v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_27| Int)) (let ((.cse4 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_28|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse4 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_28|)) (= (select .cse4 (+ |v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_27| 24)) |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_28|) (not (= |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_28| 0)))))) (or (exists ((v_arrayElimArr_11 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_44| Int) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (let ((.cse6 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse7 (select |c_#memory_$Pointer$#2.base| .cse6)) (.cse8 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_44| 24))) (let ((.cse5 (select .cse7 .cse8))) (and (not (= .cse5 0)) (not (= .cse6 .cse5)) (= .cse7 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse6 v_DerPreprocessor_3) .cse5 v_arrayElimArr_11) .cse6) .cse8 .cse5))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_44| Int) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_52| Int)) (let ((.cse9 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_52|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_52| (select .cse9 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_52| 0)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_52| (select .cse9 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_44| 24))))))) (or (exists ((v_arrayElimArr_11 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_28| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (let ((.cse11 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse13 (select |c_#memory_$Pointer$#2.base| .cse11)) (.cse12 (+ |v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_28| 24))) (let ((.cse10 (select .cse13 .cse12))) (and (not (= .cse10 0)) (not (= .cse10 .cse11)) (= (store (select (store (store |c_#memory_$Pointer$#2.base| .cse11 v_DerPreprocessor_3) .cse10 v_arrayElimArr_11) .cse11) .cse12 .cse10) .cse13)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_28| Int) (|v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_29| Int)) (let ((.cse14 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_29|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_29| (select .cse14 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (not (= |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_29| 0)) (= |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_29| (select .cse14 (+ |v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_28| 24))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_26| Int)) (let ((.cse15 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_26|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_26| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_26| (select .cse15 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (= |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_26| (select .cse15 (+ |v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_25| 24)))))) (exists ((v_arrayElimArr_11 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (let ((.cse18 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse17 (select |c_#memory_$Pointer$#2.base| .cse18)) (.cse19 (+ |v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_25| 24))) (let ((.cse16 (select .cse17 .cse19))) (and (not (= .cse16 0)) (= .cse17 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse18 v_DerPreprocessor_3) .cse16 v_arrayElimArr_11) .cse18) .cse19 .cse16)) (not (= .cse16 .cse18)))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_48| Int) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_41| Int)) (let ((.cse20 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_48|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_48| (select .cse20 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (= (select .cse20 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_41| 24)) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_48|) (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_48| 0))))) (exists ((v_arrayElimArr_11 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_41| Int)) (let ((.cse23 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse22 (select |c_#memory_$Pointer$#2.base| .cse23)) (.cse24 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_41| 24))) (let ((.cse21 (select .cse22 .cse24))) (and (not (= .cse21 0)) (= .cse22 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse23 v_DerPreprocessor_3) .cse21 v_arrayElimArr_11) .cse23) .cse24 .cse21)) (not (= .cse21 .cse23)))))))) (or (exists ((v_arrayElimArr_11 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_42| Int)) (let ((.cse25 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse28 (select |c_#memory_$Pointer$#2.base| .cse25)) (.cse27 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_42| 24))) (let ((.cse26 (select .cse28 .cse27))) (and (not (= .cse25 .cse26)) (= (store (select (store (store |c_#memory_$Pointer$#2.base| .cse25 v_DerPreprocessor_3) .cse26 v_arrayElimArr_11) .cse25) .cse27 .cse26) .cse28) (not (= .cse26 0))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_49| Int) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_42| Int)) (let ((.cse29 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_49|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_49| 0)) (= (select .cse29 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_42| 24)) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_49|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse29 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_49|)))))) (or (exists ((v_arrayElimArr_11 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_26| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (let ((.cse32 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse31 (select |c_#memory_$Pointer$#2.base| .cse32)) (.cse33 (+ |v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_26| 24))) (let ((.cse30 (select .cse31 .cse33))) (and (not (= .cse30 0)) (= .cse31 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse32 v_DerPreprocessor_3) .cse30 v_arrayElimArr_11) .cse32) .cse33 .cse30)) (not (= .cse30 .cse32))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_26| Int) (|v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_27| Int)) (let ((.cse34 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_27|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_27| (select .cse34 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (= |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_27| (select .cse34 (+ |v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_26| 24))) (not (= |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_27| 0)))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_50| Int) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_43| Int)) (let ((.cse35 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_50|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_50| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse35 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_50|)) (= (select .cse35 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_43| 24)) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_50|)))) (exists ((v_arrayElimArr_11 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_43| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (let ((.cse37 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse36 (select |c_#memory_$Pointer$#2.base| .cse37)) (.cse39 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_43| 24))) (let ((.cse38 (select .cse36 .cse39))) (and (= .cse36 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse37 v_DerPreprocessor_3) .cse38 v_arrayElimArr_11) .cse37) .cse39 .cse38)) (not (= 0 .cse38)) (not (= .cse37 .cse38)))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_51| Int) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_44| Int)) (let ((.cse40 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_51|))) (and (= (select .cse40 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_44| 24)) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_51|) (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_51| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse40 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_51|))))) (exists ((v_arrayElimArr_11 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_44| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (let ((.cse41 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse43 (select |c_#memory_$Pointer$#2.base| .cse41)) (.cse44 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_44| 24))) (let ((.cse42 (select .cse43 .cse44))) (and (not (= .cse41 .cse42)) (= .cse43 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse41 v_DerPreprocessor_3) .cse42 v_arrayElimArr_11) .cse41) .cse44 .cse42)) (not (= .cse42 0)))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_43| Int) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_51| Int)) (let ((.cse45 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_51|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse45 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_51|)) (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_51| 0)) (= (select .cse45 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_43| 24)) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_51|)))) (exists ((v_arrayElimArr_11 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_43| Int) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (let ((.cse47 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse46 (select |c_#memory_$Pointer$#2.base| .cse47)) (.cse49 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_43| 24))) (let ((.cse48 (select .cse46 .cse49))) (and (= .cse46 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse47 v_DerPreprocessor_3) .cse48 v_arrayElimArr_11) .cse47) .cse49 .cse48)) (not (= .cse48 .cse47)) (not (= .cse48 0))))))))) is different from true [2025-01-09 17:22:57,235 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((v_arrayElimArr_11 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_27| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (let ((.cse1 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse3 (select |c_#memory_$Pointer$#2.base| .cse1)) (.cse2 (+ |v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_27| 24))) (let ((.cse0 (select .cse3 .cse2))) (and (not (= .cse0 0)) (not (= .cse0 .cse1)) (= (store (select (store (store |c_#memory_$Pointer$#2.base| .cse1 v_DerPreprocessor_3) .cse0 v_arrayElimArr_11) .cse1) .cse2 .cse0) .cse3)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_28| Int) (|v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_27| Int)) (let ((.cse4 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_28|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse4 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_28|)) (= (select .cse4 (+ |v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_27| 24)) |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_28|) (not (= |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_28| 0)))))) (or (exists ((v_arrayElimArr_11 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_44| Int) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (let ((.cse6 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse7 (select |c_#memory_$Pointer$#2.base| .cse6)) (.cse8 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_44| 24))) (let ((.cse5 (select .cse7 .cse8))) (and (not (= .cse5 0)) (not (= .cse6 .cse5)) (= .cse7 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse6 v_DerPreprocessor_3) .cse5 v_arrayElimArr_11) .cse6) .cse8 .cse5))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_44| Int) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_52| Int)) (let ((.cse9 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_52|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_52| (select .cse9 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_52| 0)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_52| (select .cse9 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_44| 24))))))) (or (exists ((v_arrayElimArr_11 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_28| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (let ((.cse11 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse13 (select |c_#memory_$Pointer$#2.base| .cse11)) (.cse12 (+ |v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_28| 24))) (let ((.cse10 (select .cse13 .cse12))) (and (not (= .cse10 0)) (not (= .cse10 .cse11)) (= (store (select (store (store |c_#memory_$Pointer$#2.base| .cse11 v_DerPreprocessor_3) .cse10 v_arrayElimArr_11) .cse11) .cse12 .cse10) .cse13)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_28| Int) (|v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_29| Int)) (let ((.cse14 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_29|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_29| (select .cse14 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (not (= |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_29| 0)) (= |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_29| (select .cse14 (+ |v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_28| 24))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_26| Int)) (let ((.cse15 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_26|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_26| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_26| (select .cse15 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (= |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_26| (select .cse15 (+ |v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_25| 24)))))) (exists ((v_arrayElimArr_11 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (let ((.cse18 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse17 (select |c_#memory_$Pointer$#2.base| .cse18)) (.cse19 (+ |v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_25| 24))) (let ((.cse16 (select .cse17 .cse19))) (and (not (= .cse16 0)) (= .cse17 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse18 v_DerPreprocessor_3) .cse16 v_arrayElimArr_11) .cse18) .cse19 .cse16)) (not (= .cse16 .cse18)))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_48| Int) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_41| Int)) (let ((.cse20 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_48|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_48| (select .cse20 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (= (select .cse20 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_41| 24)) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_48|) (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_48| 0))))) (exists ((v_arrayElimArr_11 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_41| Int)) (let ((.cse23 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse22 (select |c_#memory_$Pointer$#2.base| .cse23)) (.cse24 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_41| 24))) (let ((.cse21 (select .cse22 .cse24))) (and (not (= .cse21 0)) (= .cse22 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse23 v_DerPreprocessor_3) .cse21 v_arrayElimArr_11) .cse23) .cse24 .cse21)) (not (= .cse21 .cse23)))))))) (or (exists ((v_arrayElimArr_11 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_42| Int)) (let ((.cse25 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse28 (select |c_#memory_$Pointer$#2.base| .cse25)) (.cse27 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_42| 24))) (let ((.cse26 (select .cse28 .cse27))) (and (not (= .cse25 .cse26)) (= (store (select (store (store |c_#memory_$Pointer$#2.base| .cse25 v_DerPreprocessor_3) .cse26 v_arrayElimArr_11) .cse25) .cse27 .cse26) .cse28) (not (= .cse26 0))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_49| Int) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_42| Int)) (let ((.cse29 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_49|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_49| 0)) (= (select .cse29 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_42| 24)) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_49|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse29 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_49|)))))) (or (exists ((v_arrayElimArr_11 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_26| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (let ((.cse32 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse31 (select |c_#memory_$Pointer$#2.base| .cse32)) (.cse33 (+ |v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_26| 24))) (let ((.cse30 (select .cse31 .cse33))) (and (not (= .cse30 0)) (= .cse31 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse32 v_DerPreprocessor_3) .cse30 v_arrayElimArr_11) .cse32) .cse33 .cse30)) (not (= .cse30 .cse32))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_26| Int) (|v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_27| Int)) (let ((.cse34 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_27|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_27| (select .cse34 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (= |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_27| (select .cse34 (+ |v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_26| 24))) (not (= |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_27| 0)))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_50| Int) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_43| Int)) (let ((.cse35 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_50|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_50| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse35 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_50|)) (= (select .cse35 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_43| 24)) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_50|)))) (exists ((v_arrayElimArr_11 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_43| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (let ((.cse37 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse36 (select |c_#memory_$Pointer$#2.base| .cse37)) (.cse39 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_43| 24))) (let ((.cse38 (select .cse36 .cse39))) (and (= .cse36 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse37 v_DerPreprocessor_3) .cse38 v_arrayElimArr_11) .cse37) .cse39 .cse38)) (not (= 0 .cse38)) (not (= .cse37 .cse38)))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_51| Int) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_44| Int)) (let ((.cse40 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_51|))) (and (= (select .cse40 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_44| 24)) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_51|) (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_51| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse40 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_51|))))) (exists ((v_arrayElimArr_11 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_44| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (let ((.cse41 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse43 (select |c_#memory_$Pointer$#2.base| .cse41)) (.cse44 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_44| 24))) (let ((.cse42 (select .cse43 .cse44))) (and (not (= .cse41 .cse42)) (= .cse43 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse41 v_DerPreprocessor_3) .cse42 v_arrayElimArr_11) .cse41) .cse44 .cse42)) (not (= .cse42 0)))))))) (let ((.cse45 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_linked_list_back_~list#1.base|)) (.cse48 (+ |c_ULTIMATE.start_aws_linked_list_back_~list#1.offset| 24))) (let ((.cse47 (select .cse45 .cse48))) (let ((.cse46 (= |c_ULTIMATE.start_aws_linked_list_back_~list#1.base| .cse47))) (or (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse45 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |c_ULTIMATE.start_aws_linked_list_back_~list#1.base|)) (not (= |c_ULTIMATE.start_aws_linked_list_back_~list#1.base| 0)) .cse46) (and (exists ((v_arrayElimArr_11 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (and (= (store (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_linked_list_back_~list#1.base| v_DerPreprocessor_3) .cse47 v_arrayElimArr_11) |c_ULTIMATE.start_aws_linked_list_back_~list#1.base|) .cse48 .cse47) .cse45) (= (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |c_ULTIMATE.start_aws_linked_list_back_~list#1.base|))) (not (= .cse47 0)) (not .cse46)))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_43| Int) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_51| Int)) (let ((.cse49 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_51|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse49 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_51|)) (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_51| 0)) (= (select .cse49 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_43| 24)) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_51|)))) (exists ((v_arrayElimArr_11 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_43| Int) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (let ((.cse51 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse50 (select |c_#memory_$Pointer$#2.base| .cse51)) (.cse53 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_43| 24))) (let ((.cse52 (select .cse50 .cse53))) (and (= .cse50 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse51 v_DerPreprocessor_3) .cse52 v_arrayElimArr_11) .cse51) .cse53 .cse52)) (not (= .cse52 .cse51)) (not (= .cse52 0))))))))) is different from true [2025-01-09 17:22:57,444 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((v_arrayElimArr_11 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_27| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (let ((.cse1 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse3 (select |c_#memory_$Pointer$#2.base| .cse1)) (.cse2 (+ |v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_27| 24))) (let ((.cse0 (select .cse3 .cse2))) (and (not (= .cse0 0)) (not (= .cse0 .cse1)) (= (store (select (store (store |c_#memory_$Pointer$#2.base| .cse1 v_DerPreprocessor_3) .cse0 v_arrayElimArr_11) .cse1) .cse2 .cse0) .cse3)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_28| Int) (|v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_27| Int)) (let ((.cse4 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_28|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse4 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_28|)) (= (select .cse4 (+ |v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_27| 24)) |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_28|) (not (= |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_28| 0)))))) (or (exists ((v_arrayElimArr_11 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_44| Int) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (let ((.cse6 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse7 (select |c_#memory_$Pointer$#2.base| .cse6)) (.cse8 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_44| 24))) (let ((.cse5 (select .cse7 .cse8))) (and (not (= .cse5 0)) (not (= .cse6 .cse5)) (= .cse7 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse6 v_DerPreprocessor_3) .cse5 v_arrayElimArr_11) .cse6) .cse8 .cse5))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_44| Int) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_52| Int)) (let ((.cse9 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_52|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_52| (select .cse9 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_52| 0)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_52| (select .cse9 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_44| 24))))))) (or (exists ((v_arrayElimArr_11 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_28| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (let ((.cse11 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse13 (select |c_#memory_$Pointer$#2.base| .cse11)) (.cse12 (+ |v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_28| 24))) (let ((.cse10 (select .cse13 .cse12))) (and (not (= .cse10 0)) (not (= .cse10 .cse11)) (= (store (select (store (store |c_#memory_$Pointer$#2.base| .cse11 v_DerPreprocessor_3) .cse10 v_arrayElimArr_11) .cse11) .cse12 .cse10) .cse13)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_28| Int) (|v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_29| Int)) (let ((.cse14 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_29|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_29| (select .cse14 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (not (= |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_29| 0)) (= |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_29| (select .cse14 (+ |v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_28| 24))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_26| Int)) (let ((.cse15 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_26|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_26| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_26| (select .cse15 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (= |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_26| (select .cse15 (+ |v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_25| 24)))))) (exists ((v_arrayElimArr_11 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (let ((.cse18 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse17 (select |c_#memory_$Pointer$#2.base| .cse18)) (.cse19 (+ |v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_25| 24))) (let ((.cse16 (select .cse17 .cse19))) (and (not (= .cse16 0)) (= .cse17 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse18 v_DerPreprocessor_3) .cse16 v_arrayElimArr_11) .cse18) .cse19 .cse16)) (not (= .cse16 .cse18)))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_48| Int) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_41| Int)) (let ((.cse20 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_48|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_48| (select .cse20 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (= (select .cse20 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_41| 24)) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_48|) (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_48| 0))))) (exists ((v_arrayElimArr_11 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_41| Int)) (let ((.cse23 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse22 (select |c_#memory_$Pointer$#2.base| .cse23)) (.cse24 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_41| 24))) (let ((.cse21 (select .cse22 .cse24))) (and (not (= .cse21 0)) (= .cse22 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse23 v_DerPreprocessor_3) .cse21 v_arrayElimArr_11) .cse23) .cse24 .cse21)) (not (= .cse21 .cse23)))))))) (or (exists ((v_arrayElimArr_11 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_42| Int)) (let ((.cse25 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse28 (select |c_#memory_$Pointer$#2.base| .cse25)) (.cse27 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_42| 24))) (let ((.cse26 (select .cse28 .cse27))) (and (not (= .cse25 .cse26)) (= (store (select (store (store |c_#memory_$Pointer$#2.base| .cse25 v_DerPreprocessor_3) .cse26 v_arrayElimArr_11) .cse25) .cse27 .cse26) .cse28) (not (= .cse26 0))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_49| Int) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_42| Int)) (let ((.cse29 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_49|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_49| 0)) (= (select .cse29 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_42| 24)) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_49|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse29 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_49|)))))) (or (exists ((v_arrayElimArr_11 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_26| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (let ((.cse32 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse31 (select |c_#memory_$Pointer$#2.base| .cse32)) (.cse33 (+ |v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_26| 24))) (let ((.cse30 (select .cse31 .cse33))) (and (not (= .cse30 0)) (= .cse31 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse32 v_DerPreprocessor_3) .cse30 v_arrayElimArr_11) .cse32) .cse33 .cse30)) (not (= .cse30 .cse32))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_26| Int) (|v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_27| Int)) (let ((.cse34 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_27|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_27| (select .cse34 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (= |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_27| (select .cse34 (+ |v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_26| 24))) (not (= |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_27| 0)))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_50| Int) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_43| Int)) (let ((.cse35 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_50|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_50| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse35 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_50|)) (= (select .cse35 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_43| 24)) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_50|)))) (exists ((v_arrayElimArr_11 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_43| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (let ((.cse37 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse36 (select |c_#memory_$Pointer$#2.base| .cse37)) (.cse39 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_43| 24))) (let ((.cse38 (select .cse36 .cse39))) (and (= .cse36 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse37 v_DerPreprocessor_3) .cse38 v_arrayElimArr_11) .cse37) .cse39 .cse38)) (not (= 0 .cse38)) (not (= .cse37 .cse38)))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_51| Int) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_44| Int)) (let ((.cse40 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_51|))) (and (= (select .cse40 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_44| 24)) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_51|) (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_51| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse40 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_51|))))) (exists ((v_arrayElimArr_11 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_44| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (let ((.cse41 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse43 (select |c_#memory_$Pointer$#2.base| .cse41)) (.cse44 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_44| 24))) (let ((.cse42 (select .cse43 .cse44))) (and (not (= .cse41 .cse42)) (= .cse43 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse41 v_DerPreprocessor_3) .cse42 v_arrayElimArr_11) .cse41) .cse44 .cse42)) (not (= .cse42 0)))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_29| Int) (|v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_30| Int)) (let ((.cse45 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_30|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_30| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_30| (select .cse45 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (= |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_30| (select .cse45 (+ |v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_29| 24)))))) (exists ((v_arrayElimArr_11 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_29| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (let ((.cse47 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse48 (select |c_#memory_$Pointer$#2.base| .cse47)) (.cse49 (+ |v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_29| 24))) (let ((.cse46 (select .cse48 .cse49))) (and (not (= .cse46 0)) (not (= .cse46 .cse47)) (= .cse48 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse47 v_DerPreprocessor_3) .cse46 v_arrayElimArr_11) .cse47) .cse49 .cse46)))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_43| Int) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_51| Int)) (let ((.cse50 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_51|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse50 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_51|)) (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_51| 0)) (= (select .cse50 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_43| 24)) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_51|)))) (exists ((v_arrayElimArr_11 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_43| Int) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (let ((.cse52 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse51 (select |c_#memory_$Pointer$#2.base| .cse52)) (.cse54 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_43| 24))) (let ((.cse53 (select .cse51 .cse54))) (and (= .cse51 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse52 v_DerPreprocessor_3) .cse53 v_arrayElimArr_11) .cse52) .cse54 .cse53)) (not (= .cse53 .cse52)) (not (= .cse53 0))))))))) is different from true [2025-01-09 17:22:58,528 WARN L873 $PredicateComparison]: unable to prove that (and (or |c_aws_linked_list_is_valid_#t~short308#1| (= 0 (select (select |c_#memory_$Pointer$#2.base| |c_aws_linked_list_is_valid_#in~list#1.base|) (+ |c_aws_linked_list_is_valid_#in~list#1.offset| 24)))) (or (exists ((v_arrayElimArr_11 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_27| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (let ((.cse1 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse3 (select |c_#memory_$Pointer$#2.base| .cse1)) (.cse2 (+ |v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_27| 24))) (let ((.cse0 (select .cse3 .cse2))) (and (not (= .cse0 0)) (not (= .cse0 .cse1)) (= (store (select (store (store |c_#memory_$Pointer$#2.base| .cse1 v_DerPreprocessor_3) .cse0 v_arrayElimArr_11) .cse1) .cse2 .cse0) .cse3)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_28| Int) (|v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_27| Int)) (let ((.cse4 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_28|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse4 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_28|)) (= (select .cse4 (+ |v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_27| 24)) |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_28|) (not (= |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_28| 0)))))) (or (exists ((v_arrayElimArr_11 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_44| Int) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (let ((.cse6 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse7 (select |c_#memory_$Pointer$#2.base| .cse6)) (.cse8 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_44| 24))) (let ((.cse5 (select .cse7 .cse8))) (and (not (= .cse5 0)) (not (= .cse6 .cse5)) (= .cse7 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse6 v_DerPreprocessor_3) .cse5 v_arrayElimArr_11) .cse6) .cse8 .cse5))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_44| Int) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_52| Int)) (let ((.cse9 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_52|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_52| (select .cse9 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_52| 0)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_52| (select .cse9 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_44| 24))))))) (or (exists ((v_arrayElimArr_11 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_28| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (let ((.cse11 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse13 (select |c_#memory_$Pointer$#2.base| .cse11)) (.cse12 (+ |v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_28| 24))) (let ((.cse10 (select .cse13 .cse12))) (and (not (= .cse10 0)) (not (= .cse10 .cse11)) (= (store (select (store (store |c_#memory_$Pointer$#2.base| .cse11 v_DerPreprocessor_3) .cse10 v_arrayElimArr_11) .cse11) .cse12 .cse10) .cse13)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_28| Int) (|v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_29| Int)) (let ((.cse14 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_29|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_29| (select .cse14 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (not (= |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_29| 0)) (= |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_29| (select .cse14 (+ |v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_28| 24))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_26| Int)) (let ((.cse15 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_26|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_26| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_26| (select .cse15 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (= |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_26| (select .cse15 (+ |v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_25| 24)))))) (exists ((v_arrayElimArr_11 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (let ((.cse18 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse17 (select |c_#memory_$Pointer$#2.base| .cse18)) (.cse19 (+ |v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_25| 24))) (let ((.cse16 (select .cse17 .cse19))) (and (not (= .cse16 0)) (= .cse17 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse18 v_DerPreprocessor_3) .cse16 v_arrayElimArr_11) .cse18) .cse19 .cse16)) (not (= .cse16 .cse18)))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_48| Int) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_41| Int)) (let ((.cse20 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_48|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_48| (select .cse20 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (= (select .cse20 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_41| 24)) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_48|) (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_48| 0))))) (exists ((v_arrayElimArr_11 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_41| Int)) (let ((.cse23 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse22 (select |c_#memory_$Pointer$#2.base| .cse23)) (.cse24 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_41| 24))) (let ((.cse21 (select .cse22 .cse24))) (and (not (= .cse21 0)) (= .cse22 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse23 v_DerPreprocessor_3) .cse21 v_arrayElimArr_11) .cse23) .cse24 .cse21)) (not (= .cse21 .cse23)))))))) (or (exists ((v_arrayElimArr_11 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_42| Int)) (let ((.cse25 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse28 (select |c_#memory_$Pointer$#2.base| .cse25)) (.cse27 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_42| 24))) (let ((.cse26 (select .cse28 .cse27))) (and (not (= .cse25 .cse26)) (= (store (select (store (store |c_#memory_$Pointer$#2.base| .cse25 v_DerPreprocessor_3) .cse26 v_arrayElimArr_11) .cse25) .cse27 .cse26) .cse28) (not (= .cse26 0))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_49| Int) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_42| Int)) (let ((.cse29 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_49|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_49| 0)) (= (select .cse29 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_42| 24)) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_49|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse29 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_49|)))))) (or (exists ((v_arrayElimArr_11 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_26| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (let ((.cse32 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse31 (select |c_#memory_$Pointer$#2.base| .cse32)) (.cse33 (+ |v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_26| 24))) (let ((.cse30 (select .cse31 .cse33))) (and (not (= .cse30 0)) (= .cse31 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse32 v_DerPreprocessor_3) .cse30 v_arrayElimArr_11) .cse32) .cse33 .cse30)) (not (= .cse30 .cse32))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_26| Int) (|v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_27| Int)) (let ((.cse34 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_27|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_27| (select .cse34 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (= |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_27| (select .cse34 (+ |v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_26| 24))) (not (= |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_27| 0)))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_50| Int) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_43| Int)) (let ((.cse35 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_50|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_50| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse35 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_50|)) (= (select .cse35 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_43| 24)) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_50|)))) (exists ((v_arrayElimArr_11 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_43| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (let ((.cse37 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse36 (select |c_#memory_$Pointer$#2.base| .cse37)) (.cse39 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_43| 24))) (let ((.cse38 (select .cse36 .cse39))) (and (= .cse36 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse37 v_DerPreprocessor_3) .cse38 v_arrayElimArr_11) .cse37) .cse39 .cse38)) (not (= 0 .cse38)) (not (= .cse37 .cse38)))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_51| Int) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_44| Int)) (let ((.cse40 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_51|))) (and (= (select .cse40 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_44| 24)) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_51|) (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_51| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse40 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_51|))))) (exists ((v_arrayElimArr_11 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_44| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (let ((.cse41 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse43 (select |c_#memory_$Pointer$#2.base| .cse41)) (.cse44 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_44| 24))) (let ((.cse42 (select .cse43 .cse44))) (and (not (= .cse41 .cse42)) (= .cse43 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse41 v_DerPreprocessor_3) .cse42 v_arrayElimArr_11) .cse41) .cse44 .cse42)) (not (= .cse42 0)))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_29| Int) (|v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_30| Int)) (let ((.cse45 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_30|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_30| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_30| (select .cse45 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (= |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_30| (select .cse45 (+ |v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_29| 24)))))) (exists ((v_arrayElimArr_11 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_29| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (let ((.cse47 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse48 (select |c_#memory_$Pointer$#2.base| .cse47)) (.cse49 (+ |v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_29| 24))) (let ((.cse46 (select .cse48 .cse49))) (and (not (= .cse46 0)) (not (= .cse46 .cse47)) (= .cse48 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse47 v_DerPreprocessor_3) .cse46 v_arrayElimArr_11) .cse47) .cse49 .cse46)))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_43| Int) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_51| Int)) (let ((.cse50 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_51|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse50 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_51|)) (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_51| 0)) (= (select .cse50 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_43| 24)) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_51|)))) (exists ((v_arrayElimArr_11 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_43| Int) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (let ((.cse52 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse51 (select |c_#memory_$Pointer$#2.base| .cse52)) (.cse54 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_43| 24))) (let ((.cse53 (select .cse51 .cse54))) (and (= .cse51 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse52 v_DerPreprocessor_3) .cse53 v_arrayElimArr_11) .cse52) .cse54 .cse53)) (not (= .cse53 .cse52)) (not (= .cse53 0))))))))) is different from true [2025-01-09 17:22:58,658 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((v_arrayElimArr_11 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_27| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (let ((.cse1 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse3 (select |c_#memory_$Pointer$#2.base| .cse1)) (.cse2 (+ |v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_27| 24))) (let ((.cse0 (select .cse3 .cse2))) (and (not (= .cse0 0)) (not (= .cse0 .cse1)) (= (store (select (store (store |c_#memory_$Pointer$#2.base| .cse1 v_DerPreprocessor_3) .cse0 v_arrayElimArr_11) .cse1) .cse2 .cse0) .cse3)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_28| Int) (|v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_27| Int)) (let ((.cse4 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_28|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse4 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_28|)) (= (select .cse4 (+ |v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_27| 24)) |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_28|) (not (= |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_28| 0)))))) (or (exists ((v_arrayElimArr_11 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_44| Int) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (let ((.cse6 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse7 (select |c_#memory_$Pointer$#2.base| .cse6)) (.cse8 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_44| 24))) (let ((.cse5 (select .cse7 .cse8))) (and (not (= .cse5 0)) (not (= .cse6 .cse5)) (= .cse7 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse6 v_DerPreprocessor_3) .cse5 v_arrayElimArr_11) .cse6) .cse8 .cse5))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_44| Int) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_52| Int)) (let ((.cse9 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_52|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_52| (select .cse9 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_52| 0)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_52| (select .cse9 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_44| 24))))))) (or (exists ((v_arrayElimArr_11 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_28| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (let ((.cse11 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse13 (select |c_#memory_$Pointer$#2.base| .cse11)) (.cse12 (+ |v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_28| 24))) (let ((.cse10 (select .cse13 .cse12))) (and (not (= .cse10 0)) (not (= .cse10 .cse11)) (= (store (select (store (store |c_#memory_$Pointer$#2.base| .cse11 v_DerPreprocessor_3) .cse10 v_arrayElimArr_11) .cse11) .cse12 .cse10) .cse13)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_28| Int) (|v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_29| Int)) (let ((.cse14 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_29|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_29| (select .cse14 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (not (= |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_29| 0)) (= |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_29| (select .cse14 (+ |v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_28| 24))))))) (or |c_aws_linked_list_is_valid_#t~short310#1| (= 0 (select (select |c_#memory_$Pointer$#2.base| |c_aws_linked_list_is_valid_#in~list#1.base|) (+ |c_aws_linked_list_is_valid_#in~list#1.offset| 24)))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_26| Int)) (let ((.cse15 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_26|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_26| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_26| (select .cse15 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (= |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_26| (select .cse15 (+ |v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_25| 24)))))) (exists ((v_arrayElimArr_11 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (let ((.cse18 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse17 (select |c_#memory_$Pointer$#2.base| .cse18)) (.cse19 (+ |v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_25| 24))) (let ((.cse16 (select .cse17 .cse19))) (and (not (= .cse16 0)) (= .cse17 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse18 v_DerPreprocessor_3) .cse16 v_arrayElimArr_11) .cse18) .cse19 .cse16)) (not (= .cse16 .cse18)))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_48| Int) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_41| Int)) (let ((.cse20 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_48|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_48| (select .cse20 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (= (select .cse20 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_41| 24)) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_48|) (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_48| 0))))) (exists ((v_arrayElimArr_11 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_41| Int)) (let ((.cse23 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse22 (select |c_#memory_$Pointer$#2.base| .cse23)) (.cse24 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_41| 24))) (let ((.cse21 (select .cse22 .cse24))) (and (not (= .cse21 0)) (= .cse22 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse23 v_DerPreprocessor_3) .cse21 v_arrayElimArr_11) .cse23) .cse24 .cse21)) (not (= .cse21 .cse23)))))))) (or (exists ((v_arrayElimArr_11 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_42| Int)) (let ((.cse25 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse28 (select |c_#memory_$Pointer$#2.base| .cse25)) (.cse27 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_42| 24))) (let ((.cse26 (select .cse28 .cse27))) (and (not (= .cse25 .cse26)) (= (store (select (store (store |c_#memory_$Pointer$#2.base| .cse25 v_DerPreprocessor_3) .cse26 v_arrayElimArr_11) .cse25) .cse27 .cse26) .cse28) (not (= .cse26 0))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_49| Int) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_42| Int)) (let ((.cse29 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_49|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_49| 0)) (= (select .cse29 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_42| 24)) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_49|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse29 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_49|)))))) (or (exists ((v_arrayElimArr_11 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_26| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (let ((.cse32 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse31 (select |c_#memory_$Pointer$#2.base| .cse32)) (.cse33 (+ |v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_26| 24))) (let ((.cse30 (select .cse31 .cse33))) (and (not (= .cse30 0)) (= .cse31 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse32 v_DerPreprocessor_3) .cse30 v_arrayElimArr_11) .cse32) .cse33 .cse30)) (not (= .cse30 .cse32))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_26| Int) (|v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_27| Int)) (let ((.cse34 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_27|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_27| (select .cse34 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (= |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_27| (select .cse34 (+ |v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_26| 24))) (not (= |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_27| 0)))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_50| Int) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_43| Int)) (let ((.cse35 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_50|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_50| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse35 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_50|)) (= (select .cse35 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_43| 24)) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_50|)))) (exists ((v_arrayElimArr_11 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_43| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (let ((.cse37 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse36 (select |c_#memory_$Pointer$#2.base| .cse37)) (.cse39 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_43| 24))) (let ((.cse38 (select .cse36 .cse39))) (and (= .cse36 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse37 v_DerPreprocessor_3) .cse38 v_arrayElimArr_11) .cse37) .cse39 .cse38)) (not (= 0 .cse38)) (not (= .cse37 .cse38)))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_51| Int) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_44| Int)) (let ((.cse40 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_51|))) (and (= (select .cse40 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_44| 24)) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_51|) (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_51| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse40 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_51|))))) (exists ((v_arrayElimArr_11 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_44| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (let ((.cse41 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse43 (select |c_#memory_$Pointer$#2.base| .cse41)) (.cse44 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.offset_BEFORE_CALL_44| 24))) (let ((.cse42 (select .cse43 .cse44))) (and (not (= .cse41 .cse42)) (= .cse43 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse41 v_DerPreprocessor_3) .cse42 v_arrayElimArr_11) .cse41) .cse44 .cse42)) (not (= .cse42 0)))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_29| Int) (|v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_30| Int)) (let ((.cse45 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_30|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_30| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_30| (select .cse45 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (= |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_30| (select .cse45 (+ |v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_29| 24)))))) (exists ((v_arrayElimArr_11 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_29| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (let ((.cse47 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse48 (select |c_#memory_$Pointer$#2.base| .cse47)) (.cse49 (+ |v_ULTIMATE.start_aws_linked_list_back_~list#1.offset_BEFORE_CALL_29| 24))) (let ((.cse46 (select .cse48 .cse49))) (and (not (= .cse46 0)) (not (= .cse46 .cse47)) (= .cse48 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse47 v_DerPreprocessor_3) .cse46 v_arrayElimArr_11) .cse47) .cse49 .cse46)))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_43| Int) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_51| Int)) (let ((.cse50 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_51|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (= (select .cse50 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_51|)) (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_51| 0)) (= (select .cse50 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_43| 24)) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_51|)))) (exists ((v_arrayElimArr_11 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_43| Int) (v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29| Int)) (let ((.cse52 (select v_arrayElimArr_11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_29|))) (let ((.cse51 (select |c_#memory_$Pointer$#2.base| .cse52)) (.cse54 (+ |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset_BEFORE_CALL_43| 24))) (let ((.cse53 (select .cse51 .cse54))) (and (= .cse51 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse52 v_DerPreprocessor_3) .cse53 v_arrayElimArr_11) .cse52) .cse54 .cse53)) (not (= .cse53 .cse52)) (not (= .cse53 0))))))))) is different from true [2025-01-09 17:22:59,342 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 32 proven. 1 refuted. 0 times theorem prover too weak. 28 trivial. 214 not checked. [2025-01-09 17:22:59,342 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 17:22:59,745 INFO L349 Elim1Store]: treesize reduction 19, result has 62.0 percent of original size [2025-01-09 17:22:59,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 94 treesize of output 103 [2025-01-09 17:22:59,757 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 17:22:59,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 103 treesize of output 119 [2025-01-09 17:22:59,761 INFO L378 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 68 treesize of output 64 [2025-01-09 17:22:59,816 INFO L378 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 [2025-01-09 17:22:59,850 INFO L378 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 [2025-01-09 17:22:59,856 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 17:22:59,856 INFO L378 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 19 treesize of output 23 [2025-01-09 17:22:59,863 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 17:22:59,863 INFO L378 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 33 treesize of output 37 [2025-01-09 17:22:59,886 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 254 trivial. 0 not checked. [2025-01-09 17:22:59,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1069142760] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 17:22:59,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 17:22:59,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [8, 33] total 46 [2025-01-09 17:22:59,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338224859] [2025-01-09 17:22:59,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:22:59,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 17:22:59,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:22:59,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 17:22:59,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=390, Unknown=67, NotChecked=1512, Total=2070 [2025-01-09 17:22:59,888 INFO L87 Difference]: Start difference. First operand 357 states and 481 transitions. Second operand has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 6 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 6 states have call predecessors, (15), 5 states have call successors, (15) [2025-01-09 17:23:00,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:23:00,285 INFO L93 Difference]: Finished difference Result 616 states and 821 transitions. [2025-01-09 17:23:00,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 17:23:00,285 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 6 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 6 states have call predecessors, (15), 5 states have call successors, (15) Word has length 169 [2025-01-09 17:23:00,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:23:00,288 INFO L225 Difference]: With dead ends: 616 [2025-01-09 17:23:00,288 INFO L226 Difference]: Without dead ends: 387 [2025-01-09 17:23:00,289 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 300 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 24 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=123, Invalid=550, Unknown=73, NotChecked=1704, Total=2450 [2025-01-09 17:23:00,290 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 30 mSDsluCounter, 754 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 912 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 17:23:00,290 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 912 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 17:23:00,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2025-01-09 17:23:00,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 365. [2025-01-09 17:23:00,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 267 states have (on average 1.2921348314606742) internal successors, (345), 273 states have internal predecessors, (345), 69 states have call successors, (69), 24 states have call predecessors, (69), 28 states have return successors, (75), 67 states have call predecessors, (75), 67 states have call successors, (75) [2025-01-09 17:23:00,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 489 transitions. [2025-01-09 17:23:00,332 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 489 transitions. Word has length 169 [2025-01-09 17:23:00,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:23:00,332 INFO L471 AbstractCegarLoop]: Abstraction has 365 states and 489 transitions. [2025-01-09 17:23:00,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 6 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 6 states have call predecessors, (15), 5 states have call successors, (15) [2025-01-09 17:23:00,332 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 489 transitions. [2025-01-09 17:23:00,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-01-09 17:23:00,334 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:23:00,334 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 17:23:00,343 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-01-09 17:23:00,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-01-09 17:23:00,535 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:23:00,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:23:00,535 INFO L85 PathProgramCache]: Analyzing trace with hash 1568633061, now seen corresponding path program 1 times [2025-01-09 17:23:00,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:23:00,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711553723] [2025-01-09 17:23:00,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:23:00,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:23:00,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-01-09 17:23:00,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-01-09 17:23:00,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:23:00,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:23:00,821 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 9 proven. 23 refuted. 0 times theorem prover too weak. 243 trivial. 0 not checked. [2025-01-09 17:23:00,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:23:00,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711553723] [2025-01-09 17:23:00,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711553723] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 17:23:00,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [16053623] [2025-01-09 17:23:00,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:23:00,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 17:23:00,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 17:23:00,824 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 17:23:00,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-01-09 17:23:00,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-01-09 17:23:01,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-01-09 17:23:01,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:23:01,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:23:01,064 INFO L256 TraceCheckSpWp]: Trace formula consists of 693 conjuncts, 103 conjuncts are in the unsatisfiable core [2025-01-09 17:23:01,079 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 17:23:01,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-01-09 17:23:01,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-01-09 17:23:02,915 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 175 proven. 34 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-01-09 17:23:02,915 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 17:23:04,376 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 23 proven. 65 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2025-01-09 17:23:04,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [16053623] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 17:23:04,377 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 17:23:04,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 23, 19] total 45 [2025-01-09 17:23:04,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660542135] [2025-01-09 17:23:04,377 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 17:23:04,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-01-09 17:23:04,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:23:04,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-01-09 17:23:04,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=1822, Unknown=0, NotChecked=0, Total=1980 [2025-01-09 17:23:04,378 INFO L87 Difference]: Start difference. First operand 365 states and 489 transitions. Second operand has 45 states, 43 states have (on average 4.255813953488372) internal successors, (183), 42 states have internal predecessors, (183), 17 states have call successors, (40), 3 states have call predecessors, (40), 9 states have return successors, (41), 16 states have call predecessors, (41), 17 states have call successors, (41) [2025-01-09 17:23:21,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:23:21,243 INFO L93 Difference]: Finished difference Result 1069 states and 1481 transitions. [2025-01-09 17:23:21,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2025-01-09 17:23:21,244 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 43 states have (on average 4.255813953488372) internal successors, (183), 42 states have internal predecessors, (183), 17 states have call successors, (40), 3 states have call predecessors, (40), 9 states have return successors, (41), 16 states have call predecessors, (41), 17 states have call successors, (41) Word has length 169 [2025-01-09 17:23:21,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:23:21,246 INFO L225 Difference]: With dead ends: 1069 [2025-01-09 17:23:21,246 INFO L226 Difference]: Without dead ends: 649 [2025-01-09 17:23:21,248 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 328 SyntacticMatches, 2 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1543 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=738, Invalid=6744, Unknown=0, NotChecked=0, Total=7482 [2025-01-09 17:23:21,249 INFO L435 NwaCegarLoop]: 221 mSDtfsCounter, 371 mSDsluCounter, 5172 mSDsCounter, 0 mSdLazyCounter, 3741 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 5393 SdHoareTripleChecker+Invalid, 3878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 3741 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.1s IncrementalHoareTripleChecker+Time [2025-01-09 17:23:21,249 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [375 Valid, 5393 Invalid, 3878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 3741 Invalid, 0 Unknown, 0 Unchecked, 15.1s Time] [2025-01-09 17:23:21,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2025-01-09 17:23:21,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 481. [2025-01-09 17:23:21,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 356 states have (on average 1.3146067415730338) internal successors, (468), 366 states have internal predecessors, (468), 84 states have call successors, (84), 28 states have call predecessors, (84), 40 states have return successors, (114), 86 states have call predecessors, (114), 80 states have call successors, (114) [2025-01-09 17:23:21,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 666 transitions. [2025-01-09 17:23:21,293 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 666 transitions. Word has length 169 [2025-01-09 17:23:21,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:23:21,294 INFO L471 AbstractCegarLoop]: Abstraction has 481 states and 666 transitions. [2025-01-09 17:23:21,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 43 states have (on average 4.255813953488372) internal successors, (183), 42 states have internal predecessors, (183), 17 states have call successors, (40), 3 states have call predecessors, (40), 9 states have return successors, (41), 16 states have call predecessors, (41), 17 states have call successors, (41) [2025-01-09 17:23:21,294 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 666 transitions. [2025-01-09 17:23:21,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-01-09 17:23:21,295 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:23:21,295 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 17:23:21,303 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-01-09 17:23:21,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-01-09 17:23:21,496 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:23:21,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:23:21,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1001901462, now seen corresponding path program 1 times [2025-01-09 17:23:21,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:23:21,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212179147] [2025-01-09 17:23:21,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:23:21,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:23:21,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-01-09 17:23:21,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-01-09 17:23:21,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:23:21,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:23:22,085 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 49 proven. 3 refuted. 0 times theorem prover too weak. 228 trivial. 0 not checked. [2025-01-09 17:23:22,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:23:22,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212179147] [2025-01-09 17:23:22,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212179147] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 17:23:22,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [836530298] [2025-01-09 17:23:22,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:23:22,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 17:23:22,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 17:23:22,087 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 17:23:22,088 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-01-09 17:23:22,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-01-09 17:23:22,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-01-09 17:23:22,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:23:22,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:23:22,348 INFO L256 TraceCheckSpWp]: Trace formula consists of 696 conjuncts, 54 conjuncts are in the unsatisfiable core [2025-01-09 17:23:22,351 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 17:23:22,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-01-09 17:23:22,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-01-09 17:23:22,801 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 169 proven. 2 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2025-01-09 17:23:22,801 INFO L312 TraceCheckSpWp]: Computing backward predicates...