./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_linked_list_remove_harness_negated.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/aws-c-common/aws_linked_list_remove_harness_negated.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 59c6b72a732d91c045894268c659507998ee445c19bfbe580f6574a50ad495ad --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 02:59:41,685 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 02:59:41,743 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-04 02:59:41,749 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 02:59:41,750 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 02:59:41,771 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 02:59:41,772 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 02:59:41,772 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 02:59:41,773 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 02:59:41,773 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 02:59:41,773 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 02:59:41,773 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 02:59:41,774 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 02:59:41,774 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 02:59:41,774 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 02:59:41,774 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 02:59:41,774 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 02:59:41,775 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 02:59:41,775 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 02:59:41,775 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 02:59:41,775 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 02:59:41,775 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 02:59:41,775 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 02:59:41,775 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 02:59:41,775 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 02:59:41,775 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 02:59:41,775 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 02:59:41,775 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 02:59:41,776 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 02:59:41,776 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:59:41,776 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 02:59:41,776 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 02:59:41,776 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 02:59:41,776 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 02:59:41,776 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 02:59:41,776 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 02:59:41,777 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 02:59:41,777 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 02:59:41,777 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 02:59:41,777 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 02:59:41,777 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 59c6b72a732d91c045894268c659507998ee445c19bfbe580f6574a50ad495ad [2025-03-04 02:59:41,977 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 02:59:41,985 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 02:59:41,988 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 02:59:41,989 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 02:59:41,989 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 02:59:41,990 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_linked_list_remove_harness_negated.i [2025-03-04 02:59:43,116 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b18b7b0e/8f5dfe2040f344028834c698bf225997/FLAG5d6195490 [2025-03-04 02:59:43,476 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 02:59:43,477 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_remove_harness_negated.i [2025-03-04 02:59:43,503 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b18b7b0e/8f5dfe2040f344028834c698bf225997/FLAG5d6195490 [2025-03-04 02:59:43,512 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b18b7b0e/8f5dfe2040f344028834c698bf225997 [2025-03-04 02:59:43,515 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 02:59:43,516 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 02:59:43,517 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 02:59:43,517 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 02:59:43,519 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 02:59:43,520 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:59:43" (1/1) ... [2025-03-04 02:59:43,520 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3717b099 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:59:43, skipping insertion in model container [2025-03-04 02:59:43,520 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:59:43" (1/1) ... [2025-03-04 02:59:43,576 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 02:59:43,726 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_remove_harness_negated.i[4496,4509] [2025-03-04 02:59:43,732 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_remove_harness_negated.i[4556,4569] [2025-03-04 02:59:44,107 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:59:44,107 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:59:44,107 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:59:44,108 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:59:44,108 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:59:44,121 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:59:44,121 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:59:44,122 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:59:44,123 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:59:44,124 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:59:44,124 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:59:44,125 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:59:44,125 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:59:44,417 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_remove_harness_negated.i[150856,150869] [2025-03-04 02:59:44,418 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:59:44,430 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 02:59:44,444 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_remove_harness_negated.i[4496,4509] [2025-03-04 02:59:44,444 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_remove_harness_negated.i[4556,4569] [2025-03-04 02:59:44,491 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:59:44,492 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:59:44,493 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:59:44,493 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:59:44,493 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:59:44,501 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:59:44,504 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:59:44,505 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:59:44,505 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:59:44,506 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:59:44,507 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:59:44,507 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:59:44,507 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:59:44,581 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_remove_harness_negated.i[150856,150869] [2025-03-04 02:59:44,582 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:59:44,748 INFO L204 MainTranslator]: Completed translation [2025-03-04 02:59:44,748 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:59:44 WrapperNode [2025-03-04 02:59:44,748 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 02:59:44,749 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 02:59:44,750 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 02:59:44,750 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 02:59:44,754 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:59:44" (1/1) ... [2025-03-04 02:59:44,797 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:59:44" (1/1) ... [2025-03-04 02:59:44,828 INFO L138 Inliner]: procedures = 668, calls = 1048, calls flagged for inlining = 50, calls inlined = 4, statements flattened = 86 [2025-03-04 02:59:44,829 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 02:59:44,829 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 02:59:44,829 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 02:59:44,829 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 02:59:44,835 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:59:44" (1/1) ... [2025-03-04 02:59:44,835 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:59:44" (1/1) ... [2025-03-04 02:59:44,837 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:59:44" (1/1) ... [2025-03-04 02:59:44,856 INFO L175 MemorySlicer]: Split 30 memory accesses to 3 slices as follows [2, 5, 23]. 77 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5, 0]. The 7 writes are split as follows [0, 0, 7]. [2025-03-04 02:59:44,856 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:59:44" (1/1) ... [2025-03-04 02:59:44,857 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:59:44" (1/1) ... [2025-03-04 02:59:44,869 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:59:44" (1/1) ... [2025-03-04 02:59:44,870 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:59:44" (1/1) ... [2025-03-04 02:59:44,872 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:59:44" (1/1) ... [2025-03-04 02:59:44,873 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:59:44" (1/1) ... [2025-03-04 02:59:44,876 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 02:59:44,876 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 02:59:44,876 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 02:59:44,876 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 02:59:44,877 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:59:44" (1/1) ... [2025-03-04 02:59:44,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:59:44,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:59:44,904 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 02:59:44,905 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 02:59:44,921 INFO L130 BoogieDeclarations]: Found specification of procedure aws_is_mem_zeroed [2025-03-04 02:59:44,921 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_is_mem_zeroed [2025-03-04 02:59:44,921 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_remove [2025-03-04 02:59:44,921 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_remove [2025-03-04 02:59:44,921 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 02:59:44,921 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 02:59:44,921 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 02:59:44,921 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 02:59:44,921 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-04 02:59:44,921 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-04 02:59:44,922 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2025-03-04 02:59:44,922 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2025-03-04 02:59:44,922 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 02:59:44,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 02:59:44,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 02:59:44,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 02:59:44,922 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 02:59:44,922 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 02:59:44,922 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-04 02:59:44,922 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-04 02:59:44,922 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-03-04 02:59:44,922 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-04 02:59:44,922 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-04 02:59:44,922 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-03-04 02:59:44,922 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 02:59:44,922 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 02:59:44,922 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 02:59:44,922 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 02:59:44,922 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 02:59:44,922 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 02:59:44,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-04 02:59:44,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-04 02:59:44,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-04 02:59:44,922 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_prev_is_valid [2025-03-04 02:59:44,922 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_prev_is_valid [2025-03-04 02:59:44,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 02:59:44,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 02:59:44,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 02:59:45,127 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 02:59:45,129 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 02:59:45,169 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4731: havoc #t~mem313.base, #t~mem313.offset;havoc #t~short314;havoc #t~mem315.base, #t~mem315.offset;havoc #t~mem316.base, #t~mem316.offset;havoc #t~short317; [2025-03-04 02:59:45,245 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4720: havoc #t~mem308.base, #t~mem308.offset;havoc #t~short309;havoc #t~mem310.base, #t~mem310.offset;havoc #t~mem311.base, #t~mem311.offset;havoc #t~short312; [2025-03-04 02:59:45,399 INFO L? ?]: Removed 48 outVars from TransFormulas that were not future-live. [2025-03-04 02:59:45,400 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 02:59:45,408 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 02:59:45,410 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 02:59:45,411 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:59:45 BoogieIcfgContainer [2025-03-04 02:59:45,411 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 02:59:45,412 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 02:59:45,413 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 02:59:45,416 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 02:59:45,416 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 02:59:43" (1/3) ... [2025-03-04 02:59:45,417 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e43677a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:59:45, skipping insertion in model container [2025-03-04 02:59:45,417 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:59:44" (2/3) ... [2025-03-04 02:59:45,417 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e43677a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:59:45, skipping insertion in model container [2025-03-04 02:59:45,417 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:59:45" (3/3) ... [2025-03-04 02:59:45,418 INFO L128 eAbstractionObserver]: Analyzing ICFG aws_linked_list_remove_harness_negated.i [2025-03-04 02:59:45,428 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 02:59:45,429 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG aws_linked_list_remove_harness_negated.i that has 10 procedures, 80 locations, 1 initial locations, 5 loop locations, and 1 error locations. [2025-03-04 02:59:45,464 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 02:59:45,473 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;@509b42a4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 02:59:45,475 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 02:59:45,478 INFO L276 IsEmpty]: Start isEmpty. Operand has 72 states, 47 states have (on average 1.2553191489361701) internal successors, (59), 48 states have internal predecessors, (59), 17 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 02:59:45,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-04 02:59:45,484 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:59:45,484 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:59:45,484 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:59:45,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:59:45,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1553950321, now seen corresponding path program 1 times [2025-03-04 02:59:45,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:59:45,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627534627] [2025-03-04 02:59:45,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:59:45,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:59:45,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-04 02:59:45,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-04 02:59:45,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:59:45,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:59:45,817 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 02:59:45,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:59:45,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627534627] [2025-03-04 02:59:45,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627534627] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:59:45,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2102321004] [2025-03-04 02:59:45,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:59:45,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:59:45,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:59:45,821 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:59:45,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 02:59:45,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-04 02:59:45,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-04 02:59:45,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:59:45,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:59:45,989 INFO L256 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 02:59:45,996 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:59:46,005 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 02:59:46,005 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 02:59:46,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2102321004] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:59:46,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 02:59:46,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 02:59:46,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223126338] [2025-03-04 02:59:46,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:59:46,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 02:59:46,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:59:46,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 02:59:46,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 02:59:46,024 INFO L87 Difference]: Start difference. First operand has 72 states, 47 states have (on average 1.2553191489361701) internal successors, (59), 48 states have internal predecessors, (59), 17 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-04 02:59:46,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:59:46,039 INFO L93 Difference]: Finished difference Result 138 states and 188 transitions. [2025-03-04 02:59:46,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 02:59:46,040 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 47 [2025-03-04 02:59:46,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:59:46,045 INFO L225 Difference]: With dead ends: 138 [2025-03-04 02:59:46,045 INFO L226 Difference]: Without dead ends: 67 [2025-03-04 02:59:46,048 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 02:59:46,052 INFO L435 NwaCegarLoop]: 89 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, 89 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 02:59:46,054 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 02:59:46,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-03-04 02:59:46,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2025-03-04 02:59:46,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 42 states have (on average 1.2142857142857142) internal successors, (51), 43 states have internal predecessors, (51), 17 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-04 02:59:46,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 84 transitions. [2025-03-04 02:59:46,089 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 84 transitions. Word has length 47 [2025-03-04 02:59:46,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:59:46,092 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 84 transitions. [2025-03-04 02:59:46,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-04 02:59:46,093 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 84 transitions. [2025-03-04 02:59:46,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-04 02:59:46,105 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:59:46,105 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:59:46,114 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 02:59:46,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-04 02:59:46,307 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:59:46,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:59:46,307 INFO L85 PathProgramCache]: Analyzing trace with hash -1780213379, now seen corresponding path program 1 times [2025-03-04 02:59:46,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:59:46,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228860227] [2025-03-04 02:59:46,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:59:46,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:59:46,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-04 02:59:46,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-04 02:59:46,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:59:46,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:59:47,009 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 02:59:47,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:59:47,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228860227] [2025-03-04 02:59:47,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228860227] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:59:47,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:59:47,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 02:59:47,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134130601] [2025-03-04 02:59:47,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:59:47,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 02:59:47,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:59:47,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 02:59:47,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 02:59:47,011 INFO L87 Difference]: Start difference. First operand 67 states and 84 transitions. Second operand has 9 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-04 02:59:47,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:59:47,241 INFO L93 Difference]: Finished difference Result 134 states and 168 transitions. [2025-03-04 02:59:47,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 02:59:47,242 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 53 [2025-03-04 02:59:47,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:59:47,244 INFO L225 Difference]: With dead ends: 134 [2025-03-04 02:59:47,245 INFO L226 Difference]: Without dead ends: 75 [2025-03-04 02:59:47,247 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2025-03-04 02:59:47,247 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 12 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 02:59:47,247 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 438 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 02:59:47,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-03-04 02:59:47,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 72. [2025-03-04 02:59:47,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 48 states have internal predecessors, (56), 17 states have call successors, (17), 7 states have call predecessors, (17), 8 states have return successors, (17), 16 states have call predecessors, (17), 16 states have call successors, (17) [2025-03-04 02:59:47,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 90 transitions. [2025-03-04 02:59:47,266 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 90 transitions. Word has length 53 [2025-03-04 02:59:47,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:59:47,266 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 90 transitions. [2025-03-04 02:59:47,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-04 02:59:47,266 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 90 transitions. [2025-03-04 02:59:47,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-04 02:59:47,267 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:59:47,267 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:59:47,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 02:59:47,267 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:59:47,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:59:47,268 INFO L85 PathProgramCache]: Analyzing trace with hash -2131013316, now seen corresponding path program 1 times [2025-03-04 02:59:47,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:59:47,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994263650] [2025-03-04 02:59:47,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:59:47,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:59:47,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-04 02:59:47,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-04 02:59:47,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:59:47,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:59:47,585 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 02:59:47,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:59:47,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994263650] [2025-03-04 02:59:47,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994263650] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:59:47,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:59:47,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 02:59:47,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657781201] [2025-03-04 02:59:47,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:59:47,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:59:47,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:59:47,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:59:47,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 02:59:47,586 INFO L87 Difference]: Start difference. First operand 72 states and 90 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-04 02:59:47,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:59:47,608 INFO L93 Difference]: Finished difference Result 127 states and 159 transitions. [2025-03-04 02:59:47,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 02:59:47,609 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 53 [2025-03-04 02:59:47,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:59:47,610 INFO L225 Difference]: With dead ends: 127 [2025-03-04 02:59:47,612 INFO L226 Difference]: Without dead ends: 73 [2025-03-04 02:59:47,612 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 02:59:47,613 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 0 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 02:59:47,613 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 244 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 02:59:47,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-03-04 02:59:47,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2025-03-04 02:59:47,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 47 states have (on average 1.2127659574468086) internal successors, (57), 49 states have internal predecessors, (57), 17 states have call successors, (17), 7 states have call predecessors, (17), 8 states have return successors, (17), 16 states have call predecessors, (17), 16 states have call successors, (17) [2025-03-04 02:59:47,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 91 transitions. [2025-03-04 02:59:47,625 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 91 transitions. Word has length 53 [2025-03-04 02:59:47,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:59:47,626 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 91 transitions. [2025-03-04 02:59:47,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-04 02:59:47,626 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 91 transitions. [2025-03-04 02:59:47,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-04 02:59:47,628 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:59:47,628 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:59:47,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 02:59:47,628 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:59:47,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:59:47,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1725980893, now seen corresponding path program 1 times [2025-03-04 02:59:47,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:59:47,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938588392] [2025-03-04 02:59:47,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:59:47,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:59:47,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-04 02:59:47,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-04 02:59:47,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:59:47,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:59:47,912 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 02:59:47,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:59:47,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938588392] [2025-03-04 02:59:47,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938588392] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:59:47,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1258277669] [2025-03-04 02:59:47,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:59:47,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:59:47,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:59:47,915 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:59:47,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 02:59:48,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-04 02:59:48,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-04 02:59:48,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:59:48,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:59:48,060 INFO L256 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 02:59:48,063 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:59:48,128 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 02:59:48,128 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:59:48,206 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-04 02:59:48,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1258277669] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 02:59:48,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 02:59:48,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 6] total 10 [2025-03-04 02:59:48,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740941374] [2025-03-04 02:59:48,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:59:48,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:59:48,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:59:48,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:59:48,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-04 02:59:48,207 INFO L87 Difference]: Start difference. First operand 73 states and 91 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-04 02:59:48,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:59:48,237 INFO L93 Difference]: Finished difference Result 122 states and 152 transitions. [2025-03-04 02:59:48,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 02:59:48,238 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 54 [2025-03-04 02:59:48,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:59:48,240 INFO L225 Difference]: With dead ends: 122 [2025-03-04 02:59:48,241 INFO L226 Difference]: Without dead ends: 76 [2025-03-04 02:59:48,241 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-04 02:59:48,242 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 3 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 02:59:48,244 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 236 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 02:59:48,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-03-04 02:59:48,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2025-03-04 02:59:48,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 48 states have (on average 1.2083333333333333) internal successors, (58), 50 states have internal predecessors, (58), 17 states have call successors, (17), 7 states have call predecessors, (17), 8 states have return successors, (17), 16 states have call predecessors, (17), 16 states have call successors, (17) [2025-03-04 02:59:48,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 92 transitions. [2025-03-04 02:59:48,252 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 92 transitions. Word has length 54 [2025-03-04 02:59:48,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:59:48,253 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 92 transitions. [2025-03-04 02:59:48,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-04 02:59:48,253 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 92 transitions. [2025-03-04 02:59:48,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-04 02:59:48,254 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:59:48,255 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:59:48,262 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 02:59:48,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-04 02:59:48,455 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:59:48,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:59:48,456 INFO L85 PathProgramCache]: Analyzing trace with hash 424100937, now seen corresponding path program 1 times [2025-03-04 02:59:48,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:59:48,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681554842] [2025-03-04 02:59:48,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:59:48,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:59:48,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-04 02:59:48,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 02:59:48,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:59:48,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:59:48,739 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-04 02:59:48,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:59:48,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681554842] [2025-03-04 02:59:48,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681554842] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:59:48,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:59:48,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 02:59:48,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580424604] [2025-03-04 02:59:48,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:59:48,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 02:59:48,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:59:48,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 02:59:48,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 02:59:48,740 INFO L87 Difference]: Start difference. First operand 74 states and 92 transitions. Second operand has 6 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-04 02:59:48,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:59:48,793 INFO L93 Difference]: Finished difference Result 84 states and 102 transitions. [2025-03-04 02:59:48,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 02:59:48,793 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 55 [2025-03-04 02:59:48,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:59:48,795 INFO L225 Difference]: With dead ends: 84 [2025-03-04 02:59:48,795 INFO L226 Difference]: Without dead ends: 82 [2025-03-04 02:59:48,799 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-03-04 02:59:48,800 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 3 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 02:59:48,800 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 394 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 02:59:48,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-03-04 02:59:48,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2025-03-04 02:59:48,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 52 states have (on average 1.1923076923076923) internal successors, (62), 55 states have internal predecessors, (62), 18 states have call successors, (18), 8 states have call predecessors, (18), 10 states have return successors, (19), 17 states have call predecessors, (19), 17 states have call successors, (19) [2025-03-04 02:59:48,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 99 transitions. [2025-03-04 02:59:48,810 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 99 transitions. Word has length 55 [2025-03-04 02:59:48,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:59:48,811 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 99 transitions. [2025-03-04 02:59:48,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-04 02:59:48,812 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 99 transitions. [2025-03-04 02:59:48,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-04 02:59:48,812 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:59:48,812 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:59:48,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 02:59:48,813 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:59:48,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:59:48,813 INFO L85 PathProgramCache]: Analyzing trace with hash -56342844, now seen corresponding path program 1 times [2025-03-04 02:59:48,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:59:48,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954573995] [2025-03-04 02:59:48,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:59:48,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:59:48,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-04 02:59:48,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-04 02:59:48,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:59:48,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:59:49,055 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-04 02:59:49,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:59:49,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954573995] [2025-03-04 02:59:49,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954573995] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:59:49,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [856794386] [2025-03-04 02:59:49,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:59:49,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:59:49,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:59:49,058 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:59:49,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 02:59:49,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-04 02:59:49,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-04 02:59:49,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:59:49,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:59:49,227 INFO L256 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 02:59:49,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:59:49,251 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-04 02:59:49,252 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:59:49,342 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-04 02:59:49,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [856794386] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:59:49,343 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:59:49,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-04 02:59:49,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578099821] [2025-03-04 02:59:49,343 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:59:49,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 02:59:49,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:59:49,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 02:59:49,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2025-03-04 02:59:49,344 INFO L87 Difference]: Start difference. First operand 81 states and 99 transitions. Second operand has 10 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 2 states have call successors, (10), 2 states have call predecessors, (10), 5 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-04 02:59:49,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:59:49,430 INFO L93 Difference]: Finished difference Result 148 states and 182 transitions. [2025-03-04 02:59:49,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 02:59:49,433 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 2 states have call successors, (10), 2 states have call predecessors, (10), 5 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 56 [2025-03-04 02:59:49,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:59:49,434 INFO L225 Difference]: With dead ends: 148 [2025-03-04 02:59:49,434 INFO L226 Difference]: Without dead ends: 84 [2025-03-04 02:59:49,435 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2025-03-04 02:59:49,435 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 0 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 02:59:49,435 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 328 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 02:59:49,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-03-04 02:59:49,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2025-03-04 02:59:49,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 55 states have (on average 1.1818181818181819) internal successors, (65), 58 states have internal predecessors, (65), 18 states have call successors, (18), 8 states have call predecessors, (18), 10 states have return successors, (19), 17 states have call predecessors, (19), 17 states have call successors, (19) [2025-03-04 02:59:49,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 102 transitions. [2025-03-04 02:59:49,447 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 102 transitions. Word has length 56 [2025-03-04 02:59:49,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:59:49,448 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 102 transitions. [2025-03-04 02:59:49,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 2 states have call successors, (10), 2 states have call predecessors, (10), 5 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-04 02:59:49,448 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 102 transitions. [2025-03-04 02:59:49,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-04 02:59:49,448 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:59:49,449 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:59:49,457 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 02:59:49,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:59:49,650 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:59:49,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:59:49,650 INFO L85 PathProgramCache]: Analyzing trace with hash 1661610077, now seen corresponding path program 2 times [2025-03-04 02:59:49,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:59:49,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831347516] [2025-03-04 02:59:49,650 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:59:49,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:59:49,677 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 59 statements into 2 equivalence classes. [2025-03-04 02:59:49,724 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 59 of 59 statements. [2025-03-04 02:59:49,724 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:59:49,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:59:49,972 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-04 02:59:49,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:59:49,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831347516] [2025-03-04 02:59:49,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831347516] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:59:49,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [860529655] [2025-03-04 02:59:49,973 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:59:49,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:59:49,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:59:49,975 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:59:49,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 02:59:50,088 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 59 statements into 2 equivalence classes. [2025-03-04 02:59:50,148 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 59 of 59 statements. [2025-03-04 02:59:50,148 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:59:50,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:59:50,154 INFO L256 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 02:59:50,156 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:59:50,235 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-04 02:59:50,236 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:59:50,365 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 02:59:50,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [860529655] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:59:50,365 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:59:50,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 5] total 16 [2025-03-04 02:59:50,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267062951] [2025-03-04 02:59:50,365 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:59:50,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 02:59:50,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:59:50,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 02:59:50,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2025-03-04 02:59:50,367 INFO L87 Difference]: Start difference. First operand 84 states and 102 transitions. Second operand has 16 states, 16 states have (on average 3.625) internal successors, (58), 16 states have internal predecessors, (58), 2 states have call successors, (10), 2 states have call predecessors, (10), 5 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-04 02:59:50,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:59:50,575 INFO L93 Difference]: Finished difference Result 163 states and 201 transitions. [2025-03-04 02:59:50,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 02:59:50,578 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.625) internal successors, (58), 16 states have internal predecessors, (58), 2 states have call successors, (10), 2 states have call predecessors, (10), 5 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 59 [2025-03-04 02:59:50,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:59:50,580 INFO L225 Difference]: With dead ends: 163 [2025-03-04 02:59:50,580 INFO L226 Difference]: Without dead ends: 97 [2025-03-04 02:59:50,581 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=410, Unknown=0, NotChecked=0, Total=506 [2025-03-04 02:59:50,581 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 14 mSDsluCounter, 696 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 776 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 02:59:50,581 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 776 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 02:59:50,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-03-04 02:59:50,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 91. [2025-03-04 02:59:50,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 62 states have (on average 1.2096774193548387) internal successors, (75), 65 states have internal predecessors, (75), 18 states have call successors, (18), 8 states have call predecessors, (18), 10 states have return successors, (19), 17 states have call predecessors, (19), 17 states have call successors, (19) [2025-03-04 02:59:50,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 112 transitions. [2025-03-04 02:59:50,593 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 112 transitions. Word has length 59 [2025-03-04 02:59:50,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:59:50,593 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 112 transitions. [2025-03-04 02:59:50,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.625) internal successors, (58), 16 states have internal predecessors, (58), 2 states have call successors, (10), 2 states have call predecessors, (10), 5 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-04 02:59:50,593 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 112 transitions. [2025-03-04 02:59:50,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-04 02:59:50,594 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:59:50,594 INFO L218 NwaCegarLoop]: trace histogram [5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:59:50,603 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 02:59:50,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:59:50,795 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:59:50,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:59:50,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1902361270, now seen corresponding path program 1 times [2025-03-04 02:59:50,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:59:50,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991373997] [2025-03-04 02:59:50,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:59:50,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:59:50,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-04 02:59:50,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-04 02:59:50,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:59:50,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:59:51,160 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 02:59:51,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:59:51,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991373997] [2025-03-04 02:59:51,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991373997] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:59:51,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [821334399] [2025-03-04 02:59:51,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:59:51,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:59:51,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:59:51,163 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:59:51,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 02:59:51,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-04 02:59:51,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-04 02:59:51,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:59:51,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:59:51,348 INFO L256 TraceCheckSpWp]: Trace formula consists of 471 conjuncts, 70 conjuncts are in the unsatisfiable core [2025-03-04 02:59:51,354 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:59:51,403 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-03-04 02:59:51,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 67 [2025-03-04 02:59:51,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 150 treesize of output 137 [2025-03-04 02:59:51,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 02:59:51,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 02:59:51,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-03-04 02:59:51,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 02:59:51,491 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 29 treesize of output 37 [2025-03-04 02:59:51,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 02:59:51,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-03-04 02:59:51,505 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 55 treesize of output 54 [2025-03-04 02:59:51,859 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((v_DerPreprocessor_1 (Array Int Int)) (|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| Int) (|ULTIMATE.start_aws_linked_list_remove_harness_~#next~0#1.offset| Int) (v_DerPreprocessor_2 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset| Int) (|v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1| Int)) (let ((.cse0 (select v_arrayElimArr_2 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset|))) (let ((.cse4 (select |c_#memory_$Pointer$#2.base| .cse0))) (let ((.cse2 (select .cse4 |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1|))) (and (= (store (select (let ((.cse3 (store |c_#memory_$Pointer$#2.base| .cse2 v_DerPreprocessor_1))) (let ((.cse1 (store (select (store (store .cse3 .cse0 v_DerPreprocessor_2) |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_2) .cse0) (+ |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1| 8) |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|))) (store (store (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_2) .cse0 .cse1) .cse2 (store (select (store (store .cse3 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_2) .cse0 .cse1) .cse2) (+ |ULTIMATE.start_aws_linked_list_remove_harness_~#next~0#1.offset| 8) .cse0)))) .cse0) |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1| .cse2) .cse4) (<= 2 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|) (not (= .cse2 .cse0)) (not (= .cse2 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|)) (not (= .cse0 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|)) (<= 2 .cse0)))))) (exists ((v_DerPreprocessor_4 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset| Int) (|v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1| Int)) (let ((.cse6 (select v_arrayElimArr_4 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset|))) (let ((.cse7 (select |c_#memory_$Pointer$#2.base| .cse6))) (let ((.cse5 (select .cse7 |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1|))) (and (<= 2 .cse5) (not (= .cse6 .cse5)) (= (store (store (select (store (store |c_#memory_$Pointer$#2.base| .cse6 v_DerPreprocessor_4) .cse5 v_arrayElimArr_4) .cse6) (+ |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1| 8) .cse5) |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1| .cse5) .cse7) (<= 2 .cse6))))))) is different from true [2025-03-04 02:59:52,333 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((v_DerPreprocessor_1 (Array Int Int)) (|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| Int) (|ULTIMATE.start_aws_linked_list_remove_harness_~#next~0#1.offset| Int) (v_DerPreprocessor_2 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset| Int) (|v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1| Int)) (let ((.cse0 (select v_arrayElimArr_2 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset|))) (let ((.cse4 (select |c_#memory_$Pointer$#2.base| .cse0))) (let ((.cse2 (select .cse4 |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1|))) (and (= (store (select (let ((.cse3 (store |c_#memory_$Pointer$#2.base| .cse2 v_DerPreprocessor_1))) (let ((.cse1 (store (select (store (store .cse3 .cse0 v_DerPreprocessor_2) |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_2) .cse0) (+ |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1| 8) |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|))) (store (store (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_2) .cse0 .cse1) .cse2 (store (select (store (store .cse3 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_2) .cse0 .cse1) .cse2) (+ |ULTIMATE.start_aws_linked_list_remove_harness_~#next~0#1.offset| 8) .cse0)))) .cse0) |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1| .cse2) .cse4) (<= 2 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|) (not (= .cse2 .cse0)) (not (= .cse2 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|)) (not (= .cse0 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|)) (<= 2 .cse0)))))) (exists ((v_DerPreprocessor_4 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset| Int) (|v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1| Int)) (let ((.cse6 (select v_arrayElimArr_4 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset|))) (let ((.cse7 (select |c_#memory_$Pointer$#2.base| .cse6))) (let ((.cse5 (select .cse7 |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1|))) (and (<= 2 .cse5) (not (= .cse6 .cse5)) (= (store (store (select (store (store |c_#memory_$Pointer$#2.base| .cse6 v_DerPreprocessor_4) .cse5 v_arrayElimArr_4) .cse6) (+ |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1| 8) .cse5) |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1| .cse5) .cse7) (<= 2 .cse6))))))) (or (exists ((|v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2| Int) (v_DerPreprocessor_4 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset| Int)) (let ((.cse8 (select v_arrayElimArr_4 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset|))) (let ((.cse10 (select |c_#memory_$Pointer$#2.base| .cse8))) (let ((.cse9 (select .cse10 |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2|))) (and (not (= .cse8 .cse9)) (<= 2 .cse9) (<= 2 .cse8) (= .cse10 (store (store (select (store (store |c_#memory_$Pointer$#2.base| .cse8 v_DerPreprocessor_4) .cse9 v_arrayElimArr_4) .cse8) (+ |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2| 8) .cse9) |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2| .cse9))))))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| Int) (|ULTIMATE.start_aws_linked_list_remove_harness_~#next~0#1.offset| Int) (v_DerPreprocessor_2 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2| Int) (|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset| Int)) (let ((.cse12 (select v_arrayElimArr_2 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset|))) (let ((.cse11 (select |c_#memory_$Pointer$#2.base| .cse12))) (let ((.cse14 (select .cse11 |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2|))) (and (<= 2 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|) (= .cse11 (store (select (let ((.cse15 (store |c_#memory_$Pointer$#2.base| .cse14 v_DerPreprocessor_1))) (let ((.cse13 (store (select (store (store .cse15 .cse12 v_DerPreprocessor_2) |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_2) .cse12) (+ |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2| 8) |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|))) (store (store (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_2) .cse12 .cse13) .cse14 (store (select (store (store .cse15 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_2) .cse12 .cse13) .cse14) (+ |ULTIMATE.start_aws_linked_list_remove_harness_~#next~0#1.offset| 8) .cse12)))) .cse12) |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2| .cse14)) (not (= .cse14 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|)) (not (= .cse12 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|)) (not (= .cse14 .cse12)) (<= 2 .cse12)))))))) is different from true [2025-03-04 02:59:53,060 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((v_DerPreprocessor_1 (Array Int Int)) (|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| Int) (|ULTIMATE.start_aws_linked_list_remove_harness_~#next~0#1.offset| Int) (v_DerPreprocessor_2 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset| Int) (|v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1| Int)) (let ((.cse0 (select v_arrayElimArr_2 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset|))) (let ((.cse4 (select |c_#memory_$Pointer$#2.base| .cse0))) (let ((.cse2 (select .cse4 |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1|))) (and (= (store (select (let ((.cse3 (store |c_#memory_$Pointer$#2.base| .cse2 v_DerPreprocessor_1))) (let ((.cse1 (store (select (store (store .cse3 .cse0 v_DerPreprocessor_2) |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_2) .cse0) (+ |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1| 8) |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|))) (store (store (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_2) .cse0 .cse1) .cse2 (store (select (store (store .cse3 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_2) .cse0 .cse1) .cse2) (+ |ULTIMATE.start_aws_linked_list_remove_harness_~#next~0#1.offset| 8) .cse0)))) .cse0) |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1| .cse2) .cse4) (<= 2 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|) (not (= .cse2 .cse0)) (not (= .cse2 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|)) (not (= .cse0 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|)) (<= 2 .cse0)))))) (exists ((v_DerPreprocessor_4 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset| Int) (|v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1| Int)) (let ((.cse6 (select v_arrayElimArr_4 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset|))) (let ((.cse7 (select |c_#memory_$Pointer$#2.base| .cse6))) (let ((.cse5 (select .cse7 |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1|))) (and (<= 2 .cse5) (not (= .cse6 .cse5)) (= (store (store (select (store (store |c_#memory_$Pointer$#2.base| .cse6 v_DerPreprocessor_4) .cse5 v_arrayElimArr_4) .cse6) (+ |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1| 8) .cse5) |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1| .cse5) .cse7) (<= 2 .cse6))))))) (or (exists ((v_DerPreprocessor_4 (Array Int Int)) (|v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_3| Int) (v_arrayElimArr_4 (Array Int Int)) (|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset| Int)) (let ((.cse9 (select v_arrayElimArr_4 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset|))) (let ((.cse10 (select |c_#memory_$Pointer$#2.base| .cse9))) (let ((.cse8 (select .cse10 |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_3|))) (and (not (= .cse8 .cse9)) (<= 2 .cse8) (= (store (store (select (store (store |c_#memory_$Pointer$#2.base| .cse9 v_DerPreprocessor_4) .cse8 v_arrayElimArr_4) .cse9) (+ |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_3| 8) .cse8) |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_3| .cse8) .cse10) (<= 2 .cse9)))))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| Int) (|ULTIMATE.start_aws_linked_list_remove_harness_~#next~0#1.offset| Int) (v_DerPreprocessor_2 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_3| Int) (|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset| Int)) (let ((.cse12 (select v_arrayElimArr_2 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset|))) (let ((.cse13 (select |c_#memory_$Pointer$#2.base| .cse12))) (let ((.cse11 (select .cse13 |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_3|))) (and (not (= .cse11 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|)) (<= 2 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|) (not (= .cse12 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|)) (= .cse13 (store (select (let ((.cse15 (store |c_#memory_$Pointer$#2.base| .cse11 v_DerPreprocessor_1))) (let ((.cse14 (store (select (store (store .cse15 .cse12 v_DerPreprocessor_2) |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_2) .cse12) (+ |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_3| 8) |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|))) (store (store (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_2) .cse12 .cse14) .cse11 (store (select (store (store .cse15 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_2) .cse12 .cse14) .cse11) (+ |ULTIMATE.start_aws_linked_list_remove_harness_~#next~0#1.offset| 8) .cse12)))) .cse12) |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_3| .cse11)) (not (= .cse12 .cse11)) (<= 2 .cse12))))))) (or (exists ((|v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2| Int) (v_DerPreprocessor_4 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset| Int)) (let ((.cse16 (select v_arrayElimArr_4 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset|))) (let ((.cse18 (select |c_#memory_$Pointer$#2.base| .cse16))) (let ((.cse17 (select .cse18 |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2|))) (and (not (= .cse16 .cse17)) (<= 2 .cse17) (<= 2 .cse16) (= .cse18 (store (store (select (store (store |c_#memory_$Pointer$#2.base| .cse16 v_DerPreprocessor_4) .cse17 v_arrayElimArr_4) .cse16) (+ |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2| 8) .cse17) |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2| .cse17))))))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| Int) (|ULTIMATE.start_aws_linked_list_remove_harness_~#next~0#1.offset| Int) (v_DerPreprocessor_2 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2| Int) (|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset| Int)) (let ((.cse20 (select v_arrayElimArr_2 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset|))) (let ((.cse19 (select |c_#memory_$Pointer$#2.base| .cse20))) (let ((.cse22 (select .cse19 |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2|))) (and (<= 2 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|) (= .cse19 (store (select (let ((.cse23 (store |c_#memory_$Pointer$#2.base| .cse22 v_DerPreprocessor_1))) (let ((.cse21 (store (select (store (store .cse23 .cse20 v_DerPreprocessor_2) |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_2) .cse20) (+ |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2| 8) |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|))) (store (store (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_2) .cse20 .cse21) .cse22 (store (select (store (store .cse23 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_2) .cse20 .cse21) .cse22) (+ |ULTIMATE.start_aws_linked_list_remove_harness_~#next~0#1.offset| 8) .cse20)))) .cse20) |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2| .cse22)) (not (= .cse22 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|)) (not (= .cse20 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|)) (not (= .cse22 .cse20)) (<= 2 .cse20)))))))) is different from true [2025-03-04 02:59:53,680 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((v_DerPreprocessor_1 (Array Int Int)) (|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| Int) (|ULTIMATE.start_aws_linked_list_remove_harness_~#next~0#1.offset| Int) (v_DerPreprocessor_2 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset| Int) (|v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1| Int)) (let ((.cse0 (select v_arrayElimArr_2 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset|))) (let ((.cse4 (select |c_#memory_$Pointer$#2.base| .cse0))) (let ((.cse2 (select .cse4 |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1|))) (and (= (store (select (let ((.cse3 (store |c_#memory_$Pointer$#2.base| .cse2 v_DerPreprocessor_1))) (let ((.cse1 (store (select (store (store .cse3 .cse0 v_DerPreprocessor_2) |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_2) .cse0) (+ |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1| 8) |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|))) (store (store (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_2) .cse0 .cse1) .cse2 (store (select (store (store .cse3 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_2) .cse0 .cse1) .cse2) (+ |ULTIMATE.start_aws_linked_list_remove_harness_~#next~0#1.offset| 8) .cse0)))) .cse0) |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1| .cse2) .cse4) (<= 2 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|) (not (= .cse2 .cse0)) (not (= .cse2 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|)) (not (= .cse0 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|)) (<= 2 .cse0)))))) (exists ((v_DerPreprocessor_4 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset| Int) (|v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1| Int)) (let ((.cse6 (select v_arrayElimArr_4 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset|))) (let ((.cse7 (select |c_#memory_$Pointer$#2.base| .cse6))) (let ((.cse5 (select .cse7 |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1|))) (and (<= 2 .cse5) (not (= .cse6 .cse5)) (= (store (store (select (store (store |c_#memory_$Pointer$#2.base| .cse6 v_DerPreprocessor_4) .cse5 v_arrayElimArr_4) .cse6) (+ |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1| 8) .cse5) |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1| .cse5) .cse7) (<= 2 .cse6))))))) (<= 2 |c_aws_linked_list_remove_~node#1.base|) (let ((.cse10 (select |c_#memory_$Pointer$#2.base| |c_aws_linked_list_remove_~node#1.base|))) (let ((.cse8 (select .cse10 |c_aws_linked_list_remove_~node#1.offset|))) (let ((.cse9 (not (= .cse8 |c_aws_linked_list_remove_~node#1.base|))) (.cse11 (+ |c_aws_linked_list_remove_~node#1.offset| 8))) (or (and (<= 2 .cse8) .cse9 (exists ((v_DerPreprocessor_4 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset| Int)) (and (= .cse10 (store (store (select (store (store |c_#memory_$Pointer$#2.base| |c_aws_linked_list_remove_~node#1.base| v_DerPreprocessor_4) .cse8 v_arrayElimArr_4) |c_aws_linked_list_remove_~node#1.base|) .cse11 .cse8) |c_aws_linked_list_remove_~node#1.offset| .cse8)) (= (select v_arrayElimArr_4 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset|) |c_aws_linked_list_remove_~node#1.base|)))) (and .cse9 (exists ((|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| Int) (v_DerPreprocessor_1 (Array Int Int)) (|ULTIMATE.start_aws_linked_list_remove_harness_~#next~0#1.offset| Int) (v_DerPreprocessor_2 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset| Int)) (and (= (select v_arrayElimArr_2 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset|) |c_aws_linked_list_remove_~node#1.base|) (<= 2 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|) (= (store (select (let ((.cse13 (store |c_#memory_$Pointer$#2.base| .cse8 v_DerPreprocessor_1))) (let ((.cse12 (store (select (store (store .cse13 |c_aws_linked_list_remove_~node#1.base| v_DerPreprocessor_2) |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_2) |c_aws_linked_list_remove_~node#1.base|) .cse11 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|))) (store (store (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_2) |c_aws_linked_list_remove_~node#1.base| .cse12) .cse8 (store (select (store (store .cse13 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_2) |c_aws_linked_list_remove_~node#1.base| .cse12) .cse8) (+ |ULTIMATE.start_aws_linked_list_remove_harness_~#next~0#1.offset| 8) |c_aws_linked_list_remove_~node#1.base|)))) |c_aws_linked_list_remove_~node#1.base|) |c_aws_linked_list_remove_~node#1.offset| .cse8) .cse10) (not (= |c_aws_linked_list_remove_~node#1.base| |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|)) (not (= .cse8 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|))))))))) (or (exists ((v_DerPreprocessor_4 (Array Int Int)) (|v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_3| Int) (v_arrayElimArr_4 (Array Int Int)) (|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset| Int)) (let ((.cse15 (select v_arrayElimArr_4 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset|))) (let ((.cse16 (select |c_#memory_$Pointer$#2.base| .cse15))) (let ((.cse14 (select .cse16 |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_3|))) (and (not (= .cse14 .cse15)) (<= 2 .cse14) (= (store (store (select (store (store |c_#memory_$Pointer$#2.base| .cse15 v_DerPreprocessor_4) .cse14 v_arrayElimArr_4) .cse15) (+ |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_3| 8) .cse14) |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_3| .cse14) .cse16) (<= 2 .cse15)))))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| Int) (|ULTIMATE.start_aws_linked_list_remove_harness_~#next~0#1.offset| Int) (v_DerPreprocessor_2 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_3| Int) (|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset| Int)) (let ((.cse18 (select v_arrayElimArr_2 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset|))) (let ((.cse19 (select |c_#memory_$Pointer$#2.base| .cse18))) (let ((.cse17 (select .cse19 |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_3|))) (and (not (= .cse17 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|)) (<= 2 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|) (not (= .cse18 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|)) (= .cse19 (store (select (let ((.cse21 (store |c_#memory_$Pointer$#2.base| .cse17 v_DerPreprocessor_1))) (let ((.cse20 (store (select (store (store .cse21 .cse18 v_DerPreprocessor_2) |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_2) .cse18) (+ |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_3| 8) |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|))) (store (store (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_2) .cse18 .cse20) .cse17 (store (select (store (store .cse21 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_2) .cse18 .cse20) .cse17) (+ |ULTIMATE.start_aws_linked_list_remove_harness_~#next~0#1.offset| 8) .cse18)))) .cse18) |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_3| .cse17)) (not (= .cse18 .cse17)) (<= 2 .cse18))))))) (or (exists ((|v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2| Int) (v_DerPreprocessor_4 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset| Int)) (let ((.cse22 (select v_arrayElimArr_4 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset|))) (let ((.cse24 (select |c_#memory_$Pointer$#2.base| .cse22))) (let ((.cse23 (select .cse24 |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2|))) (and (not (= .cse22 .cse23)) (<= 2 .cse23) (<= 2 .cse22) (= .cse24 (store (store (select (store (store |c_#memory_$Pointer$#2.base| .cse22 v_DerPreprocessor_4) .cse23 v_arrayElimArr_4) .cse22) (+ |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2| 8) .cse23) |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2| .cse23))))))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| Int) (|ULTIMATE.start_aws_linked_list_remove_harness_~#next~0#1.offset| Int) (v_DerPreprocessor_2 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2| Int) (|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset| Int)) (let ((.cse26 (select v_arrayElimArr_2 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset|))) (let ((.cse25 (select |c_#memory_$Pointer$#2.base| .cse26))) (let ((.cse28 (select .cse25 |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2|))) (and (<= 2 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|) (= .cse25 (store (select (let ((.cse29 (store |c_#memory_$Pointer$#2.base| .cse28 v_DerPreprocessor_1))) (let ((.cse27 (store (select (store (store .cse29 .cse26 v_DerPreprocessor_2) |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_2) .cse26) (+ |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2| 8) |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|))) (store (store (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_2) .cse26 .cse27) .cse28 (store (select (store (store .cse29 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_2) .cse26 .cse27) .cse28) (+ |ULTIMATE.start_aws_linked_list_remove_harness_~#next~0#1.offset| 8) .cse26)))) .cse26) |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2| .cse28)) (not (= .cse28 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|)) (not (= .cse26 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|)) (not (= .cse28 .cse26)) (<= 2 .cse26)))))))) is different from true [2025-03-04 02:59:53,886 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((v_DerPreprocessor_1 (Array Int Int)) (|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| Int) (|ULTIMATE.start_aws_linked_list_remove_harness_~#next~0#1.offset| Int) (v_DerPreprocessor_2 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset| Int) (|v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1| Int)) (let ((.cse0 (select v_arrayElimArr_2 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset|))) (let ((.cse4 (select |c_#memory_$Pointer$#2.base| .cse0))) (let ((.cse2 (select .cse4 |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1|))) (and (= (store (select (let ((.cse3 (store |c_#memory_$Pointer$#2.base| .cse2 v_DerPreprocessor_1))) (let ((.cse1 (store (select (store (store .cse3 .cse0 v_DerPreprocessor_2) |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_2) .cse0) (+ |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1| 8) |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|))) (store (store (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_2) .cse0 .cse1) .cse2 (store (select (store (store .cse3 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_2) .cse0 .cse1) .cse2) (+ |ULTIMATE.start_aws_linked_list_remove_harness_~#next~0#1.offset| 8) .cse0)))) .cse0) |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1| .cse2) .cse4) (<= 2 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|) (not (= .cse2 .cse0)) (not (= .cse2 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|)) (not (= .cse0 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|)) (<= 2 .cse0)))))) (exists ((v_DerPreprocessor_4 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset| Int) (|v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1| Int)) (let ((.cse6 (select v_arrayElimArr_4 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset|))) (let ((.cse7 (select |c_#memory_$Pointer$#2.base| .cse6))) (let ((.cse5 (select .cse7 |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1|))) (and (<= 2 .cse5) (not (= .cse6 .cse5)) (= (store (store (select (store (store |c_#memory_$Pointer$#2.base| .cse6 v_DerPreprocessor_4) .cse5 v_arrayElimArr_4) .cse6) (+ |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1| 8) .cse5) |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1| .cse5) .cse7) (<= 2 .cse6))))))) (or (exists ((v_DerPreprocessor_4 (Array Int Int)) (|v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_3| Int) (v_arrayElimArr_4 (Array Int Int)) (|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset| Int)) (let ((.cse9 (select v_arrayElimArr_4 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset|))) (let ((.cse10 (select |c_#memory_$Pointer$#2.base| .cse9))) (let ((.cse8 (select .cse10 |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_3|))) (and (not (= .cse8 .cse9)) (<= 2 .cse8) (= (store (store (select (store (store |c_#memory_$Pointer$#2.base| .cse9 v_DerPreprocessor_4) .cse8 v_arrayElimArr_4) .cse9) (+ |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_3| 8) .cse8) |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_3| .cse8) .cse10) (<= 2 .cse9)))))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| Int) (|ULTIMATE.start_aws_linked_list_remove_harness_~#next~0#1.offset| Int) (v_DerPreprocessor_2 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_3| Int) (|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset| Int)) (let ((.cse12 (select v_arrayElimArr_2 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset|))) (let ((.cse13 (select |c_#memory_$Pointer$#2.base| .cse12))) (let ((.cse11 (select .cse13 |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_3|))) (and (not (= .cse11 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|)) (<= 2 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|) (not (= .cse12 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|)) (= .cse13 (store (select (let ((.cse15 (store |c_#memory_$Pointer$#2.base| .cse11 v_DerPreprocessor_1))) (let ((.cse14 (store (select (store (store .cse15 .cse12 v_DerPreprocessor_2) |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_2) .cse12) (+ |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_3| 8) |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|))) (store (store (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_2) .cse12 .cse14) .cse11 (store (select (store (store .cse15 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_2) .cse12 .cse14) .cse11) (+ |ULTIMATE.start_aws_linked_list_remove_harness_~#next~0#1.offset| 8) .cse12)))) .cse12) |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_3| .cse11)) (not (= .cse12 .cse11)) (<= 2 .cse12))))))) (or (exists ((|v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_4| Int) (v_DerPreprocessor_4 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset| Int)) (let ((.cse17 (select v_arrayElimArr_4 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset|))) (let ((.cse16 (select |c_#memory_$Pointer$#2.base| .cse17))) (let ((.cse18 (select .cse16 |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_4|))) (and (= .cse16 (store (store (select (store (store |c_#memory_$Pointer$#2.base| .cse17 v_DerPreprocessor_4) .cse18 v_arrayElimArr_4) .cse17) (+ |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_4| 8) .cse18) |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_4| .cse18)) (not (= .cse18 .cse17)) (<= 2 .cse18) (<= 2 .cse17)))))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| Int) (|v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_4| Int) (|ULTIMATE.start_aws_linked_list_remove_harness_~#next~0#1.offset| Int) (v_DerPreprocessor_2 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset| Int)) (let ((.cse19 (select v_arrayElimArr_2 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset|))) (let ((.cse23 (select |c_#memory_$Pointer$#2.base| .cse19))) (let ((.cse21 (select .cse23 |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_4|))) (and (= (store (select (let ((.cse22 (store |c_#memory_$Pointer$#2.base| .cse21 v_DerPreprocessor_1))) (let ((.cse20 (store (select (store (store .cse22 .cse19 v_DerPreprocessor_2) |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_2) .cse19) (+ |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_4| 8) |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|))) (store (store (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_2) .cse19 .cse20) .cse21 (store (select (store (store .cse22 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_2) .cse19 .cse20) .cse21) (+ |ULTIMATE.start_aws_linked_list_remove_harness_~#next~0#1.offset| 8) .cse19)))) .cse19) |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_4| .cse21) .cse23) (<= 2 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|) (not (= .cse19 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|)) (not (= .cse21 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|)) (not (= .cse21 .cse19)) (<= 2 .cse19))))))) (or (exists ((|v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2| Int) (v_DerPreprocessor_4 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset| Int)) (let ((.cse24 (select v_arrayElimArr_4 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset|))) (let ((.cse26 (select |c_#memory_$Pointer$#2.base| .cse24))) (let ((.cse25 (select .cse26 |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2|))) (and (not (= .cse24 .cse25)) (<= 2 .cse25) (<= 2 .cse24) (= .cse26 (store (store (select (store (store |c_#memory_$Pointer$#2.base| .cse24 v_DerPreprocessor_4) .cse25 v_arrayElimArr_4) .cse24) (+ |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2| 8) .cse25) |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2| .cse25))))))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| Int) (|ULTIMATE.start_aws_linked_list_remove_harness_~#next~0#1.offset| Int) (v_DerPreprocessor_2 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2| Int) (|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset| Int)) (let ((.cse28 (select v_arrayElimArr_2 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset|))) (let ((.cse27 (select |c_#memory_$Pointer$#2.base| .cse28))) (let ((.cse30 (select .cse27 |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2|))) (and (<= 2 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|) (= .cse27 (store (select (let ((.cse31 (store |c_#memory_$Pointer$#2.base| .cse30 v_DerPreprocessor_1))) (let ((.cse29 (store (select (store (store .cse31 .cse28 v_DerPreprocessor_2) |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_2) .cse28) (+ |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2| 8) |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|))) (store (store (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_2) .cse28 .cse29) .cse30 (store (select (store (store .cse31 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_2) .cse28 .cse29) .cse30) (+ |ULTIMATE.start_aws_linked_list_remove_harness_~#next~0#1.offset| 8) .cse28)))) .cse28) |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2| .cse30)) (not (= .cse30 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|)) (not (= .cse28 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|)) (not (= .cse30 .cse28)) (<= 2 .cse28)))))))) is different from true [2025-03-04 02:59:54,305 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((v_DerPreprocessor_1 (Array Int Int)) (|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| Int) (|ULTIMATE.start_aws_linked_list_remove_harness_~#next~0#1.offset| Int) (v_DerPreprocessor_2 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset| Int) (|v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1| Int)) (let ((.cse0 (select v_arrayElimArr_2 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset|))) (let ((.cse4 (select |c_#memory_$Pointer$#2.base| .cse0))) (let ((.cse2 (select .cse4 |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1|))) (and (= (store (select (let ((.cse3 (store |c_#memory_$Pointer$#2.base| .cse2 v_DerPreprocessor_1))) (let ((.cse1 (store (select (store (store .cse3 .cse0 v_DerPreprocessor_2) |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_2) .cse0) (+ |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1| 8) |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|))) (store (store (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_2) .cse0 .cse1) .cse2 (store (select (store (store .cse3 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_2) .cse0 .cse1) .cse2) (+ |ULTIMATE.start_aws_linked_list_remove_harness_~#next~0#1.offset| 8) .cse0)))) .cse0) |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1| .cse2) .cse4) (<= 2 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|) (not (= .cse2 .cse0)) (not (= .cse2 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|)) (not (= .cse0 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|)) (<= 2 .cse0)))))) (exists ((v_DerPreprocessor_4 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset| Int) (|v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1| Int)) (let ((.cse6 (select v_arrayElimArr_4 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset|))) (let ((.cse7 (select |c_#memory_$Pointer$#2.base| .cse6))) (let ((.cse5 (select .cse7 |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1|))) (and (<= 2 .cse5) (not (= .cse6 .cse5)) (= (store (store (select (store (store |c_#memory_$Pointer$#2.base| .cse6 v_DerPreprocessor_4) .cse5 v_arrayElimArr_4) .cse6) (+ |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1| 8) .cse5) |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1| .cse5) .cse7) (<= 2 .cse6))))))) (<= 2 |c_aws_linked_list_remove_~node#1.base|) (let ((.cse10 (select |c_#memory_$Pointer$#2.base| |c_aws_linked_list_remove_~node#1.base|))) (let ((.cse8 (select .cse10 |c_aws_linked_list_remove_~node#1.offset|))) (let ((.cse9 (not (= .cse8 |c_aws_linked_list_remove_~node#1.base|))) (.cse11 (+ |c_aws_linked_list_remove_~node#1.offset| 8))) (or (and (<= 2 .cse8) .cse9 (exists ((v_DerPreprocessor_4 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset| Int)) (and (= .cse10 (store (store (select (store (store |c_#memory_$Pointer$#2.base| |c_aws_linked_list_remove_~node#1.base| v_DerPreprocessor_4) .cse8 v_arrayElimArr_4) |c_aws_linked_list_remove_~node#1.base|) .cse11 .cse8) |c_aws_linked_list_remove_~node#1.offset| .cse8)) (= (select v_arrayElimArr_4 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset|) |c_aws_linked_list_remove_~node#1.base|)))) (and .cse9 (exists ((|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| Int) (v_DerPreprocessor_1 (Array Int Int)) (|ULTIMATE.start_aws_linked_list_remove_harness_~#next~0#1.offset| Int) (v_DerPreprocessor_2 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset| Int)) (and (= (select v_arrayElimArr_2 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset|) |c_aws_linked_list_remove_~node#1.base|) (<= 2 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|) (= (store (select (let ((.cse13 (store |c_#memory_$Pointer$#2.base| .cse8 v_DerPreprocessor_1))) (let ((.cse12 (store (select (store (store .cse13 |c_aws_linked_list_remove_~node#1.base| v_DerPreprocessor_2) |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_2) |c_aws_linked_list_remove_~node#1.base|) .cse11 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|))) (store (store (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_2) |c_aws_linked_list_remove_~node#1.base| .cse12) .cse8 (store (select (store (store .cse13 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_2) |c_aws_linked_list_remove_~node#1.base| .cse12) .cse8) (+ |ULTIMATE.start_aws_linked_list_remove_harness_~#next~0#1.offset| 8) |c_aws_linked_list_remove_~node#1.base|)))) |c_aws_linked_list_remove_~node#1.base|) |c_aws_linked_list_remove_~node#1.offset| .cse8) .cse10) (not (= |c_aws_linked_list_remove_~node#1.base| |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|)) (not (= .cse8 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|))))))))) (or (exists ((v_DerPreprocessor_4 (Array Int Int)) (|v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_3| Int) (v_arrayElimArr_4 (Array Int Int)) (|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset| Int)) (let ((.cse15 (select v_arrayElimArr_4 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset|))) (let ((.cse16 (select |c_#memory_$Pointer$#2.base| .cse15))) (let ((.cse14 (select .cse16 |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_3|))) (and (not (= .cse14 .cse15)) (<= 2 .cse14) (= (store (store (select (store (store |c_#memory_$Pointer$#2.base| .cse15 v_DerPreprocessor_4) .cse14 v_arrayElimArr_4) .cse15) (+ |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_3| 8) .cse14) |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_3| .cse14) .cse16) (<= 2 .cse15)))))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| Int) (|ULTIMATE.start_aws_linked_list_remove_harness_~#next~0#1.offset| Int) (v_DerPreprocessor_2 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_3| Int) (|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset| Int)) (let ((.cse18 (select v_arrayElimArr_2 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset|))) (let ((.cse19 (select |c_#memory_$Pointer$#2.base| .cse18))) (let ((.cse17 (select .cse19 |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_3|))) (and (not (= .cse17 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|)) (<= 2 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|) (not (= .cse18 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|)) (= .cse19 (store (select (let ((.cse21 (store |c_#memory_$Pointer$#2.base| .cse17 v_DerPreprocessor_1))) (let ((.cse20 (store (select (store (store .cse21 .cse18 v_DerPreprocessor_2) |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_2) .cse18) (+ |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_3| 8) |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|))) (store (store (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_2) .cse18 .cse20) .cse17 (store (select (store (store .cse21 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_2) .cse18 .cse20) .cse17) (+ |ULTIMATE.start_aws_linked_list_remove_harness_~#next~0#1.offset| 8) .cse18)))) .cse18) |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_3| .cse17)) (not (= .cse18 .cse17)) (<= 2 .cse18))))))) (or (exists ((|v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_4| Int) (v_DerPreprocessor_4 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset| Int)) (let ((.cse23 (select v_arrayElimArr_4 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset|))) (let ((.cse22 (select |c_#memory_$Pointer$#2.base| .cse23))) (let ((.cse24 (select .cse22 |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_4|))) (and (= .cse22 (store (store (select (store (store |c_#memory_$Pointer$#2.base| .cse23 v_DerPreprocessor_4) .cse24 v_arrayElimArr_4) .cse23) (+ |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_4| 8) .cse24) |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_4| .cse24)) (not (= .cse24 .cse23)) (<= 2 .cse24) (<= 2 .cse23)))))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| Int) (|v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_4| Int) (|ULTIMATE.start_aws_linked_list_remove_harness_~#next~0#1.offset| Int) (v_DerPreprocessor_2 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset| Int)) (let ((.cse25 (select v_arrayElimArr_2 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset|))) (let ((.cse29 (select |c_#memory_$Pointer$#2.base| .cse25))) (let ((.cse27 (select .cse29 |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_4|))) (and (= (store (select (let ((.cse28 (store |c_#memory_$Pointer$#2.base| .cse27 v_DerPreprocessor_1))) (let ((.cse26 (store (select (store (store .cse28 .cse25 v_DerPreprocessor_2) |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_2) .cse25) (+ |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_4| 8) |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|))) (store (store (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_2) .cse25 .cse26) .cse27 (store (select (store (store .cse28 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_2) .cse25 .cse26) .cse27) (+ |ULTIMATE.start_aws_linked_list_remove_harness_~#next~0#1.offset| 8) .cse25)))) .cse25) |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_4| .cse27) .cse29) (<= 2 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|) (not (= .cse25 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|)) (not (= .cse27 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|)) (not (= .cse27 .cse25)) (<= 2 .cse25))))))) (or (exists ((|v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2| Int) (v_DerPreprocessor_4 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset| Int)) (let ((.cse30 (select v_arrayElimArr_4 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset|))) (let ((.cse32 (select |c_#memory_$Pointer$#2.base| .cse30))) (let ((.cse31 (select .cse32 |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2|))) (and (not (= .cse30 .cse31)) (<= 2 .cse31) (<= 2 .cse30) (= .cse32 (store (store (select (store (store |c_#memory_$Pointer$#2.base| .cse30 v_DerPreprocessor_4) .cse31 v_arrayElimArr_4) .cse30) (+ |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2| 8) .cse31) |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2| .cse31))))))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| Int) (|ULTIMATE.start_aws_linked_list_remove_harness_~#next~0#1.offset| Int) (v_DerPreprocessor_2 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2| Int) (|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset| Int)) (let ((.cse34 (select v_arrayElimArr_2 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset|))) (let ((.cse33 (select |c_#memory_$Pointer$#2.base| .cse34))) (let ((.cse36 (select .cse33 |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2|))) (and (<= 2 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|) (= .cse33 (store (select (let ((.cse37 (store |c_#memory_$Pointer$#2.base| .cse36 v_DerPreprocessor_1))) (let ((.cse35 (store (select (store (store .cse37 .cse34 v_DerPreprocessor_2) |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_2) .cse34) (+ |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2| 8) |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|))) (store (store (store |c_#memory_$Pointer$#2.base| |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_2) .cse34 .cse35) .cse36 (store (select (store (store .cse37 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_2) .cse34 .cse35) .cse36) (+ |ULTIMATE.start_aws_linked_list_remove_harness_~#next~0#1.offset| 8) .cse34)))) .cse34) |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2| .cse36)) (not (= .cse36 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|)) (not (= .cse34 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|)) (not (= .cse36 .cse34)) (<= 2 .cse34)))))))) is different from true [2025-03-04 02:59:55,419 INFO L349 Elim1Store]: treesize reduction 429, result has 56.9 percent of original size [2025-03-04 02:59:55,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 12 new quantified variables, introduced 54 case distinctions, treesize of input 3764 treesize of output 3259 [2025-03-04 02:59:55,490 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 194 treesize of output 166 [2025-03-04 02:59:55,518 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 192 treesize of output 164 [2025-03-04 02:59:55,546 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 77 treesize of output 82 [2025-03-04 02:59:55,580 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 190 treesize of output 162 [2025-03-04 02:59:55,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 94 [2025-03-04 02:59:55,644 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 182 treesize of output 156 [2025-03-04 02:59:55,667 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 180 treesize of output 154 [2025-03-04 02:59:55,692 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 71 treesize of output 76 [2025-03-04 02:59:55,726 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 186 treesize of output 160 [2025-03-04 02:59:55,751 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 180 treesize of output 152 [2025-03-04 02:59:55,777 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 89 treesize of output 87 [2025-03-04 02:59:55,802 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 176 treesize of output 150 [2025-03-04 02:59:55,829 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 67 treesize of output 72 [2025-03-04 02:59:55,864 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 67 treesize of output 72 [2025-03-04 02:59:55,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 92 [2025-03-04 02:59:55,948 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 69 treesize of output 74 [2025-03-04 02:59:55,978 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 171 treesize of output 145 [2025-03-04 02:59:56,012 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 69 treesize of output 74 [2025-03-04 02:59:56,047 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 69 treesize of output 74 [2025-03-04 02:59:56,082 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 71 treesize of output 69 [2025-03-04 02:59:56,120 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 69 treesize of output 74 [2025-03-04 02:59:56,271 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 5 [2025-03-04 02:59:56,359 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 5 [2025-03-04 02:59:56,466 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:59:56,466 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 17 treesize of output 11 [2025-03-04 02:59:56,564 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 5 [2025-03-04 02:59:56,703 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:59:56,704 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 17 treesize of output 11 [2025-03-04 02:59:56,773 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:59:56,774 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 17 treesize of output 11 [2025-03-04 02:59:56,855 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 02:59:56,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 11 [2025-03-04 02:59:56,910 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 5 [2025-03-04 03:00:06,133 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 03:00:06,133 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 32 treesize of output 16 [2025-03-04 03:00:23,669 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 03:00:23,669 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 21 treesize of output 11 [2025-03-04 03:00:24,918 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 03:00:24,918 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 21 treesize of output 11 [2025-03-04 03:00:26,100 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 03:00:26,100 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 21 treesize of output 11 [2025-03-04 03:00:26,658 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 03:00:26,658 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 21 treesize of output 11 [2025-03-04 03:00:27,190 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 03:00:27,190 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 21 treesize of output 11 [2025-03-04 03:00:28,784 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 03:00:28,784 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 21 treesize of output 11 [2025-03-04 03:00:29,346 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 03:00:29,346 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 21 treesize of output 11 [2025-03-04 03:00:29,922 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 03:00:29,922 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 21 treesize of output 11 [2025-03-04 03:00:31,204 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 03:00:31,204 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 21 treesize of output 11 [2025-03-04 03:00:33,550 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 03:00:33,550 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 21 treesize of output 11 [2025-03-04 03:00:34,217 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 03:00:34,217 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 21 treesize of output 11 [2025-03-04 03:00:34,744 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 03:00:34,745 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 21 treesize of output 11 [2025-03-04 03:00:35,500 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 03:00:35,501 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 21 treesize of output 11 [2025-03-04 03:00:36,068 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 03:00:36,068 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 21 treesize of output 11 [2025-03-04 03:00:36,714 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 03:00:36,714 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 21 treesize of output 11 [2025-03-04 03:00:37,218 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 03:00:37,218 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 21 treesize of output 11 [2025-03-04 03:00:38,752 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 03:00:38,752 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 21 treesize of output 11 [2025-03-04 03:00:39,303 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 03:00:39,303 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 21 treesize of output 11 [2025-03-04 03:00:52,087 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 03:00:52,088 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 21 treesize of output 11 [2025-03-04 03:00:52,691 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 03:00:52,691 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 21 treesize of output 11 [2025-03-04 03:00:53,993 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 03:00:53,993 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 21 treesize of output 11 [2025-03-04 03:00:54,499 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 03:00:54,499 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 21 treesize of output 11 [2025-03-04 03:00:55,072 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 03:00:55,073 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 21 treesize of output 11 [2025-03-04 03:00:55,655 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 03:00:55,657 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 21 treesize of output 11 [2025-03-04 03:00:57,693 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 03:00:57,693 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 21 treesize of output 11 [2025-03-04 03:00:58,396 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 03:00:58,396 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 21 treesize of output 11 [2025-03-04 03:00:59,568 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 03:00:59,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 121 treesize of output 131