./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_linked_list_rbegin_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/aws-c-common/aws_linked_list_rbegin_harness.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 7aeda8ef841ef7069da39f878404252c33796f5e53e1f416b530364b2ef30242 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 18:10:51,603 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 18:10:51,655 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-08 18:10:51,662 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 18:10:51,662 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 18:10:51,679 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 18:10:51,680 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 18:10:51,680 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 18:10:51,680 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 18:10:51,680 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 18:10:51,681 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 18:10:51,681 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 18:10:51,682 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 18:10:51,682 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 18:10:51,682 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 18:10:51,682 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 18:10:51,682 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 18:10:51,683 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 18:10:51,683 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 18:10:51,683 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 18:10:51,683 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 18:10:51,683 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 18:10:51,683 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 18:10:51,683 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 18:10:51,683 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 18:10:51,683 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 18:10:51,683 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 18:10:51,683 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 18:10:51,683 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 18:10:51,683 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 18:10:51,683 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 18:10:51,683 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 18:10:51,683 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 18:10:51,683 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 18:10:51,683 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 18:10:51,684 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 18:10:51,684 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 18:10:51,684 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 18:10:51,684 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 18:10:51,684 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 18:10:51,684 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/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 -> 7aeda8ef841ef7069da39f878404252c33796f5e53e1f416b530364b2ef30242 [2025-03-08 18:10:51,906 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 18:10:51,914 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 18:10:51,916 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 18:10:51,917 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 18:10:51,917 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 18:10:51,919 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_linked_list_rbegin_harness.i [2025-03-08 18:10:53,115 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b29d41ea9/2a2622a8f4df40aa9009443d91c3857a/FLAG764c5d99b [2025-03-08 18:10:53,509 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 18:10:53,510 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_rbegin_harness.i [2025-03-08 18:10:53,531 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b29d41ea9/2a2622a8f4df40aa9009443d91c3857a/FLAG764c5d99b [2025-03-08 18:10:53,684 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b29d41ea9/2a2622a8f4df40aa9009443d91c3857a [2025-03-08 18:10:53,687 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 18:10:53,688 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 18:10:53,689 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 18:10:53,689 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 18:10:53,692 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 18:10:53,692 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:10:53" (1/1) ... [2025-03-08 18:10:53,693 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@747debb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:10:53, skipping insertion in model container [2025-03-08 18:10:53,693 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:10:53" (1/1) ... [2025-03-08 18:10:53,746 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 18:10:53,937 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_rbegin_harness.i[4496,4509] [2025-03-08 18:10:53,943 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_rbegin_harness.i[4556,4569] [2025-03-08 18:10:54,398 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:10:54,402 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:10:54,402 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:10:54,403 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:10:54,407 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:10:54,415 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:10:54,416 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:10:54,417 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:10:54,417 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:10:54,418 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:10:54,419 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:10:54,419 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:10:54,419 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:10:54,703 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_rbegin_harness.i[150476,150489] [2025-03-08 18:10:54,704 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 18:10:54,717 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 18:10:54,729 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_rbegin_harness.i[4496,4509] [2025-03-08 18:10:54,729 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_rbegin_harness.i[4556,4569] [2025-03-08 18:10:54,762 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:10:54,762 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:10:54,762 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:10:54,762 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:10:54,763 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:10:54,768 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:10:54,769 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:10:54,769 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:10:54,769 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:10:54,770 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:10:54,771 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:10:54,771 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:10:54,771 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:10:54,845 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_rbegin_harness.i[150476,150489] [2025-03-08 18:10:54,846 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 18:10:55,017 INFO L204 MainTranslator]: Completed translation [2025-03-08 18:10:55,018 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:10:55 WrapperNode [2025-03-08 18:10:55,019 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 18:10:55,020 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 18:10:55,020 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 18:10:55,020 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 18:10:55,025 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:10:55" (1/1) ... [2025-03-08 18:10:55,060 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:10:55" (1/1) ... [2025-03-08 18:10:55,084 INFO L138 Inliner]: procedures = 668, calls = 1039, calls flagged for inlining = 53, calls inlined = 6, statements flattened = 137 [2025-03-08 18:10:55,085 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 18:10:55,085 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 18:10:55,085 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 18:10:55,085 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 18:10:55,091 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:10:55" (1/1) ... [2025-03-08 18:10:55,091 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:10:55" (1/1) ... [2025-03-08 18:10:55,094 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:10:55" (1/1) ... [2025-03-08 18:10:55,117 INFO L175 MemorySlicer]: Split 24 memory accesses to 3 slices as follows [2, 5, 17]. 71 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5, 0]. The 6 writes are split as follows [0, 0, 6]. [2025-03-08 18:10:55,118 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:10:55" (1/1) ... [2025-03-08 18:10:55,118 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:10:55" (1/1) ... [2025-03-08 18:10:55,131 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:10:55" (1/1) ... [2025-03-08 18:10:55,132 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:10:55" (1/1) ... [2025-03-08 18:10:55,137 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:10:55" (1/1) ... [2025-03-08 18:10:55,138 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:10:55" (1/1) ... [2025-03-08 18:10:55,144 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 18:10:55,145 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 18:10:55,146 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 18:10:55,146 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 18:10:55,147 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:10:55" (1/1) ... [2025-03-08 18:10:55,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 18:10:55,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 18:10:55,176 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 18:10:55,179 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 18:10:55,197 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 18:10:55,198 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-08 18:10:55,198 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-08 18:10:55,198 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2025-03-08 18:10:55,198 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2025-03-08 18:10:55,198 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 18:10:55,198 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_is_valid [2025-03-08 18:10:55,198 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_is_valid [2025-03-08 18:10:55,199 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 18:10:55,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-08 18:10:55,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-08 18:10:55,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-08 18:10:55,200 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 18:10:55,200 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 18:10:55,200 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 18:10:55,200 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 18:10:55,200 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 18:10:55,200 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-08 18:10:55,200 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-08 18:10:55,200 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-08 18:10:55,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-08 18:10:55,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-08 18:10:55,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-08 18:10:55,200 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2025-03-08 18:10:55,200 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2025-03-08 18:10:55,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 18:10:55,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 18:10:55,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 18:10:55,357 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 18:10:55,358 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 18:10:55,394 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4718: havoc #t~mem312.base, #t~mem312.offset;havoc #t~short313;havoc #t~mem314.base, #t~mem314.offset;havoc #t~mem315.base, #t~mem315.offset;havoc #t~short316; [2025-03-08 18:10:55,400 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L266: havoc #t~nondet9; [2025-03-08 18:10:55,529 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4700: havoc #t~ret311#1; [2025-03-08 18:10:55,542 INFO L? ?]: Removed 55 outVars from TransFormulas that were not future-live. [2025-03-08 18:10:55,542 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 18:10:55,549 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 18:10:55,549 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 18:10:55,550 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:10:55 BoogieIcfgContainer [2025-03-08 18:10:55,550 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 18:10:55,554 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 18:10:55,554 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 18:10:55,558 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 18:10:55,558 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 06:10:53" (1/3) ... [2025-03-08 18:10:55,558 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73e3bf18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:10:55, skipping insertion in model container [2025-03-08 18:10:55,558 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:10:55" (2/3) ... [2025-03-08 18:10:55,558 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73e3bf18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:10:55, skipping insertion in model container [2025-03-08 18:10:55,559 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:10:55" (3/3) ... [2025-03-08 18:10:55,560 INFO L128 eAbstractionObserver]: Analyzing ICFG aws_linked_list_rbegin_harness.i [2025-03-08 18:10:55,572 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 18:10:55,573 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG aws_linked_list_rbegin_harness.i that has 6 procedures, 68 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-08 18:10:55,615 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 18:10:55,624 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;@eefd53a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 18:10:55,626 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 18:10:55,629 INFO L276 IsEmpty]: Start isEmpty. Operand has 68 states, 48 states have (on average 1.3125) internal successors, (63), 49 states have internal predecessors, (63), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-08 18:10:55,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-08 18:10:55,637 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:10:55,638 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 18:10:55,638 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:10:55,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:10:55,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1751692032, now seen corresponding path program 1 times [2025-03-08 18:10:55,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:10:55,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247621465] [2025-03-08 18:10:55,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:10:55,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:10:55,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-08 18:10:55,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-08 18:10:55,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:10:55,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:10:55,924 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-03-08 18:10:55,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:10:55,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247621465] [2025-03-08 18:10:55,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247621465] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 18:10:55,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1826422566] [2025-03-08 18:10:55,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:10:55,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:10:55,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 18:10:55,927 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 18:10:55,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 18:10:56,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-08 18:10:56,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-08 18:10:56,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:10:56,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:10:56,088 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 18:10:56,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 18:10:56,100 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-03-08 18:10:56,100 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 18:10:56,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1826422566] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:10:56,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 18:10:56,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 18:10:56,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332733560] [2025-03-08 18:10:56,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:10:56,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 18:10:56,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:10:56,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 18:10:56,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 18:10:56,119 INFO L87 Difference]: Start difference. First operand has 68 states, 48 states have (on average 1.3125) internal successors, (63), 49 states have internal predecessors, (63), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 18:10:56,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:10:56,139 INFO L93 Difference]: Finished difference Result 128 states and 176 transitions. [2025-03-08 18:10:56,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 18:10:56,140 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 70 [2025-03-08 18:10:56,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:10:56,144 INFO L225 Difference]: With dead ends: 128 [2025-03-08 18:10:56,144 INFO L226 Difference]: Without dead ends: 63 [2025-03-08 18:10:56,146 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 71 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-03-08 18:10:56,148 INFO L435 NwaCegarLoop]: 87 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, 87 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-03-08 18:10:56,149 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 18:10:56,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-03-08 18:10:56,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2025-03-08 18:10:56,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 45 states have internal predecessors, (57), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-08 18:10:56,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 82 transitions. [2025-03-08 18:10:56,171 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 82 transitions. Word has length 70 [2025-03-08 18:10:56,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:10:56,171 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 82 transitions. [2025-03-08 18:10:56,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 18:10:56,171 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 82 transitions. [2025-03-08 18:10:56,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-08 18:10:56,173 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:10:56,173 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 18:10:56,181 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 18:10:56,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 18:10:56,378 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:10:56,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:10:56,379 INFO L85 PathProgramCache]: Analyzing trace with hash -2037040671, now seen corresponding path program 1 times [2025-03-08 18:10:56,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:10:56,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745907009] [2025-03-08 18:10:56,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:10:56,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:10:56,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-08 18:10:56,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-08 18:10:56,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:10:56,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:10:56,915 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-03-08 18:10:56,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:10:56,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745907009] [2025-03-08 18:10:56,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745907009] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 18:10:56,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1963614933] [2025-03-08 18:10:56,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:10:56,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:10:56,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 18:10:56,918 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 18:10:56,919 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 18:10:57,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-08 18:10:57,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-08 18:10:57,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:10:57,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:10:57,080 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-03-08 18:10:57,086 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 18:10:57,191 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 18 treesize of output 7 [2025-03-08 18:10:57,198 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 14 treesize of output 15 [2025-03-08 18:10:57,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:10:57,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:10:57,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2025-03-08 18:10:57,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:10:57,278 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:10:57,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:10:57,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 32 [2025-03-08 18:10:58,576 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-08 18:10:58,577 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 18:10:58,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1963614933] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:10:58,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 18:10:58,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2025-03-08 18:10:58,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810335285] [2025-03-08 18:10:58,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:10:58,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 18:10:58,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:10:58,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 18:10:58,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-03-08 18:10:58,580 INFO L87 Difference]: Start difference. First operand 63 states and 82 transitions. Second operand has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-08 18:10:59,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:10:59,002 INFO L93 Difference]: Finished difference Result 174 states and 234 transitions. [2025-03-08 18:10:59,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 18:10:59,003 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 70 [2025-03-08 18:10:59,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:10:59,005 INFO L225 Difference]: With dead ends: 174 [2025-03-08 18:10:59,005 INFO L226 Difference]: Without dead ends: 120 [2025-03-08 18:10:59,005 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 55 SyntacticMatches, 8 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2025-03-08 18:10:59,006 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 59 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 18:10:59,006 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 350 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 18:10:59,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-03-08 18:10:59,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 116. [2025-03-08 18:10:59,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 82 states have (on average 1.3170731707317074) internal successors, (108), 84 states have internal predecessors, (108), 24 states have call successors, (24), 9 states have call predecessors, (24), 9 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-08 18:10:59,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 154 transitions. [2025-03-08 18:10:59,021 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 154 transitions. Word has length 70 [2025-03-08 18:10:59,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:10:59,021 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 154 transitions. [2025-03-08 18:10:59,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-08 18:10:59,021 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 154 transitions. [2025-03-08 18:10:59,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-08 18:10:59,023 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:10:59,023 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 18:10:59,030 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 18:10:59,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-08 18:10:59,224 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:10:59,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:10:59,226 INFO L85 PathProgramCache]: Analyzing trace with hash -2128292222, now seen corresponding path program 1 times [2025-03-08 18:10:59,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:10:59,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427707747] [2025-03-08 18:10:59,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:10:59,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:10:59,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-08 18:10:59,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-08 18:10:59,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:10:59,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:10:59,493 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-03-08 18:10:59,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:10:59,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427707747] [2025-03-08 18:10:59,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427707747] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 18:10:59,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [563388985] [2025-03-08 18:10:59,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:10:59,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:10:59,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 18:10:59,496 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 18:10:59,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 18:10:59,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-08 18:10:59,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-08 18:10:59,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:10:59,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:10:59,613 INFO L256 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-08 18:10:59,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 18:10:59,699 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2025-03-08 18:10:59,700 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 22 treesize of output 13 [2025-03-08 18:10:59,708 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 26 treesize of output 34 [2025-03-08 18:10:59,713 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-03-08 18:11:00,306 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-08 18:11:00,307 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 18:11:00,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [563388985] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:11:00,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 18:11:00,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [6] total 16 [2025-03-08 18:11:00,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366873365] [2025-03-08 18:11:00,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:11:00,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 18:11:00,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:11:00,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 18:11:00,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2025-03-08 18:11:00,308 INFO L87 Difference]: Start difference. First operand 116 states and 154 transitions. Second operand has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 12 states have internal predecessors, (41), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-08 18:11:04,317 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 18:11:08,365 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 18:11:12,435 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 18:11:16,451 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 18:11:20,458 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 18:11:20,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:11:20,978 INFO L93 Difference]: Finished difference Result 187 states and 256 transitions. [2025-03-08 18:11:20,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 18:11:20,978 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 12 states have internal predecessors, (41), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 70 [2025-03-08 18:11:20,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:11:20,979 INFO L225 Difference]: With dead ends: 187 [2025-03-08 18:11:20,979 INFO L226 Difference]: Without dead ends: 122 [2025-03-08 18:11:20,980 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 54 SyntacticMatches, 8 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=109, Invalid=541, Unknown=0, NotChecked=0, Total=650 [2025-03-08 18:11:20,980 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 208 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 56 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.5s IncrementalHoareTripleChecker+Time [2025-03-08 18:11:20,980 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 500 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 308 Invalid, 5 Unknown, 0 Unchecked, 20.5s Time] [2025-03-08 18:11:20,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-03-08 18:11:20,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 118. [2025-03-08 18:11:20,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 84 states have (on average 1.3095238095238095) internal successors, (110), 86 states have internal predecessors, (110), 24 states have call successors, (24), 9 states have call predecessors, (24), 9 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-08 18:11:20,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 156 transitions. [2025-03-08 18:11:20,991 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 156 transitions. Word has length 70 [2025-03-08 18:11:20,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:11:20,991 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 156 transitions. [2025-03-08 18:11:20,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 12 states have internal predecessors, (41), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-08 18:11:20,992 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 156 transitions. [2025-03-08 18:11:20,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-08 18:11:20,993 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:11:20,993 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 18:11:21,000 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 18:11:21,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:11:21,194 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:11:21,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:11:21,194 INFO L85 PathProgramCache]: Analyzing trace with hash 373280483, now seen corresponding path program 1 times [2025-03-08 18:11:21,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:11:21,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743281641] [2025-03-08 18:11:21,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:11:21,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:11:21,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-08 18:11:21,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-08 18:11:21,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:11:21,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:11:21,408 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-03-08 18:11:21,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:11:21,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743281641] [2025-03-08 18:11:21,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743281641] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 18:11:21,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [45572924] [2025-03-08 18:11:21,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:11:21,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:11:21,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 18:11:21,411 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 18:11:21,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 18:11:21,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-08 18:11:21,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-08 18:11:21,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:11:21,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:11:21,519 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-03-08 18:11:21,522 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 18:11:21,556 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 24 treesize of output 9 [2025-03-08 18:11:21,566 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 18 treesize of output 19 [2025-03-08 18:11:21,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:11:21,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:11:21,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:11:21,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 25 [2025-03-08 18:11:21,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:11:21,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:11:21,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 26 [2025-03-08 18:11:22,711 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-08 18:11:22,712 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 18:11:22,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [45572924] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:11:22,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 18:11:22,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [6] total 15 [2025-03-08 18:11:22,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849060026] [2025-03-08 18:11:22,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:11:22,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 18:11:22,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:11:22,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 18:11:22,713 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2025-03-08 18:11:22,713 INFO L87 Difference]: Start difference. First operand 118 states and 156 transitions. Second operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-08 18:11:23,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:11:23,453 INFO L93 Difference]: Finished difference Result 194 states and 264 transitions. [2025-03-08 18:11:23,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 18:11:23,454 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 70 [2025-03-08 18:11:23,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:11:23,455 INFO L225 Difference]: With dead ends: 194 [2025-03-08 18:11:23,455 INFO L226 Difference]: Without dead ends: 124 [2025-03-08 18:11:23,456 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 54 SyntacticMatches, 8 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2025-03-08 18:11:23,456 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 66 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 18:11:23,457 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 535 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 18:11:23,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2025-03-08 18:11:23,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 120. [2025-03-08 18:11:23,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 86 states have (on average 1.302325581395349) internal successors, (112), 88 states have internal predecessors, (112), 24 states have call successors, (24), 9 states have call predecessors, (24), 9 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-08 18:11:23,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 158 transitions. [2025-03-08 18:11:23,476 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 158 transitions. Word has length 70 [2025-03-08 18:11:23,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:11:23,476 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 158 transitions. [2025-03-08 18:11:23,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-08 18:11:23,476 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 158 transitions. [2025-03-08 18:11:23,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-08 18:11:23,477 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:11:23,478 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 18:11:23,484 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 18:11:23,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:11:23,678 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:11:23,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:11:23,679 INFO L85 PathProgramCache]: Analyzing trace with hash -797035772, now seen corresponding path program 1 times [2025-03-08 18:11:23,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:11:23,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879579330] [2025-03-08 18:11:23,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:11:23,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:11:23,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-08 18:11:23,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-08 18:11:23,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:11:23,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:11:24,068 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-08 18:11:24,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:11:24,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879579330] [2025-03-08 18:11:24,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879579330] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 18:11:24,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [534365871] [2025-03-08 18:11:24,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:11:24,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:11:24,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 18:11:24,071 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 18:11:24,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 18:11:24,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-08 18:11:24,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-08 18:11:24,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:11:24,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:11:24,186 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-08 18:11:24,189 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 18:11:24,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:11:24,272 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 7 [2025-03-08 18:11:24,804 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-08 18:11:24,805 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 18:11:24,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [534365871] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:11:24,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 18:11:24,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [9] total 18 [2025-03-08 18:11:24,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36498411] [2025-03-08 18:11:24,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:11:24,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 18:11:24,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:11:24,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 18:11:24,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2025-03-08 18:11:24,806 INFO L87 Difference]: Start difference. First operand 120 states and 158 transitions. Second operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-08 18:11:25,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:11:25,178 INFO L93 Difference]: Finished difference Result 202 states and 273 transitions. [2025-03-08 18:11:25,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 18:11:25,179 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 70 [2025-03-08 18:11:25,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:11:25,180 INFO L225 Difference]: With dead ends: 202 [2025-03-08 18:11:25,180 INFO L226 Difference]: Without dead ends: 126 [2025-03-08 18:11:25,181 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 54 SyntacticMatches, 8 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2025-03-08 18:11:25,182 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 95 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 18:11:25,182 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 398 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 18:11:25,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2025-03-08 18:11:25,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 122. [2025-03-08 18:11:25,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 88 states have (on average 1.2954545454545454) internal successors, (114), 90 states have internal predecessors, (114), 24 states have call successors, (24), 9 states have call predecessors, (24), 9 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-08 18:11:25,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 160 transitions. [2025-03-08 18:11:25,204 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 160 transitions. Word has length 70 [2025-03-08 18:11:25,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:11:25,204 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 160 transitions. [2025-03-08 18:11:25,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-08 18:11:25,204 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 160 transitions. [2025-03-08 18:11:25,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-08 18:11:25,209 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:11:25,210 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 18:11:25,216 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-08 18:11:25,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:11:25,414 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:11:25,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:11:25,414 INFO L85 PathProgramCache]: Analyzing trace with hash -189525275, now seen corresponding path program 1 times [2025-03-08 18:11:25,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:11:25,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601815300] [2025-03-08 18:11:25,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:11:25,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:11:25,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-08 18:11:25,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-08 18:11:25,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:11:25,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:11:25,515 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-08 18:11:25,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:11:25,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601815300] [2025-03-08 18:11:25,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601815300] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 18:11:25,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [380572876] [2025-03-08 18:11:25,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:11:25,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:11:25,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 18:11:25,518 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 18:11:25,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 18:11:25,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-08 18:11:25,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-08 18:11:25,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:11:25,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:11:25,635 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 18:11:25,636 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 18:11:25,695 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-08 18:11:25,695 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 18:11:25,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [380572876] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:11:25,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 18:11:25,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 9 [2025-03-08 18:11:25,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199000139] [2025-03-08 18:11:25,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:11:25,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 18:11:25,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:11:25,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 18:11:25,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-08 18:11:25,696 INFO L87 Difference]: Start difference. First operand 122 states and 160 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 18:11:25,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:11:25,814 INFO L93 Difference]: Finished difference Result 260 states and 351 transitions. [2025-03-08 18:11:25,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 18:11:25,814 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 70 [2025-03-08 18:11:25,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:11:25,816 INFO L225 Difference]: With dead ends: 260 [2025-03-08 18:11:25,818 INFO L226 Difference]: Without dead ends: 153 [2025-03-08 18:11:25,819 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-03-08 18:11:25,819 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 96 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 18:11:25,819 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 277 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 18:11:25,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2025-03-08 18:11:25,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2025-03-08 18:11:25,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 115 states have (on average 1.3304347826086957) internal successors, (153), 119 states have internal predecessors, (153), 26 states have call successors, (26), 9 states have call predecessors, (26), 11 states have return successors, (28), 24 states have call predecessors, (28), 24 states have call successors, (28) [2025-03-08 18:11:25,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 207 transitions. [2025-03-08 18:11:25,844 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 207 transitions. Word has length 70 [2025-03-08 18:11:25,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:11:25,844 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 207 transitions. [2025-03-08 18:11:25,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 18:11:25,844 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 207 transitions. [2025-03-08 18:11:25,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-08 18:11:25,845 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:11:25,845 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 18:11:25,853 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-08 18:11:26,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:11:26,046 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:11:26,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:11:26,047 INFO L85 PathProgramCache]: Analyzing trace with hash -1002041002, now seen corresponding path program 1 times [2025-03-08 18:11:26,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:11:26,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321946365] [2025-03-08 18:11:26,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:11:26,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:11:26,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-08 18:11:26,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-08 18:11:26,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:11:26,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:11:26,170 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-08 18:11:26,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:11:26,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321946365] [2025-03-08 18:11:26,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321946365] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 18:11:26,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [276381357] [2025-03-08 18:11:26,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:11:26,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:11:26,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 18:11:26,173 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 18:11:26,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-08 18:11:26,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-08 18:11:26,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-08 18:11:26,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:11:26,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:11:26,296 INFO L256 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 18:11:26,297 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 18:11:26,352 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-08 18:11:26,352 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 18:11:26,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [276381357] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:11:26,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 18:11:26,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 11 [2025-03-08 18:11:26,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569406524] [2025-03-08 18:11:26,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:11:26,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 18:11:26,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:11:26,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 18:11:26,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-08 18:11:26,353 INFO L87 Difference]: Start difference. First operand 153 states and 207 transitions. Second operand has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 18:11:26,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:11:26,507 INFO L93 Difference]: Finished difference Result 317 states and 433 transitions. [2025-03-08 18:11:26,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 18:11:26,507 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 71 [2025-03-08 18:11:26,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:11:26,509 INFO L225 Difference]: With dead ends: 317 [2025-03-08 18:11:26,509 INFO L226 Difference]: Without dead ends: 179 [2025-03-08 18:11:26,510 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2025-03-08 18:11:26,510 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 94 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 18:11:26,510 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 254 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 18:11:26,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2025-03-08 18:11:26,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 153. [2025-03-08 18:11:26,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 115 states have (on average 1.3304347826086957) internal successors, (153), 119 states have internal predecessors, (153), 26 states have call successors, (26), 9 states have call predecessors, (26), 11 states have return successors, (28), 24 states have call predecessors, (28), 24 states have call successors, (28) [2025-03-08 18:11:26,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 207 transitions. [2025-03-08 18:11:26,537 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 207 transitions. Word has length 71 [2025-03-08 18:11:26,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:11:26,538 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 207 transitions. [2025-03-08 18:11:26,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 18:11:26,538 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 207 transitions. [2025-03-08 18:11:26,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-08 18:11:26,539 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:11:26,539 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 18:11:26,545 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-08 18:11:26,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:11:26,743 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:11:26,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:11:26,743 INFO L85 PathProgramCache]: Analyzing trace with hash -2011864026, now seen corresponding path program 1 times [2025-03-08 18:11:26,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:11:26,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781323120] [2025-03-08 18:11:26,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:11:26,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:11:26,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-08 18:11:26,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-08 18:11:26,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:11:26,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:11:26,937 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-03-08 18:11:26,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:11:26,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781323120] [2025-03-08 18:11:26,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781323120] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 18:11:26,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2108936875] [2025-03-08 18:11:26,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:11:26,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:11:26,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 18:11:26,939 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 18:11:26,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-08 18:11:27,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-08 18:11:27,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-08 18:11:27,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:11:27,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:11:27,088 INFO L256 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-03-08 18:11:27,091 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 18:11:27,123 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 24 treesize of output 9 [2025-03-08 18:11:27,131 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 18 treesize of output 19 [2025-03-08 18:11:27,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:11:27,168 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 0 case distinctions, treesize of input 26 treesize of output 28 [2025-03-08 18:11:27,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:11:27,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:11:27,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 40 [2025-03-08 18:11:27,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:11:27,181 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 34 treesize of output 25 [2025-03-08 18:11:27,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:11:27,196 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 18 treesize of output 13 [2025-03-08 18:11:27,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:11:27,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 52 [2025-03-08 18:11:27,244 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 14 treesize of output 13 [2025-03-08 18:11:27,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:11:27,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:11:27,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:11:27,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:11:27,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 35 [2025-03-08 18:11:30,367 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 36 proven. 1 refuted. 12 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 18:11:30,368 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 18:11:30,723 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 24)) (.cse2 (+ 16 |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|))) (and (forall ((|ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| Int) (v_ArrVal_585 Int)) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|) |ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| v_ArrVal_585)))) (store .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 |ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset|))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse2) 0)) (forall ((|ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| Int) (v_ArrVal_586 Int) (v_ArrVal_588 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_588) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|) |ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|)) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_ArrVal_586)) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse2) 0)))) is different from false [2025-03-08 18:11:30,738 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 18:11:30,738 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 1 case distinctions, treesize of input 92 treesize of output 96 [2025-03-08 18:11:30,747 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 18:11:30,747 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 1 case distinctions, treesize of input 89 treesize of output 90 [2025-03-08 18:11:30,766 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-03-08 18:11:30,785 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 24)) (.cse2 (+ 16 |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_18| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_18| 1)) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_subst_1 Int)) (= (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| 0)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_18| v_arrayElimArr_6))) (store .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_subst_1))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse2) 0)))) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_18| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_18| 1)) (forall ((v_arrayElimArr_5 (Array Int Int)) (v_subst_2 Int)) (or (not (= |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (select v_arrayElimArr_5 v_subst_2))) (forall ((v_ArrVal_586 Int) (v_ArrVal_583 Int) (v_ArrVal_588 (Array Int Int))) (= (select (select (let ((.cse3 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| v_ArrVal_583)))) (store (store .cse3 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_18| v_ArrVal_588) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select (store .cse3 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_18| v_arrayElimArr_5) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_ArrVal_586))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse2) 0)))))))) is different from false [2025-03-08 18:11:30,802 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 18:11:30,803 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 18:11:30,863 INFO L349 Elim1Store]: treesize reduction 86, result has 45.2 percent of original size [2025-03-08 18:11:30,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 177 treesize of output 206 [2025-03-08 18:11:30,879 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 18:11:30,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 226 treesize of output 226 [2025-03-08 18:11:30,894 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 18:11:30,894 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 193 treesize of output 194 [2025-03-08 18:11:30,901 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 183 treesize of output 179 [2025-03-08 18:11:30,912 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 18:11:30,913 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 18:11:30,961 INFO L349 Elim1Store]: treesize reduction 86, result has 45.2 percent of original size [2025-03-08 18:11:30,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 251 treesize of output 280 [2025-03-08 18:11:30,975 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 18:11:30,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 318 treesize of output 314 [2025-03-08 18:11:30,985 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 267 treesize of output 255 [2025-03-08 18:11:31,305 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-03-08 18:11:31,321 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-03-08 18:11:31,423 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 18:11:31,424 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 18:11:31,433 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 18:11:31,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 106 treesize of output 116 [2025-03-08 18:11:31,490 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 18:11:31,490 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 37 treesize of output 37 [2025-03-08 18:11:31,557 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 11 proven. 11 refuted. 0 times theorem prover too weak. 26 trivial. 1 not checked. [2025-03-08 18:11:31,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2108936875] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 18:11:31,557 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 18:11:31,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 15, 10] total 27 [2025-03-08 18:11:31,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446107696] [2025-03-08 18:11:31,557 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 18:11:31,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-08 18:11:31,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:11:31,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-08 18:11:31,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=495, Unknown=37, NotChecked=94, Total=702 [2025-03-08 18:11:31,559 INFO L87 Difference]: Start difference. First operand 153 states and 207 transitions. Second operand has 27 states, 23 states have (on average 4.217391304347826) internal successors, (97), 23 states have internal predecessors, (97), 10 states have call successors, (20), 5 states have call predecessors, (20), 8 states have return successors, (19), 8 states have call predecessors, (19), 10 states have call successors, (19) [2025-03-08 18:11:37,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:11:37,309 INFO L93 Difference]: Finished difference Result 351 states and 475 transitions. [2025-03-08 18:11:37,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-03-08 18:11:37,312 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 23 states have (on average 4.217391304347826) internal successors, (97), 23 states have internal predecessors, (97), 10 states have call successors, (20), 5 states have call predecessors, (20), 8 states have return successors, (19), 8 states have call predecessors, (19), 10 states have call successors, (19) Word has length 71 [2025-03-08 18:11:37,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:11:37,315 INFO L225 Difference]: With dead ends: 351 [2025-03-08 18:11:37,315 INFO L226 Difference]: Without dead ends: 241 [2025-03-08 18:11:37,316 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 123 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=215, Invalid=1593, Unknown=92, NotChecked=170, Total=2070 [2025-03-08 18:11:37,317 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 81 mSDsluCounter, 1609 mSDsCounter, 0 mSdLazyCounter, 957 mSolverCounterSat, 24 mSolverCounterUnsat, 268 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 1731 SdHoareTripleChecker+Invalid, 1570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 957 IncrementalHoareTripleChecker+Invalid, 268 IncrementalHoareTripleChecker+Unknown, 321 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2025-03-08 18:11:37,317 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 1731 Invalid, 1570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 957 Invalid, 268 Unknown, 321 Unchecked, 3.4s Time] [2025-03-08 18:11:37,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2025-03-08 18:11:37,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 211. [2025-03-08 18:11:37,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 166 states have (on average 1.3433734939759037) internal successors, (223), 170 states have internal predecessors, (223), 28 states have call successors, (28), 14 states have call predecessors, (28), 16 states have return successors, (29), 26 states have call predecessors, (29), 26 states have call successors, (29) [2025-03-08 18:11:37,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 280 transitions. [2025-03-08 18:11:37,339 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 280 transitions. Word has length 71 [2025-03-08 18:11:37,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:11:37,339 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 280 transitions. [2025-03-08 18:11:37,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 23 states have (on average 4.217391304347826) internal successors, (97), 23 states have internal predecessors, (97), 10 states have call successors, (20), 5 states have call predecessors, (20), 8 states have return successors, (19), 8 states have call predecessors, (19), 10 states have call successors, (19) [2025-03-08 18:11:37,339 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 280 transitions. [2025-03-08 18:11:37,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-08 18:11:37,340 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:11:37,340 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 18:11:37,348 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-08 18:11:37,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-03-08 18:11:37,541 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:11:37,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:11:37,541 INFO L85 PathProgramCache]: Analyzing trace with hash -2138953986, now seen corresponding path program 1 times [2025-03-08 18:11:37,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:11:37,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70475155] [2025-03-08 18:11:37,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:11:37,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:11:37,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-08 18:11:37,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-08 18:11:37,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:11:37,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:11:37,649 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-08 18:11:37,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:11:37,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70475155] [2025-03-08 18:11:37,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70475155] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 18:11:37,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [530571131] [2025-03-08 18:11:37,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:11:37,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:11:37,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 18:11:37,652 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 18:11:37,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-08 18:11:37,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-08 18:11:37,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-08 18:11:37,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:11:37,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:11:37,814 INFO L256 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 18:11:37,816 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 18:11:37,902 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-08 18:11:37,902 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 18:11:37,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [530571131] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:11:37,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 18:11:37,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [7] total 13 [2025-03-08 18:11:37,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180096290] [2025-03-08 18:11:37,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:11:37,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 18:11:37,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:11:37,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 18:11:37,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-03-08 18:11:37,904 INFO L87 Difference]: Start difference. First operand 211 states and 280 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 18:11:38,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:11:38,147 INFO L93 Difference]: Finished difference Result 459 states and 616 transitions. [2025-03-08 18:11:38,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 18:11:38,152 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 73 [2025-03-08 18:11:38,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:11:38,154 INFO L225 Difference]: With dead ends: 459 [2025-03-08 18:11:38,154 INFO L226 Difference]: Without dead ends: 284 [2025-03-08 18:11:38,155 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2025-03-08 18:11:38,157 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 109 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 18:11:38,158 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 297 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 18:11:38,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2025-03-08 18:11:38,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 214. [2025-03-08 18:11:38,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 169 states have (on average 1.349112426035503) internal successors, (228), 173 states have internal predecessors, (228), 28 states have call successors, (28), 14 states have call predecessors, (28), 16 states have return successors, (29), 26 states have call predecessors, (29), 26 states have call successors, (29) [2025-03-08 18:11:38,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 285 transitions. [2025-03-08 18:11:38,189 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 285 transitions. Word has length 73 [2025-03-08 18:11:38,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:11:38,189 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 285 transitions. [2025-03-08 18:11:38,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 18:11:38,190 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 285 transitions. [2025-03-08 18:11:38,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-08 18:11:38,191 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:11:38,191 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 18:11:38,200 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-08 18:11:38,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:11:38,395 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:11:38,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:11:38,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1850041836, now seen corresponding path program 1 times [2025-03-08 18:11:38,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:11:38,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085061965] [2025-03-08 18:11:38,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:11:38,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:11:38,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-08 18:11:38,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-08 18:11:38,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:11:38,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:11:38,520 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-08 18:11:38,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:11:38,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085061965] [2025-03-08 18:11:38,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085061965] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 18:11:38,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [611713616] [2025-03-08 18:11:38,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:11:38,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:11:38,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 18:11:38,523 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 18:11:38,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-08 18:11:38,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-08 18:11:38,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-08 18:11:38,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:11:38,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:11:38,650 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 18:11:38,651 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 18:11:38,662 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-08 18:11:38,663 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 18:11:38,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [611713616] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:11:38,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 18:11:38,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2025-03-08 18:11:38,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786423271] [2025-03-08 18:11:38,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:11:38,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 18:11:38,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:11:38,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 18:11:38,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 18:11:38,665 INFO L87 Difference]: Start difference. First operand 214 states and 285 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 18:11:38,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:11:38,696 INFO L93 Difference]: Finished difference Result 418 states and 579 transitions. [2025-03-08 18:11:38,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 18:11:38,696 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 74 [2025-03-08 18:11:38,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:11:38,698 INFO L225 Difference]: With dead ends: 418 [2025-03-08 18:11:38,698 INFO L226 Difference]: Without dead ends: 241 [2025-03-08 18:11:38,699 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 18:11:38,700 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 2 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 152 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-03-08 18:11:38,700 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 152 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 18:11:38,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2025-03-08 18:11:38,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 223. [2025-03-08 18:11:38,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 178 states have (on average 1.348314606741573) internal successors, (240), 182 states have internal predecessors, (240), 28 states have call successors, (28), 14 states have call predecessors, (28), 16 states have return successors, (29), 26 states have call predecessors, (29), 26 states have call successors, (29) [2025-03-08 18:11:38,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 297 transitions. [2025-03-08 18:11:38,721 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 297 transitions. Word has length 74 [2025-03-08 18:11:38,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:11:38,721 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 297 transitions. [2025-03-08 18:11:38,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 18:11:38,721 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 297 transitions. [2025-03-08 18:11:38,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-08 18:11:38,722 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:11:38,722 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 18:11:38,728 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-08 18:11:38,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-08 18:11:38,927 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:11:38,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:11:38,927 INFO L85 PathProgramCache]: Analyzing trace with hash -167275381, now seen corresponding path program 1 times [2025-03-08 18:11:38,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:11:38,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042381413] [2025-03-08 18:11:38,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:11:38,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:11:38,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-08 18:11:38,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-08 18:11:38,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:11:38,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:11:39,019 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 10 proven. 11 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-08 18:11:39,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:11:39,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042381413] [2025-03-08 18:11:39,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042381413] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 18:11:39,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1013298342] [2025-03-08 18:11:39,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:11:39,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:11:39,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 18:11:39,022 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 18:11:39,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-08 18:11:39,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-08 18:11:39,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-08 18:11:39,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:11:39,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:11:39,157 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 18:11:39,158 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 18:11:39,219 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 18:11:39,220 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 18:11:39,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1013298342] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:11:39,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 18:11:39,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 11 [2025-03-08 18:11:39,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360921840] [2025-03-08 18:11:39,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:11:39,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 18:11:39,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:11:39,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 18:11:39,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-08 18:11:39,221 INFO L87 Difference]: Start difference. First operand 223 states and 297 transitions. Second operand has 7 states, 6 states have (on average 10.333333333333334) internal successors, (62), 7 states have internal predecessors, (62), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-08 18:11:39,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:11:39,328 INFO L93 Difference]: Finished difference Result 393 states and 525 transitions. [2025-03-08 18:11:39,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 18:11:39,328 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 10.333333333333334) internal successors, (62), 7 states have internal predecessors, (62), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) Word has length 82 [2025-03-08 18:11:39,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:11:39,329 INFO L225 Difference]: With dead ends: 393 [2025-03-08 18:11:39,329 INFO L226 Difference]: Without dead ends: 187 [2025-03-08 18:11:39,330 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2025-03-08 18:11:39,330 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 115 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 18:11:39,330 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 281 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 18:11:39,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2025-03-08 18:11:39,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2025-03-08 18:11:39,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 144 states have (on average 1.2847222222222223) internal successors, (185), 148 states have internal predecessors, (185), 26 states have call successors, (26), 14 states have call predecessors, (26), 16 states have return successors, (27), 24 states have call predecessors, (27), 24 states have call successors, (27) [2025-03-08 18:11:39,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 238 transitions. [2025-03-08 18:11:39,350 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 238 transitions. Word has length 82 [2025-03-08 18:11:39,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:11:39,350 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 238 transitions. [2025-03-08 18:11:39,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 10.333333333333334) internal successors, (62), 7 states have internal predecessors, (62), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-08 18:11:39,350 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 238 transitions. [2025-03-08 18:11:39,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-08 18:11:39,351 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:11:39,351 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 18:11:39,358 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-08 18:11:39,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-08 18:11:39,552 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:11:39,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:11:39,552 INFO L85 PathProgramCache]: Analyzing trace with hash -592860112, now seen corresponding path program 1 times [2025-03-08 18:11:39,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:11:39,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64727217] [2025-03-08 18:11:39,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:11:39,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:11:39,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-08 18:11:39,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-08 18:11:39,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:11:39,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:11:39,811 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-03-08 18:11:39,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:11:39,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64727217] [2025-03-08 18:11:39,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64727217] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 18:11:39,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [736620040] [2025-03-08 18:11:39,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:11:39,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:11:39,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 18:11:39,814 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 18:11:39,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-08 18:11:39,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-08 18:11:39,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-08 18:11:39,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:11:39,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:11:39,967 INFO L256 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-08 18:11:39,969 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 18:11:40,016 INFO L349 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2025-03-08 18:11:40,017 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-03-08 18:11:40,022 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-03-08 18:11:40,028 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-03-08 18:11:40,036 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|)) (.cse3 (+ |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset| 24))) (let ((.cse1 (select .cse2 .cse3))) (let ((.cse0 (= |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base| .cse1))) (or (and (not .cse0) (not (= 0 .cse1)) (exists ((v_arrayElimArr_10 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int) (v_DerPreprocessor_11 (Array Int Int))) (and (= (select v_arrayElimArr_10 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) (= .cse2 (store (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base| v_DerPreprocessor_11) .cse1 v_arrayElimArr_10) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse3 .cse1))))) (and (not (= |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base| 0)) .cse0 (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int)) (= |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base| (select .cse2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|)))))))) is different from true [2025-03-08 18:11:40,061 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((v_arrayElimArr_10 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_28| Int) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse1 (select v_arrayElimArr_10 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|))) (let ((.cse0 (select |c_#memory_$Pointer$#2.base| .cse1)) (.cse3 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_28| 24))) (let ((.cse2 (select .cse0 .cse3))) (and (= .cse0 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse1 v_DerPreprocessor_11) .cse2 v_arrayElimArr_10) .cse1) .cse3 .cse2)) (not (= .cse1 .cse2)) (not (= .cse2 0))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_28| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41| Int)) (let ((.cse4 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int)) (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41| (select .cse4 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|))) (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41| (select .cse4 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_28| 24))))))) is different from true [2025-03-08 18:11:40,323 WARN L873 $PredicateComparison]: unable to prove that (and (let ((.cse2 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|)) (.cse3 (+ |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset| 24))) (let ((.cse1 (select .cse2 .cse3))) (let ((.cse0 (= |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base| .cse1))) (or (and (not .cse0) (not (= 0 .cse1)) (exists ((v_arrayElimArr_10 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int) (v_DerPreprocessor_11 (Array Int Int))) (and (= (select v_arrayElimArr_10 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) (= .cse2 (store (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base| v_DerPreprocessor_11) .cse1 v_arrayElimArr_10) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse3 .cse1))))) (and (not (= |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base| 0)) .cse0 (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int)) (= |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base| (select .cse2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|)))))))) (or (exists ((v_arrayElimArr_10 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_28| Int) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse5 (select v_arrayElimArr_10 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|))) (let ((.cse4 (select |c_#memory_$Pointer$#2.base| .cse5)) (.cse7 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_28| 24))) (let ((.cse6 (select .cse4 .cse7))) (and (= .cse4 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse5 v_DerPreprocessor_11) .cse6 v_arrayElimArr_10) .cse5) .cse7 .cse6)) (not (= .cse5 .cse6)) (not (= .cse6 0))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_28| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41| Int)) (let ((.cse8 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int)) (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41| (select .cse8 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|))) (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41| (select .cse8 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_28| 24)))))))) is different from true [2025-03-08 18:11:40,351 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((v_arrayElimArr_10 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_29| Int) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse1 (select v_arrayElimArr_10 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|))) (let ((.cse3 (select |c_#memory_$Pointer$#2.base| .cse1)) (.cse2 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_29| 24))) (let ((.cse0 (select .cse3 .cse2))) (and (not (= .cse0 0)) (not (= .cse1 .cse0)) (= (store (select (store (store |c_#memory_$Pointer$#2.base| .cse1 v_DerPreprocessor_11) .cse0 v_arrayElimArr_10) .cse1) .cse2 .cse0) .cse3)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_29| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_42| Int)) (let ((.cse4 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_42|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int)) (= (select .cse4 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_42|)) (not (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_42| 0)) (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_42| (select .cse4 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_29| 24))))))) (or (exists ((v_arrayElimArr_10 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_28| Int) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse6 (select v_arrayElimArr_10 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|))) (let ((.cse5 (select |c_#memory_$Pointer$#2.base| .cse6)) (.cse8 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_28| 24))) (let ((.cse7 (select .cse5 .cse8))) (and (= .cse5 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse6 v_DerPreprocessor_11) .cse7 v_arrayElimArr_10) .cse6) .cse8 .cse7)) (not (= .cse6 .cse7)) (not (= .cse7 0))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_28| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41| Int)) (let ((.cse9 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int)) (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41| (select .cse9 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|))) (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41| (select .cse9 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_28| 24)))))))) is different from true [2025-03-08 18:11:40,556 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((v_arrayElimArr_10 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_29| Int) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse1 (select v_arrayElimArr_10 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|))) (let ((.cse3 (select |c_#memory_$Pointer$#2.base| .cse1)) (.cse2 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_29| 24))) (let ((.cse0 (select .cse3 .cse2))) (and (not (= .cse0 0)) (not (= .cse1 .cse0)) (= (store (select (store (store |c_#memory_$Pointer$#2.base| .cse1 v_DerPreprocessor_11) .cse0 v_arrayElimArr_10) .cse1) .cse2 .cse0) .cse3)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_29| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_42| Int)) (let ((.cse4 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_42|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int)) (= (select .cse4 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_42|)) (not (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_42| 0)) (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_42| (select .cse4 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_29| 24))))))) (let ((.cse6 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base|)) (.cse8 (+ |c_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset| 24))) (let ((.cse7 (select .cse6 .cse8))) (let ((.cse5 (= .cse7 |c_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base|))) (or (and .cse5 (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int)) (= (select .cse6 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|) |c_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base|)) (not (= |c_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base| 0))) (and (not (= .cse7 0)) (exists ((v_arrayElimArr_10 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int) (v_DerPreprocessor_11 (Array Int Int))) (and (= (select v_arrayElimArr_10 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|) |c_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base|) (= (store (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base| v_DerPreprocessor_11) .cse7 v_arrayElimArr_10) |c_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base|) .cse8 .cse7) .cse6))) (not .cse5)))))) (or (exists ((v_arrayElimArr_10 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_28| Int) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse10 (select v_arrayElimArr_10 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|))) (let ((.cse9 (select |c_#memory_$Pointer$#2.base| .cse10)) (.cse12 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_28| 24))) (let ((.cse11 (select .cse9 .cse12))) (and (= .cse9 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse10 v_DerPreprocessor_11) .cse11 v_arrayElimArr_10) .cse10) .cse12 .cse11)) (not (= .cse10 .cse11)) (not (= .cse11 0))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_28| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41| Int)) (let ((.cse13 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int)) (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41| (select .cse13 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|))) (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41| (select .cse13 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_28| 24)))))))) is different from true [2025-03-08 18:11:40,587 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((v_arrayElimArr_10 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_29| Int) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse1 (select v_arrayElimArr_10 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|))) (let ((.cse3 (select |c_#memory_$Pointer$#2.base| .cse1)) (.cse2 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_29| 24))) (let ((.cse0 (select .cse3 .cse2))) (and (not (= .cse0 0)) (not (= .cse1 .cse0)) (= (store (select (store (store |c_#memory_$Pointer$#2.base| .cse1 v_DerPreprocessor_11) .cse0 v_arrayElimArr_10) .cse1) .cse2 .cse0) .cse3)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_29| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_42| Int)) (let ((.cse4 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_42|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int)) (= (select .cse4 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_42|)) (not (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_42| 0)) (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_42| (select .cse4 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_29| 24))))))) (or (exists ((v_arrayElimArr_10 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_15| Int) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse6 (select v_arrayElimArr_10 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|))) (let ((.cse7 (select |c_#memory_$Pointer$#2.base| .cse6)) (.cse8 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_15| 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_11) .cse5 v_arrayElimArr_10) .cse6) .cse8 .cse5))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_16| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_15| Int)) (let ((.cse9 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_16|))) (and (= (select .cse9 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_15| 24)) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_16|) (not (= 0 |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_16|)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int)) (= (select .cse9 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_16|)))))) (or (exists ((v_arrayElimArr_10 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_28| Int) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse11 (select v_arrayElimArr_10 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|))) (let ((.cse10 (select |c_#memory_$Pointer$#2.base| .cse11)) (.cse13 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_28| 24))) (let ((.cse12 (select .cse10 .cse13))) (and (= .cse10 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse11 v_DerPreprocessor_11) .cse12 v_arrayElimArr_10) .cse11) .cse13 .cse12)) (not (= .cse11 .cse12)) (not (= .cse12 0))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_28| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41| Int)) (let ((.cse14 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int)) (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41| (select .cse14 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|))) (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41| (select .cse14 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_28| 24)))))))) is different from true [2025-03-08 18:11:40,992 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((v_arrayElimArr_10 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_29| Int) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse1 (select v_arrayElimArr_10 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|))) (let ((.cse3 (select |c_#memory_$Pointer$#2.base| .cse1)) (.cse2 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_29| 24))) (let ((.cse0 (select .cse3 .cse2))) (and (not (= .cse0 0)) (not (= .cse1 .cse0)) (= (store (select (store (store |c_#memory_$Pointer$#2.base| .cse1 v_DerPreprocessor_11) .cse0 v_arrayElimArr_10) .cse1) .cse2 .cse0) .cse3)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_29| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_42| Int)) (let ((.cse4 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_42|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int)) (= (select .cse4 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_42|)) (not (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_42| 0)) (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_42| (select .cse4 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_29| 24))))))) (let ((.cse6 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base|)) (.cse8 (+ |c_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset| 24))) (let ((.cse7 (select .cse6 .cse8))) (let ((.cse5 (= .cse7 |c_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base|))) (or (and .cse5 (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int)) (= (select .cse6 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|) |c_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base|)) (not (= |c_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base| 0))) (and (not (= .cse7 0)) (exists ((v_arrayElimArr_10 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int) (v_DerPreprocessor_11 (Array Int Int))) (and (= (select v_arrayElimArr_10 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|) |c_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base|) (= (store (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base| v_DerPreprocessor_11) .cse7 v_arrayElimArr_10) |c_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base|) .cse8 .cse7) .cse6))) (not .cse5)))))) (or (exists ((v_arrayElimArr_10 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_15| Int) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse10 (select v_arrayElimArr_10 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|))) (let ((.cse11 (select |c_#memory_$Pointer$#2.base| .cse10)) (.cse12 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_15| 24))) (let ((.cse9 (select .cse11 .cse12))) (and (not (= .cse9 0)) (not (= .cse10 .cse9)) (= .cse11 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse10 v_DerPreprocessor_11) .cse9 v_arrayElimArr_10) .cse10) .cse12 .cse9))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_16| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_15| Int)) (let ((.cse13 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_16|))) (and (= (select .cse13 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_15| 24)) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_16|) (not (= 0 |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_16|)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int)) (= (select .cse13 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_16|)))))) (or (exists ((v_arrayElimArr_10 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_28| Int) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse15 (select v_arrayElimArr_10 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|))) (let ((.cse14 (select |c_#memory_$Pointer$#2.base| .cse15)) (.cse17 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_28| 24))) (let ((.cse16 (select .cse14 .cse17))) (and (= .cse14 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse15 v_DerPreprocessor_11) .cse16 v_arrayElimArr_10) .cse15) .cse17 .cse16)) (not (= .cse15 .cse16)) (not (= .cse16 0))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_28| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41| Int)) (let ((.cse18 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int)) (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41| (select .cse18 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|))) (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41| (select .cse18 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_28| 24)))))))) is different from true [2025-03-08 18:11:41,040 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((v_arrayElimArr_10 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_29| Int) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse1 (select v_arrayElimArr_10 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|))) (let ((.cse3 (select |c_#memory_$Pointer$#2.base| .cse1)) (.cse2 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_29| 24))) (let ((.cse0 (select .cse3 .cse2))) (and (not (= .cse0 0)) (not (= .cse1 .cse0)) (= (store (select (store (store |c_#memory_$Pointer$#2.base| .cse1 v_DerPreprocessor_11) .cse0 v_arrayElimArr_10) .cse1) .cse2 .cse0) .cse3)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_29| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_42| Int)) (let ((.cse4 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_42|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int)) (= (select .cse4 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_42|)) (not (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_42| 0)) (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_42| (select .cse4 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_29| 24))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_16| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_17| Int)) (let ((.cse5 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_17|))) (and (= (select .cse5 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_16| 24)) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_17|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int)) (= (select .cse5 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_17|)) (not (= 0 |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_17|))))) (exists ((v_arrayElimArr_10 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_16| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse6 (select v_arrayElimArr_10 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|))) (let ((.cse9 (select |c_#memory_$Pointer$#2.base| .cse6)) (.cse8 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_16| 24))) (let ((.cse7 (select .cse9 .cse8))) (and (= (store (select (store (store |c_#memory_$Pointer$#2.base| .cse6 v_DerPreprocessor_11) .cse7 v_arrayElimArr_10) .cse6) .cse8 .cse7) .cse9) (not (= .cse7 0)) (not (= .cse6 .cse7)))))))) (or (exists ((v_arrayElimArr_10 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_15| Int) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse11 (select v_arrayElimArr_10 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|))) (let ((.cse12 (select |c_#memory_$Pointer$#2.base| .cse11)) (.cse13 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_15| 24))) (let ((.cse10 (select .cse12 .cse13))) (and (not (= .cse10 0)) (not (= .cse11 .cse10)) (= .cse12 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse11 v_DerPreprocessor_11) .cse10 v_arrayElimArr_10) .cse11) .cse13 .cse10))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_16| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_15| Int)) (let ((.cse14 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_16|))) (and (= (select .cse14 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_15| 24)) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_16|) (not (= 0 |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_16|)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int)) (= (select .cse14 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_16|)))))) (or (exists ((v_arrayElimArr_10 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_28| Int) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse16 (select v_arrayElimArr_10 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|))) (let ((.cse15 (select |c_#memory_$Pointer$#2.base| .cse16)) (.cse18 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_28| 24))) (let ((.cse17 (select .cse15 .cse18))) (and (= .cse15 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse16 v_DerPreprocessor_11) .cse17 v_arrayElimArr_10) .cse16) .cse18 .cse17)) (not (= .cse16 .cse17)) (not (= .cse17 0))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_28| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41| Int)) (let ((.cse19 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int)) (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41| (select .cse19 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|))) (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41| (select .cse19 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_28| 24)))))))) is different from true [2025-03-08 18:11:41,251 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((v_arrayElimArr_10 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_29| Int) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse1 (select v_arrayElimArr_10 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|))) (let ((.cse3 (select |c_#memory_$Pointer$#2.base| .cse1)) (.cse2 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_29| 24))) (let ((.cse0 (select .cse3 .cse2))) (and (not (= .cse0 0)) (not (= .cse1 .cse0)) (= (store (select (store (store |c_#memory_$Pointer$#2.base| .cse1 v_DerPreprocessor_11) .cse0 v_arrayElimArr_10) .cse1) .cse2 .cse0) .cse3)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_29| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_42| Int)) (let ((.cse4 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_42|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int)) (= (select .cse4 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_42|)) (not (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_42| 0)) (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_42| (select .cse4 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_29| 24))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_16| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_17| Int)) (let ((.cse5 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_17|))) (and (= (select .cse5 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_16| 24)) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_17|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int)) (= (select .cse5 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_17|)) (not (= 0 |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_17|))))) (exists ((v_arrayElimArr_10 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_16| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse6 (select v_arrayElimArr_10 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|))) (let ((.cse9 (select |c_#memory_$Pointer$#2.base| .cse6)) (.cse8 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_16| 24))) (let ((.cse7 (select .cse9 .cse8))) (and (= (store (select (store (store |c_#memory_$Pointer$#2.base| .cse6 v_DerPreprocessor_11) .cse7 v_arrayElimArr_10) .cse6) .cse8 .cse7) .cse9) (not (= .cse7 0)) (not (= .cse6 .cse7)))))))) (let ((.cse11 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base|)) (.cse13 (+ |c_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset| 24))) (let ((.cse12 (select .cse11 .cse13))) (let ((.cse10 (= .cse12 |c_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base|))) (or (and .cse10 (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int)) (= (select .cse11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|) |c_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base|)) (not (= |c_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base| 0))) (and (not (= .cse12 0)) (exists ((v_arrayElimArr_10 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int) (v_DerPreprocessor_11 (Array Int Int))) (and (= (select v_arrayElimArr_10 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|) |c_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base|) (= (store (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base| v_DerPreprocessor_11) .cse12 v_arrayElimArr_10) |c_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base|) .cse13 .cse12) .cse11))) (not .cse10)))))) (or (exists ((v_arrayElimArr_10 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_15| Int) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse15 (select v_arrayElimArr_10 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|))) (let ((.cse16 (select |c_#memory_$Pointer$#2.base| .cse15)) (.cse17 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_15| 24))) (let ((.cse14 (select .cse16 .cse17))) (and (not (= .cse14 0)) (not (= .cse15 .cse14)) (= .cse16 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse15 v_DerPreprocessor_11) .cse14 v_arrayElimArr_10) .cse15) .cse17 .cse14))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_16| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_15| Int)) (let ((.cse18 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_16|))) (and (= (select .cse18 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_15| 24)) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_16|) (not (= 0 |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_16|)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int)) (= (select .cse18 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_16|)))))) (or (exists ((v_arrayElimArr_10 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_28| Int) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse20 (select v_arrayElimArr_10 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|))) (let ((.cse19 (select |c_#memory_$Pointer$#2.base| .cse20)) (.cse22 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_28| 24))) (let ((.cse21 (select .cse19 .cse22))) (and (= .cse19 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse20 v_DerPreprocessor_11) .cse21 v_arrayElimArr_10) .cse20) .cse22 .cse21)) (not (= .cse20 .cse21)) (not (= .cse21 0))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_28| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41| Int)) (let ((.cse23 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int)) (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41| (select .cse23 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|))) (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41| (select .cse23 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_28| 24)))))))) is different from true [2025-03-08 18:11:41,353 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((v_arrayElimArr_10 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_29| Int) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse1 (select v_arrayElimArr_10 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|))) (let ((.cse3 (select |c_#memory_$Pointer$#2.base| .cse1)) (.cse2 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_29| 24))) (let ((.cse0 (select .cse3 .cse2))) (and (not (= .cse0 0)) (not (= .cse1 .cse0)) (= (store (select (store (store |c_#memory_$Pointer$#2.base| .cse1 v_DerPreprocessor_11) .cse0 v_arrayElimArr_10) .cse1) .cse2 .cse0) .cse3)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_29| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_42| Int)) (let ((.cse4 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_42|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int)) (= (select .cse4 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_42|)) (not (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_42| 0)) (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_42| (select .cse4 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_29| 24))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_16| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_17| Int)) (let ((.cse5 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_17|))) (and (= (select .cse5 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_16| 24)) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_17|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int)) (= (select .cse5 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_17|)) (not (= 0 |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_17|))))) (exists ((v_arrayElimArr_10 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_16| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse6 (select v_arrayElimArr_10 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|))) (let ((.cse9 (select |c_#memory_$Pointer$#2.base| .cse6)) (.cse8 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_16| 24))) (let ((.cse7 (select .cse9 .cse8))) (and (= (store (select (store (store |c_#memory_$Pointer$#2.base| .cse6 v_DerPreprocessor_11) .cse7 v_arrayElimArr_10) .cse6) .cse8 .cse7) .cse9) (not (= .cse7 0)) (not (= .cse6 .cse7)))))))) (or (exists ((v_arrayElimArr_10 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_15| Int) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse11 (select v_arrayElimArr_10 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|))) (let ((.cse12 (select |c_#memory_$Pointer$#2.base| .cse11)) (.cse13 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_15| 24))) (let ((.cse10 (select .cse12 .cse13))) (and (not (= .cse10 0)) (not (= .cse11 .cse10)) (= .cse12 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse11 v_DerPreprocessor_11) .cse10 v_arrayElimArr_10) .cse11) .cse13 .cse10))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_16| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_15| Int)) (let ((.cse14 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_16|))) (and (= (select .cse14 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_15| 24)) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_16|) (not (= 0 |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_16|)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int)) (= (select .cse14 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_16|)))))) (or (exists ((v_arrayElimArr_10 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_28| Int) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse16 (select v_arrayElimArr_10 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|))) (let ((.cse15 (select |c_#memory_$Pointer$#2.base| .cse16)) (.cse18 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_28| 24))) (let ((.cse17 (select .cse15 .cse18))) (and (= .cse15 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse16 v_DerPreprocessor_11) .cse17 v_arrayElimArr_10) .cse16) .cse18 .cse17)) (not (= .cse16 .cse17)) (not (= .cse17 0))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_28| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41| Int)) (let ((.cse19 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int)) (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41| (select .cse19 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|))) (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41| (select .cse19 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_28| 24))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_17| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_18| Int)) (let ((.cse20 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_18|))) (and (= (select .cse20 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_17| 24)) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_18|) (not (= 0 |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_18|)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int)) (= (select .cse20 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_18|))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_17| Int) (v_arrayElimArr_10 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse22 (select v_arrayElimArr_10 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|))) (let ((.cse23 (select |c_#memory_$Pointer$#2.base| .cse22)) (.cse24 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_17| 24))) (let ((.cse21 (select .cse23 .cse24))) (and (not (= .cse21 .cse22)) (not (= .cse21 0)) (= .cse23 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse22 v_DerPreprocessor_11) .cse21 v_arrayElimArr_10) .cse22) .cse24 .cse21))))))))) is different from true [2025-03-08 18:11:41,461 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_aws_linked_list_is_valid_~list#1.offset| |c_aws_linked_list_is_valid_#in~list#1.offset|) (= |c_aws_linked_list_is_valid_~list#1.base| |c_aws_linked_list_is_valid_#in~list#1.base|) (or (exists ((v_arrayElimArr_10 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_29| Int) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse1 (select v_arrayElimArr_10 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|))) (let ((.cse3 (select |c_#memory_$Pointer$#2.base| .cse1)) (.cse2 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_29| 24))) (let ((.cse0 (select .cse3 .cse2))) (and (not (= .cse0 0)) (not (= .cse1 .cse0)) (= (store (select (store (store |c_#memory_$Pointer$#2.base| .cse1 v_DerPreprocessor_11) .cse0 v_arrayElimArr_10) .cse1) .cse2 .cse0) .cse3)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_29| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_42| Int)) (let ((.cse4 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_42|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int)) (= (select .cse4 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_42|)) (not (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_42| 0)) (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_42| (select .cse4 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_29| 24))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_16| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_17| Int)) (let ((.cse5 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_17|))) (and (= (select .cse5 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_16| 24)) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_17|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int)) (= (select .cse5 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_17|)) (not (= 0 |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_17|))))) (exists ((v_arrayElimArr_10 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_16| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse6 (select v_arrayElimArr_10 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|))) (let ((.cse9 (select |c_#memory_$Pointer$#2.base| .cse6)) (.cse8 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_16| 24))) (let ((.cse7 (select .cse9 .cse8))) (and (= (store (select (store (store |c_#memory_$Pointer$#2.base| .cse6 v_DerPreprocessor_11) .cse7 v_arrayElimArr_10) .cse6) .cse8 .cse7) .cse9) (not (= .cse7 0)) (not (= .cse6 .cse7)))))))) (or (exists ((v_arrayElimArr_10 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_15| Int) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse11 (select v_arrayElimArr_10 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|))) (let ((.cse12 (select |c_#memory_$Pointer$#2.base| .cse11)) (.cse13 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_15| 24))) (let ((.cse10 (select .cse12 .cse13))) (and (not (= .cse10 0)) (not (= .cse11 .cse10)) (= .cse12 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse11 v_DerPreprocessor_11) .cse10 v_arrayElimArr_10) .cse11) .cse13 .cse10))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_16| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_15| Int)) (let ((.cse14 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_16|))) (and (= (select .cse14 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_15| 24)) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_16|) (not (= 0 |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_16|)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int)) (= (select .cse14 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_16|)))))) (or (exists ((v_arrayElimArr_10 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_28| Int) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse16 (select v_arrayElimArr_10 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|))) (let ((.cse15 (select |c_#memory_$Pointer$#2.base| .cse16)) (.cse18 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_28| 24))) (let ((.cse17 (select .cse15 .cse18))) (and (= .cse15 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse16 v_DerPreprocessor_11) .cse17 v_arrayElimArr_10) .cse16) .cse18 .cse17)) (not (= .cse16 .cse17)) (not (= .cse17 0))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_28| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41| Int)) (let ((.cse19 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int)) (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41| (select .cse19 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|))) (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41| (select .cse19 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_28| 24))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_17| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_18| Int)) (let ((.cse20 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_18|))) (and (= (select .cse20 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_17| 24)) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_18|) (not (= 0 |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_18|)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int)) (= (select .cse20 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_18|))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_17| Int) (v_arrayElimArr_10 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse22 (select v_arrayElimArr_10 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|))) (let ((.cse23 (select |c_#memory_$Pointer$#2.base| .cse22)) (.cse24 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_17| 24))) (let ((.cse21 (select .cse23 .cse24))) (and (not (= .cse21 .cse22)) (not (= .cse21 0)) (= .cse23 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse22 v_DerPreprocessor_11) .cse21 v_arrayElimArr_10) .cse22) .cse24 .cse21))))))))) is different from true [2025-03-08 18:11:41,827 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_10 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_29| Int) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse1 (select v_arrayElimArr_10 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|))) (let ((.cse3 (select |c_#memory_$Pointer$#2.base| .cse1)) (.cse2 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_29| 24))) (let ((.cse0 (select .cse3 .cse2))) (and (not (= .cse0 0)) (not (= .cse1 .cse0)) (= (store (select (store (store |c_#memory_$Pointer$#2.base| .cse1 v_DerPreprocessor_11) .cse0 v_arrayElimArr_10) .cse1) .cse2 .cse0) .cse3)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_29| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_42| Int)) (let ((.cse4 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_42|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int)) (= (select .cse4 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_42|)) (not (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_42| 0)) (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_42| (select .cse4 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_29| 24))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_16| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_17| Int)) (let ((.cse5 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_17|))) (and (= (select .cse5 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_16| 24)) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_17|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int)) (= (select .cse5 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_17|)) (not (= 0 |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_17|))))) (exists ((v_arrayElimArr_10 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_16| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse6 (select v_arrayElimArr_10 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|))) (let ((.cse9 (select |c_#memory_$Pointer$#2.base| .cse6)) (.cse8 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_16| 24))) (let ((.cse7 (select .cse9 .cse8))) (and (= (store (select (store (store |c_#memory_$Pointer$#2.base| .cse6 v_DerPreprocessor_11) .cse7 v_arrayElimArr_10) .cse6) .cse8 .cse7) .cse9) (not (= .cse7 0)) (not (= .cse6 .cse7)))))))) (or (exists ((v_arrayElimArr_10 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_15| Int) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse11 (select v_arrayElimArr_10 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|))) (let ((.cse12 (select |c_#memory_$Pointer$#2.base| .cse11)) (.cse13 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_15| 24))) (let ((.cse10 (select .cse12 .cse13))) (and (not (= .cse10 0)) (not (= .cse11 .cse10)) (= .cse12 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse11 v_DerPreprocessor_11) .cse10 v_arrayElimArr_10) .cse11) .cse13 .cse10))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_16| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_15| Int)) (let ((.cse14 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_16|))) (and (= (select .cse14 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_15| 24)) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_16|) (not (= 0 |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_16|)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int)) (= (select .cse14 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_16|)))))) (or (exists ((v_arrayElimArr_10 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_28| Int) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse16 (select v_arrayElimArr_10 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|))) (let ((.cse15 (select |c_#memory_$Pointer$#2.base| .cse16)) (.cse18 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_28| 24))) (let ((.cse17 (select .cse15 .cse18))) (and (= .cse15 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse16 v_DerPreprocessor_11) .cse17 v_arrayElimArr_10) .cse16) .cse18 .cse17)) (not (= .cse16 .cse17)) (not (= .cse17 0))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_28| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41| Int)) (let ((.cse19 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int)) (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41| (select .cse19 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|))) (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41| (select .cse19 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_28| 24))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_17| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_18| Int)) (let ((.cse20 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_18|))) (and (= (select .cse20 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_17| 24)) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_18|) (not (= 0 |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_18|)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int)) (= (select .cse20 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_18|))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_17| Int) (v_arrayElimArr_10 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse22 (select v_arrayElimArr_10 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|))) (let ((.cse23 (select |c_#memory_$Pointer$#2.base| .cse22)) (.cse24 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_17| 24))) (let ((.cse21 (select .cse23 .cse24))) (and (not (= .cse21 .cse22)) (not (= .cse21 0)) (= .cse23 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse22 v_DerPreprocessor_11) .cse21 v_arrayElimArr_10) .cse22) .cse24 .cse21))))))))) is different from true [2025-03-08 18:11:41,882 WARN L873 $PredicateComparison]: unable to prove that (and (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_arrayElimArr_10 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_29| Int) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse1 (select v_arrayElimArr_10 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|))) (let ((.cse3 (select |c_#memory_$Pointer$#2.base| .cse1)) (.cse2 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_29| 24))) (let ((.cse0 (select .cse3 .cse2))) (and (not (= .cse0 0)) (not (= .cse1 .cse0)) (= (store (select (store (store |c_#memory_$Pointer$#2.base| .cse1 v_DerPreprocessor_11) .cse0 v_arrayElimArr_10) .cse1) .cse2 .cse0) .cse3)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_29| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_42| Int)) (let ((.cse4 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_42|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int)) (= (select .cse4 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_42|)) (not (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_42| 0)) (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_42| (select .cse4 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_29| 24))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_16| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_17| Int)) (let ((.cse5 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_17|))) (and (= (select .cse5 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_16| 24)) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_17|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int)) (= (select .cse5 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_17|)) (not (= 0 |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_17|))))) (exists ((v_arrayElimArr_10 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_16| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse6 (select v_arrayElimArr_10 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|))) (let ((.cse9 (select |c_#memory_$Pointer$#2.base| .cse6)) (.cse8 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_16| 24))) (let ((.cse7 (select .cse9 .cse8))) (and (= (store (select (store (store |c_#memory_$Pointer$#2.base| .cse6 v_DerPreprocessor_11) .cse7 v_arrayElimArr_10) .cse6) .cse8 .cse7) .cse9) (not (= .cse7 0)) (not (= .cse6 .cse7)))))))) (or (exists ((v_arrayElimArr_10 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_15| Int) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse11 (select v_arrayElimArr_10 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|))) (let ((.cse12 (select |c_#memory_$Pointer$#2.base| .cse11)) (.cse13 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_15| 24))) (let ((.cse10 (select .cse12 .cse13))) (and (not (= .cse10 0)) (not (= .cse11 .cse10)) (= .cse12 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse11 v_DerPreprocessor_11) .cse10 v_arrayElimArr_10) .cse11) .cse13 .cse10))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_16| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_15| Int)) (let ((.cse14 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_16|))) (and (= (select .cse14 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_15| 24)) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_16|) (not (= 0 |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_16|)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int)) (= (select .cse14 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_16|)))))) (or (exists ((v_arrayElimArr_10 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_28| Int) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse16 (select v_arrayElimArr_10 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|))) (let ((.cse15 (select |c_#memory_$Pointer$#2.base| .cse16)) (.cse18 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_28| 24))) (let ((.cse17 (select .cse15 .cse18))) (and (= .cse15 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse16 v_DerPreprocessor_11) .cse17 v_arrayElimArr_10) .cse16) .cse18 .cse17)) (not (= .cse16 .cse17)) (not (= .cse17 0))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_28| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41| Int)) (let ((.cse19 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int)) (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41| (select .cse19 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|))) (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41| (select .cse19 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_28| 24))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_17| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_18| Int)) (let ((.cse20 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_18|))) (and (= (select .cse20 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_17| 24)) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_18|) (not (= 0 |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_18|)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int)) (= (select .cse20 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_18|))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_17| Int) (v_arrayElimArr_10 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse22 (select v_arrayElimArr_10 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|))) (let ((.cse23 (select |c_#memory_$Pointer$#2.base| .cse22)) (.cse24 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_17| 24))) (let ((.cse21 (select .cse23 .cse24))) (and (not (= .cse21 .cse22)) (not (= .cse21 0)) (= .cse23 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse22 v_DerPreprocessor_11) .cse21 v_arrayElimArr_10) .cse22) .cse24 .cse21))))))))) is different from true [2025-03-08 18:11:41,961 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((v_arrayElimArr_10 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_29| Int) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse1 (select v_arrayElimArr_10 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|))) (let ((.cse3 (select |c_#memory_$Pointer$#2.base| .cse1)) (.cse2 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_29| 24))) (let ((.cse0 (select .cse3 .cse2))) (and (not (= .cse0 0)) (not (= .cse1 .cse0)) (= (store (select (store (store |c_#memory_$Pointer$#2.base| .cse1 v_DerPreprocessor_11) .cse0 v_arrayElimArr_10) .cse1) .cse2 .cse0) .cse3)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_29| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_42| Int)) (let ((.cse4 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_42|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int)) (= (select .cse4 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_42|)) (not (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_42| 0)) (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_42| (select .cse4 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_29| 24))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_16| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_17| Int)) (let ((.cse5 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_17|))) (and (= (select .cse5 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_16| 24)) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_17|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int)) (= (select .cse5 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_17|)) (not (= 0 |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_17|))))) (exists ((v_arrayElimArr_10 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_16| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse6 (select v_arrayElimArr_10 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|))) (let ((.cse9 (select |c_#memory_$Pointer$#2.base| .cse6)) (.cse8 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_16| 24))) (let ((.cse7 (select .cse9 .cse8))) (and (= (store (select (store (store |c_#memory_$Pointer$#2.base| .cse6 v_DerPreprocessor_11) .cse7 v_arrayElimArr_10) .cse6) .cse8 .cse7) .cse9) (not (= .cse7 0)) (not (= .cse6 .cse7)))))))) (or (exists ((v_arrayElimArr_10 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_15| Int) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse11 (select v_arrayElimArr_10 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|))) (let ((.cse12 (select |c_#memory_$Pointer$#2.base| .cse11)) (.cse13 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_15| 24))) (let ((.cse10 (select .cse12 .cse13))) (and (not (= .cse10 0)) (not (= .cse11 .cse10)) (= .cse12 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse11 v_DerPreprocessor_11) .cse10 v_arrayElimArr_10) .cse11) .cse13 .cse10))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_16| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_15| Int)) (let ((.cse14 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_16|))) (and (= (select .cse14 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_15| 24)) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_16|) (not (= 0 |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_16|)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int)) (= (select .cse14 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_16|)))))) (or (exists ((v_arrayElimArr_10 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_28| Int) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse16 (select v_arrayElimArr_10 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|))) (let ((.cse15 (select |c_#memory_$Pointer$#2.base| .cse16)) (.cse18 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_28| 24))) (let ((.cse17 (select .cse15 .cse18))) (and (= .cse15 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse16 v_DerPreprocessor_11) .cse17 v_arrayElimArr_10) .cse16) .cse18 .cse17)) (not (= .cse16 .cse17)) (not (= .cse17 0))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_28| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41| Int)) (let ((.cse19 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41| 0)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int)) (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41| (select .cse19 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|))) (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41| (select .cse19 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_28| 24))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_17| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_18| Int)) (let ((.cse20 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_18|))) (and (= (select .cse20 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_17| 24)) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_18|) (not (= 0 |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_18|)) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int)) (= (select .cse20 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_18|))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_17| Int) (v_arrayElimArr_10 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20| Int) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse22 (select v_arrayElimArr_10 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_20|))) (let ((.cse23 (select |c_#memory_$Pointer$#2.base| .cse22)) (.cse24 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_17| 24))) (let ((.cse21 (select .cse23 .cse24))) (and (not (= .cse21 .cse22)) (not (= .cse21 0)) (= .cse23 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse22 v_DerPreprocessor_11) .cse21 v_arrayElimArr_10) .cse22) .cse24 .cse21)))))))) (= 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)))) is different from true [2025-03-08 18:11:42,146 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 38 not checked. [2025-03-08 18:11:42,146 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 18:11:42,322 INFO L349 Elim1Store]: treesize reduction 19, result has 62.0 percent of original size [2025-03-08 18:11:42,322 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 198 treesize of output 185 [2025-03-08 18:11:42,333 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 18:11:42,333 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-03-08 18:11:42,337 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-03-08 18:11:42,365 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-03-08 18:11:42,374 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-03-08 18:11:42,380 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 18:11:42,381 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 24 treesize of output 28 [2025-03-08 18:11:42,387 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 18:11:42,388 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 37 treesize of output 41 [2025-03-08 18:11:42,406 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-08 18:11:42,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [736620040] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 18:11:42,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-08 18:11:42,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [7, 19] total 30 [2025-03-08 18:11:42,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810160707] [2025-03-08 18:11:42,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:11:42,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 18:11:42,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:11:42,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 18:11:42,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=209, Unknown=25, NotChecked=574, Total=870 [2025-03-08 18:11:42,407 INFO L87 Difference]: Start difference. First operand 187 states and 238 transitions. Second operand has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 5 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-08 18:11:42,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:11:42,625 INFO L93 Difference]: Finished difference Result 330 states and 429 transitions. [2025-03-08 18:11:42,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 18:11:42,625 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 5 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Word has length 83 [2025-03-08 18:11:42,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:11:42,627 INFO L225 Difference]: With dead ends: 330 [2025-03-08 18:11:42,627 INFO L226 Difference]: Without dead ends: 197 [2025-03-08 18:11:42,627 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=296, Unknown=26, NotChecked=658, Total=1056 [2025-03-08 18:11:42,628 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 61 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 18:11:42,628 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 428 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 18:11:42,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2025-03-08 18:11:42,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 193. [2025-03-08 18:11:42,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 150 states have (on average 1.2733333333333334) internal successors, (191), 154 states have internal predecessors, (191), 26 states have call successors, (26), 14 states have call predecessors, (26), 16 states have return successors, (27), 24 states have call predecessors, (27), 24 states have call successors, (27) [2025-03-08 18:11:42,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 244 transitions. [2025-03-08 18:11:42,647 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 244 transitions. Word has length 83 [2025-03-08 18:11:42,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:11:42,648 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 244 transitions. [2025-03-08 18:11:42,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 5 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-08 18:11:42,648 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 244 transitions. [2025-03-08 18:11:42,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-08 18:11:42,649 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:11:42,650 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 18:11:42,657 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-08 18:11:42,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-08 18:11:42,854 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:11:42,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:11:42,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1916471952, now seen corresponding path program 1 times [2025-03-08 18:11:42,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:11:42,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190098587] [2025-03-08 18:11:42,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:11:42,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:11:42,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-08 18:11:42,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-08 18:11:42,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:11:42,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:11:43,155 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-03-08 18:11:43,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:11:43,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190098587] [2025-03-08 18:11:43,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190098587] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 18:11:43,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [58214922] [2025-03-08 18:11:43,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:11:43,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:11:43,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 18:11:43,158 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 18:11:43,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-08 18:11:43,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-08 18:11:43,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-08 18:11:43,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:11:43,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:11:43,325 INFO L256 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-03-08 18:11:43,328 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 18:11:43,370 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 24 treesize of output 9 [2025-03-08 18:11:43,378 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 18 treesize of output 19 [2025-03-08 18:11:43,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:11:43,411 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 0 case distinctions, treesize of input 26 treesize of output 28 [2025-03-08 18:11:43,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:11:43,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:11:43,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 40 [2025-03-08 18:11:43,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:11:43,422 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 34 treesize of output 25 [2025-03-08 18:11:43,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:11:43,431 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 18 treesize of output 13 [2025-03-08 18:11:43,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:11:43,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 52 [2025-03-08 18:11:43,469 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 14 treesize of output 13 [2025-03-08 18:11:43,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:11:43,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:11:43,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:11:43,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:11:43,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 35 [2025-03-08 18:11:43,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:11:43,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 35 [2025-03-08 18:11:43,484 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 11 treesize of output 3 [2025-03-08 18:11:43,486 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 24 treesize of output 13 [2025-03-08 18:11:46,799 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 45 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 18:11:46,799 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 18:11:47,007 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 24)) (.cse2 (+ 8 |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|))) (and (forall ((|ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| Int) (v_ArrVal_994 Int)) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|) |ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| v_ArrVal_994)))) (store .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 |ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset|))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse2) 0)) (forall ((|ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| Int) (v_ArrVal_995 Int) (v_ArrVal_998 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_998) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|) |ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|)) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_ArrVal_995)) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse2) 0)))) is different from false [2025-03-08 18:11:47,015 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 18:11:47,016 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 1 case distinctions, treesize of input 92 treesize of output 96 [2025-03-08 18:11:47,022 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 18:11:47,023 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 1 case distinctions, treesize of input 89 treesize of output 90 [2025-03-08 18:11:47,034 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-03-08 18:11:47,089 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 24)) (.cse2 (+ 8 |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_29| Int)) (or (forall ((v_arrayElimArr_16 (Array Int Int)) (v_subst_3 Int)) (= (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| 0)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_29| v_arrayElimArr_16))) (store .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_subst_3))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse2) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_29| 1)))) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_29| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_29| 1)) (forall ((v_arrayElimArr_15 (Array Int Int)) (v_subst_4 Int)) (or (not (= |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (select v_arrayElimArr_15 v_subst_4))) (forall ((v_ArrVal_995 Int) (v_ArrVal_998 (Array Int Int)) (v_ArrVal_991 Int)) (= (select (select (let ((.cse3 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| v_ArrVal_991)))) (store (store .cse3 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_29| v_ArrVal_998) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select (store .cse3 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_29| v_arrayElimArr_15) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_ArrVal_995))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse2) 0)))))))) is different from false [2025-03-08 18:11:47,100 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 18:11:47,101 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 18:11:47,147 INFO L349 Elim1Store]: treesize reduction 88, result has 44.7 percent of original size [2025-03-08 18:11:47,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 303 treesize of output 290 [2025-03-08 18:11:47,159 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 18:11:47,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 226 treesize of output 226 [2025-03-08 18:11:47,173 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 18:11:47,173 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 193 treesize of output 194 [2025-03-08 18:11:47,179 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 183 treesize of output 179 [2025-03-08 18:11:47,196 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 18:11:47,197 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 18:11:47,253 INFO L349 Elim1Store]: treesize reduction 88, result has 44.7 percent of original size [2025-03-08 18:11:47,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 251 treesize of output 280 [2025-03-08 18:11:47,266 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 18:11:47,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 318 treesize of output 314 [2025-03-08 18:11:47,275 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 267 treesize of output 255 [2025-03-08 18:11:47,647 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-03-08 18:11:47,839 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 18:11:47,840 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 78 treesize of output 74 [2025-03-08 18:11:47,862 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 18:11:47,863 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 18:11:47,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2025-03-08 18:11:47,901 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 10 proven. 11 refuted. 0 times theorem prover too weak. 25 trivial. 1 not checked. [2025-03-08 18:11:47,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [58214922] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 18:11:47,902 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 18:11:47,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 12, 11] total 26 [2025-03-08 18:11:47,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708646622] [2025-03-08 18:11:47,902 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 18:11:47,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-08 18:11:47,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:11:47,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-08 18:11:47,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=483, Unknown=3, NotChecked=90, Total=650 [2025-03-08 18:11:47,903 INFO L87 Difference]: Start difference. First operand 193 states and 244 transitions. Second operand has 26 states, 23 states have (on average 5.304347826086956) internal successors, (122), 25 states have internal predecessors, (122), 10 states have call successors, (22), 3 states have call predecessors, (22), 7 states have return successors, (21), 8 states have call predecessors, (21), 10 states have call successors, (21) [2025-03-08 18:11:49,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:11:49,445 INFO L93 Difference]: Finished difference Result 443 states and 565 transitions. [2025-03-08 18:11:49,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-08 18:11:49,445 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 5.304347826086956) internal successors, (122), 25 states have internal predecessors, (122), 10 states have call successors, (22), 3 states have call predecessors, (22), 7 states have return successors, (21), 8 states have call predecessors, (21), 10 states have call successors, (21) Word has length 83 [2025-03-08 18:11:49,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:11:49,446 INFO L225 Difference]: With dead ends: 443 [2025-03-08 18:11:49,446 INFO L226 Difference]: Without dead ends: 224 [2025-03-08 18:11:49,448 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 146 SyntacticMatches, 5 SemanticMatches, 43 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=221, Invalid=1590, Unknown=3, NotChecked=166, Total=1980 [2025-03-08 18:11:49,448 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 100 mSDsluCounter, 1224 mSDsCounter, 0 mSdLazyCounter, 979 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 1317 SdHoareTripleChecker+Invalid, 1365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 979 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 321 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 18:11:49,448 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 1317 Invalid, 1365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 979 Invalid, 0 Unknown, 321 Unchecked, 0.9s Time] [2025-03-08 18:11:49,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2025-03-08 18:11:49,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 206. [2025-03-08 18:11:49,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 161 states have (on average 1.2484472049689441) internal successors, (201), 166 states have internal predecessors, (201), 26 states have call successors, (26), 15 states have call predecessors, (26), 18 states have return successors, (30), 24 states have call predecessors, (30), 24 states have call successors, (30) [2025-03-08 18:11:49,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 257 transitions. [2025-03-08 18:11:49,471 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 257 transitions. Word has length 83 [2025-03-08 18:11:49,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:11:49,471 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 257 transitions. [2025-03-08 18:11:49,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 5.304347826086956) internal successors, (122), 25 states have internal predecessors, (122), 10 states have call successors, (22), 3 states have call predecessors, (22), 7 states have return successors, (21), 8 states have call predecessors, (21), 10 states have call successors, (21) [2025-03-08 18:11:49,471 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 257 transitions. [2025-03-08 18:11:49,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-08 18:11:49,472 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:11:49,472 INFO L218 NwaCegarLoop]: trace histogram [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-03-08 18:11:49,479 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-08 18:11:49,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-08 18:11:49,673 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:11:49,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:11:49,673 INFO L85 PathProgramCache]: Analyzing trace with hash -1113844778, now seen corresponding path program 1 times [2025-03-08 18:11:49,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:11:49,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61395495] [2025-03-08 18:11:49,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:11:49,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:11:49,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-08 18:11:49,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-08 18:11:49,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:11:49,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:11:49,889 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-03-08 18:11:49,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:11:49,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61395495] [2025-03-08 18:11:49,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61395495] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 18:11:49,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2023346923] [2025-03-08 18:11:49,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:11:49,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:11:49,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 18:11:49,892 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 18:11:49,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-08 18:11:50,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-08 18:11:50,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-08 18:11:50,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:11:50,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:11:50,070 INFO L256 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-03-08 18:11:50,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 18:11:50,133 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-03-08 18:11:50,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:11:50,137 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-08 18:11:50,175 INFO L349 Elim1Store]: treesize reduction 56, result has 8.2 percent of original size [2025-03-08 18:11:50,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 60 treesize of output 61 [2025-03-08 18:11:50,180 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 24 treesize of output 23 [2025-03-08 18:11:50,250 WARN L873 $PredicateComparison]: unable to prove that (exists ((v_DerPreprocessor_13 Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_44| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_32| Int) (v_DerPreprocessor_15 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_57| Int) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_57| v_DerPreprocessor_14) v_DerPreprocessor_13 v_DerPreprocessor_15))) (let ((.cse2 (select .cse4 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_57|))) (let ((.cse0 (select .cse2 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_44|))) (and (= v_DerPreprocessor_13 .cse0) (<= (+ 2 .cse0) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_57|) (let ((.cse1 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_57|))) (= .cse1 (let ((.cse3 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_44| 24))) (store .cse2 .cse3 (select .cse1 .cse3))))) (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_57| (select (select .cse4 .cse0) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_32|)) (not (= .cse0 0))))))) is different from true [2025-03-08 18:11:50,497 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((v_DerPreprocessor_13 Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_44| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_32| Int) (v_DerPreprocessor_15 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_57| Int) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_57| v_DerPreprocessor_14) v_DerPreprocessor_13 v_DerPreprocessor_15))) (let ((.cse2 (select .cse4 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_57|))) (let ((.cse0 (select .cse2 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_44|))) (and (= v_DerPreprocessor_13 .cse0) (<= (+ 2 .cse0) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_57|) (let ((.cse1 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_57|))) (= .cse1 (let ((.cse3 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_44| 24))) (store .cse2 .cse3 (select .cse1 .cse3))))) (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_57| (select (select .cse4 .cse0) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_32|)) (not (= .cse0 0))))))) (exists ((v_DerPreprocessor_13 Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_32| Int) (v_DerPreprocessor_15 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse9 (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base| v_DerPreprocessor_14) v_DerPreprocessor_13 v_DerPreprocessor_15))) (let ((.cse7 (select .cse9 |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|))) (let ((.cse5 (select .cse7 |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|))) (and (= v_DerPreprocessor_13 .cse5) (let ((.cse6 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|))) (= .cse6 (let ((.cse8 (+ |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset| 24))) (store .cse7 .cse8 (select .cse6 .cse8))))) (= |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base| (select (select .cse9 .cse5) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_32|)) (<= (+ 2 .cse5) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) (not (= .cse5 0)))))))) is different from true [2025-03-08 18:11:50,521 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((v_DerPreprocessor_13 Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_32| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_58| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_45| Int) (v_DerPreprocessor_15 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_58| v_DerPreprocessor_14) v_DerPreprocessor_13 v_DerPreprocessor_15))) (let ((.cse2 (select .cse1 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_58|))) (let ((.cse0 (select .cse2 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_45|))) (and (= .cse0 v_DerPreprocessor_13) (<= (+ .cse0 2) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_58|) (not (= .cse0 0)) (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_58| (select (select .cse1 .cse0) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_32|)) (let ((.cse4 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_58|))) (= (let ((.cse3 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_45| 24))) (store .cse2 .cse3 (select .cse4 .cse3))) .cse4))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_44| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_33| Int) (v_DerPreprocessor_16 Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_57| Int) (v_DerPreprocessor_17 (Array Int Int)) (v_DerPreprocessor_18 (Array Int Int))) (let ((.cse9 (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_57| v_DerPreprocessor_18) v_DerPreprocessor_16 v_DerPreprocessor_17))) (let ((.cse7 (select .cse9 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_57|))) (let ((.cse5 (select .cse7 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_44|))) (and (= .cse5 v_DerPreprocessor_16) (not (= .cse5 0)) (<= (+ .cse5 2) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_57|) (let ((.cse6 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_57|))) (= .cse6 (let ((.cse8 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_44| 24))) (store .cse7 .cse8 (select .cse6 .cse8))))) (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_57| (select (select .cse9 .cse5) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_33|)))))))) is different from true [2025-03-08 18:11:50,756 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_35| Int) (v_DerPreprocessor_22 Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_58| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_45| Int) (v_DerPreprocessor_23 (Array Int Int)) (v_DerPreprocessor_24 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_58| v_DerPreprocessor_24) v_DerPreprocessor_22 v_DerPreprocessor_23))) (let ((.cse2 (select .cse0 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_58|))) (let ((.cse1 (select .cse2 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_45|))) (and (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_58| (select (select .cse0 .cse1) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_35|)) (let ((.cse4 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_58|))) (= (let ((.cse3 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_45| 24))) (store .cse2 .cse3 (select .cse4 .cse3))) .cse4)) (= v_DerPreprocessor_22 .cse1) (not (= .cse1 0)) (<= (+ 2 .cse1) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_58|)))))) (exists ((v_DerPreprocessor_20 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_34| Int) (v_DerPreprocessor_21 (Array Int Int)) (v_DerPreprocessor_19 Int)) (let ((.cse9 (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base| v_DerPreprocessor_21) v_DerPreprocessor_19 v_DerPreprocessor_20))) (let ((.cse5 (select .cse9 |c_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base|))) (let ((.cse8 (select .cse5 |c_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset|))) (and (let ((.cse7 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base|))) (= (let ((.cse6 (+ |c_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset| 24))) (store .cse5 .cse6 (select .cse7 .cse6))) .cse7)) (= .cse8 v_DerPreprocessor_19) (= (select (select .cse9 .cse8) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_34|) |c_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base|) (not (= .cse8 0)) (<= (+ .cse8 2) |c_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base|)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_44| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_33| Int) (v_DerPreprocessor_16 Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_57| Int) (v_DerPreprocessor_17 (Array Int Int)) (v_DerPreprocessor_18 (Array Int Int))) (let ((.cse14 (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_57| v_DerPreprocessor_18) v_DerPreprocessor_16 v_DerPreprocessor_17))) (let ((.cse12 (select .cse14 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_57|))) (let ((.cse10 (select .cse12 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_44|))) (and (= .cse10 v_DerPreprocessor_16) (not (= .cse10 0)) (<= (+ .cse10 2) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_57|) (let ((.cse11 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_57|))) (= .cse11 (let ((.cse13 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_44| 24))) (store .cse12 .cse13 (select .cse11 .cse13))))) (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_57| (select (select .cse14 .cse10) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_33|))))))) (exists ((v_DerPreprocessor_13 Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_32| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_59| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_46| Int) (v_DerPreprocessor_15 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse16 (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_59| v_DerPreprocessor_14) v_DerPreprocessor_13 v_DerPreprocessor_15))) (let ((.cse18 (select .cse16 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_59|))) (let ((.cse15 (select .cse18 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_46|))) (and (= v_DerPreprocessor_13 .cse15) (= (select (select .cse16 .cse15) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_32|) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_59|) (<= (+ 2 .cse15) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_59|) (let ((.cse17 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_59|))) (= .cse17 (let ((.cse19 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_46| 24))) (store .cse18 .cse19 (select .cse17 .cse19))))) (not (= .cse15 0)))))))) is different from true [2025-03-08 18:11:50,801 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_35| Int) (v_DerPreprocessor_22 Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_58| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_45| Int) (v_DerPreprocessor_23 (Array Int Int)) (v_DerPreprocessor_24 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_58| v_DerPreprocessor_24) v_DerPreprocessor_22 v_DerPreprocessor_23))) (let ((.cse2 (select .cse0 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_58|))) (let ((.cse1 (select .cse2 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_45|))) (and (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_58| (select (select .cse0 .cse1) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_35|)) (let ((.cse4 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_58|))) (= (let ((.cse3 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_45| 24))) (store .cse2 .cse3 (select .cse4 .cse3))) .cse4)) (= v_DerPreprocessor_22 .cse1) (not (= .cse1 0)) (<= (+ 2 .cse1) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_58|)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_44| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_33| Int) (v_DerPreprocessor_16 Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_57| Int) (v_DerPreprocessor_17 (Array Int Int)) (v_DerPreprocessor_18 (Array Int Int))) (let ((.cse9 (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_57| v_DerPreprocessor_18) v_DerPreprocessor_16 v_DerPreprocessor_17))) (let ((.cse7 (select .cse9 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_57|))) (let ((.cse5 (select .cse7 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_44|))) (and (= .cse5 v_DerPreprocessor_16) (not (= .cse5 0)) (<= (+ .cse5 2) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_57|) (let ((.cse6 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_57|))) (= .cse6 (let ((.cse8 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_44| 24))) (store .cse7 .cse8 (select .cse6 .cse8))))) (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_57| (select (select .cse9 .cse5) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_33|))))))) (exists ((v_DerPreprocessor_20 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_34| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_24| Int) (v_DerPreprocessor_21 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_23| Int) (v_DerPreprocessor_19 Int)) (let ((.cse14 (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_24| v_DerPreprocessor_21) v_DerPreprocessor_19 v_DerPreprocessor_20))) (let ((.cse11 (select .cse14 |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_24|))) (let ((.cse10 (select .cse11 |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_23|))) (and (not (= .cse10 0)) (let ((.cse13 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_24|))) (= (let ((.cse12 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_23| 24))) (store .cse11 .cse12 (select .cse13 .cse12))) .cse13)) (= v_DerPreprocessor_19 .cse10) (<= (+ 2 .cse10) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_24|) (= (select (select .cse14 .cse10) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_34|) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_24|)))))) (exists ((v_DerPreprocessor_13 Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_32| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_59| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_46| Int) (v_DerPreprocessor_15 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse16 (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_59| v_DerPreprocessor_14) v_DerPreprocessor_13 v_DerPreprocessor_15))) (let ((.cse18 (select .cse16 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_59|))) (let ((.cse15 (select .cse18 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_46|))) (and (= v_DerPreprocessor_13 .cse15) (= (select (select .cse16 .cse15) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_32|) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_59|) (<= (+ 2 .cse15) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_59|) (let ((.cse17 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_59|))) (= .cse17 (let ((.cse19 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_46| 24))) (store .cse18 .cse19 (select .cse17 .cse19))))) (not (= .cse15 0)))))))) is different from true [2025-03-08 18:11:51,296 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_35| Int) (v_DerPreprocessor_22 Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_58| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_45| Int) (v_DerPreprocessor_23 (Array Int Int)) (v_DerPreprocessor_24 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_58| v_DerPreprocessor_24) v_DerPreprocessor_22 v_DerPreprocessor_23))) (let ((.cse2 (select .cse0 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_58|))) (let ((.cse1 (select .cse2 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_45|))) (and (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_58| (select (select .cse0 .cse1) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_35|)) (let ((.cse4 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_58|))) (= (let ((.cse3 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_45| 24))) (store .cse2 .cse3 (select .cse4 .cse3))) .cse4)) (= v_DerPreprocessor_22 .cse1) (not (= .cse1 0)) (<= (+ 2 .cse1) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_58|)))))) (exists ((v_DerPreprocessor_20 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_34| Int) (v_DerPreprocessor_21 (Array Int Int)) (v_DerPreprocessor_19 Int)) (let ((.cse9 (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base| v_DerPreprocessor_21) v_DerPreprocessor_19 v_DerPreprocessor_20))) (let ((.cse5 (select .cse9 |c_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base|))) (let ((.cse8 (select .cse5 |c_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset|))) (and (let ((.cse7 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base|))) (= (let ((.cse6 (+ |c_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset| 24))) (store .cse5 .cse6 (select .cse7 .cse6))) .cse7)) (= .cse8 v_DerPreprocessor_19) (= (select (select .cse9 .cse8) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_34|) |c_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base|) (not (= .cse8 0)) (<= (+ .cse8 2) |c_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base|)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_44| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_33| Int) (v_DerPreprocessor_16 Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_57| Int) (v_DerPreprocessor_17 (Array Int Int)) (v_DerPreprocessor_18 (Array Int Int))) (let ((.cse14 (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_57| v_DerPreprocessor_18) v_DerPreprocessor_16 v_DerPreprocessor_17))) (let ((.cse12 (select .cse14 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_57|))) (let ((.cse10 (select .cse12 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_44|))) (and (= .cse10 v_DerPreprocessor_16) (not (= .cse10 0)) (<= (+ .cse10 2) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_57|) (let ((.cse11 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_57|))) (= .cse11 (let ((.cse13 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_44| 24))) (store .cse12 .cse13 (select .cse11 .cse13))))) (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_57| (select (select .cse14 .cse10) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_33|))))))) (exists ((v_DerPreprocessor_20 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_34| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_24| Int) (v_DerPreprocessor_21 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_23| Int) (v_DerPreprocessor_19 Int)) (let ((.cse19 (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_24| v_DerPreprocessor_21) v_DerPreprocessor_19 v_DerPreprocessor_20))) (let ((.cse16 (select .cse19 |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_24|))) (let ((.cse15 (select .cse16 |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_23|))) (and (not (= .cse15 0)) (let ((.cse18 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_24|))) (= (let ((.cse17 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_23| 24))) (store .cse16 .cse17 (select .cse18 .cse17))) .cse18)) (= v_DerPreprocessor_19 .cse15) (<= (+ 2 .cse15) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_24|) (= (select (select .cse19 .cse15) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_34|) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_24|)))))) (exists ((v_DerPreprocessor_13 Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_32| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_59| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_46| Int) (v_DerPreprocessor_15 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse21 (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_59| v_DerPreprocessor_14) v_DerPreprocessor_13 v_DerPreprocessor_15))) (let ((.cse23 (select .cse21 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_59|))) (let ((.cse20 (select .cse23 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_46|))) (and (= v_DerPreprocessor_13 .cse20) (= (select (select .cse21 .cse20) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_32|) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_59|) (<= (+ 2 .cse20) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_59|) (let ((.cse22 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_59|))) (= .cse22 (let ((.cse24 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_46| 24))) (store .cse23 .cse24 (select .cse22 .cse24))))) (not (= .cse20 0)))))))) is different from true [2025-03-08 18:11:51,353 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_36| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_24| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_23| Int) (v_DerPreprocessor_27 Int) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_25 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_24| v_DerPreprocessor_26) v_DerPreprocessor_27 v_DerPreprocessor_25))) (let ((.cse2 (select .cse1 |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_24|))) (let ((.cse0 (select .cse2 |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_23|))) (and (<= (+ .cse0 2) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_24|) (not (= .cse0 0)) (= (select (select .cse1 .cse0) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_36|) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_24|) (= .cse0 v_DerPreprocessor_27) (let ((.cse4 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_24|))) (= (let ((.cse3 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_23| 24))) (store .cse2 .cse3 (select .cse4 .cse3))) .cse4))))))) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_35| Int) (v_DerPreprocessor_22 Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_58| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_45| Int) (v_DerPreprocessor_23 (Array Int Int)) (v_DerPreprocessor_24 (Array Int Int))) (let ((.cse5 (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_58| v_DerPreprocessor_24) v_DerPreprocessor_22 v_DerPreprocessor_23))) (let ((.cse7 (select .cse5 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_58|))) (let ((.cse6 (select .cse7 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_45|))) (and (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_58| (select (select .cse5 .cse6) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_35|)) (let ((.cse9 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_58|))) (= (let ((.cse8 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_45| 24))) (store .cse7 .cse8 (select .cse9 .cse8))) .cse9)) (= v_DerPreprocessor_22 .cse6) (not (= .cse6 0)) (<= (+ 2 .cse6) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_58|)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_44| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_33| Int) (v_DerPreprocessor_16 Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_57| Int) (v_DerPreprocessor_17 (Array Int Int)) (v_DerPreprocessor_18 (Array Int Int))) (let ((.cse14 (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_57| v_DerPreprocessor_18) v_DerPreprocessor_16 v_DerPreprocessor_17))) (let ((.cse12 (select .cse14 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_57|))) (let ((.cse10 (select .cse12 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_44|))) (and (= .cse10 v_DerPreprocessor_16) (not (= .cse10 0)) (<= (+ .cse10 2) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_57|) (let ((.cse11 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_57|))) (= .cse11 (let ((.cse13 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_44| 24))) (store .cse12 .cse13 (select .cse11 .cse13))))) (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_57| (select (select .cse14 .cse10) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_33|))))))) (exists ((v_DerPreprocessor_20 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_34| Int) (v_DerPreprocessor_21 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_24| Int) (v_DerPreprocessor_19 Int)) (let ((.cse19 (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_25| v_DerPreprocessor_21) v_DerPreprocessor_19 v_DerPreprocessor_20))) (let ((.cse16 (select .cse19 |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_25|))) (let ((.cse18 (select .cse16 |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_24|))) (and (let ((.cse15 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_25|))) (= .cse15 (let ((.cse17 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_24| 24))) (store .cse16 .cse17 (select .cse15 .cse17))))) (not (= .cse18 0)) (= (select (select .cse19 .cse18) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_34|) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_25|) (<= (+ 2 .cse18) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_25|) (= v_DerPreprocessor_19 .cse18)))))) (exists ((v_DerPreprocessor_13 Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_32| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_59| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_46| Int) (v_DerPreprocessor_15 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse21 (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_59| v_DerPreprocessor_14) v_DerPreprocessor_13 v_DerPreprocessor_15))) (let ((.cse23 (select .cse21 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_59|))) (let ((.cse20 (select .cse23 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_46|))) (and (= v_DerPreprocessor_13 .cse20) (= (select (select .cse21 .cse20) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_32|) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_59|) (<= (+ 2 .cse20) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_59|) (let ((.cse22 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_59|))) (= .cse22 (let ((.cse24 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_46| 24))) (store .cse23 .cse24 (select .cse22 .cse24))))) (not (= .cse20 0)))))))) is different from true [2025-03-08 18:11:51,564 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_36| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_24| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_23| Int) (v_DerPreprocessor_27 Int) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_25 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_24| v_DerPreprocessor_26) v_DerPreprocessor_27 v_DerPreprocessor_25))) (let ((.cse2 (select .cse1 |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_24|))) (let ((.cse0 (select .cse2 |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_23|))) (and (<= (+ .cse0 2) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_24|) (not (= .cse0 0)) (= (select (select .cse1 .cse0) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_36|) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_24|) (= .cse0 v_DerPreprocessor_27) (let ((.cse4 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_24|))) (= (let ((.cse3 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_23| 24))) (store .cse2 .cse3 (select .cse4 .cse3))) .cse4))))))) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_35| Int) (v_DerPreprocessor_22 Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_58| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_45| Int) (v_DerPreprocessor_23 (Array Int Int)) (v_DerPreprocessor_24 (Array Int Int))) (let ((.cse5 (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_58| v_DerPreprocessor_24) v_DerPreprocessor_22 v_DerPreprocessor_23))) (let ((.cse7 (select .cse5 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_58|))) (let ((.cse6 (select .cse7 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_45|))) (and (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_58| (select (select .cse5 .cse6) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_35|)) (let ((.cse9 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_58|))) (= (let ((.cse8 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_45| 24))) (store .cse7 .cse8 (select .cse9 .cse8))) .cse9)) (= v_DerPreprocessor_22 .cse6) (not (= .cse6 0)) (<= (+ 2 .cse6) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_58|)))))) (exists ((v_DerPreprocessor_20 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_34| Int) (v_DerPreprocessor_21 (Array Int Int)) (v_DerPreprocessor_19 Int)) (let ((.cse14 (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base| v_DerPreprocessor_21) v_DerPreprocessor_19 v_DerPreprocessor_20))) (let ((.cse10 (select .cse14 |c_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base|))) (let ((.cse13 (select .cse10 |c_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset|))) (and (let ((.cse12 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base|))) (= (let ((.cse11 (+ |c_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset| 24))) (store .cse10 .cse11 (select .cse12 .cse11))) .cse12)) (= .cse13 v_DerPreprocessor_19) (= (select (select .cse14 .cse13) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_34|) |c_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base|) (not (= .cse13 0)) (<= (+ .cse13 2) |c_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base|)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_44| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_33| Int) (v_DerPreprocessor_16 Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_57| Int) (v_DerPreprocessor_17 (Array Int Int)) (v_DerPreprocessor_18 (Array Int Int))) (let ((.cse19 (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_57| v_DerPreprocessor_18) v_DerPreprocessor_16 v_DerPreprocessor_17))) (let ((.cse17 (select .cse19 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_57|))) (let ((.cse15 (select .cse17 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_44|))) (and (= .cse15 v_DerPreprocessor_16) (not (= .cse15 0)) (<= (+ .cse15 2) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_57|) (let ((.cse16 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_57|))) (= .cse16 (let ((.cse18 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_44| 24))) (store .cse17 .cse18 (select .cse16 .cse18))))) (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_57| (select (select .cse19 .cse15) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_33|))))))) (exists ((v_DerPreprocessor_20 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_34| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_24| Int) (v_DerPreprocessor_21 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_23| Int) (v_DerPreprocessor_19 Int)) (let ((.cse24 (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_24| v_DerPreprocessor_21) v_DerPreprocessor_19 v_DerPreprocessor_20))) (let ((.cse21 (select .cse24 |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_24|))) (let ((.cse20 (select .cse21 |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_23|))) (and (not (= .cse20 0)) (let ((.cse23 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_24|))) (= (let ((.cse22 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_23| 24))) (store .cse21 .cse22 (select .cse23 .cse22))) .cse23)) (= v_DerPreprocessor_19 .cse20) (<= (+ 2 .cse20) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_24|) (= (select (select .cse24 .cse20) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_34|) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_24|)))))) (exists ((v_DerPreprocessor_20 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_34| Int) (v_DerPreprocessor_21 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_24| Int) (v_DerPreprocessor_19 Int)) (let ((.cse29 (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_25| v_DerPreprocessor_21) v_DerPreprocessor_19 v_DerPreprocessor_20))) (let ((.cse26 (select .cse29 |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_25|))) (let ((.cse28 (select .cse26 |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_24|))) (and (let ((.cse25 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_25|))) (= .cse25 (let ((.cse27 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_24| 24))) (store .cse26 .cse27 (select .cse25 .cse27))))) (not (= .cse28 0)) (= (select (select .cse29 .cse28) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_34|) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_25|) (<= (+ 2 .cse28) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_25|) (= v_DerPreprocessor_19 .cse28)))))) (exists ((v_DerPreprocessor_13 Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_32| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_59| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_46| Int) (v_DerPreprocessor_15 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse31 (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_59| v_DerPreprocessor_14) v_DerPreprocessor_13 v_DerPreprocessor_15))) (let ((.cse33 (select .cse31 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_59|))) (let ((.cse30 (select .cse33 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_46|))) (and (= v_DerPreprocessor_13 .cse30) (= (select (select .cse31 .cse30) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_32|) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_59|) (<= (+ 2 .cse30) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_59|) (let ((.cse32 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_59|))) (= .cse32 (let ((.cse34 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_46| 24))) (store .cse33 .cse34 (select .cse32 .cse34))))) (not (= .cse30 0)))))))) is different from true [2025-03-08 18:11:51,706 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_36| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_24| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_23| Int) (v_DerPreprocessor_27 Int) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_25 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_24| v_DerPreprocessor_26) v_DerPreprocessor_27 v_DerPreprocessor_25))) (let ((.cse2 (select .cse1 |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_24|))) (let ((.cse0 (select .cse2 |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_23|))) (and (<= (+ .cse0 2) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_24|) (not (= .cse0 0)) (= (select (select .cse1 .cse0) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_36|) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_24|) (= .cse0 v_DerPreprocessor_27) (let ((.cse4 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_24|))) (= (let ((.cse3 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_23| 24))) (store .cse2 .cse3 (select .cse4 .cse3))) .cse4))))))) (exists ((v_DerPreprocessor_33 Int) (v_DerPreprocessor_31 (Array Int Int)) (v_DerPreprocessor_32 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_27| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_26| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_38| Int)) (let ((.cse6 (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_27| v_DerPreprocessor_32) v_DerPreprocessor_33 v_DerPreprocessor_31))) (let ((.cse8 (select .cse6 |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_27|))) (let ((.cse5 (select .cse8 |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_26|))) (and (not (= .cse5 0)) (= (select (select .cse6 .cse5) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_38|) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_27|) (<= (+ 2 .cse5) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_27|) (let ((.cse7 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_27|))) (= .cse7 (let ((.cse9 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_26| 24))) (store .cse8 .cse9 (select .cse7 .cse9))))) (= v_DerPreprocessor_33 .cse5)))))) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_35| Int) (v_DerPreprocessor_22 Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_58| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_45| Int) (v_DerPreprocessor_23 (Array Int Int)) (v_DerPreprocessor_24 (Array Int Int))) (let ((.cse10 (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_58| v_DerPreprocessor_24) v_DerPreprocessor_22 v_DerPreprocessor_23))) (let ((.cse12 (select .cse10 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_58|))) (let ((.cse11 (select .cse12 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_45|))) (and (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_58| (select (select .cse10 .cse11) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_35|)) (let ((.cse14 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_58|))) (= (let ((.cse13 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_45| 24))) (store .cse12 .cse13 (select .cse14 .cse13))) .cse14)) (= v_DerPreprocessor_22 .cse11) (not (= .cse11 0)) (<= (+ 2 .cse11) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_58|)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_26| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_25| Int) (v_DerPreprocessor_28 (Array Int Int)) (v_DerPreprocessor_29 (Array Int Int)) (v_DerPreprocessor_30 Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_37| Int)) (let ((.cse19 (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_26| v_DerPreprocessor_29) v_DerPreprocessor_30 v_DerPreprocessor_28))) (let ((.cse17 (select .cse19 |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_26|))) (let ((.cse15 (select .cse17 |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_25|))) (and (not (= .cse15 0)) (let ((.cse16 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_26|))) (= .cse16 (let ((.cse18 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_25| 24))) (store .cse17 .cse18 (select .cse16 .cse18))))) (<= (+ .cse15 2) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_26|) (= v_DerPreprocessor_30 .cse15) (= (select (select .cse19 .cse15) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_37|) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_26|)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_44| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_33| Int) (v_DerPreprocessor_16 Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_57| Int) (v_DerPreprocessor_17 (Array Int Int)) (v_DerPreprocessor_18 (Array Int Int))) (let ((.cse24 (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_57| v_DerPreprocessor_18) v_DerPreprocessor_16 v_DerPreprocessor_17))) (let ((.cse22 (select .cse24 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_57|))) (let ((.cse20 (select .cse22 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_44|))) (and (= .cse20 v_DerPreprocessor_16) (not (= .cse20 0)) (<= (+ .cse20 2) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_57|) (let ((.cse21 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_57|))) (= .cse21 (let ((.cse23 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_44| 24))) (store .cse22 .cse23 (select .cse21 .cse23))))) (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_57| (select (select .cse24 .cse20) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_33|))))))) (exists ((v_DerPreprocessor_20 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_34| Int) (v_DerPreprocessor_21 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_24| Int) (v_DerPreprocessor_19 Int)) (let ((.cse29 (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_25| v_DerPreprocessor_21) v_DerPreprocessor_19 v_DerPreprocessor_20))) (let ((.cse26 (select .cse29 |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_25|))) (let ((.cse28 (select .cse26 |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_24|))) (and (let ((.cse25 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_25|))) (= .cse25 (let ((.cse27 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_24| 24))) (store .cse26 .cse27 (select .cse25 .cse27))))) (not (= .cse28 0)) (= (select (select .cse29 .cse28) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_34|) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_25|) (<= (+ 2 .cse28) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_25|) (= v_DerPreprocessor_19 .cse28)))))) (exists ((v_DerPreprocessor_13 Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_32| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_59| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_46| Int) (v_DerPreprocessor_15 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse31 (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_59| v_DerPreprocessor_14) v_DerPreprocessor_13 v_DerPreprocessor_15))) (let ((.cse33 (select .cse31 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_59|))) (let ((.cse30 (select .cse33 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_46|))) (and (= v_DerPreprocessor_13 .cse30) (= (select (select .cse31 .cse30) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_32|) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_59|) (<= (+ 2 .cse30) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_59|) (let ((.cse32 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_59|))) (= .cse32 (let ((.cse34 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_46| 24))) (store .cse33 .cse34 (select .cse32 .cse34))))) (not (= .cse30 0)))))))) is different from true [2025-03-08 18:11:53,913 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 38 not checked. [2025-03-08 18:11:53,913 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 18:11:54,300 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 18:11:54,300 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 1 case distinctions, treesize of input 43 treesize of output 36 [2025-03-08 18:11:54,315 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 18:11:54,315 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 159 treesize of output 161 [2025-03-08 18:11:54,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 332 treesize of output 324 [2025-03-08 18:11:54,326 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 196 treesize of output 194 [2025-03-08 18:11:54,365 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 24 treesize of output 22 [2025-03-08 18:11:54,370 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-03-08 18:11:54,382 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 18:11:54,382 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 62 treesize of output 60 [2025-03-08 18:11:54,557 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 21 proven. 1 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-08 18:11:54,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2023346923] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 18:11:54,557 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 18:11:54,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 20, 11] total 35 [2025-03-08 18:11:54,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058893261] [2025-03-08 18:11:54,557 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 18:11:54,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-03-08 18:11:54,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:11:54,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-03-08 18:11:54,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=560, Unknown=38, NotChecked=504, Total=1190 [2025-03-08 18:11:54,558 INFO L87 Difference]: Start difference. First operand 206 states and 257 transitions. Second operand has 35 states, 32 states have (on average 4.34375) internal successors, (139), 31 states have internal predecessors, (139), 13 states have call successors, (25), 7 states have call predecessors, (25), 8 states have return successors, (24), 12 states have call predecessors, (24), 13 states have call successors, (24) [2025-03-08 18:11:55,319 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= (select (select |c_#memory_$Pointer$#2.base| |c_aws_linked_list_is_valid_~list#1.base|) |c_aws_linked_list_is_valid_~list#1.offset|) 0)))) (and (or .cse0 (= (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|) 0)) (exists ((v_DerPreprocessor_13 Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_44| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_32| Int) (v_DerPreprocessor_15 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_57| Int) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse5 (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_57| v_DerPreprocessor_14) v_DerPreprocessor_13 v_DerPreprocessor_15))) (let ((.cse3 (select .cse5 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_57|))) (let ((.cse1 (select .cse3 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_44|))) (and (= v_DerPreprocessor_13 .cse1) (<= (+ 2 .cse1) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_57|) (let ((.cse2 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_57|))) (= .cse2 (let ((.cse4 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_44| 24))) (store .cse3 .cse4 (select .cse2 .cse4))))) (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_57| (select (select .cse5 .cse1) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_32|)) (not (= .cse1 0))))))) (or (not (= (select (select |c_#memory_$Pointer$#2.offset| |c_aws_linked_list_is_valid_~list#1.base|) |c_aws_linked_list_is_valid_~list#1.offset|) 0)) .cse0))) is different from true [2025-03-08 18:11:57,074 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base|))) (and (not (= (select .cse0 |c_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset|) 0)) (exists ((v_DerPreprocessor_13 Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_44| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_32| Int) (v_DerPreprocessor_15 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_57| Int) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse5 (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_57| v_DerPreprocessor_14) v_DerPreprocessor_13 v_DerPreprocessor_15))) (let ((.cse3 (select .cse5 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_57|))) (let ((.cse1 (select .cse3 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_44|))) (and (= v_DerPreprocessor_13 .cse1) (<= (+ 2 .cse1) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_57|) (let ((.cse2 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_57|))) (= .cse2 (let ((.cse4 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_44| 24))) (store .cse3 .cse4 (select .cse2 .cse4))))) (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_57| (select (select .cse5 .cse1) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_32|)) (not (= .cse1 0))))))) (exists ((v_DerPreprocessor_13 Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_32| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_58| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_45| Int) (v_DerPreprocessor_15 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse7 (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_58| v_DerPreprocessor_14) v_DerPreprocessor_13 v_DerPreprocessor_15))) (let ((.cse8 (select .cse7 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_58|))) (let ((.cse6 (select .cse8 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_45|))) (and (= .cse6 v_DerPreprocessor_13) (<= (+ .cse6 2) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_58|) (not (= .cse6 0)) (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_58| (select (select .cse7 .cse6) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_32|)) (let ((.cse10 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_58|))) (= (let ((.cse9 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_45| 24))) (store .cse8 .cse9 (select .cse10 .cse9))) .cse10))))))) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_35| Int) (v_DerPreprocessor_22 Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_58| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_45| Int) (v_DerPreprocessor_23 (Array Int Int)) (v_DerPreprocessor_24 (Array Int Int))) (let ((.cse11 (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_58| v_DerPreprocessor_24) v_DerPreprocessor_22 v_DerPreprocessor_23))) (let ((.cse13 (select .cse11 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_58|))) (let ((.cse12 (select .cse13 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_45|))) (and (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_58| (select (select .cse11 .cse12) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_35|)) (let ((.cse15 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_58|))) (= (let ((.cse14 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_45| 24))) (store .cse13 .cse14 (select .cse15 .cse14))) .cse15)) (= v_DerPreprocessor_22 .cse12) (not (= .cse12 0)) (<= (+ 2 .cse12) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_58|)))))) (exists ((v_DerPreprocessor_20 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_34| Int) (v_DerPreprocessor_21 (Array Int Int)) (v_DerPreprocessor_19 Int)) (let ((.cse19 (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base| v_DerPreprocessor_21) v_DerPreprocessor_19 v_DerPreprocessor_20))) (let ((.cse16 (select .cse19 |c_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base|))) (let ((.cse18 (select .cse16 |c_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset|))) (and (= (let ((.cse17 (+ |c_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset| 24))) (store .cse16 .cse17 (select .cse0 .cse17))) .cse0) (= .cse18 v_DerPreprocessor_19) (= (select (select .cse19 .cse18) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_34|) |c_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base|) (not (= .cse18 0)) (<= (+ .cse18 2) |c_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base|)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_44| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_33| Int) (v_DerPreprocessor_16 Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_57| Int) (v_DerPreprocessor_17 (Array Int Int)) (v_DerPreprocessor_18 (Array Int Int))) (let ((.cse24 (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_57| v_DerPreprocessor_18) v_DerPreprocessor_16 v_DerPreprocessor_17))) (let ((.cse22 (select .cse24 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_57|))) (let ((.cse20 (select .cse22 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_44|))) (and (= .cse20 v_DerPreprocessor_16) (not (= .cse20 0)) (<= (+ .cse20 2) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_57|) (let ((.cse21 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_57|))) (= .cse21 (let ((.cse23 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_44| 24))) (store .cse22 .cse23 (select .cse21 .cse23))))) (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_57| (select (select .cse24 .cse20) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_33|))))))) (exists ((v_DerPreprocessor_13 Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_32| Int) (v_DerPreprocessor_15 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse29 (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base| v_DerPreprocessor_14) v_DerPreprocessor_13 v_DerPreprocessor_15))) (let ((.cse27 (select .cse29 |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|))) (let ((.cse25 (select .cse27 |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|))) (and (= v_DerPreprocessor_13 .cse25) (let ((.cse26 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|))) (= .cse26 (let ((.cse28 (+ |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset| 24))) (store .cse27 .cse28 (select .cse26 .cse28))))) (= |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base| (select (select .cse29 .cse25) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_32|)) (<= (+ 2 .cse25) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) (not (= .cse25 0))))))) (exists ((v_DerPreprocessor_13 Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_32| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_59| Int) (|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_46| Int) (v_DerPreprocessor_15 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse31 (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_59| v_DerPreprocessor_14) v_DerPreprocessor_13 v_DerPreprocessor_15))) (let ((.cse33 (select .cse31 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_59|))) (let ((.cse30 (select .cse33 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_46|))) (and (= v_DerPreprocessor_13 .cse30) (= (select (select .cse31 .cse30) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_32|) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_59|) (<= (+ 2 .cse30) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_59|) (let ((.cse32 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_59|))) (= .cse32 (let ((.cse34 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_46| 24))) (store .cse33 .cse34 (select .cse32 .cse34))))) (not (= .cse30 0))))))))) is different from true [2025-03-08 18:12:05,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:12:05,278 INFO L93 Difference]: Finished difference Result 537 states and 715 transitions. [2025-03-08 18:12:05,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2025-03-08 18:12:05,279 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 32 states have (on average 4.34375) internal successors, (139), 31 states have internal predecessors, (139), 13 states have call successors, (25), 7 states have call predecessors, (25), 8 states have return successors, (24), 12 states have call predecessors, (24), 13 states have call successors, (24) Word has length 85 [2025-03-08 18:12:05,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:12:05,280 INFO L225 Difference]: With dead ends: 537 [2025-03-08 18:12:05,280 INFO L226 Difference]: Without dead ends: 332 [2025-03-08 18:12:05,282 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 578 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=284, Invalid=2790, Unknown=162, NotChecked=1320, Total=4556 [2025-03-08 18:12:05,282 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 112 mSDsluCounter, 1141 mSDsCounter, 0 mSdLazyCounter, 1465 mSolverCounterSat, 29 mSolverCounterUnsat, 177 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 1272 SdHoareTripleChecker+Invalid, 4611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1465 IncrementalHoareTripleChecker+Invalid, 177 IncrementalHoareTripleChecker+Unknown, 2940 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2025-03-08 18:12:05,282 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 1272 Invalid, 4611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1465 Invalid, 177 Unknown, 2940 Unchecked, 5.5s Time] [2025-03-08 18:12:05,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2025-03-08 18:12:05,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 308. [2025-03-08 18:12:05,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 237 states have (on average 1.2067510548523206) internal successors, (286), 244 states have internal predecessors, (286), 45 states have call successors, (45), 21 states have call predecessors, (45), 25 states have return successors, (57), 42 states have call predecessors, (57), 43 states have call successors, (57) [2025-03-08 18:12:05,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 388 transitions. [2025-03-08 18:12:05,319 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 388 transitions. Word has length 85 [2025-03-08 18:12:05,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:12:05,319 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 388 transitions. [2025-03-08 18:12:05,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 32 states have (on average 4.34375) internal successors, (139), 31 states have internal predecessors, (139), 13 states have call successors, (25), 7 states have call predecessors, (25), 8 states have return successors, (24), 12 states have call predecessors, (24), 13 states have call successors, (24) [2025-03-08 18:12:05,320 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 388 transitions. [2025-03-08 18:12:05,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-08 18:12:05,321 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:12:05,321 INFO L218 NwaCegarLoop]: trace histogram [3, 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] [2025-03-08 18:12:05,328 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-08 18:12:05,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:12:05,521 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:12:05,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:12:05,522 INFO L85 PathProgramCache]: Analyzing trace with hash -1484919617, now seen corresponding path program 1 times [2025-03-08 18:12:05,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:12:05,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916406288] [2025-03-08 18:12:05,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:12:05,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:12:05,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-08 18:12:05,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-08 18:12:05,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:12:05,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:12:05,622 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-03-08 18:12:05,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:12:05,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916406288] [2025-03-08 18:12:05,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916406288] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 18:12:05,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [312829766] [2025-03-08 18:12:05,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:12:05,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:12:05,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 18:12:05,627 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 18:12:05,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-08 18:12:05,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-08 18:12:05,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-08 18:12:05,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:12:05,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:12:05,802 INFO L256 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-08 18:12:05,804 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 18:12:05,870 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-08 18:12:05,870 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 18:12:05,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [312829766] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:12:05,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 18:12:05,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [7] total 13 [2025-03-08 18:12:05,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437238233] [2025-03-08 18:12:05,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:12:05,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 18:12:05,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:12:05,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 18:12:05,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-03-08 18:12:05,871 INFO L87 Difference]: Start difference. First operand 308 states and 388 transitions. Second operand has 8 states, 7 states have (on average 9.428571428571429) internal successors, (66), 8 states have internal predecessors, (66), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-08 18:12:06,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:12:06,049 INFO L93 Difference]: Finished difference Result 470 states and 590 transitions. [2025-03-08 18:12:06,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 18:12:06,050 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 9.428571428571429) internal successors, (66), 8 states have internal predecessors, (66), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) Word has length 87 [2025-03-08 18:12:06,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:12:06,052 INFO L225 Difference]: With dead ends: 470 [2025-03-08 18:12:06,052 INFO L226 Difference]: Without dead ends: 316 [2025-03-08 18:12:06,052 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 85 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-03-08 18:12:06,053 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 91 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 18:12:06,053 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 304 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 18:12:06,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2025-03-08 18:12:06,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 302. [2025-03-08 18:12:06,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 233 states have (on average 1.1931330472103003) internal successors, (278), 238 states have internal predecessors, (278), 45 states have call successors, (45), 21 states have call predecessors, (45), 23 states have return successors, (52), 42 states have call predecessors, (52), 43 states have call successors, (52) [2025-03-08 18:12:06,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 375 transitions. [2025-03-08 18:12:06,090 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 375 transitions. Word has length 87 [2025-03-08 18:12:06,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:12:06,090 INFO L471 AbstractCegarLoop]: Abstraction has 302 states and 375 transitions. [2025-03-08 18:12:06,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 9.428571428571429) internal successors, (66), 8 states have internal predecessors, (66), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-08 18:12:06,091 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 375 transitions. [2025-03-08 18:12:06,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-08 18:12:06,092 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:12:06,092 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 18:12:06,101 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-08 18:12:06,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-08 18:12:06,292 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:12:06,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:12:06,293 INFO L85 PathProgramCache]: Analyzing trace with hash 1942251993, now seen corresponding path program 1 times [2025-03-08 18:12:06,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:12:06,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350054443] [2025-03-08 18:12:06,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:12:06,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:12:06,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-08 18:12:06,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-08 18:12:06,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:12:06,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:12:06,545 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2025-03-08 18:12:06,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:12:06,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350054443] [2025-03-08 18:12:06,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350054443] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 18:12:06,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [994884049] [2025-03-08 18:12:06,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:12:06,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:12:06,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 18:12:06,547 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 18:12:06,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-08 18:12:06,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-08 18:12:06,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-08 18:12:06,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:12:06,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:12:06,736 INFO L256 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-08 18:12:06,738 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 18:12:06,761 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-08 18:12:06,761 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 18:12:06,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [994884049] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:12:06,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 18:12:06,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 9 [2025-03-08 18:12:06,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147413191] [2025-03-08 18:12:06,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:12:06,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 18:12:06,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:12:06,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 18:12:06,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 18:12:06,762 INFO L87 Difference]: Start difference. First operand 302 states and 375 transitions. Second operand has 7 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-08 18:12:06,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:12:06,841 INFO L93 Difference]: Finished difference Result 442 states and 557 transitions. [2025-03-08 18:12:06,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 18:12:06,842 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 109 [2025-03-08 18:12:06,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:12:06,843 INFO L225 Difference]: With dead ends: 442 [2025-03-08 18:12:06,843 INFO L226 Difference]: Without dead ends: 294 [2025-03-08 18:12:06,844 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 18:12:06,844 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 0 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 18:12:06,844 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 434 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 18:12:06,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2025-03-08 18:12:06,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 287. [2025-03-08 18:12:06,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 222 states have (on average 1.1846846846846846) internal successors, (263), 227 states have internal predecessors, (263), 43 states have call successors, (43), 19 states have call predecessors, (43), 21 states have return successors, (48), 40 states have call predecessors, (48), 41 states have call successors, (48) [2025-03-08 18:12:06,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 354 transitions. [2025-03-08 18:12:06,878 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 354 transitions. Word has length 109 [2025-03-08 18:12:06,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:12:06,878 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 354 transitions. [2025-03-08 18:12:06,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-08 18:12:06,878 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 354 transitions. [2025-03-08 18:12:06,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-08 18:12:06,879 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:12:06,880 INFO L218 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 18:12:06,887 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-03-08 18:12:07,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-08 18:12:07,084 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:12:07,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:12:07,084 INFO L85 PathProgramCache]: Analyzing trace with hash -748756151, now seen corresponding path program 2 times [2025-03-08 18:12:07,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:12:07,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788939704] [2025-03-08 18:12:07,085 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 18:12:07,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:12:07,108 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 112 statements into 2 equivalence classes. [2025-03-08 18:12:07,147 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 112 of 112 statements. [2025-03-08 18:12:07,148 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 18:12:07,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:12:08,776 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 18 proven. 27 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-03-08 18:12:08,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:12:08,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788939704] [2025-03-08 18:12:08,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788939704] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 18:12:08,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1788295637] [2025-03-08 18:12:08,776 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 18:12:08,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:12:08,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 18:12:08,778 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 18:12:08,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-08 18:12:08,914 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 112 statements into 2 equivalence classes. [2025-03-08 18:12:08,965 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 112 of 112 statements. [2025-03-08 18:12:08,965 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 18:12:08,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:12:08,968 INFO L256 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 94 conjuncts are in the unsatisfiable core [2025-03-08 18:12:08,971 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 18:12:08,999 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 14 treesize of output 15 [2025-03-08 18:12:09,004 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 14 treesize of output 15 [2025-03-08 18:12:10,355 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-08 18:12:10,355 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 18:12:10,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1788295637] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:12:10,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 18:12:10,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [19] total 31 [2025-03-08 18:12:10,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084551480] [2025-03-08 18:12:10,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:12:10,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-08 18:12:10,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:12:10,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-08 18:12:10,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=842, Unknown=0, NotChecked=0, Total=930 [2025-03-08 18:12:10,357 INFO L87 Difference]: Start difference. First operand 287 states and 354 transitions. Second operand has 18 states, 18 states have (on average 3.6666666666666665) internal successors, (66), 17 states have internal predecessors, (66), 6 states have call successors, (10), 3 states have call predecessors, (10), 5 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) [2025-03-08 18:12:11,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:12:11,273 INFO L93 Difference]: Finished difference Result 347 states and 425 transitions. [2025-03-08 18:12:11,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 18:12:11,273 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.6666666666666665) internal successors, (66), 17 states have internal predecessors, (66), 6 states have call successors, (10), 3 states have call predecessors, (10), 5 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) Word has length 112 [2025-03-08 18:12:11,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:12:11,275 INFO L225 Difference]: With dead ends: 347 [2025-03-08 18:12:11,275 INFO L226 Difference]: Without dead ends: 296 [2025-03-08 18:12:11,275 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 103 SyntacticMatches, 10 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=125, Invalid=1065, Unknown=0, NotChecked=0, Total=1190 [2025-03-08 18:12:11,275 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 39 mSDsluCounter, 744 mSDsCounter, 0 mSdLazyCounter, 684 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 822 SdHoareTripleChecker+Invalid, 700 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 18:12:11,276 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 822 Invalid, 700 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 684 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 18:12:11,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2025-03-08 18:12:11,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 291. [2025-03-08 18:12:11,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 225 states have (on average 1.1822222222222223) internal successors, (266), 230 states have internal predecessors, (266), 43 states have call successors, (43), 19 states have call predecessors, (43), 22 states have return successors, (50), 41 states have call predecessors, (50), 41 states have call successors, (50) [2025-03-08 18:12:11,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 359 transitions. [2025-03-08 18:12:11,317 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 359 transitions. Word has length 112 [2025-03-08 18:12:11,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:12:11,318 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 359 transitions. [2025-03-08 18:12:11,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.6666666666666665) internal successors, (66), 17 states have internal predecessors, (66), 6 states have call successors, (10), 3 states have call predecessors, (10), 5 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) [2025-03-08 18:12:11,319 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 359 transitions. [2025-03-08 18:12:11,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-08 18:12:11,320 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:12:11,321 INFO L218 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-08 18:12:11,328 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-03-08 18:12:11,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-08 18:12:11,521 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:12:11,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:12:11,522 INFO L85 PathProgramCache]: Analyzing trace with hash -1803020729, now seen corresponding path program 1 times [2025-03-08 18:12:11,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:12:11,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636111105] [2025-03-08 18:12:11,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:12:11,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:12:11,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-08 18:12:11,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-08 18:12:11,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:12:11,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:12:11,987 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 6 proven. 60 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-08 18:12:11,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:12:11,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636111105] [2025-03-08 18:12:11,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636111105] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 18:12:11,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2063101448] [2025-03-08 18:12:11,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:12:11,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:12:11,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 18:12:11,990 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 18:12:11,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-08 18:12:12,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-08 18:12:12,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-08 18:12:12,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:12:12,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:12:12,166 INFO L256 TraceCheckSpWp]: Trace formula consists of 494 conjuncts, 69 conjuncts are in the unsatisfiable core [2025-03-08 18:12:12,169 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 18:12:12,191 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-03-08 18:12:12,864 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 57 proven. 34 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-08 18:12:12,865 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 18:12:13,544 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-03-08 18:12:13,546 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-03-08 18:12:13,549 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-03-08 18:12:13,610 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 30 proven. 43 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-08 18:12:13,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2063101448] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 18:12:13,611 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 18:12:13,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 20, 19] total 49 [2025-03-08 18:12:13,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622925477] [2025-03-08 18:12:13,611 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 18:12:13,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2025-03-08 18:12:13,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:12:13,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2025-03-08 18:12:13,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=2183, Unknown=0, NotChecked=0, Total=2352 [2025-03-08 18:12:13,612 INFO L87 Difference]: Start difference. First operand 291 states and 359 transitions. Second operand has 49 states, 48 states have (on average 3.8125) internal successors, (183), 46 states have internal predecessors, (183), 20 states have call successors, (30), 3 states have call predecessors, (30), 11 states have return successors, (29), 17 states have call predecessors, (29), 20 states have call successors, (29) [2025-03-08 18:12:17,659 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 18:12:21,698 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]