./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_linked_list_begin_harness_negated.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/aws-c-common/aws_linked_list_begin_harness_negated.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash cf0e38c8708298b6c669a06e84f1e143a32d8eb782624bd4425e7da323fbf6a8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 01:52:07,191 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 01:52:07,266 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-08 01:52:07,272 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 01:52:07,276 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 01:52:07,302 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 01:52:07,303 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 01:52:07,303 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 01:52:07,303 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 01:52:07,304 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 01:52:07,304 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 01:52:07,304 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 01:52:07,304 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 01:52:07,305 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 01:52:07,305 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 01:52:07,305 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 01:52:07,306 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 01:52:07,306 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 01:52:07,306 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 01:52:07,306 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 01:52:07,306 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 01:52:07,306 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 01:52:07,306 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 01:52:07,307 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 01:52:07,307 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 01:52:07,307 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 01:52:07,307 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 01:52:07,307 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 01:52:07,307 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 01:52:07,307 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 01:52:07,307 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 01:52:07,307 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 01:52:07,308 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 01:52:07,308 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 01:52:07,308 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 01:52:07,308 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 01:52:07,308 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 01:52:07,308 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 01:52:07,309 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 01:52:07,309 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 01:52:07,309 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> cf0e38c8708298b6c669a06e84f1e143a32d8eb782624bd4425e7da323fbf6a8 [2025-02-08 01:52:07,574 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 01:52:07,583 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 01:52:07,586 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 01:52:07,587 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 01:52:07,588 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 01:52:07,590 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_linked_list_begin_harness_negated.i [2025-02-08 01:52:08,887 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bc67b2b0a/f4ec2acc834a43938e99db46751c7c23/FLAG521985d49 [2025-02-08 01:52:09,335 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 01:52:09,336 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_begin_harness_negated.i [2025-02-08 01:52:09,370 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bc67b2b0a/f4ec2acc834a43938e99db46751c7c23/FLAG521985d49 [2025-02-08 01:52:09,450 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bc67b2b0a/f4ec2acc834a43938e99db46751c7c23 [2025-02-08 01:52:09,453 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 01:52:09,454 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 01:52:09,457 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 01:52:09,457 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 01:52:09,460 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 01:52:09,461 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:52:09" (1/1) ... [2025-02-08 01:52:09,462 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a9db794 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:52:09, skipping insertion in model container [2025-02-08 01:52:09,462 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:52:09" (1/1) ... [2025-02-08 01:52:09,539 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 01:52:09,776 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_begin_harness_negated.i[4495,4508] [2025-02-08 01:52:09,785 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_begin_harness_negated.i[4555,4568] [2025-02-08 01:52:10,347 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:52:10,348 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:52:10,348 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:52:10,349 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:52:10,350 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:52:10,360 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:52:10,361 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:52:10,362 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:52:10,363 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:52:10,364 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:52:10,365 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:52:10,365 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:52:10,366 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:52:10,764 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_begin_harness_negated.i[150686,150699] [2025-02-08 01:52:10,765 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 01:52:10,778 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 01:52:10,788 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_begin_harness_negated.i[4495,4508] [2025-02-08 01:52:10,789 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_begin_harness_negated.i[4555,4568] [2025-02-08 01:52:10,840 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:52:10,841 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:52:10,841 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:52:10,842 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:52:10,843 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:52:10,852 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:52:10,855 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:52:10,856 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:52:10,856 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:52:10,857 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:52:10,858 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:52:10,858 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:52:10,858 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:52:10,947 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_begin_harness_negated.i[150686,150699] [2025-02-08 01:52:10,947 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 01:52:11,111 INFO L204 MainTranslator]: Completed translation [2025-02-08 01:52:11,112 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:52:11 WrapperNode [2025-02-08 01:52:11,112 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 01:52:11,113 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 01:52:11,113 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 01:52:11,113 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 01:52:11,117 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:52:11" (1/1) ... [2025-02-08 01:52:11,164 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:52:11" (1/1) ... [2025-02-08 01:52:11,204 INFO L138 Inliner]: procedures = 668, calls = 1039, calls flagged for inlining = 53, calls inlined = 6, statements flattened = 137 [2025-02-08 01:52:11,205 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 01:52:11,205 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 01:52:11,205 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 01:52:11,205 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 01:52:11,213 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:52:11" (1/1) ... [2025-02-08 01:52:11,214 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:52:11" (1/1) ... [2025-02-08 01:52:11,217 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:52:11" (1/1) ... [2025-02-08 01:52:11,242 INFO L175 MemorySlicer]: Split 24 memory accesses to 3 slices as follows [2, 17, 5]. 71 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 0, 5]. The 6 writes are split as follows [0, 6, 0]. [2025-02-08 01:52:11,242 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:52:11" (1/1) ... [2025-02-08 01:52:11,242 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:52:11" (1/1) ... [2025-02-08 01:52:11,262 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:52:11" (1/1) ... [2025-02-08 01:52:11,263 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:52:11" (1/1) ... [2025-02-08 01:52:11,265 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:52:11" (1/1) ... [2025-02-08 01:52:11,274 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:52:11" (1/1) ... [2025-02-08 01:52:11,280 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 01:52:11,281 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 01:52:11,281 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 01:52:11,281 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 01:52:11,282 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:52:11" (1/1) ... [2025-02-08 01:52:11,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 01:52:11,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:52:11,315 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 01:52:11,317 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 01:52:11,335 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 01:52:11,335 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-08 01:52:11,335 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-08 01:52:11,335 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2025-02-08 01:52:11,336 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2025-02-08 01:52:11,336 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 01:52:11,336 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_is_valid [2025-02-08 01:52:11,336 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_is_valid [2025-02-08 01:52:11,336 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 01:52:11,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-08 01:52:11,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-08 01:52:11,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-08 01:52:11,336 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 01:52:11,336 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 01:52:11,336 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-08 01:52:11,336 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-08 01:52:11,337 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 01:52:11,337 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-08 01:52:11,337 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-08 01:52:11,337 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-08 01:52:11,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-08 01:52:11,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-08 01:52:11,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-02-08 01:52:11,337 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2025-02-08 01:52:11,337 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2025-02-08 01:52:11,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 01:52:11,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 01:52:11,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 01:52:11,536 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 01:52:11,538 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 01:52:11,595 INFO L1324 $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-02-08 01:52:11,605 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L266: havoc #t~nondet9; [2025-02-08 01:52:11,796 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4700-1: #t~ret311#1 := aws_linked_list_is_valid_deep_#res#1;havoc aws_linked_list_is_valid_deep_#t~ret322#1, aws_linked_list_is_valid_deep_#t~mem323#1.base, aws_linked_list_is_valid_deep_#t~mem323#1.offset, aws_linked_list_is_valid_deep_~list#1.base, aws_linked_list_is_valid_deep_~list#1.offset, aws_linked_list_is_valid_deep_~temp~0#1.base, aws_linked_list_is_valid_deep_~temp~0#1.offset, aws_linked_list_is_valid_deep_~head_reaches_tail~0#1;havoc aws_linked_list_is_valid_deep_#in~list#1.base, aws_linked_list_is_valid_deep_#in~list#1.offset;assume { :end_inline_aws_linked_list_is_valid_deep } true;#res#1 := (if 0 == #t~ret311#1 % 256 then 0 else 1);havoc #t~ret311#1; [2025-02-08 01:52:11,797 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4700: havoc #t~ret311#1; [2025-02-08 01:52:11,818 INFO L? ?]: Removed 50 outVars from TransFormulas that were not future-live. [2025-02-08 01:52:11,819 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 01:52:11,827 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 01:52:11,827 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 01:52:11,828 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:52:11 BoogieIcfgContainer [2025-02-08 01:52:11,828 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 01:52:11,830 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 01:52:11,830 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 01:52:11,834 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 01:52:11,834 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 01:52:09" (1/3) ... [2025-02-08 01:52:11,835 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20a1d4b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:52:11, skipping insertion in model container [2025-02-08 01:52:11,835 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:52:11" (2/3) ... [2025-02-08 01:52:11,835 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20a1d4b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:52:11, skipping insertion in model container [2025-02-08 01:52:11,835 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:52:11" (3/3) ... [2025-02-08 01:52:11,836 INFO L128 eAbstractionObserver]: Analyzing ICFG aws_linked_list_begin_harness_negated.i [2025-02-08 01:52:11,849 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 01:52:11,851 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG aws_linked_list_begin_harness_negated.i that has 6 procedures, 63 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-02-08 01:52:11,905 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 01:52:11,915 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;@3dad5ee3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 01:52:11,917 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-08 01:52:11,921 INFO L276 IsEmpty]: Start isEmpty. Operand has 63 states, 42 states have (on average 1.3571428571428572) internal successors, (57), 44 states have internal predecessors, (57), 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-02-08 01:52:11,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-02-08 01:52:11,930 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:52:11,931 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] [2025-02-08 01:52:11,931 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:52:11,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:52:11,938 INFO L85 PathProgramCache]: Analyzing trace with hash -1485045053, now seen corresponding path program 1 times [2025-02-08 01:52:11,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:52:11,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038818050] [2025-02-08 01:52:11,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:52:11,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:52:12,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-08 01:52:12,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-08 01:52:12,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:52:12,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:52:12,308 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-02-08 01:52:12,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:52:12,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038818050] [2025-02-08 01:52:12,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038818050] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:52:12,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1495377149] [2025-02-08 01:52:12,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:52:12,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:52:12,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:52:12,320 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 01:52:12,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 01:52:12,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-08 01:52:12,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-08 01:52:12,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:52:12,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:52:12,528 INFO L256 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-08 01:52:12,536 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:52:12,551 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-02-08 01:52:12,555 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 01:52:12,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1495377149] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:52:12,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 01:52:12,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-08 01:52:12,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384875260] [2025-02-08 01:52:12,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:52:12,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 01:52:12,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:52:12,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 01:52:12,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 01:52:12,589 INFO L87 Difference]: Start difference. First operand has 63 states, 42 states have (on average 1.3571428571428572) internal successors, (57), 44 states have internal predecessors, (57), 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 13.5) internal successors, (27), 2 states have internal predecessors, (27), 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-02-08 01:52:12,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:52:12,614 INFO L93 Difference]: Finished difference Result 119 states and 165 transitions. [2025-02-08 01:52:12,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 01:52:12,616 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 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 68 [2025-02-08 01:52:12,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:52:12,621 INFO L225 Difference]: With dead ends: 119 [2025-02-08 01:52:12,621 INFO L226 Difference]: Without dead ends: 46 [2025-02-08 01:52:12,624 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 69 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-02-08 01:52:12,628 INFO L435 NwaCegarLoop]: 81 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, 81 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-02-08 01:52:12,628 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 01:52:12,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-02-08 01:52:12,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2025-02-08 01:52:12,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 29 states have (on average 1.206896551724138) internal successors, (35), 30 states have internal predecessors, (35), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-08 01:52:12,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 58 transitions. [2025-02-08 01:52:12,660 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 58 transitions. Word has length 68 [2025-02-08 01:52:12,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:52:12,660 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 58 transitions. [2025-02-08 01:52:12,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 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-02-08 01:52:12,661 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 58 transitions. [2025-02-08 01:52:12,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-02-08 01:52:12,664 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:52:12,664 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] [2025-02-08 01:52:12,673 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-08 01:52:12,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-08 01:52:12,865 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:52:12,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:52:12,866 INFO L85 PathProgramCache]: Analyzing trace with hash 288797826, now seen corresponding path program 1 times [2025-02-08 01:52:12,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:52:12,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346085944] [2025-02-08 01:52:12,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:52:12,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:52:12,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-08 01:52:12,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-08 01:52:12,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:52:12,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:52:13,644 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-02-08 01:52:13,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:52:13,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346085944] [2025-02-08 01:52:13,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346085944] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:52:13,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:52:13,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 01:52:13,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376225418] [2025-02-08 01:52:13,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:52:13,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 01:52:13,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:52:13,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 01:52:13,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 01:52:13,646 INFO L87 Difference]: Start difference. First operand 46 states and 58 transitions. Second operand has 6 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2025-02-08 01:52:13,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:52:13,704 INFO L93 Difference]: Finished difference Result 52 states and 63 transitions. [2025-02-08 01:52:13,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 01:52:13,705 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 68 [2025-02-08 01:52:13,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:52:13,706 INFO L225 Difference]: With dead ends: 52 [2025-02-08 01:52:13,706 INFO L226 Difference]: Without dead ends: 50 [2025-02-08 01:52:13,707 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-08 01:52:13,707 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 3 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 01:52:13,708 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 265 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 01:52:13,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-02-08 01:52:13,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-02-08 01:52:13,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 32 states have (on average 1.1875) internal successors, (38), 33 states have internal predecessors, (38), 12 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-08 01:52:13,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 61 transitions. [2025-02-08 01:52:13,714 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 61 transitions. Word has length 68 [2025-02-08 01:52:13,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:52:13,716 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 61 transitions. [2025-02-08 01:52:13,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2025-02-08 01:52:13,716 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 61 transitions. [2025-02-08 01:52:13,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-02-08 01:52:13,718 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:52:13,718 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-08 01:52:13,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 01:52:13,718 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:52:13,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:52:13,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1707368470, now seen corresponding path program 1 times [2025-02-08 01:52:13,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:52:13,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911852167] [2025-02-08 01:52:13,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:52:13,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:52:13,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-08 01:52:13,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-08 01:52:13,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:52:13,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:52:14,231 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-02-08 01:52:14,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:52:14,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911852167] [2025-02-08 01:52:14,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911852167] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:52:14,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [445198748] [2025-02-08 01:52:14,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:52:14,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:52:14,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:52:14,236 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 01:52:14,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 01:52:14,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-08 01:52:14,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-08 01:52:14,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:52:14,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:52:14,439 INFO L256 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-02-08 01:52:14,447 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:52:14,554 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-02-08 01:52:14,577 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-02-08 01:52:14,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 01:52:14,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 01:52:14,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 01:52:14,670 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 41 treesize of output 47 [2025-02-08 01:52:14,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 01:52:14,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 01:52:14,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 01:52:14,716 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-02-08 01:52:15,690 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-08 01:52:15,690 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 01:52:15,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [445198748] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:52:15,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 01:52:15,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [6] total 13 [2025-02-08 01:52:15,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725607887] [2025-02-08 01:52:15,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:52:15,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 01:52:15,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:52:15,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 01:52:15,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-02-08 01:52:15,692 INFO L87 Difference]: Start difference. First operand 50 states and 61 transitions. Second operand has 9 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2025-02-08 01:52:16,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:52:16,260 INFO L93 Difference]: Finished difference Result 136 states and 168 transitions. [2025-02-08 01:52:16,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 01:52:16,261 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) Word has length 74 [2025-02-08 01:52:16,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:52:16,264 INFO L225 Difference]: With dead ends: 136 [2025-02-08 01:52:16,264 INFO L226 Difference]: Without dead ends: 96 [2025-02-08 01:52:16,265 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2025-02-08 01:52:16,265 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 26 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 01:52:16,265 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 248 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 01:52:16,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-02-08 01:52:16,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2025-02-08 01:52:16,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 61 states have (on average 1.1967213114754098) internal successors, (73), 64 states have internal predecessors, (73), 22 states have call successors, (22), 9 states have call predecessors, (22), 10 states have return successors, (22), 20 states have call predecessors, (22), 20 states have call successors, (22) [2025-02-08 01:52:16,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 117 transitions. [2025-02-08 01:52:16,286 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 117 transitions. Word has length 74 [2025-02-08 01:52:16,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:52:16,288 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 117 transitions. [2025-02-08 01:52:16,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2025-02-08 01:52:16,288 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 117 transitions. [2025-02-08 01:52:16,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-02-08 01:52:16,290 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:52:16,290 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-08 01:52:16,299 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-08 01:52:16,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:52:16,495 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:52:16,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:52:16,496 INFO L85 PathProgramCache]: Analyzing trace with hash -218164841, now seen corresponding path program 1 times [2025-02-08 01:52:16,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:52:16,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783312414] [2025-02-08 01:52:16,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:52:16,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:52:16,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-08 01:52:16,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-08 01:52:16,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:52:16,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:52:16,817 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-02-08 01:52:16,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:52:16,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783312414] [2025-02-08 01:52:16,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783312414] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:52:16,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [436659769] [2025-02-08 01:52:16,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:52:16,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:52:16,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:52:16,822 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 01:52:16,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 01:52:16,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-08 01:52:16,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-08 01:52:16,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:52:16,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:52:16,995 INFO L256 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-02-08 01:52:16,999 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:52:17,029 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-02-08 01:52:17,043 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-02-08 01:52:17,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 01:52:17,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 01:52:17,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 01:52:17,090 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 41 treesize of output 47 [2025-02-08 01:52:17,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 01:52:17,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 01:52:17,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 01:52:17,118 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-02-08 01:52:18,851 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-02-08 01:52:18,851 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 01:52:18,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [436659769] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:52:18,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 01:52:18,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2025-02-08 01:52:18,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846312141] [2025-02-08 01:52:18,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:52:18,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 01:52:18,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:52:18,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 01:52:18,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-02-08 01:52:18,853 INFO L87 Difference]: Start difference. First operand 94 states and 117 transitions. Second operand has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-02-08 01:52:19,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:52:19,460 INFO L93 Difference]: Finished difference Result 137 states and 165 transitions. [2025-02-08 01:52:19,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 01:52:19,460 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 74 [2025-02-08 01:52:19,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:52:19,462 INFO L225 Difference]: With dead ends: 137 [2025-02-08 01:52:19,462 INFO L226 Difference]: Without dead ends: 92 [2025-02-08 01:52:19,462 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 59 SyntacticMatches, 8 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2025-02-08 01:52:19,463 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 31 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 01:52:19,463 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 258 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 01:52:19,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-02-08 01:52:19,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 90. [2025-02-08 01:52:19,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 58 states have (on average 1.1896551724137931) internal successors, (69), 60 states have internal predecessors, (69), 22 states have call successors, (22), 9 states have call predecessors, (22), 9 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-08 01:52:19,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 111 transitions. [2025-02-08 01:52:19,477 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 111 transitions. Word has length 74 [2025-02-08 01:52:19,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:52:19,477 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 111 transitions. [2025-02-08 01:52:19,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-02-08 01:52:19,478 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 111 transitions. [2025-02-08 01:52:19,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-02-08 01:52:19,479 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:52:19,479 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-08 01:52:19,488 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-08 01:52:19,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:52:19,683 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:52:19,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:52:19,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1980088329, now seen corresponding path program 1 times [2025-02-08 01:52:19,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:52:19,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974171856] [2025-02-08 01:52:19,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:52:19,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:52:19,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-08 01:52:19,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-08 01:52:19,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:52:19,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:52:20,094 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-02-08 01:52:20,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:52:20,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974171856] [2025-02-08 01:52:20,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974171856] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:52:20,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [665406336] [2025-02-08 01:52:20,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:52:20,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:52:20,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:52:20,097 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 01:52:20,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-08 01:52:20,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-08 01:52:20,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-08 01:52:20,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:52:20,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:52:20,251 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-02-08 01:52:20,254 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:52:20,316 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-02-08 01:52:20,328 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-02-08 01:52:20,352 INFO L349 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2025-02-08 01:52:20,353 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 16 treesize of output 17 [2025-02-08 01:52:20,441 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_10| Int) (v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int)) (let ((.cse0 (select v_arrayElimArr_2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|))) (let ((.cse2 (select |c_#memory_$Pointer$#1.base| .cse0)) (.cse3 (+ |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_10| 24))) (let ((.cse1 (select .cse2 .cse3))) (and (<= 2 .cse0) (not (= .cse0 .cse1)) (<= .cse0 .cse1) (= .cse2 (store (select (store (store |c_#memory_$Pointer$#1.base| .cse0 v_DerPreprocessor_1) .cse1 v_arrayElimArr_2) .cse0) .cse3 .cse1))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse4 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_10|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int)) (= (select .cse4 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|) |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_10|)) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_10| Int)) (= (select .cse4 (+ |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_10| 24)) |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_10|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_10|))))) is different from true [2025-02-08 01:52:20,924 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_10| Int) (v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int)) (let ((.cse0 (select v_arrayElimArr_2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|))) (let ((.cse2 (select |c_#memory_$Pointer$#1.base| .cse0)) (.cse3 (+ |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_10| 24))) (let ((.cse1 (select .cse2 .cse3))) (and (<= 2 .cse0) (not (= .cse0 .cse1)) (<= .cse0 .cse1) (= .cse2 (store (select (store (store |c_#memory_$Pointer$#1.base| .cse0 v_DerPreprocessor_1) .cse1 v_arrayElimArr_2) .cse0) .cse3 .cse1))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse4 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_10|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int)) (= (select .cse4 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|) |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_10|)) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_10| Int)) (= (select .cse4 (+ |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_10| 24)) |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_10|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_10|))))) (or (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_11| Int) (v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int)) (let ((.cse6 (select v_arrayElimArr_2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|))) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| .cse6)) (.cse8 (+ |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_11| 24))) (let ((.cse7 (select .cse5 .cse8))) (and (= .cse5 (store (select (store (store |c_#memory_$Pointer$#1.base| .cse6 v_DerPreprocessor_1) .cse7 v_arrayElimArr_2) .cse6) .cse8 .cse7)) (not (= .cse6 .cse7)) (<= 2 .cse6) (<= .cse6 .cse7)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_11| Int)) (let ((.cse9 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_11|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int)) (= (select .cse9 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|) |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_11|)) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_11| Int)) (= |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_11| (select .cse9 (+ |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_11| 24)))) (<= 2 |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_11|)))))) is different from true [2025-02-08 01:52:21,488 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_10| Int) (v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int)) (let ((.cse0 (select v_arrayElimArr_2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|))) (let ((.cse2 (select |c_#memory_$Pointer$#1.base| .cse0)) (.cse3 (+ |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_10| 24))) (let ((.cse1 (select .cse2 .cse3))) (and (<= 2 .cse0) (not (= .cse0 .cse1)) (<= .cse0 .cse1) (= .cse2 (store (select (store (store |c_#memory_$Pointer$#1.base| .cse0 v_DerPreprocessor_1) .cse1 v_arrayElimArr_2) .cse0) .cse3 .cse1))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse4 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_10|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int)) (= (select .cse4 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|) |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_10|)) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_10| Int)) (= (select .cse4 (+ |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_10| 24)) |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_10|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_10|))))) (or (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_11| Int) (v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int)) (let ((.cse6 (select v_arrayElimArr_2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|))) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| .cse6)) (.cse8 (+ |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_11| 24))) (let ((.cse7 (select .cse5 .cse8))) (and (= .cse5 (store (select (store (store |c_#memory_$Pointer$#1.base| .cse6 v_DerPreprocessor_1) .cse7 v_arrayElimArr_2) .cse6) .cse8 .cse7)) (not (= .cse6 .cse7)) (<= 2 .cse6) (<= .cse6 .cse7)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_11| Int)) (let ((.cse9 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_11|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int)) (= (select .cse9 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|) |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_11|)) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_11| Int)) (= |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_11| (select .cse9 (+ |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_11| 24)))) (<= 2 |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_11|))))) (or (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_begin_~list#1.offset_BEFORE_CALL_4| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int)) (let ((.cse10 (select v_arrayElimArr_2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|))) (let ((.cse13 (select |c_#memory_$Pointer$#1.base| .cse10)) (.cse12 (+ |v_ULTIMATE.start_aws_linked_list_begin_~list#1.offset_BEFORE_CALL_4| 24))) (let ((.cse11 (select .cse13 .cse12))) (and (<= 2 .cse10) (<= .cse10 .cse11) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse10 v_DerPreprocessor_1) .cse11 v_arrayElimArr_2) .cse10) .cse12 .cse11) .cse13) (not (= .cse11 .cse10))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_4| Int)) (let ((.cse14 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_4|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int)) (= (select .cse14 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|) |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_4|)) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_~list#1.offset_BEFORE_CALL_4| Int)) (= (select .cse14 (+ |v_ULTIMATE.start_aws_linked_list_begin_~list#1.offset_BEFORE_CALL_4| 24)) |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_4|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_4|)))))) is different from true [2025-02-08 01:52:22,264 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_10| Int) (v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int)) (let ((.cse0 (select v_arrayElimArr_2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|))) (let ((.cse2 (select |c_#memory_$Pointer$#1.base| .cse0)) (.cse3 (+ |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_10| 24))) (let ((.cse1 (select .cse2 .cse3))) (and (<= 2 .cse0) (not (= .cse0 .cse1)) (<= .cse0 .cse1) (= .cse2 (store (select (store (store |c_#memory_$Pointer$#1.base| .cse0 v_DerPreprocessor_1) .cse1 v_arrayElimArr_2) .cse0) .cse3 .cse1))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse4 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_10|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int)) (= (select .cse4 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|) |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_10|)) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_10| Int)) (= (select .cse4 (+ |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_10| 24)) |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_10|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_10|))))) (let ((.cse8 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_aws_linked_list_begin_~list#1.base|)) (.cse7 (+ |c_ULTIMATE.start_aws_linked_list_begin_~list#1.offset| 24))) (let ((.cse6 (select .cse8 .cse7))) (let ((.cse5 (= .cse6 |c_ULTIMATE.start_aws_linked_list_begin_~list#1.base|))) (or (and (not .cse5) (<= |c_ULTIMATE.start_aws_linked_list_begin_~list#1.base| .cse6) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int)) (and (= (select v_arrayElimArr_2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|) |c_ULTIMATE.start_aws_linked_list_begin_~list#1.base|) (= (store (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_aws_linked_list_begin_~list#1.base| v_DerPreprocessor_1) .cse6 v_arrayElimArr_2) |c_ULTIMATE.start_aws_linked_list_begin_~list#1.base|) .cse7 .cse6) .cse8)))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int)) (= |c_ULTIMATE.start_aws_linked_list_begin_~list#1.base| (select .cse8 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|))) .cse5))))) (<= 2 |c_ULTIMATE.start_aws_linked_list_begin_~list#1.base|) (or (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_11| Int) (v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int)) (let ((.cse10 (select v_arrayElimArr_2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|))) (let ((.cse9 (select |c_#memory_$Pointer$#1.base| .cse10)) (.cse12 (+ |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_11| 24))) (let ((.cse11 (select .cse9 .cse12))) (and (= .cse9 (store (select (store (store |c_#memory_$Pointer$#1.base| .cse10 v_DerPreprocessor_1) .cse11 v_arrayElimArr_2) .cse10) .cse12 .cse11)) (not (= .cse10 .cse11)) (<= 2 .cse10) (<= .cse10 .cse11)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_11| Int)) (let ((.cse13 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_11|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int)) (= (select .cse13 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|) |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_11|)) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_11| Int)) (= |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_11| (select .cse13 (+ |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_11| 24)))) (<= 2 |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_11|))))) (or (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_begin_~list#1.offset_BEFORE_CALL_4| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int)) (let ((.cse14 (select v_arrayElimArr_2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|))) (let ((.cse17 (select |c_#memory_$Pointer$#1.base| .cse14)) (.cse16 (+ |v_ULTIMATE.start_aws_linked_list_begin_~list#1.offset_BEFORE_CALL_4| 24))) (let ((.cse15 (select .cse17 .cse16))) (and (<= 2 .cse14) (<= .cse14 .cse15) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse14 v_DerPreprocessor_1) .cse15 v_arrayElimArr_2) .cse14) .cse16 .cse15) .cse17) (not (= .cse15 .cse14))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_4| Int)) (let ((.cse18 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_4|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int)) (= (select .cse18 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|) |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_4|)) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_~list#1.offset_BEFORE_CALL_4| Int)) (= (select .cse18 (+ |v_ULTIMATE.start_aws_linked_list_begin_~list#1.offset_BEFORE_CALL_4| 24)) |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_4|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_4|)))))) is different from true [2025-02-08 01:52:22,368 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_begin_~list#1.offset_BEFORE_CALL_5| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int)) (let ((.cse0 (select v_arrayElimArr_2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|))) (let ((.cse1 (select |c_#memory_$Pointer$#1.base| .cse0)) (.cse3 (+ |v_ULTIMATE.start_aws_linked_list_begin_~list#1.offset_BEFORE_CALL_5| 24))) (let ((.cse2 (select .cse1 .cse3))) (and (<= 2 .cse0) (= .cse1 (store (select (store (store |c_#memory_$Pointer$#1.base| .cse0 v_DerPreprocessor_1) .cse2 v_arrayElimArr_2) .cse0) .cse3 .cse2)) (not (= .cse2 .cse0)) (<= .cse0 .cse2)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_5| Int)) (let ((.cse4 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_5|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int)) (= |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_5| (select .cse4 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|))) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_~list#1.offset_BEFORE_CALL_5| Int)) (= (select .cse4 (+ |v_ULTIMATE.start_aws_linked_list_begin_~list#1.offset_BEFORE_CALL_5| 24)) |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_5|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_5|))))) (or (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_10| Int) (v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int)) (let ((.cse5 (select v_arrayElimArr_2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|))) (let ((.cse7 (select |c_#memory_$Pointer$#1.base| .cse5)) (.cse8 (+ |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_10| 24))) (let ((.cse6 (select .cse7 .cse8))) (and (<= 2 .cse5) (not (= .cse5 .cse6)) (<= .cse5 .cse6) (= .cse7 (store (select (store (store |c_#memory_$Pointer$#1.base| .cse5 v_DerPreprocessor_1) .cse6 v_arrayElimArr_2) .cse5) .cse8 .cse6))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse9 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_10|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int)) (= (select .cse9 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|) |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_10|)) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_10| Int)) (= (select .cse9 (+ |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_10| 24)) |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_10|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_10|))))) (or (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_11| Int) (v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int)) (let ((.cse11 (select v_arrayElimArr_2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|))) (let ((.cse10 (select |c_#memory_$Pointer$#1.base| .cse11)) (.cse13 (+ |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_11| 24))) (let ((.cse12 (select .cse10 .cse13))) (and (= .cse10 (store (select (store (store |c_#memory_$Pointer$#1.base| .cse11 v_DerPreprocessor_1) .cse12 v_arrayElimArr_2) .cse11) .cse13 .cse12)) (not (= .cse11 .cse12)) (<= 2 .cse11) (<= .cse11 .cse12)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_11| Int)) (let ((.cse14 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_11|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int)) (= (select .cse14 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|) |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_11|)) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_11| Int)) (= |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_11| (select .cse14 (+ |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_11| 24)))) (<= 2 |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_11|))))) (or (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_begin_~list#1.offset_BEFORE_CALL_4| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int)) (let ((.cse15 (select v_arrayElimArr_2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|))) (let ((.cse18 (select |c_#memory_$Pointer$#1.base| .cse15)) (.cse17 (+ |v_ULTIMATE.start_aws_linked_list_begin_~list#1.offset_BEFORE_CALL_4| 24))) (let ((.cse16 (select .cse18 .cse17))) (and (<= 2 .cse15) (<= .cse15 .cse16) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse15 v_DerPreprocessor_1) .cse16 v_arrayElimArr_2) .cse15) .cse17 .cse16) .cse18) (not (= .cse16 .cse15))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_4| Int)) (let ((.cse19 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_4|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int)) (= (select .cse19 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|) |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_4|)) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_~list#1.offset_BEFORE_CALL_4| Int)) (= (select .cse19 (+ |v_ULTIMATE.start_aws_linked_list_begin_~list#1.offset_BEFORE_CALL_4| 24)) |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_4|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_4|)))))) is different from true [2025-02-08 01:52:22,720 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_begin_~list#1.offset_BEFORE_CALL_5| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int)) (let ((.cse0 (select v_arrayElimArr_2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|))) (let ((.cse1 (select |c_#memory_$Pointer$#1.base| .cse0)) (.cse3 (+ |v_ULTIMATE.start_aws_linked_list_begin_~list#1.offset_BEFORE_CALL_5| 24))) (let ((.cse2 (select .cse1 .cse3))) (and (<= 2 .cse0) (= .cse1 (store (select (store (store |c_#memory_$Pointer$#1.base| .cse0 v_DerPreprocessor_1) .cse2 v_arrayElimArr_2) .cse0) .cse3 .cse2)) (not (= .cse2 .cse0)) (<= .cse0 .cse2)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_5| Int)) (let ((.cse4 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_5|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int)) (= |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_5| (select .cse4 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|))) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_~list#1.offset_BEFORE_CALL_5| Int)) (= (select .cse4 (+ |v_ULTIMATE.start_aws_linked_list_begin_~list#1.offset_BEFORE_CALL_5| 24)) |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_5|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_5|))))) (or (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_10| Int) (v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int)) (let ((.cse5 (select v_arrayElimArr_2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|))) (let ((.cse7 (select |c_#memory_$Pointer$#1.base| .cse5)) (.cse8 (+ |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_10| 24))) (let ((.cse6 (select .cse7 .cse8))) (and (<= 2 .cse5) (not (= .cse5 .cse6)) (<= .cse5 .cse6) (= .cse7 (store (select (store (store |c_#memory_$Pointer$#1.base| .cse5 v_DerPreprocessor_1) .cse6 v_arrayElimArr_2) .cse5) .cse8 .cse6))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse9 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_10|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int)) (= (select .cse9 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|) |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_10|)) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_10| Int)) (= (select .cse9 (+ |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_10| 24)) |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_10|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_10|))))) (let ((.cse13 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_aws_linked_list_begin_~list#1.base|)) (.cse12 (+ |c_ULTIMATE.start_aws_linked_list_begin_~list#1.offset| 24))) (let ((.cse11 (select .cse13 .cse12))) (let ((.cse10 (= .cse11 |c_ULTIMATE.start_aws_linked_list_begin_~list#1.base|))) (or (and (not .cse10) (<= |c_ULTIMATE.start_aws_linked_list_begin_~list#1.base| .cse11) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int)) (and (= (select v_arrayElimArr_2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|) |c_ULTIMATE.start_aws_linked_list_begin_~list#1.base|) (= (store (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_aws_linked_list_begin_~list#1.base| v_DerPreprocessor_1) .cse11 v_arrayElimArr_2) |c_ULTIMATE.start_aws_linked_list_begin_~list#1.base|) .cse12 .cse11) .cse13)))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int)) (= |c_ULTIMATE.start_aws_linked_list_begin_~list#1.base| (select .cse13 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|))) .cse10))))) (<= 2 |c_ULTIMATE.start_aws_linked_list_begin_~list#1.base|) (or (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_11| Int) (v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int)) (let ((.cse15 (select v_arrayElimArr_2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|))) (let ((.cse14 (select |c_#memory_$Pointer$#1.base| .cse15)) (.cse17 (+ |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_11| 24))) (let ((.cse16 (select .cse14 .cse17))) (and (= .cse14 (store (select (store (store |c_#memory_$Pointer$#1.base| .cse15 v_DerPreprocessor_1) .cse16 v_arrayElimArr_2) .cse15) .cse17 .cse16)) (not (= .cse15 .cse16)) (<= 2 .cse15) (<= .cse15 .cse16)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_11| Int)) (let ((.cse18 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_11|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int)) (= (select .cse18 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|) |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_11|)) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_11| Int)) (= |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_11| (select .cse18 (+ |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_11| 24)))) (<= 2 |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_11|))))) (or (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_begin_~list#1.offset_BEFORE_CALL_4| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int)) (let ((.cse19 (select v_arrayElimArr_2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|))) (let ((.cse22 (select |c_#memory_$Pointer$#1.base| .cse19)) (.cse21 (+ |v_ULTIMATE.start_aws_linked_list_begin_~list#1.offset_BEFORE_CALL_4| 24))) (let ((.cse20 (select .cse22 .cse21))) (and (<= 2 .cse19) (<= .cse19 .cse20) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse19 v_DerPreprocessor_1) .cse20 v_arrayElimArr_2) .cse19) .cse21 .cse20) .cse22) (not (= .cse20 .cse19))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_4| Int)) (let ((.cse23 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_4|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int)) (= (select .cse23 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|) |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_4|)) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_~list#1.offset_BEFORE_CALL_4| Int)) (= (select .cse23 (+ |v_ULTIMATE.start_aws_linked_list_begin_~list#1.offset_BEFORE_CALL_4| 24)) |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_4|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_4|)))))) is different from true [2025-02-08 01:52:22,979 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_begin_~list#1.offset_BEFORE_CALL_5| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int)) (let ((.cse0 (select v_arrayElimArr_2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|))) (let ((.cse1 (select |c_#memory_$Pointer$#1.base| .cse0)) (.cse3 (+ |v_ULTIMATE.start_aws_linked_list_begin_~list#1.offset_BEFORE_CALL_5| 24))) (let ((.cse2 (select .cse1 .cse3))) (and (<= 2 .cse0) (= .cse1 (store (select (store (store |c_#memory_$Pointer$#1.base| .cse0 v_DerPreprocessor_1) .cse2 v_arrayElimArr_2) .cse0) .cse3 .cse2)) (not (= .cse2 .cse0)) (<= .cse0 .cse2)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_5| Int)) (let ((.cse4 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_5|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int)) (= |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_5| (select .cse4 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|))) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_~list#1.offset_BEFORE_CALL_5| Int)) (= (select .cse4 (+ |v_ULTIMATE.start_aws_linked_list_begin_~list#1.offset_BEFORE_CALL_5| 24)) |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_5|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_5|))))) (or (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_10| Int) (v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int)) (let ((.cse5 (select v_arrayElimArr_2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|))) (let ((.cse7 (select |c_#memory_$Pointer$#1.base| .cse5)) (.cse8 (+ |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_10| 24))) (let ((.cse6 (select .cse7 .cse8))) (and (<= 2 .cse5) (not (= .cse5 .cse6)) (<= .cse5 .cse6) (= .cse7 (store (select (store (store |c_#memory_$Pointer$#1.base| .cse5 v_DerPreprocessor_1) .cse6 v_arrayElimArr_2) .cse5) .cse8 .cse6))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse9 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_10|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int)) (= (select .cse9 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|) |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_10|)) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_10| Int)) (= (select .cse9 (+ |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_10| 24)) |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_10|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_10|))))) (or (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_begin_~list#1.offset_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int)) (let ((.cse10 (select v_arrayElimArr_2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|))) (let ((.cse12 (select |c_#memory_$Pointer$#1.base| .cse10)) (.cse13 (+ |v_ULTIMATE.start_aws_linked_list_begin_~list#1.offset_BEFORE_CALL_6| 24))) (let ((.cse11 (select .cse12 .cse13))) (and (<= 2 .cse10) (not (= .cse10 .cse11)) (<= .cse10 .cse11) (= .cse12 (store (select (store (store |c_#memory_$Pointer$#1.base| .cse10 v_DerPreprocessor_1) .cse11 v_arrayElimArr_2) .cse10) .cse13 .cse11))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_6| Int)) (let ((.cse14 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_6|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int)) (= (select .cse14 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|) |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_6|)) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_~list#1.offset_BEFORE_CALL_6| Int)) (= (select .cse14 (+ |v_ULTIMATE.start_aws_linked_list_begin_~list#1.offset_BEFORE_CALL_6| 24)) |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_6|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_6|))))) (or (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_11| Int) (v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int)) (let ((.cse16 (select v_arrayElimArr_2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|))) (let ((.cse15 (select |c_#memory_$Pointer$#1.base| .cse16)) (.cse18 (+ |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_11| 24))) (let ((.cse17 (select .cse15 .cse18))) (and (= .cse15 (store (select (store (store |c_#memory_$Pointer$#1.base| .cse16 v_DerPreprocessor_1) .cse17 v_arrayElimArr_2) .cse16) .cse18 .cse17)) (not (= .cse16 .cse17)) (<= 2 .cse16) (<= .cse16 .cse17)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_11| Int)) (let ((.cse19 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_11|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int)) (= (select .cse19 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|) |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_11|)) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_11| Int)) (= |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_11| (select .cse19 (+ |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_11| 24)))) (<= 2 |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_11|))))) (or (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_begin_~list#1.offset_BEFORE_CALL_4| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int)) (let ((.cse20 (select v_arrayElimArr_2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|))) (let ((.cse23 (select |c_#memory_$Pointer$#1.base| .cse20)) (.cse22 (+ |v_ULTIMATE.start_aws_linked_list_begin_~list#1.offset_BEFORE_CALL_4| 24))) (let ((.cse21 (select .cse23 .cse22))) (and (<= 2 .cse20) (<= .cse20 .cse21) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse20 v_DerPreprocessor_1) .cse21 v_arrayElimArr_2) .cse20) .cse22 .cse21) .cse23) (not (= .cse21 .cse20))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_4| Int)) (let ((.cse24 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_4|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int)) (= (select .cse24 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|) |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_4|)) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_~list#1.offset_BEFORE_CALL_4| Int)) (= (select .cse24 (+ |v_ULTIMATE.start_aws_linked_list_begin_~list#1.offset_BEFORE_CALL_4| 24)) |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_4|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_4|)))))) is different from true [2025-02-08 01:52:23,917 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_begin_~list#1.offset_BEFORE_CALL_5| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int)) (let ((.cse0 (select v_arrayElimArr_2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|))) (let ((.cse1 (select |c_#memory_$Pointer$#1.base| .cse0)) (.cse3 (+ |v_ULTIMATE.start_aws_linked_list_begin_~list#1.offset_BEFORE_CALL_5| 24))) (let ((.cse2 (select .cse1 .cse3))) (and (<= 2 .cse0) (= .cse1 (store (select (store (store |c_#memory_$Pointer$#1.base| .cse0 v_DerPreprocessor_1) .cse2 v_arrayElimArr_2) .cse0) .cse3 .cse2)) (not (= .cse2 .cse0)) (<= .cse0 .cse2)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_5| Int)) (let ((.cse4 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_5|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int)) (= |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_5| (select .cse4 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|))) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_~list#1.offset_BEFORE_CALL_5| Int)) (= (select .cse4 (+ |v_ULTIMATE.start_aws_linked_list_begin_~list#1.offset_BEFORE_CALL_5| 24)) |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_5|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_5|))))) (or (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_10| Int) (v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int)) (let ((.cse5 (select v_arrayElimArr_2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|))) (let ((.cse7 (select |c_#memory_$Pointer$#1.base| .cse5)) (.cse8 (+ |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_10| 24))) (let ((.cse6 (select .cse7 .cse8))) (and (<= 2 .cse5) (not (= .cse5 .cse6)) (<= .cse5 .cse6) (= .cse7 (store (select (store (store |c_#memory_$Pointer$#1.base| .cse5 v_DerPreprocessor_1) .cse6 v_arrayElimArr_2) .cse5) .cse8 .cse6))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse9 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_10|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int)) (= (select .cse9 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|) |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_10|)) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_10| Int)) (= (select .cse9 (+ |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_10| 24)) |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_10|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_10|))))) (or (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_begin_~list#1.offset_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int)) (let ((.cse10 (select v_arrayElimArr_2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|))) (let ((.cse12 (select |c_#memory_$Pointer$#1.base| .cse10)) (.cse13 (+ |v_ULTIMATE.start_aws_linked_list_begin_~list#1.offset_BEFORE_CALL_6| 24))) (let ((.cse11 (select .cse12 .cse13))) (and (<= 2 .cse10) (not (= .cse10 .cse11)) (<= .cse10 .cse11) (= .cse12 (store (select (store (store |c_#memory_$Pointer$#1.base| .cse10 v_DerPreprocessor_1) .cse11 v_arrayElimArr_2) .cse10) .cse13 .cse11))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_6| Int)) (let ((.cse14 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_6|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int)) (= (select .cse14 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|) |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_6|)) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_~list#1.offset_BEFORE_CALL_6| Int)) (= (select .cse14 (+ |v_ULTIMATE.start_aws_linked_list_begin_~list#1.offset_BEFORE_CALL_6| 24)) |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_6|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_6|))))) (or |c_aws_linked_list_is_valid_#t~short308#1| (< (select (select |c_#memory_$Pointer$#1.base| |c_aws_linked_list_is_valid_#in~list#1.base|) (+ |c_aws_linked_list_is_valid_#in~list#1.offset| 24)) 1)) (or (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_11| Int) (v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int)) (let ((.cse16 (select v_arrayElimArr_2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|))) (let ((.cse15 (select |c_#memory_$Pointer$#1.base| .cse16)) (.cse18 (+ |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_11| 24))) (let ((.cse17 (select .cse15 .cse18))) (and (= .cse15 (store (select (store (store |c_#memory_$Pointer$#1.base| .cse16 v_DerPreprocessor_1) .cse17 v_arrayElimArr_2) .cse16) .cse18 .cse17)) (not (= .cse16 .cse17)) (<= 2 .cse16) (<= .cse16 .cse17)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_11| Int)) (let ((.cse19 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_11|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int)) (= (select .cse19 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|) |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_11|)) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_11| Int)) (= |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_11| (select .cse19 (+ |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_11| 24)))) (<= 2 |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_11|))))) (or (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_begin_~list#1.offset_BEFORE_CALL_4| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int)) (let ((.cse20 (select v_arrayElimArr_2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|))) (let ((.cse23 (select |c_#memory_$Pointer$#1.base| .cse20)) (.cse22 (+ |v_ULTIMATE.start_aws_linked_list_begin_~list#1.offset_BEFORE_CALL_4| 24))) (let ((.cse21 (select .cse23 .cse22))) (and (<= 2 .cse20) (<= .cse20 .cse21) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse20 v_DerPreprocessor_1) .cse21 v_arrayElimArr_2) .cse20) .cse22 .cse21) .cse23) (not (= .cse21 .cse20))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_4| Int)) (let ((.cse24 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_4|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int)) (= (select .cse24 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|) |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_4|)) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_~list#1.offset_BEFORE_CALL_4| Int)) (= (select .cse24 (+ |v_ULTIMATE.start_aws_linked_list_begin_~list#1.offset_BEFORE_CALL_4| 24)) |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_4|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_4|)))))) is different from true [2025-02-08 01:52:24,024 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_begin_~list#1.offset_BEFORE_CALL_5| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int)) (let ((.cse0 (select v_arrayElimArr_2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|))) (let ((.cse1 (select |c_#memory_$Pointer$#1.base| .cse0)) (.cse3 (+ |v_ULTIMATE.start_aws_linked_list_begin_~list#1.offset_BEFORE_CALL_5| 24))) (let ((.cse2 (select .cse1 .cse3))) (and (<= 2 .cse0) (= .cse1 (store (select (store (store |c_#memory_$Pointer$#1.base| .cse0 v_DerPreprocessor_1) .cse2 v_arrayElimArr_2) .cse0) .cse3 .cse2)) (not (= .cse2 .cse0)) (<= .cse0 .cse2)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_5| Int)) (let ((.cse4 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_5|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int)) (= |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_5| (select .cse4 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|))) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_~list#1.offset_BEFORE_CALL_5| Int)) (= (select .cse4 (+ |v_ULTIMATE.start_aws_linked_list_begin_~list#1.offset_BEFORE_CALL_5| 24)) |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_5|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_5|))))) (or (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_10| Int) (v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int)) (let ((.cse5 (select v_arrayElimArr_2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|))) (let ((.cse7 (select |c_#memory_$Pointer$#1.base| .cse5)) (.cse8 (+ |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_10| 24))) (let ((.cse6 (select .cse7 .cse8))) (and (<= 2 .cse5) (not (= .cse5 .cse6)) (<= .cse5 .cse6) (= .cse7 (store (select (store (store |c_#memory_$Pointer$#1.base| .cse5 v_DerPreprocessor_1) .cse6 v_arrayElimArr_2) .cse5) .cse8 .cse6))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse9 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_10|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int)) (= (select .cse9 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|) |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_10|)) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_10| Int)) (= (select .cse9 (+ |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_10| 24)) |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_10|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_10|))))) (or (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_begin_~list#1.offset_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int)) (let ((.cse10 (select v_arrayElimArr_2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|))) (let ((.cse12 (select |c_#memory_$Pointer$#1.base| .cse10)) (.cse13 (+ |v_ULTIMATE.start_aws_linked_list_begin_~list#1.offset_BEFORE_CALL_6| 24))) (let ((.cse11 (select .cse12 .cse13))) (and (<= 2 .cse10) (not (= .cse10 .cse11)) (<= .cse10 .cse11) (= .cse12 (store (select (store (store |c_#memory_$Pointer$#1.base| .cse10 v_DerPreprocessor_1) .cse11 v_arrayElimArr_2) .cse10) .cse13 .cse11))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_6| Int)) (let ((.cse14 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_6|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int)) (= (select .cse14 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|) |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_6|)) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_~list#1.offset_BEFORE_CALL_6| Int)) (= (select .cse14 (+ |v_ULTIMATE.start_aws_linked_list_begin_~list#1.offset_BEFORE_CALL_6| 24)) |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_6|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_6|))))) (or (< (select (select |c_#memory_$Pointer$#1.base| |c_aws_linked_list_is_valid_#in~list#1.base|) (+ |c_aws_linked_list_is_valid_#in~list#1.offset| 24)) 1) |c_aws_linked_list_is_valid_#t~short310#1|) (or (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_11| Int) (v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int)) (let ((.cse16 (select v_arrayElimArr_2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|))) (let ((.cse15 (select |c_#memory_$Pointer$#1.base| .cse16)) (.cse18 (+ |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_11| 24))) (let ((.cse17 (select .cse15 .cse18))) (and (= .cse15 (store (select (store (store |c_#memory_$Pointer$#1.base| .cse16 v_DerPreprocessor_1) .cse17 v_arrayElimArr_2) .cse16) .cse18 .cse17)) (not (= .cse16 .cse17)) (<= 2 .cse16) (<= .cse16 .cse17)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_11| Int)) (let ((.cse19 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_11|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int)) (= (select .cse19 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|) |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_11|)) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_11| Int)) (= |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_11| (select .cse19 (+ |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_11| 24)))) (<= 2 |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_11|))))) (or (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_begin_~list#1.offset_BEFORE_CALL_4| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int)) (let ((.cse20 (select v_arrayElimArr_2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|))) (let ((.cse23 (select |c_#memory_$Pointer$#1.base| .cse20)) (.cse22 (+ |v_ULTIMATE.start_aws_linked_list_begin_~list#1.offset_BEFORE_CALL_4| 24))) (let ((.cse21 (select .cse23 .cse22))) (and (<= 2 .cse20) (<= .cse20 .cse21) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse20 v_DerPreprocessor_1) .cse21 v_arrayElimArr_2) .cse20) .cse22 .cse21) .cse23) (not (= .cse21 .cse20))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_4| Int)) (let ((.cse24 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_4|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int)) (= (select .cse24 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|) |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_4|)) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_~list#1.offset_BEFORE_CALL_4| Int)) (= (select .cse24 (+ |v_ULTIMATE.start_aws_linked_list_begin_~list#1.offset_BEFORE_CALL_4| 24)) |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_4|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_4|)))))) is different from true [2025-02-08 01:52:24,139 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_begin_~list#1.offset_BEFORE_CALL_5| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int)) (let ((.cse0 (select v_arrayElimArr_2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|))) (let ((.cse1 (select |c_#memory_$Pointer$#1.base| .cse0)) (.cse3 (+ |v_ULTIMATE.start_aws_linked_list_begin_~list#1.offset_BEFORE_CALL_5| 24))) (let ((.cse2 (select .cse1 .cse3))) (and (<= 2 .cse0) (= .cse1 (store (select (store (store |c_#memory_$Pointer$#1.base| .cse0 v_DerPreprocessor_1) .cse2 v_arrayElimArr_2) .cse0) .cse3 .cse2)) (not (= .cse2 .cse0)) (<= .cse0 .cse2)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_5| Int)) (let ((.cse4 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_5|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int)) (= |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_5| (select .cse4 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|))) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_~list#1.offset_BEFORE_CALL_5| Int)) (= (select .cse4 (+ |v_ULTIMATE.start_aws_linked_list_begin_~list#1.offset_BEFORE_CALL_5| 24)) |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_5|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_5|))))) (or (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_10| Int) (v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int)) (let ((.cse5 (select v_arrayElimArr_2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|))) (let ((.cse7 (select |c_#memory_$Pointer$#1.base| .cse5)) (.cse8 (+ |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_10| 24))) (let ((.cse6 (select .cse7 .cse8))) (and (<= 2 .cse5) (not (= .cse5 .cse6)) (<= .cse5 .cse6) (= .cse7 (store (select (store (store |c_#memory_$Pointer$#1.base| .cse5 v_DerPreprocessor_1) .cse6 v_arrayElimArr_2) .cse5) .cse8 .cse6))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse9 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_10|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int)) (= (select .cse9 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|) |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_10|)) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_10| Int)) (= (select .cse9 (+ |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_10| 24)) |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_10|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_10|))))) (or (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_begin_~list#1.offset_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int)) (let ((.cse10 (select v_arrayElimArr_2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|))) (let ((.cse12 (select |c_#memory_$Pointer$#1.base| .cse10)) (.cse13 (+ |v_ULTIMATE.start_aws_linked_list_begin_~list#1.offset_BEFORE_CALL_6| 24))) (let ((.cse11 (select .cse12 .cse13))) (and (<= 2 .cse10) (not (= .cse10 .cse11)) (<= .cse10 .cse11) (= .cse12 (store (select (store (store |c_#memory_$Pointer$#1.base| .cse10 v_DerPreprocessor_1) .cse11 v_arrayElimArr_2) .cse10) .cse13 .cse11))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_6| Int)) (let ((.cse14 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_6|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int)) (= (select .cse14 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|) |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_6|)) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_~list#1.offset_BEFORE_CALL_6| Int)) (= (select .cse14 (+ |v_ULTIMATE.start_aws_linked_list_begin_~list#1.offset_BEFORE_CALL_6| 24)) |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_6|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_6|))))) (<= (select (select |c_#memory_$Pointer$#1.base| |c_aws_linked_list_is_valid_#in~list#1.base|) (+ |c_aws_linked_list_is_valid_#in~list#1.offset| 24)) 0) (or (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_11| Int) (v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int)) (let ((.cse16 (select v_arrayElimArr_2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|))) (let ((.cse15 (select |c_#memory_$Pointer$#1.base| .cse16)) (.cse18 (+ |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_11| 24))) (let ((.cse17 (select .cse15 .cse18))) (and (= .cse15 (store (select (store (store |c_#memory_$Pointer$#1.base| .cse16 v_DerPreprocessor_1) .cse17 v_arrayElimArr_2) .cse16) .cse18 .cse17)) (not (= .cse16 .cse17)) (<= 2 .cse16) (<= .cse16 .cse17)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_11| Int)) (let ((.cse19 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_11|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int)) (= (select .cse19 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|) |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_11|)) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_11| Int)) (= |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_11| (select .cse19 (+ |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_11| 24)))) (<= 2 |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_11|))))) (or (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_begin_~list#1.offset_BEFORE_CALL_4| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int)) (let ((.cse20 (select v_arrayElimArr_2 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|))) (let ((.cse23 (select |c_#memory_$Pointer$#1.base| .cse20)) (.cse22 (+ |v_ULTIMATE.start_aws_linked_list_begin_~list#1.offset_BEFORE_CALL_4| 24))) (let ((.cse21 (select .cse23 .cse22))) (and (<= 2 .cse20) (<= .cse20 .cse21) (= (store (select (store (store |c_#memory_$Pointer$#1.base| .cse20 v_DerPreprocessor_1) .cse21 v_arrayElimArr_2) .cse20) .cse22 .cse21) .cse23) (not (= .cse21 .cse20))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_4| Int)) (let ((.cse24 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_4|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9| Int)) (= (select .cse24 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_9|) |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_4|)) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_~list#1.offset_BEFORE_CALL_4| Int)) (= (select .cse24 (+ |v_ULTIMATE.start_aws_linked_list_begin_~list#1.offset_BEFORE_CALL_4| 24)) |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_4|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_begin_~list#1.base_BEFORE_CALL_4|)))))) is different from true [2025-02-08 01:52:24,460 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 40 not checked. [2025-02-08 01:52:24,461 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 01:52:24,812 INFO L349 Elim1Store]: treesize reduction 19, result has 62.0 percent of original size [2025-02-08 01:52:24,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 90 treesize of output 98 [2025-02-08 01:52:24,830 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 01:52:24,830 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 98 treesize of output 114 [2025-02-08 01:52:24,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2025-02-08 01:52:24,887 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-02-08 01:52:24,917 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-02-08 01:52:24,941 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 01:52:24,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 71 treesize of output 87 [2025-02-08 01:52:25,098 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-02-08 01:52:25,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [665406336] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-08 01:52:25,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-08 01:52:25,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [7, 19] total 32 [2025-02-08 01:52:25,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176147805] [2025-02-08 01:52:25,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:52:25,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 01:52:25,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:52:25,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 01:52:25,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=392, Unknown=34, NotChecked=490, Total=992 [2025-02-08 01:52:25,102 INFO L87 Difference]: Start difference. First operand 90 states and 111 transitions. Second operand has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-02-08 01:52:25,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:52:25,494 INFO L93 Difference]: Finished difference Result 142 states and 177 transitions. [2025-02-08 01:52:25,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 01:52:25,494 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 74 [2025-02-08 01:52:25,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:52:25,496 INFO L225 Difference]: With dead ends: 142 [2025-02-08 01:52:25,496 INFO L226 Difference]: Without dead ends: 96 [2025-02-08 01:52:25,497 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=95, Invalid=560, Unknown=35, NotChecked=570, Total=1260 [2025-02-08 01:52:25,497 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 20 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 01:52:25,497 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 252 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 01:52:25,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-02-08 01:52:25,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 90. [2025-02-08 01:52:25,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 58 states have (on average 1.1724137931034482) internal successors, (68), 60 states have internal predecessors, (68), 22 states have call successors, (22), 9 states have call predecessors, (22), 9 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-08 01:52:25,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 110 transitions. [2025-02-08 01:52:25,514 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 110 transitions. Word has length 74 [2025-02-08 01:52:25,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:52:25,515 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 110 transitions. [2025-02-08 01:52:25,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-02-08 01:52:25,515 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 110 transitions. [2025-02-08 01:52:25,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-02-08 01:52:25,517 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:52:25,517 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-08 01:52:25,524 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-08 01:52:25,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:52:25,718 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:52:25,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:52:25,718 INFO L85 PathProgramCache]: Analyzing trace with hash 2016914328, now seen corresponding path program 1 times [2025-02-08 01:52:25,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:52:25,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265176110] [2025-02-08 01:52:25,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:52:25,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:52:25,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-08 01:52:25,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-08 01:52:25,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:52:25,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:52:26,081 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-02-08 01:52:26,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:52:26,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265176110] [2025-02-08 01:52:26,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265176110] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:52:26,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1483241296] [2025-02-08 01:52:26,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:52:26,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:52:26,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:52:26,084 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 01:52:26,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-08 01:52:26,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-08 01:52:26,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-08 01:52:26,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:52:26,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:52:26,234 INFO L256 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-02-08 01:52:26,238 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:52:26,268 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-02-08 01:52:26,281 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-02-08 01:52:26,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 01:52:26,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 01:52:26,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 01:52:26,321 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 41 treesize of output 47 [2025-02-08 01:52:26,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 01:52:26,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 01:52:26,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 01:52:26,344 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-02-08 01:52:27,475 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 01:52:27,475 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 01:52:27,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1483241296] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:52:27,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 01:52:27,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [7] total 16 [2025-02-08 01:52:27,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543874451] [2025-02-08 01:52:27,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:52:27,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 01:52:27,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:52:27,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 01:52:27,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2025-02-08 01:52:27,476 INFO L87 Difference]: Start difference. First operand 90 states and 110 transitions. Second operand has 11 states, 10 states have (on average 5.6) internal successors, (56), 11 states have internal predecessors, (56), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2025-02-08 01:52:28,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:52:28,189 INFO L93 Difference]: Finished difference Result 140 states and 168 transitions. [2025-02-08 01:52:28,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 01:52:28,191 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.6) internal successors, (56), 11 states have internal predecessors, (56), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) Word has length 74 [2025-02-08 01:52:28,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:52:28,192 INFO L225 Difference]: With dead ends: 140 [2025-02-08 01:52:28,193 INFO L226 Difference]: Without dead ends: 92 [2025-02-08 01:52:28,193 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 63 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2025-02-08 01:52:28,197 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 41 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 01:52:28,197 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 213 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 01:52:28,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-02-08 01:52:28,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 90. [2025-02-08 01:52:28,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 58 states have (on average 1.1551724137931034) internal successors, (67), 60 states have internal predecessors, (67), 22 states have call successors, (22), 9 states have call predecessors, (22), 9 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-08 01:52:28,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 109 transitions. [2025-02-08 01:52:28,220 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 109 transitions. Word has length 74 [2025-02-08 01:52:28,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:52:28,221 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 109 transitions. [2025-02-08 01:52:28,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.6) internal successors, (56), 11 states have internal predecessors, (56), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2025-02-08 01:52:28,221 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 109 transitions. [2025-02-08 01:52:28,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-02-08 01:52:28,222 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:52:28,222 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-08 01:52:28,230 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-08 01:52:28,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:52:28,423 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:52:28,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:52:28,423 INFO L85 PathProgramCache]: Analyzing trace with hash -859262215, now seen corresponding path program 1 times [2025-02-08 01:52:28,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:52:28,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105934906] [2025-02-08 01:52:28,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:52:28,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:52:28,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-08 01:52:28,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-08 01:52:28,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:52:28,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:52:28,918 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-02-08 01:52:28,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:52:28,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105934906] [2025-02-08 01:52:28,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105934906] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:52:28,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [574311249] [2025-02-08 01:52:28,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:52:28,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:52:28,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:52:28,923 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 01:52:28,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-08 01:52:29,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-08 01:52:29,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-08 01:52:29,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:52:29,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:52:29,078 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-02-08 01:52:29,081 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:52:29,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 01:52:29,138 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-02-08 01:52:29,565 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 01:52:29,566 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 01:52:29,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [574311249] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:52:29,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 01:52:29,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [9] total 17 [2025-02-08 01:52:29,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457655708] [2025-02-08 01:52:29,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:52:29,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 01:52:29,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:52:29,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 01:52:29,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2025-02-08 01:52:29,568 INFO L87 Difference]: Start difference. First operand 90 states and 109 transitions. Second operand has 11 states, 10 states have (on average 5.6) internal successors, (56), 11 states have internal predecessors, (56), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2025-02-08 01:52:29,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:52:29,877 INFO L93 Difference]: Finished difference Result 142 states and 168 transitions. [2025-02-08 01:52:29,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 01:52:29,878 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.6) internal successors, (56), 11 states have internal predecessors, (56), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) Word has length 74 [2025-02-08 01:52:29,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:52:29,880 INFO L225 Difference]: With dead ends: 142 [2025-02-08 01:52:29,880 INFO L226 Difference]: Without dead ends: 92 [2025-02-08 01:52:29,880 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 63 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2025-02-08 01:52:29,881 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 38 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 01:52:29,881 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 289 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 01:52:29,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-02-08 01:52:29,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 90. [2025-02-08 01:52:29,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 58 states have (on average 1.1379310344827587) internal successors, (66), 60 states have internal predecessors, (66), 22 states have call successors, (22), 9 states have call predecessors, (22), 9 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-08 01:52:29,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 108 transitions. [2025-02-08 01:52:29,896 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 108 transitions. Word has length 74 [2025-02-08 01:52:29,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:52:29,896 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 108 transitions. [2025-02-08 01:52:29,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.6) internal successors, (56), 11 states have internal predecessors, (56), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2025-02-08 01:52:29,896 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 108 transitions. [2025-02-08 01:52:29,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-02-08 01:52:29,901 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:52:29,901 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-08 01:52:29,909 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-08 01:52:30,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-02-08 01:52:30,105 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:52:30,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:52:30,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1094018586, now seen corresponding path program 1 times [2025-02-08 01:52:30,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:52:30,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101375291] [2025-02-08 01:52:30,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:52:30,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:52:30,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-08 01:52:30,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-08 01:52:30,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:52:30,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:52:30,215 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-02-08 01:52:30,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:52:30,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101375291] [2025-02-08 01:52:30,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101375291] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:52:30,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1365867466] [2025-02-08 01:52:30,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:52:30,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:52:30,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:52:30,219 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 01:52:30,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-08 01:52:30,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-08 01:52:30,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-08 01:52:30,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:52:30,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:52:30,366 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 01:52:30,368 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:52:30,416 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-08 01:52:30,416 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 01:52:30,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1365867466] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:52:30,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 01:52:30,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-02-08 01:52:30,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822746557] [2025-02-08 01:52:30,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:52:30,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 01:52:30,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:52:30,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 01:52:30,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-08 01:52:30,417 INFO L87 Difference]: Start difference. First operand 90 states and 108 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-08 01:52:30,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:52:30,456 INFO L93 Difference]: Finished difference Result 152 states and 183 transitions. [2025-02-08 01:52:30,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 01:52:30,457 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 74 [2025-02-08 01:52:30,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:52:30,458 INFO L225 Difference]: With dead ends: 152 [2025-02-08 01:52:30,458 INFO L226 Difference]: Without dead ends: 61 [2025-02-08 01:52:30,458 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-08 01:52:30,459 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 9 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 01:52:30,459 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 191 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 01:52:30,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-02-08 01:52:30,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2025-02-08 01:52:30,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 42 states have (on average 1.2142857142857142) internal successors, (51), 44 states have internal predecessors, (51), 12 states have call successors, (12), 5 states have call predecessors, (12), 6 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2025-02-08 01:52:30,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 76 transitions. [2025-02-08 01:52:30,467 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 76 transitions. Word has length 74 [2025-02-08 01:52:30,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:52:30,467 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 76 transitions. [2025-02-08 01:52:30,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-08 01:52:30,468 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 76 transitions. [2025-02-08 01:52:30,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-02-08 01:52:30,469 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:52:30,469 INFO L218 NwaCegarLoop]: trace histogram [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-02-08 01:52:30,478 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-08 01:52:30,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:52:30,674 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:52:30,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:52:30,675 INFO L85 PathProgramCache]: Analyzing trace with hash 337246417, now seen corresponding path program 1 times [2025-02-08 01:52:30,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:52:30,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147207793] [2025-02-08 01:52:30,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:52:30,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:52:30,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-08 01:52:30,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-08 01:52:30,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:52:30,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:52:30,914 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-02-08 01:52:30,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:52:30,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147207793] [2025-02-08 01:52:30,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147207793] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:52:30,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1900665708] [2025-02-08 01:52:30,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:52:30,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:52:30,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:52:30,917 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 01:52:30,919 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-08 01:52:31,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-08 01:52:31,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-08 01:52:31,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:52:31,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:52:31,111 INFO L256 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-02-08 01:52:31,118 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:52:31,158 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-02-08 01:52:31,173 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-02-08 01:52:31,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 01:52:31,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 01:52:31,224 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-02-08 01:52:31,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 01:52:31,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 01:52:31,233 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-02-08 01:52:31,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 01:52:31,239 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-02-08 01:52:31,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 01:52:31,249 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-02-08 01:52:31,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 01:52:31,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 01:52:31,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 01:52:31,395 INFO L349 Elim1Store]: treesize reduction 166, result has 19.0 percent of original size [2025-02-08 01:52:31,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 180 treesize of output 129 [2025-02-08 01:52:31,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 01:52:31,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 01:52:31,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 01:52:31,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 01:52:31,419 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 117 treesize of output 35 [2025-02-08 01:52:32,761 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 47 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 01:52:32,761 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 01:52:33,181 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 01:52:33,182 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 95 treesize of output 96 [2025-02-08 01:52:33,190 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 01:52:33,191 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-02-08 01:52:33,212 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-02-08 01:52:33,300 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 24)) (.cse2 (+ |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset| 16))) (and (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_15| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_15| 1)) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_subst_1 Int)) (= (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store (select |c_#memory_$Pointer$#1.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_15| 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_begin_harness_~#list~0#1.base|) .cse2) 0)))) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_15| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_15| 1)) (forall ((v_arrayElimArr_7 (Array Int Int)) (v_subst_2 Int)) (or (= (select (select (let ((.cse3 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store (select |c_#memory_$Pointer$#1.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_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_15|)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_15| v_arrayElimArr_7))) (store .cse3 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse3 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_15|))) |c_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base|) .cse2) 0) (not (= |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (select v_arrayElimArr_7 v_subst_2))))))))) is different from false [2025-02-08 01:52:33,318 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 01:52:33,320 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 01:52:33,399 INFO L349 Elim1Store]: treesize reduction 86, result has 45.2 percent of original size [2025-02-08 01:52:33,399 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-02-08 01:52:33,414 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 01:52:33,414 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 280 treesize of output 256 [2025-02-08 01:52:33,427 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 01:52:33,428 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 215 treesize of output 212 [2025-02-08 01:52:33,443 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 01:52:33,444 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 01:52:33,520 INFO L349 Elim1Store]: treesize reduction 86, result has 45.2 percent of original size [2025-02-08 01:52:33,520 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 273 treesize of output 302 [2025-02-08 01:52:33,541 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 01:52:33,542 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 340 treesize of output 336 [2025-02-08 01:52:33,559 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 289 treesize of output 277 [2025-02-08 01:52:33,785 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-02-08 01:52:33,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-02-08 01:52:33,983 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 01:52:33,984 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 01:52:33,994 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 01:52:33,995 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 76 treesize of output 90 [2025-02-08 01:52:34,066 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 01:52:34,067 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 01:52:34,080 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 01:52:34,081 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 59 treesize of output 73 [2025-02-08 01:52:34,172 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 13 proven. 11 refuted. 0 times theorem prover too weak. 26 trivial. 1 not checked. [2025-02-08 01:52:34,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1900665708] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 01:52:34,172 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 01:52:34,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 11, 10] total 23 [2025-02-08 01:52:34,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517807386] [2025-02-08 01:52:34,173 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 01:52:34,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-08 01:52:34,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:52:34,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-08 01:52:34,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=401, Unknown=1, NotChecked=40, Total=506 [2025-02-08 01:52:34,174 INFO L87 Difference]: Start difference. First operand 61 states and 76 transitions. Second operand has 23 states, 20 states have (on average 4.95) internal successors, (99), 22 states have internal predecessors, (99), 9 states have call successors, (22), 3 states have call predecessors, (22), 7 states have return successors, (21), 7 states have call predecessors, (21), 9 states have call successors, (21) [2025-02-08 01:52:35,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:52:35,218 INFO L93 Difference]: Finished difference Result 133 states and 158 transitions. [2025-02-08 01:52:35,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-02-08 01:52:35,219 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 4.95) internal successors, (99), 22 states have internal predecessors, (99), 9 states have call successors, (22), 3 states have call predecessors, (22), 7 states have return successors, (21), 7 states have call predecessors, (21), 9 states have call successors, (21) Word has length 75 [2025-02-08 01:52:35,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:52:35,219 INFO L225 Difference]: With dead ends: 133 [2025-02-08 01:52:35,219 INFO L226 Difference]: Without dead ends: 0 [2025-02-08 01:52:35,220 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 129 SyntacticMatches, 5 SemanticMatches, 34 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=153, Invalid=1040, Unknown=1, NotChecked=66, Total=1260 [2025-02-08 01:52:35,221 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 26 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 57 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 01:52:35,221 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 310 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 235 Invalid, 0 Unknown, 57 Unchecked, 0.3s Time] [2025-02-08 01:52:35,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-08 01:52:35,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-08 01:52:35,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:52:35,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-08 01:52:35,222 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 75 [2025-02-08 01:52:35,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:52:35,222 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-08 01:52:35,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 4.95) internal successors, (99), 22 states have internal predecessors, (99), 9 states have call successors, (22), 3 states have call predecessors, (22), 7 states have return successors, (21), 7 states have call predecessors, (21), 9 states have call successors, (21) [2025-02-08 01:52:35,223 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-08 01:52:35,223 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-08 01:52:35,226 INFO L782 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-08 01:52:35,235 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-08 01:52:35,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:52:35,432 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:52:35,433 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-08 01:52:36,773 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 01:52:36,783 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#list~0!base [2025-02-08 01:52:36,784 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~curr~0!offset [2025-02-08 01:52:36,784 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~list!offset [2025-02-08 01:52:36,784 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2025-02-08 01:52:36,785 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2025-02-08 01:52:36,785 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~list!base,]]] [2025-02-08 01:52:36,785 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~list!base [2025-02-08 01:52:36,785 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#list~0!base [2025-02-08 01:52:36,785 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2025-02-08 01:52:36,785 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#list~0!base [2025-02-08 01:52:36,785 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2025-02-08 01:52:36,785 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2025-02-08 01:52:36,785 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~list!base,]]] [2025-02-08 01:52:36,786 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2025-02-08 01:52:36,786 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2025-02-08 01:52:36,786 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~list!base,]]] [2025-02-08 01:52:36,786 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2025-02-08 01:52:36,786 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2025-02-08 01:52:36,786 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~list!base,]]] [2025-02-08 01:52:36,786 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#list~0!offset [2025-02-08 01:52:36,786 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#list~0!base [2025-02-08 01:52:36,786 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~list!offset [2025-02-08 01:52:36,786 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2025-02-08 01:52:36,787 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2025-02-08 01:52:36,787 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~list!base [2025-02-08 01:52:36,787 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#list~0!base [2025-02-08 01:52:36,787 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2025-02-08 01:52:36,787 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#list~0!base [2025-02-08 01:52:36,787 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#list~0!offset [2025-02-08 01:52:36,789 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 01:52:36 BoogieIcfgContainer [2025-02-08 01:52:36,790 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 01:52:36,790 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 01:52:36,790 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 01:52:36,791 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 01:52:36,792 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:52:11" (3/4) ... [2025-02-08 01:52:36,793 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 01:52:36,799 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure aws_linked_list_node_next_is_valid [2025-02-08 01:52:36,799 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure nondet_uint64_t [2025-02-08 01:52:36,799 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-02-08 01:52:36,799 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2025-02-08 01:52:36,799 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure aws_linked_list_is_valid [2025-02-08 01:52:36,802 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2025-02-08 01:52:36,803 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-02-08 01:52:36,803 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 01:52:36,803 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 01:52:36,890 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 01:52:36,890 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 01:52:36,890 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 01:52:36,893 INFO L158 Benchmark]: Toolchain (without parser) took 27438.79ms. Allocated memory was 167.8MB in the beginning and 545.3MB in the end (delta: 377.5MB). Free memory was 116.9MB in the beginning and 413.7MB in the end (delta: -296.8MB). Peak memory consumption was 73.1MB. Max. memory is 16.1GB. [2025-02-08 01:52:36,893 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 201.3MB. Free memory is still 116.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 01:52:36,894 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1655.41ms. Allocated memory is still 167.8MB. Free memory was 116.9MB in the beginning and 76.4MB in the end (delta: 40.4MB). Peak memory consumption was 102.9MB. Max. memory is 16.1GB. [2025-02-08 01:52:36,894 INFO L158 Benchmark]: Boogie Procedure Inliner took 92.22ms. Allocated memory is still 167.8MB. Free memory was 76.4MB in the beginning and 71.2MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 01:52:36,894 INFO L158 Benchmark]: Boogie Preprocessor took 75.41ms. Allocated memory is still 167.8MB. Free memory was 71.2MB in the beginning and 68.1MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 01:52:36,894 INFO L158 Benchmark]: IcfgBuilder took 546.64ms. Allocated memory is still 167.8MB. Free memory was 68.1MB in the beginning and 118.1MB in the end (delta: -50.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-08 01:52:36,894 INFO L158 Benchmark]: TraceAbstraction took 24959.90ms. Allocated memory was 167.8MB in the beginning and 545.3MB in the end (delta: 377.5MB). Free memory was 117.2MB in the beginning and 422.0MB in the end (delta: -304.7MB). Peak memory consumption was 324.4MB. Max. memory is 16.1GB. [2025-02-08 01:52:36,894 INFO L158 Benchmark]: Witness Printer took 102.22ms. Allocated memory is still 545.3MB. Free memory was 422.0MB in the beginning and 413.7MB in the end (delta: 8.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 01:52:36,896 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28ms. Allocated memory is still 201.3MB. Free memory is still 116.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1655.41ms. Allocated memory is still 167.8MB. Free memory was 116.9MB in the beginning and 76.4MB in the end (delta: 40.4MB). Peak memory consumption was 102.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 92.22ms. Allocated memory is still 167.8MB. Free memory was 76.4MB in the beginning and 71.2MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 75.41ms. Allocated memory is still 167.8MB. Free memory was 71.2MB in the beginning and 68.1MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 546.64ms. Allocated memory is still 167.8MB. Free memory was 68.1MB in the beginning and 118.1MB in the end (delta: -50.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 24959.90ms. Allocated memory was 167.8MB in the beginning and 545.3MB in the end (delta: 377.5MB). Free memory was 117.2MB in the beginning and 422.0MB in the end (delta: -304.7MB). Peak memory consumption was 324.4MB. Max. memory is 16.1GB. * Witness Printer took 102.22ms. Allocated memory is still 545.3MB. Free memory was 422.0MB in the beginning and 413.7MB in the end (delta: 8.3MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#list~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~curr~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~list!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~list!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~list!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#list~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#list~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~list!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~list!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~list!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#list~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#list~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~list!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~list!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#list~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#list~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#list~0!offset * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 223]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 63 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 23.5s, OverallIterations: 9, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 227 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 194 mSDsluCounter, 2107 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 57 IncrementalHoareTripleChecker+Unchecked, 1688 mSDsCounter, 77 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1363 IncrementalHoareTripleChecker+Invalid, 1497 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 77 mSolverCounterUnsat, 419 mSDtfsCounter, 1363 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 815 GetRequests, 649 SyntacticMatches, 21 SemanticMatches, 145 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 409 ImplicationChecksByTransitivity, 4.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=94occurred in iteration=3, InterpolantAutomatonStates: 90, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 14 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 15.8s InterpolantComputationTime, 1242 NumberOfCodeBlocks, 1242 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1372 ConstructedInterpolants, 198 QuantifiedInterpolants, 28930 SizeOfPredicates, 39 NumberOfNonLiveVariables, 2613 ConjunctsInSsa, 246 ConjunctsInUnsatCore, 19 InterpolantComputations, 8 PerfectInterpolantSequences, 821/947 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-08 01:52:36,928 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE