./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 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/aws-c-common/aws_linked_list_remove_harness_negated.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 59c6b72a732d91c045894268c659507998ee445c19bfbe580f6574a50ad495ad --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 01:54:00,039 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 01:54:00,084 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-08 01:54:00,087 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 01:54:00,087 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 01:54:00,100 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 01:54:00,100 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 01:54:00,100 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 01:54:00,101 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 01:54:00,101 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 01:54:00,101 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 01:54:00,101 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 01:54:00,101 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 01:54:00,101 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 01:54:00,101 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 01:54:00,101 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 01:54:00,101 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 01:54:00,101 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 01:54:00,102 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 01:54:00,102 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 01:54:00,102 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 01:54:00,102 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 01:54:00,102 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 01:54:00,102 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 01:54:00,102 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 01:54:00,102 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 01:54:00,102 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 01:54:00,102 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 01:54:00,103 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 01:54:00,103 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 01:54:00,103 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 01:54:00,103 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 01:54:00,103 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 01:54:00,103 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 01:54:00,103 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 01:54:00,103 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 01:54:00,103 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 01:54:00,103 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 01:54:00,103 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 01:54:00,103 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 01:54:00,103 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 59c6b72a732d91c045894268c659507998ee445c19bfbe580f6574a50ad495ad [2025-02-08 01:54:00,349 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 01:54:00,354 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 01:54:00,357 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 01:54:00,359 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 01:54:00,359 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 01:54:00,360 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_linked_list_remove_harness_negated.i [2025-02-08 01:54:01,613 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0a1edae1a/d35ab55e04b944f0a5bcee5cf56a217c/FLAG387d6887e [2025-02-08 01:54:01,993 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 01:54:01,996 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_remove_harness_negated.i [2025-02-08 01:54:02,021 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0a1edae1a/d35ab55e04b944f0a5bcee5cf56a217c/FLAG387d6887e [2025-02-08 01:54:02,190 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0a1edae1a/d35ab55e04b944f0a5bcee5cf56a217c [2025-02-08 01:54:02,191 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 01:54:02,192 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 01:54:02,193 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 01:54:02,193 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 01:54:02,197 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 01:54:02,201 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:54:02" (1/1) ... [2025-02-08 01:54:02,201 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ebf33d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:54:02, skipping insertion in model container [2025-02-08 01:54:02,201 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:54:02" (1/1) ... [2025-02-08 01:54:02,249 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 01:54:02,450 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_remove_harness_negated.i[4496,4509] [2025-02-08 01:54:02,458 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_remove_harness_negated.i[4556,4569] [2025-02-08 01:54:02,850 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:54:02,853 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:54:02,854 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:54:02,854 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:54:02,855 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:54:02,865 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:54:02,866 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:54:02,867 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:54:02,867 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:54:02,869 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:54:02,869 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:54:02,870 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:54:02,870 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:54:03,183 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_remove_harness_negated.i[150856,150869] [2025-02-08 01:54:03,184 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 01:54:03,193 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 01:54:03,201 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_remove_harness_negated.i[4496,4509] [2025-02-08 01:54:03,201 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_remove_harness_negated.i[4556,4569] [2025-02-08 01:54:03,228 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:54:03,228 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:54:03,228 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:54:03,228 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:54:03,229 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:54:03,235 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:54:03,235 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:54:03,235 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:54:03,236 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:54:03,236 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:54:03,237 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:54:03,237 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:54:03,237 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:54:03,320 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_remove_harness_negated.i[150856,150869] [2025-02-08 01:54:03,320 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 01:54:03,436 INFO L204 MainTranslator]: Completed translation [2025-02-08 01:54:03,436 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:54:03 WrapperNode [2025-02-08 01:54:03,436 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 01:54:03,437 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 01:54:03,437 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 01:54:03,437 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 01:54:03,441 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:54:03" (1/1) ... [2025-02-08 01:54:03,489 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:54:03" (1/1) ... [2025-02-08 01:54:03,513 INFO L138 Inliner]: procedures = 668, calls = 1048, calls flagged for inlining = 50, calls inlined = 4, statements flattened = 86 [2025-02-08 01:54:03,514 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 01:54:03,514 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 01:54:03,514 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 01:54:03,514 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 01:54:03,520 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:54:03" (1/1) ... [2025-02-08 01:54:03,520 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:54:03" (1/1) ... [2025-02-08 01:54:03,522 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:54:03" (1/1) ... [2025-02-08 01:54:03,541 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-02-08 01:54:03,542 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:54:03" (1/1) ... [2025-02-08 01:54:03,542 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:54:03" (1/1) ... [2025-02-08 01:54:03,553 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:54:03" (1/1) ... [2025-02-08 01:54:03,553 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:54:03" (1/1) ... [2025-02-08 01:54:03,555 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:54:03" (1/1) ... [2025-02-08 01:54:03,556 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:54:03" (1/1) ... [2025-02-08 01:54:03,563 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 01:54:03,563 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 01:54:03,567 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 01:54:03,567 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 01:54:03,568 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:54:03" (1/1) ... [2025-02-08 01:54:03,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 01:54:03,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:54:03,599 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 01:54:03,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 01:54:03,616 INFO L130 BoogieDeclarations]: Found specification of procedure aws_is_mem_zeroed [2025-02-08 01:54:03,616 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_is_mem_zeroed [2025-02-08 01:54:03,616 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_remove [2025-02-08 01:54:03,616 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_remove [2025-02-08 01:54:03,616 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 01:54:03,616 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 01:54:03,616 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 01:54:03,616 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-08 01:54:03,616 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-08 01:54:03,616 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-08 01:54:03,616 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2025-02-08 01:54:03,616 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2025-02-08 01:54:03,616 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 01:54:03,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-08 01:54:03,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-08 01:54:03,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-08 01:54:03,617 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 01:54:03,617 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 01:54:03,617 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-02-08 01:54:03,617 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-02-08 01:54:03,617 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-02-08 01:54:03,617 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-02-08 01:54:03,617 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-02-08 01:54:03,617 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-02-08 01:54:03,617 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-08 01:54:03,617 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-08 01:54:03,617 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 01:54:03,617 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-08 01:54:03,617 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-08 01:54:03,617 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-08 01:54:03,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-08 01:54:03,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-08 01:54:03,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-02-08 01:54:03,618 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_prev_is_valid [2025-02-08 01:54:03,618 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_prev_is_valid [2025-02-08 01:54:03,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 01:54:03,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 01:54:03,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 01:54:03,756 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 01:54:03,757 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 01:54:03,795 INFO L1324 $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-02-08 01:54:03,844 INFO L1324 $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-02-08 01:54:03,945 INFO L? ?]: Removed 48 outVars from TransFormulas that were not future-live. [2025-02-08 01:54:03,946 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 01:54:03,953 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 01:54:03,953 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 01:54:03,953 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:54:03 BoogieIcfgContainer [2025-02-08 01:54:03,953 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 01:54:03,955 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 01:54:03,955 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 01:54:03,958 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 01:54:03,958 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 01:54:02" (1/3) ... [2025-02-08 01:54:03,959 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7637b49c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:54:03, skipping insertion in model container [2025-02-08 01:54:03,959 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:54:03" (2/3) ... [2025-02-08 01:54:03,959 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7637b49c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:54:03, skipping insertion in model container [2025-02-08 01:54:03,959 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:54:03" (3/3) ... [2025-02-08 01:54:03,960 INFO L128 eAbstractionObserver]: Analyzing ICFG aws_linked_list_remove_harness_negated.i [2025-02-08 01:54:03,972 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 01:54:03,973 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG aws_linked_list_remove_harness_negated.i that has 10 procedures, 77 locations, 1 initial locations, 5 loop locations, and 1 error locations. [2025-02-08 01:54:04,013 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 01:54:04,022 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;@2401286e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 01:54:04,022 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-08 01:54:04,025 INFO L276 IsEmpty]: Start isEmpty. Operand has 69 states, 43 states have (on average 1.302325581395349) internal successors, (56), 45 states have internal predecessors, (56), 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-02-08 01:54:04,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-02-08 01:54:04,029 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:54:04,029 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] [2025-02-08 01:54:04,029 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:54:04,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:54:04,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1074276161, now seen corresponding path program 1 times [2025-02-08 01:54:04,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:54:04,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522141203] [2025-02-08 01:54:04,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:54:04,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:54:04,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-08 01:54:04,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-08 01:54:04,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:54:04,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:54:04,318 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-08 01:54:04,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:54:04,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522141203] [2025-02-08 01:54:04,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522141203] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:54:04,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1774229029] [2025-02-08 01:54:04,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:54:04,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:54:04,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:54:04,321 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 01:54:04,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 01:54:04,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-08 01:54:04,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-08 01:54:04,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:54:04,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:54:04,461 INFO L256 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-08 01:54:04,463 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:54:04,470 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-08 01:54:04,470 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 01:54:04,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1774229029] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:54:04,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 01:54:04,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-08 01:54:04,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532548293] [2025-02-08 01:54:04,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:54:04,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 01:54:04,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:54:04,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 01:54:04,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 01:54:04,486 INFO L87 Difference]: Start difference. First operand has 69 states, 43 states have (on average 1.302325581395349) internal successors, (56), 45 states have internal predecessors, (56), 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.0) internal successors, (28), 2 states have internal predecessors, (28), 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-02-08 01:54:04,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:54:04,499 INFO L93 Difference]: Finished difference Result 133 states and 183 transitions. [2025-02-08 01:54:04,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 01:54:04,500 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 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 46 [2025-02-08 01:54:04,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:54:04,508 INFO L225 Difference]: With dead ends: 133 [2025-02-08 01:54:04,508 INFO L226 Difference]: Without dead ends: 66 [2025-02-08 01:54:04,510 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 01:54:04,515 INFO L435 NwaCegarLoop]: 86 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, 86 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 01:54:04,515 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 01:54:04,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-02-08 01:54:04,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2025-02-08 01:54:04,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 42 states have internal predecessors, (50), 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-02-08 01:54:04,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 83 transitions. [2025-02-08 01:54:04,541 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 83 transitions. Word has length 46 [2025-02-08 01:54:04,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:54:04,543 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 83 transitions. [2025-02-08 01:54:04,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 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-02-08 01:54:04,544 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 83 transitions. [2025-02-08 01:54:04,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-02-08 01:54:04,545 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:54:04,546 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-02-08 01:54:04,555 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-08 01:54:04,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-08 01:54:04,750 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:54:04,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:54:04,751 INFO L85 PathProgramCache]: Analyzing trace with hash -925416750, now seen corresponding path program 1 times [2025-02-08 01:54:04,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:54:04,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469282350] [2025-02-08 01:54:04,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:54:04,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:54:04,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-02-08 01:54:04,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-02-08 01:54:04,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:54:04,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:54:05,443 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-08 01:54:05,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:54:05,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469282350] [2025-02-08 01:54:05,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469282350] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:54:05,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:54:05,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-08 01:54:05,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007608123] [2025-02-08 01:54:05,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:54:05,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 01:54:05,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:54:05,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 01:54:05,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-08 01:54:05,445 INFO L87 Difference]: Start difference. First operand 66 states and 83 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-02-08 01:54:05,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:54:05,641 INFO L93 Difference]: Finished difference Result 133 states and 167 transitions. [2025-02-08 01:54:05,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 01:54:05,642 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-02-08 01:54:05,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:54:05,643 INFO L225 Difference]: With dead ends: 133 [2025-02-08 01:54:05,643 INFO L226 Difference]: Without dead ends: 74 [2025-02-08 01:54:05,644 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-02-08 01:54:05,644 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 12 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 01:54:05,644 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 490 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 01:54:05,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-02-08 01:54:05,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 71. [2025-02-08 01:54:05,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 45 states have (on average 1.2222222222222223) internal successors, (55), 47 states have internal predecessors, (55), 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-02-08 01:54:05,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 89 transitions. [2025-02-08 01:54:05,659 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 89 transitions. Word has length 53 [2025-02-08 01:54:05,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:54:05,659 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 89 transitions. [2025-02-08 01:54:05,659 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-02-08 01:54:05,659 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 89 transitions. [2025-02-08 01:54:05,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-02-08 01:54:05,660 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:54:05,660 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-02-08 01:54:05,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 01:54:05,661 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:54:05,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:54:05,662 INFO L85 PathProgramCache]: Analyzing trace with hash 1084687091, now seen corresponding path program 1 times [2025-02-08 01:54:05,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:54:05,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839766006] [2025-02-08 01:54:05,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:54:05,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:54:05,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-02-08 01:54:05,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-02-08 01:54:05,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:54:05,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:54:05,913 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-08 01:54:05,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:54:05,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839766006] [2025-02-08 01:54:05,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839766006] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:54:05,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:54:05,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 01:54:05,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861562502] [2025-02-08 01:54:05,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:54:05,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 01:54:05,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:54:05,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 01:54:05,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 01:54:05,915 INFO L87 Difference]: Start difference. First operand 71 states and 89 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-02-08 01:54:05,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:54:05,927 INFO L93 Difference]: Finished difference Result 125 states and 157 transitions. [2025-02-08 01:54:05,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 01:54:05,927 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-02-08 01:54:05,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:54:05,928 INFO L225 Difference]: With dead ends: 125 [2025-02-08 01:54:05,928 INFO L226 Difference]: Without dead ends: 72 [2025-02-08 01:54:05,928 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-02-08 01:54:05,929 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 0 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 241 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-02-08 01:54:05,929 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 241 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 01:54:05,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-02-08 01:54:05,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2025-02-08 01:54:05,933 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-02-08 01:54:05,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 90 transitions. [2025-02-08 01:54:05,934 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 90 transitions. Word has length 53 [2025-02-08 01:54:05,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:54:05,934 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 90 transitions. [2025-02-08 01:54:05,934 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-02-08 01:54:05,934 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 90 transitions. [2025-02-08 01:54:05,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-02-08 01:54:05,935 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:54:05,935 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-02-08 01:54:05,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 01:54:05,935 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:54:05,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:54:05,936 INFO L85 PathProgramCache]: Analyzing trace with hash 75450372, now seen corresponding path program 1 times [2025-02-08 01:54:05,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:54:05,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647443253] [2025-02-08 01:54:05,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:54:05,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:54:05,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-08 01:54:06,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-08 01:54:06,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:54:06,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:54:06,160 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-08 01:54:06,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:54:06,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647443253] [2025-02-08 01:54:06,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647443253] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:54:06,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1231852845] [2025-02-08 01:54:06,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:54:06,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:54:06,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:54:06,163 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 01:54:06,168 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 01:54:06,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-08 01:54:06,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-08 01:54:06,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:54:06,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:54:06,316 INFO L256 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-08 01:54:06,318 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:54:06,373 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-08 01:54:06,373 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 01:54:06,448 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-02-08 01:54:06,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1231852845] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-08 01:54:06,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-08 01:54:06,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 6] total 10 [2025-02-08 01:54:06,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70767930] [2025-02-08 01:54:06,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:54:06,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 01:54:06,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:54:06,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 01:54:06,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-02-08 01:54:06,450 INFO L87 Difference]: Start difference. First operand 72 states and 90 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-02-08 01:54:06,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:54:06,468 INFO L93 Difference]: Finished difference Result 120 states and 150 transitions. [2025-02-08 01:54:06,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 01:54:06,469 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-02-08 01:54:06,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:54:06,469 INFO L225 Difference]: With dead ends: 120 [2025-02-08 01:54:06,469 INFO L226 Difference]: Without dead ends: 75 [2025-02-08 01:54:06,470 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-02-08 01:54:06,470 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 3 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 233 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-02-08 01:54:06,471 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 233 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 01:54:06,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-02-08 01:54:06,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2025-02-08 01:54:06,475 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-02-08 01:54:06,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 91 transitions. [2025-02-08 01:54:06,476 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 91 transitions. Word has length 54 [2025-02-08 01:54:06,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:54:06,476 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 91 transitions. [2025-02-08 01:54:06,476 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-02-08 01:54:06,476 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 91 transitions. [2025-02-08 01:54:06,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-02-08 01:54:06,477 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:54:06,477 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-02-08 01:54:06,486 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-08 01:54:06,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:54:06,682 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:54:06,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:54:06,683 INFO L85 PathProgramCache]: Analyzing trace with hash 548411904, now seen corresponding path program 1 times [2025-02-08 01:54:06,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:54:06,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734495242] [2025-02-08 01:54:06,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:54:06,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:54:06,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-08 01:54:06,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-08 01:54:06,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:54:06,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:54:06,922 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-02-08 01:54:06,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:54:06,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734495242] [2025-02-08 01:54:06,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734495242] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:54:06,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:54:06,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 01:54:06,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266494172] [2025-02-08 01:54:06,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:54:06,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 01:54:06,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:54:06,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 01:54:06,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 01:54:06,923 INFO L87 Difference]: Start difference. First operand 73 states and 91 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-02-08 01:54:06,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:54:06,954 INFO L93 Difference]: Finished difference Result 83 states and 101 transitions. [2025-02-08 01:54:06,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 01:54:06,955 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-02-08 01:54:06,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:54:06,955 INFO L225 Difference]: With dead ends: 83 [2025-02-08 01:54:06,955 INFO L226 Difference]: Without dead ends: 81 [2025-02-08 01:54:06,956 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-08 01:54:06,956 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 3 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 01:54:06,956 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 390 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 01:54:06,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-02-08 01:54:06,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2025-02-08 01:54:06,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 51 states have (on average 1.196078431372549) internal successors, (61), 54 states have internal predecessors, (61), 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-02-08 01:54:06,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 98 transitions. [2025-02-08 01:54:06,963 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 98 transitions. Word has length 55 [2025-02-08 01:54:06,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:54:06,963 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 98 transitions. [2025-02-08 01:54:06,963 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-02-08 01:54:06,963 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 98 transitions. [2025-02-08 01:54:06,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-02-08 01:54:06,964 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:54:06,964 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-02-08 01:54:06,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 01:54:06,964 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:54:06,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:54:06,964 INFO L85 PathProgramCache]: Analyzing trace with hash -383153563, now seen corresponding path program 1 times [2025-02-08 01:54:06,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:54:06,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674286838] [2025-02-08 01:54:06,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:54:06,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:54:06,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-08 01:54:07,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-08 01:54:07,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:54:07,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:54:07,163 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-02-08 01:54:07,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:54:07,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674286838] [2025-02-08 01:54:07,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674286838] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:54:07,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1724201360] [2025-02-08 01:54:07,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:54:07,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:54:07,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:54:07,166 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 01:54:07,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 01:54:07,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-08 01:54:07,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-08 01:54:07,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:54:07,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:54:07,334 INFO L256 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-08 01:54:07,336 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:54:07,362 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-02-08 01:54:07,363 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 01:54:07,437 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-02-08 01:54:07,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1724201360] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 01:54:07,438 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 01:54:07,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-02-08 01:54:07,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357803565] [2025-02-08 01:54:07,438 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 01:54:07,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 01:54:07,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:54:07,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 01:54:07,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-02-08 01:54:07,439 INFO L87 Difference]: Start difference. First operand 80 states and 98 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-02-08 01:54:07,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:54:07,484 INFO L93 Difference]: Finished difference Result 146 states and 180 transitions. [2025-02-08 01:54:07,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 01:54:07,485 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-02-08 01:54:07,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:54:07,486 INFO L225 Difference]: With dead ends: 146 [2025-02-08 01:54:07,486 INFO L226 Difference]: Without dead ends: 83 [2025-02-08 01:54:07,486 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2025-02-08 01:54:07,487 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 0 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 480 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-02-08 01:54:07,487 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 480 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 01:54:07,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-02-08 01:54:07,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2025-02-08 01:54:07,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 54 states have (on average 1.1851851851851851) internal successors, (64), 57 states have internal predecessors, (64), 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-02-08 01:54:07,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 101 transitions. [2025-02-08 01:54:07,500 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 101 transitions. Word has length 56 [2025-02-08 01:54:07,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:54:07,500 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 101 transitions. [2025-02-08 01:54:07,500 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-02-08 01:54:07,500 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 101 transitions. [2025-02-08 01:54:07,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-02-08 01:54:07,501 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:54:07,501 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-02-08 01:54:07,516 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-08 01:54:07,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:54:07,702 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:54:07,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:54:07,702 INFO L85 PathProgramCache]: Analyzing trace with hash 962687444, now seen corresponding path program 2 times [2025-02-08 01:54:07,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:54:07,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961534475] [2025-02-08 01:54:07,702 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 01:54:07,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:54:07,725 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 59 statements into 2 equivalence classes. [2025-02-08 01:54:07,755 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 59 of 59 statements. [2025-02-08 01:54:07,755 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 01:54:07,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:54:07,958 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-02-08 01:54:07,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:54:07,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961534475] [2025-02-08 01:54:07,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961534475] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:54:07,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1063125564] [2025-02-08 01:54:07,958 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 01:54:07,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:54:07,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:54:07,960 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 01:54:07,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-08 01:54:08,074 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 59 statements into 2 equivalence classes. [2025-02-08 01:54:08,129 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 59 of 59 statements. [2025-02-08 01:54:08,129 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 01:54:08,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:54:08,131 INFO L256 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-08 01:54:08,133 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:54:08,200 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-08 01:54:08,200 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 01:54:08,292 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-08 01:54:08,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1063125564] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 01:54:08,292 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 01:54:08,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 5] total 16 [2025-02-08 01:54:08,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119200327] [2025-02-08 01:54:08,293 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 01:54:08,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-08 01:54:08,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:54:08,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-08 01:54:08,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2025-02-08 01:54:08,294 INFO L87 Difference]: Start difference. First operand 83 states and 101 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-02-08 01:54:08,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:54:08,493 INFO L93 Difference]: Finished difference Result 161 states and 199 transitions. [2025-02-08 01:54:08,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-08 01:54:08,493 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-02-08 01:54:08,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:54:08,494 INFO L225 Difference]: With dead ends: 161 [2025-02-08 01:54:08,494 INFO L226 Difference]: Without dead ends: 96 [2025-02-08 01:54:08,495 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-02-08 01:54:08,495 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 19 mSDsluCounter, 620 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 699 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 01:54:08,496 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 699 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 01:54:08,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-02-08 01:54:08,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 90. [2025-02-08 01:54:08,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 61 states have (on average 1.2131147540983607) internal successors, (74), 64 states have internal predecessors, (74), 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-02-08 01:54:08,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 111 transitions. [2025-02-08 01:54:08,502 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 111 transitions. Word has length 59 [2025-02-08 01:54:08,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:54:08,503 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 111 transitions. [2025-02-08 01:54:08,503 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-02-08 01:54:08,503 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 111 transitions. [2025-02-08 01:54:08,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-08 01:54:08,503 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:54:08,504 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] [2025-02-08 01:54:08,511 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-08 01:54:08,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-02-08 01:54:08,708 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:54:08,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:54:08,709 INFO L85 PathProgramCache]: Analyzing trace with hash -429797872, now seen corresponding path program 1 times [2025-02-08 01:54:08,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:54:08,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821334399] [2025-02-08 01:54:08,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:54:08,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:54:08,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-08 01:54:08,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-08 01:54:08,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:54:08,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:54:09,023 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-08 01:54:09,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:54:09,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821334399] [2025-02-08 01:54:09,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821334399] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:54:09,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1985006816] [2025-02-08 01:54:09,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:54:09,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:54:09,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:54:09,025 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 01:54:09,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-08 01:54:09,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-08 01:54:09,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-08 01:54:09,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:54:09,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:54:09,226 INFO L256 TraceCheckSpWp]: Trace formula consists of 471 conjuncts, 74 conjuncts are in the unsatisfiable core [2025-02-08 01:54:09,231 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:54:09,258 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-02-08 01:54:09,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 01:54:09,268 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-02-08 01:54:09,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 01:54:09,273 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-02-08 01:54:09,282 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-02-08 01:54:09,299 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-02-08 01:54:09,310 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-02-08 01:54:09,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 01:54:09,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 01:54:09,320 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-02-08 01:54:09,665 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| Int) (v_DerPreprocessor_3 (Array Int Int)) (|ULTIMATE.start_aws_linked_list_remove_harness_~#next~0#1.offset| 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) (|v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1| Int)) (let ((.cse0 (select v_arrayElimArr_4 |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_3))) (let ((.cse1 (store (select (store (store .cse3 .cse0 v_DerPreprocessor_4) |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_4) .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_4) .cse0 .cse1) .cse2 (store (select (store (store .cse3 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_4) .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) (not (= .cse0 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|)) (not (= .cse0 .cse2)) (<= 2 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|) (<= 2 .cse0) (not (= |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| .cse2))))))) (exists ((v_DerPreprocessor_1 (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 ((.cse5 (select v_arrayElimArr_2 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset|))) (let ((.cse7 (select |c_#memory_$Pointer$#2.base| .cse5))) (let ((.cse6 (select .cse7 |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1|))) (and (= (store (store (select (store (store |c_#memory_$Pointer$#2.base| .cse5 v_DerPreprocessor_1) .cse6 v_arrayElimArr_2) .cse5) (+ |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1| 8) .cse6) |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1| .cse6) .cse7) (<= 2 .cse6) (not (= .cse6 .cse5)) (<= 2 .cse5))))))) is different from true [2025-02-08 01:54:10,240 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((v_DerPreprocessor_1 (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 ((.cse0 (select v_arrayElimArr_2 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset|))) (let ((.cse2 (select |c_#memory_$Pointer$#2.base| .cse0))) (let ((.cse1 (select .cse2 |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2|))) (and (= (store (store (select (store (store |c_#memory_$Pointer$#2.base| .cse0 v_DerPreprocessor_1) .cse1 v_arrayElimArr_2) .cse0) (+ |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2| 8) .cse1) |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2| .cse1) .cse2) (not (= .cse1 .cse0)) (<= 2 .cse0) (<= 2 .cse1)))))) (exists ((|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| Int) (v_DerPreprocessor_3 (Array Int Int)) (|ULTIMATE.start_aws_linked_list_remove_harness_~#next~0#1.offset| Int) (|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 ((.cse3 (select v_arrayElimArr_4 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset|))) (let ((.cse5 (select |c_#memory_$Pointer$#2.base| .cse3))) (let ((.cse4 (select .cse5 |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2|))) (and (not (= .cse3 .cse4)) (not (= .cse3 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|)) (<= 2 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|) (<= 2 .cse3) (not (= .cse4 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|)) (= .cse5 (store (select (let ((.cse7 (store |c_#memory_$Pointer$#2.base| .cse4 v_DerPreprocessor_3))) (let ((.cse6 (store (select (store (store .cse7 .cse3 v_DerPreprocessor_4) |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_4) .cse3) (+ |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_4) .cse3 .cse6) .cse4 (store (select (store (store .cse7 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_4) .cse3 .cse6) .cse4) (+ |ULTIMATE.start_aws_linked_list_remove_harness_~#next~0#1.offset| 8) .cse3)))) .cse3) |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2| .cse4)))))))) (or (exists ((|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| Int) (v_DerPreprocessor_3 (Array Int Int)) (|ULTIMATE.start_aws_linked_list_remove_harness_~#next~0#1.offset| 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) (|v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1| Int)) (let ((.cse8 (select v_arrayElimArr_4 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset|))) (let ((.cse12 (select |c_#memory_$Pointer$#2.base| .cse8))) (let ((.cse10 (select .cse12 |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1|))) (and (= (store (select (let ((.cse11 (store |c_#memory_$Pointer$#2.base| .cse10 v_DerPreprocessor_3))) (let ((.cse9 (store (select (store (store .cse11 .cse8 v_DerPreprocessor_4) |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_4) .cse8) (+ |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_4) .cse8 .cse9) .cse10 (store (select (store (store .cse11 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_4) .cse8 .cse9) .cse10) (+ |ULTIMATE.start_aws_linked_list_remove_harness_~#next~0#1.offset| 8) .cse8)))) .cse8) |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1| .cse10) .cse12) (not (= .cse8 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|)) (not (= .cse8 .cse10)) (<= 2 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|) (<= 2 .cse8) (not (= |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| .cse10))))))) (exists ((v_DerPreprocessor_1 (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 ((.cse13 (select v_arrayElimArr_2 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset|))) (let ((.cse15 (select |c_#memory_$Pointer$#2.base| .cse13))) (let ((.cse14 (select .cse15 |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1|))) (and (= (store (store (select (store (store |c_#memory_$Pointer$#2.base| .cse13 v_DerPreprocessor_1) .cse14 v_arrayElimArr_2) .cse13) (+ |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1| 8) .cse14) |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1| .cse14) .cse15) (<= 2 .cse14) (not (= .cse14 .cse13)) (<= 2 .cse13)))))))) is different from true [2025-02-08 01:54:10,499 WARN L873 $PredicateComparison]: unable to prove that (and (<= 2 |c_aws_linked_list_remove_~node#1.base|) (or (exists ((v_DerPreprocessor_1 (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 ((.cse0 (select v_arrayElimArr_2 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset|))) (let ((.cse2 (select |c_#memory_$Pointer$#2.base| .cse0))) (let ((.cse1 (select .cse2 |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2|))) (and (= (store (store (select (store (store |c_#memory_$Pointer$#2.base| .cse0 v_DerPreprocessor_1) .cse1 v_arrayElimArr_2) .cse0) (+ |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2| 8) .cse1) |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2| .cse1) .cse2) (not (= .cse1 .cse0)) (<= 2 .cse0) (<= 2 .cse1)))))) (exists ((|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| Int) (v_DerPreprocessor_3 (Array Int Int)) (|ULTIMATE.start_aws_linked_list_remove_harness_~#next~0#1.offset| Int) (|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 ((.cse3 (select v_arrayElimArr_4 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset|))) (let ((.cse5 (select |c_#memory_$Pointer$#2.base| .cse3))) (let ((.cse4 (select .cse5 |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2|))) (and (not (= .cse3 .cse4)) (not (= .cse3 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|)) (<= 2 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|) (<= 2 .cse3) (not (= .cse4 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|)) (= .cse5 (store (select (let ((.cse7 (store |c_#memory_$Pointer$#2.base| .cse4 v_DerPreprocessor_3))) (let ((.cse6 (store (select (store (store .cse7 .cse3 v_DerPreprocessor_4) |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_4) .cse3) (+ |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_4) .cse3 .cse6) .cse4 (store (select (store (store .cse7 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_4) .cse3 .cse6) .cse4) (+ |ULTIMATE.start_aws_linked_list_remove_harness_~#next~0#1.offset| 8) .cse3)))) .cse3) |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2| .cse4)))))))) (let ((.cse9 (select |c_#memory_$Pointer$#2.base| |c_aws_linked_list_remove_~node#1.base|))) (let ((.cse11 (select .cse9 |c_aws_linked_list_remove_~node#1.offset|))) (let ((.cse8 (not (= .cse11 |c_aws_linked_list_remove_~node#1.base|))) (.cse13 (+ |c_aws_linked_list_remove_~node#1.offset| 8))) (or (and .cse8 (exists ((|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| Int) (v_DerPreprocessor_3 (Array Int Int)) (|ULTIMATE.start_aws_linked_list_remove_harness_~#next~0#1.offset| 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)) (and (= .cse9 (store (select (let ((.cse12 (store |c_#memory_$Pointer$#2.base| .cse11 v_DerPreprocessor_3))) (let ((.cse10 (store (select (store (store .cse12 |c_aws_linked_list_remove_~node#1.base| v_DerPreprocessor_4) |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_4) |c_aws_linked_list_remove_~node#1.base|) .cse13 |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_4) |c_aws_linked_list_remove_~node#1.base| .cse10) .cse11 (store (select (store (store .cse12 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_4) |c_aws_linked_list_remove_~node#1.base| .cse10) .cse11) (+ |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| .cse11)) (<= 2 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|) (not (= |c_aws_linked_list_remove_~node#1.base| |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|)) (= (select v_arrayElimArr_4 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset|) |c_aws_linked_list_remove_~node#1.base|) (not (= .cse11 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|))))) (and (<= 2 .cse11) .cse8 (exists ((v_DerPreprocessor_1 (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|) (= (store (store (select (store (store |c_#memory_$Pointer$#2.base| |c_aws_linked_list_remove_~node#1.base| v_DerPreprocessor_1) .cse11 v_arrayElimArr_2) |c_aws_linked_list_remove_~node#1.base|) .cse13 .cse11) |c_aws_linked_list_remove_~node#1.offset| .cse11) .cse9)))))))) (or (exists ((|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| Int) (v_DerPreprocessor_3 (Array Int Int)) (|ULTIMATE.start_aws_linked_list_remove_harness_~#next~0#1.offset| 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) (|v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1| Int)) (let ((.cse14 (select v_arrayElimArr_4 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset|))) (let ((.cse18 (select |c_#memory_$Pointer$#2.base| .cse14))) (let ((.cse16 (select .cse18 |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1|))) (and (= (store (select (let ((.cse17 (store |c_#memory_$Pointer$#2.base| .cse16 v_DerPreprocessor_3))) (let ((.cse15 (store (select (store (store .cse17 .cse14 v_DerPreprocessor_4) |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_4) .cse14) (+ |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_4) .cse14 .cse15) .cse16 (store (select (store (store .cse17 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_4) .cse14 .cse15) .cse16) (+ |ULTIMATE.start_aws_linked_list_remove_harness_~#next~0#1.offset| 8) .cse14)))) .cse14) |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1| .cse16) .cse18) (not (= .cse14 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|)) (not (= .cse14 .cse16)) (<= 2 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|) (<= 2 .cse14) (not (= |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| .cse16))))))) (exists ((v_DerPreprocessor_1 (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 ((.cse19 (select v_arrayElimArr_2 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset|))) (let ((.cse21 (select |c_#memory_$Pointer$#2.base| .cse19))) (let ((.cse20 (select .cse21 |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1|))) (and (= (store (store (select (store (store |c_#memory_$Pointer$#2.base| .cse19 v_DerPreprocessor_1) .cse20 v_arrayElimArr_2) .cse19) (+ |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1| 8) .cse20) |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1| .cse20) .cse21) (<= 2 .cse20) (not (= .cse20 .cse19)) (<= 2 .cse19)))))))) is different from true [2025-02-08 01:54:10,714 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((v_DerPreprocessor_1 (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 ((.cse0 (select v_arrayElimArr_2 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset|))) (let ((.cse2 (select |c_#memory_$Pointer$#2.base| .cse0))) (let ((.cse1 (select .cse2 |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2|))) (and (= (store (store (select (store (store |c_#memory_$Pointer$#2.base| .cse0 v_DerPreprocessor_1) .cse1 v_arrayElimArr_2) .cse0) (+ |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2| 8) .cse1) |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2| .cse1) .cse2) (not (= .cse1 .cse0)) (<= 2 .cse0) (<= 2 .cse1)))))) (exists ((|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| Int) (v_DerPreprocessor_3 (Array Int Int)) (|ULTIMATE.start_aws_linked_list_remove_harness_~#next~0#1.offset| Int) (|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 ((.cse3 (select v_arrayElimArr_4 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset|))) (let ((.cse5 (select |c_#memory_$Pointer$#2.base| .cse3))) (let ((.cse4 (select .cse5 |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2|))) (and (not (= .cse3 .cse4)) (not (= .cse3 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|)) (<= 2 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|) (<= 2 .cse3) (not (= .cse4 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|)) (= .cse5 (store (select (let ((.cse7 (store |c_#memory_$Pointer$#2.base| .cse4 v_DerPreprocessor_3))) (let ((.cse6 (store (select (store (store .cse7 .cse3 v_DerPreprocessor_4) |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_4) .cse3) (+ |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_4) .cse3 .cse6) .cse4 (store (select (store (store .cse7 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_4) .cse3 .cse6) .cse4) (+ |ULTIMATE.start_aws_linked_list_remove_harness_~#next~0#1.offset| 8) .cse3)))) .cse3) |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2| .cse4)))))))) (or (exists ((|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| Int) (v_DerPreprocessor_3 (Array Int Int)) (|ULTIMATE.start_aws_linked_list_remove_harness_~#next~0#1.offset| 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) (|v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1| Int)) (let ((.cse8 (select v_arrayElimArr_4 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset|))) (let ((.cse12 (select |c_#memory_$Pointer$#2.base| .cse8))) (let ((.cse10 (select .cse12 |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1|))) (and (= (store (select (let ((.cse11 (store |c_#memory_$Pointer$#2.base| .cse10 v_DerPreprocessor_3))) (let ((.cse9 (store (select (store (store .cse11 .cse8 v_DerPreprocessor_4) |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_4) .cse8) (+ |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_4) .cse8 .cse9) .cse10 (store (select (store (store .cse11 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_4) .cse8 .cse9) .cse10) (+ |ULTIMATE.start_aws_linked_list_remove_harness_~#next~0#1.offset| 8) .cse8)))) .cse8) |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1| .cse10) .cse12) (not (= .cse8 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|)) (not (= .cse8 .cse10)) (<= 2 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|) (<= 2 .cse8) (not (= |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| .cse10))))))) (exists ((v_DerPreprocessor_1 (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 ((.cse13 (select v_arrayElimArr_2 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset|))) (let ((.cse15 (select |c_#memory_$Pointer$#2.base| .cse13))) (let ((.cse14 (select .cse15 |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1|))) (and (= (store (store (select (store (store |c_#memory_$Pointer$#2.base| .cse13 v_DerPreprocessor_1) .cse14 v_arrayElimArr_2) .cse13) (+ |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1| 8) .cse14) |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1| .cse14) .cse15) (<= 2 .cse14) (not (= .cse14 .cse13)) (<= 2 .cse13))))))) (or (exists ((|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| Int) (v_DerPreprocessor_3 (Array Int Int)) (|ULTIMATE.start_aws_linked_list_remove_harness_~#next~0#1.offset| Int) (|v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_3| 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_3|))) (and (not (= .cse16 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|)) (<= 2 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|) (not (= .cse17 .cse16)) (= .cse18 (store (select (let ((.cse20 (store |c_#memory_$Pointer$#2.base| .cse17 v_DerPreprocessor_3))) (let ((.cse19 (store (select (store (store .cse20 .cse16 v_DerPreprocessor_4) |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_4) .cse16) (+ |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_4) .cse16 .cse19) .cse17 (store (select (store (store .cse20 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_4) .cse16 .cse19) .cse17) (+ |ULTIMATE.start_aws_linked_list_remove_harness_~#next~0#1.offset| 8) .cse16)))) .cse16) |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_3| .cse17)) (<= 2 .cse16) (not (= .cse17 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|))))))) (exists ((v_DerPreprocessor_1 (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 ((.cse22 (select v_arrayElimArr_2 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset|))) (let ((.cse23 (select |c_#memory_$Pointer$#2.base| .cse22))) (let ((.cse21 (select .cse23 |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_3|))) (and (<= 2 .cse21) (not (= .cse22 .cse21)) (= (store (store (select (store (store |c_#memory_$Pointer$#2.base| .cse22 v_DerPreprocessor_1) .cse21 v_arrayElimArr_2) .cse22) (+ |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_3| 8) .cse21) |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_3| .cse21) .cse23) (<= 2 .cse22)))))))) is different from true [2025-02-08 01:54:11,876 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| Int) (|v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_4| Int) (v_DerPreprocessor_3 (Array Int Int)) (|ULTIMATE.start_aws_linked_list_remove_harness_~#next~0#1.offset| 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 ((.cse1 (select v_arrayElimArr_4 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset|))) (let ((.cse0 (select |c_#memory_$Pointer$#2.base| .cse1))) (let ((.cse3 (select .cse0 |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_4|))) (and (= .cse0 (store (select (let ((.cse4 (store |c_#memory_$Pointer$#2.base| .cse3 v_DerPreprocessor_3))) (let ((.cse2 (store (select (store (store .cse4 .cse1 v_DerPreprocessor_4) |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_4) .cse1) (+ |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_4) .cse1 .cse2) .cse3 (store (select (store (store .cse4 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_4) .cse1 .cse2) .cse3) (+ |ULTIMATE.start_aws_linked_list_remove_harness_~#next~0#1.offset| 8) .cse1)))) .cse1) |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_4| .cse3)) (not (= .cse1 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|)) (not (= .cse3 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|)) (<= 2 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|) (not (= .cse3 .cse1)) (<= 2 .cse1)))))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_4| Int) (v_arrayElimArr_2 (Array Int Int)) (|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset| Int)) (let ((.cse6 (select v_arrayElimArr_2 |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_4|))) (and (<= 2 .cse5) (not (= .cse5 .cse6)) (<= 2 .cse6) (= .cse7 (store (store (select (store (store |c_#memory_$Pointer$#2.base| .cse6 v_DerPreprocessor_1) .cse5 v_arrayElimArr_2) .cse6) (+ |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_4| 8) .cse5) |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_4| .cse5)))))))) (or (exists ((v_DerPreprocessor_1 (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 ((.cse8 (select v_arrayElimArr_2 |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 (= (store (store (select (store (store |c_#memory_$Pointer$#2.base| .cse8 v_DerPreprocessor_1) .cse9 v_arrayElimArr_2) .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) .cse10) (not (= .cse9 .cse8)) (<= 2 .cse8) (<= 2 .cse9)))))) (exists ((|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| Int) (v_DerPreprocessor_3 (Array Int Int)) (|ULTIMATE.start_aws_linked_list_remove_harness_~#next~0#1.offset| Int) (|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 ((.cse11 (select v_arrayElimArr_4 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset|))) (let ((.cse13 (select |c_#memory_$Pointer$#2.base| .cse11))) (let ((.cse12 (select .cse13 |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2|))) (and (not (= .cse11 .cse12)) (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|) (<= 2 .cse11) (not (= .cse12 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|)) (= .cse13 (store (select (let ((.cse15 (store |c_#memory_$Pointer$#2.base| .cse12 v_DerPreprocessor_3))) (let ((.cse14 (store (select (store (store .cse15 .cse11 v_DerPreprocessor_4) |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_4) .cse11) (+ |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_4) .cse11 .cse14) .cse12 (store (select (store (store .cse15 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_4) .cse11 .cse14) .cse12) (+ |ULTIMATE.start_aws_linked_list_remove_harness_~#next~0#1.offset| 8) .cse11)))) .cse11) |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_2| .cse12)))))))) (or (exists ((|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| Int) (v_DerPreprocessor_3 (Array Int Int)) (|ULTIMATE.start_aws_linked_list_remove_harness_~#next~0#1.offset| 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) (|v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1| Int)) (let ((.cse16 (select v_arrayElimArr_4 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset|))) (let ((.cse20 (select |c_#memory_$Pointer$#2.base| .cse16))) (let ((.cse18 (select .cse20 |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1|))) (and (= (store (select (let ((.cse19 (store |c_#memory_$Pointer$#2.base| .cse18 v_DerPreprocessor_3))) (let ((.cse17 (store (select (store (store .cse19 .cse16 v_DerPreprocessor_4) |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_4) .cse16) (+ |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_4) .cse16 .cse17) .cse18 (store (select (store (store .cse19 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_4) .cse16 .cse17) .cse18) (+ |ULTIMATE.start_aws_linked_list_remove_harness_~#next~0#1.offset| 8) .cse16)))) .cse16) |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1| .cse18) .cse20) (not (= .cse16 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|)) (not (= .cse16 .cse18)) (<= 2 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|) (<= 2 .cse16) (not (= |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| .cse18))))))) (exists ((v_DerPreprocessor_1 (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 ((.cse21 (select v_arrayElimArr_2 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset|))) (let ((.cse23 (select |c_#memory_$Pointer$#2.base| .cse21))) (let ((.cse22 (select .cse23 |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1|))) (and (= (store (store (select (store (store |c_#memory_$Pointer$#2.base| .cse21 v_DerPreprocessor_1) .cse22 v_arrayElimArr_2) .cse21) (+ |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1| 8) .cse22) |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_1| .cse22) .cse23) (<= 2 .cse22) (not (= .cse22 .cse21)) (<= 2 .cse21))))))) (or (exists ((|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| Int) (v_DerPreprocessor_3 (Array Int Int)) (|ULTIMATE.start_aws_linked_list_remove_harness_~#next~0#1.offset| Int) (|v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_3| 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_3|))) (and (not (= .cse24 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|)) (<= 2 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|) (not (= .cse25 .cse24)) (= .cse26 (store (select (let ((.cse28 (store |c_#memory_$Pointer$#2.base| .cse25 v_DerPreprocessor_3))) (let ((.cse27 (store (select (store (store .cse28 .cse24 v_DerPreprocessor_4) |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_4) .cse24) (+ |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_4) .cse24 .cse27) .cse25 (store (select (store (store .cse28 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_4) .cse24 .cse27) .cse25) (+ |ULTIMATE.start_aws_linked_list_remove_harness_~#next~0#1.offset| 8) .cse24)))) .cse24) |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_3| .cse25)) (<= 2 .cse24) (not (= .cse25 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|))))))) (exists ((v_DerPreprocessor_1 (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 ((.cse30 (select v_arrayElimArr_2 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset|))) (let ((.cse31 (select |c_#memory_$Pointer$#2.base| .cse30))) (let ((.cse29 (select .cse31 |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_3|))) (and (<= 2 .cse29) (not (= .cse30 .cse29)) (= (store (store (select (store (store |c_#memory_$Pointer$#2.base| .cse30 v_DerPreprocessor_1) .cse29 v_arrayElimArr_2) .cse30) (+ |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_3| 8) .cse29) |v_aws_linked_list_remove_~node#1.offset_BEFORE_CALL_3| .cse29) .cse31) (<= 2 .cse30)))))))) is different from true [2025-02-08 01:54:14,847 INFO L349 Elim1Store]: treesize reduction 429, result has 56.9 percent of original size [2025-02-08 01:54:14,848 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 3076 treesize of output 2803 [2025-02-08 01:54:14,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 194 treesize of output 166 [2025-02-08 01:54:14,953 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-02-08 01:54:15,010 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-02-08 01:54:15,056 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-02-08 01:54:15,090 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-02-08 01:54:15,121 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-02-08 01:54:15,148 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-02-08 01:54:15,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 186 treesize of output 160 [2025-02-08 01:54:15,201 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-02-08 01:54:15,233 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 178 treesize of output 152 [2025-02-08 01:54:15,256 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-02-08 01:54:15,292 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 178 treesize of output 150 [2025-02-08 01:54:15,315 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-02-08 01:54:15,372 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-02-08 01:54:15,395 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-02-08 01:54:15,418 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-02-08 01:54:15,444 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-02-08 01:54:15,476 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-02-08 01:54:15,512 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-02-08 01:54:15,545 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-02-08 01:54:15,581 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-02-08 01:54:15,776 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-02-08 01:54:15,854 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-02-08 01:54:15,991 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-02-08 01:54:16,073 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 01:54:16,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 17 treesize of output 11 [2025-02-08 01:54:16,183 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-02-08 01:54:16,247 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 01:54:16,248 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-02-08 01:54:16,335 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 01:54:16,336 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-02-08 01:54:16,412 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 01:54:16,412 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-02-08 01:54:25,616 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 01:54:25,616 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-02-08 01:55:16,285 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 01:55:16,286 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-02-08 01:55:17,606 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 01:55:17,606 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 126 treesize of output 130