./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-simple/sll2c_insert_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/list-simple/sll2c_insert_equal.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-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 32bit --witnessprinter.graph.data.programhash 8eaca07dd267d84d5b5f55ad6096951e873362e33b975be77e0f552bdb4e3bcb --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 02:49:09,548 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 02:49:09,656 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 02:49:09,665 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 02:49:09,666 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 02:49:09,701 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 02:49:09,711 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 02:49:09,711 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 02:49:09,712 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 02:49:09,712 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 02:49:09,713 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 02:49:09,713 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 02:49:09,713 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 02:49:09,713 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 02:49:09,713 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 02:49:09,714 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 02:49:09,714 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 02:49:09,717 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 02:49:09,718 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 02:49:09,718 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 02:49:09,718 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 02:49:09,718 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 02:49:09,718 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 02:49:09,718 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 02:49:09,718 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 02:49:09,718 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 02:49:09,718 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 02:49:09,718 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 02:49:09,718 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 02:49:09,718 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 02:49:09,718 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 02:49:09,718 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 02:49:09,718 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 02:49:09,718 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 02:49:09,718 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 02:49:09,718 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 02:49:09,718 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 02:49:09,719 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 02:49:09,719 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 02:49:09,719 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 02:49:09,719 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 02:49:09,720 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 02:49:09,720 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 02:49:09,720 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 02:49:09,720 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 02:49:09,720 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 02:49:09,720 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 02:49:09,720 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 02:49:09,720 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8eaca07dd267d84d5b5f55ad6096951e873362e33b975be77e0f552bdb4e3bcb [2025-01-09 02:49:09,972 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 02:49:09,978 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 02:49:09,981 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 02:49:09,982 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 02:49:09,982 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 02:49:09,984 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2c_insert_equal.i [2025-01-09 02:49:11,164 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d5fef9df5/94511e73e8294c1baf1caaddb569bea4/FLAG8e2e035b8 [2025-01-09 02:49:11,512 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 02:49:11,512 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_insert_equal.i [2025-01-09 02:49:11,532 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d5fef9df5/94511e73e8294c1baf1caaddb569bea4/FLAG8e2e035b8 [2025-01-09 02:49:11,752 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d5fef9df5/94511e73e8294c1baf1caaddb569bea4 [2025-01-09 02:49:11,754 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 02:49:11,757 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 02:49:11,758 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 02:49:11,758 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 02:49:11,762 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 02:49:11,762 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:49:11" (1/1) ... [2025-01-09 02:49:11,763 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b328b29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:49:11, skipping insertion in model container [2025-01-09 02:49:11,763 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:49:11" (1/1) ... [2025-01-09 02:49:11,790 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 02:49:11,996 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/list-simple/sll2c_insert_equal.i[24601,24614] [2025-01-09 02:49:11,998 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 02:49:12,004 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 02:49:12,047 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/list-simple/sll2c_insert_equal.i[24601,24614] [2025-01-09 02:49:12,048 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 02:49:12,064 INFO L204 MainTranslator]: Completed translation [2025-01-09 02:49:12,065 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:49:12 WrapperNode [2025-01-09 02:49:12,065 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 02:49:12,066 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 02:49:12,066 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 02:49:12,066 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 02:49:12,071 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:49:12" (1/1) ... [2025-01-09 02:49:12,078 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:49:12" (1/1) ... [2025-01-09 02:49:12,090 INFO L138 Inliner]: procedures = 127, calls = 43, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 133 [2025-01-09 02:49:12,090 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 02:49:12,091 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 02:49:12,091 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 02:49:12,091 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 02:49:12,096 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:49:12" (1/1) ... [2025-01-09 02:49:12,097 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:49:12" (1/1) ... [2025-01-09 02:49:12,099 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:49:12" (1/1) ... [2025-01-09 02:49:12,111 INFO L175 MemorySlicer]: Split 25 memory accesses to 3 slices as follows [2, 9, 14]. 56 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 10 writes are split as follows [0, 1, 9]. [2025-01-09 02:49:12,111 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:49:12" (1/1) ... [2025-01-09 02:49:12,111 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:49:12" (1/1) ... [2025-01-09 02:49:12,116 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:49:12" (1/1) ... [2025-01-09 02:49:12,117 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:49:12" (1/1) ... [2025-01-09 02:49:12,119 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:49:12" (1/1) ... [2025-01-09 02:49:12,120 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:49:12" (1/1) ... [2025-01-09 02:49:12,121 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:49:12" (1/1) ... [2025-01-09 02:49:12,122 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 02:49:12,123 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 02:49:12,123 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 02:49:12,123 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 02:49:12,124 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:49:12" (1/1) ... [2025-01-09 02:49:12,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 02:49:12,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:49:12,156 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 02:49:12,159 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 02:49:12,189 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 02:49:12,189 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 02:49:12,189 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 02:49:12,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 02:49:12,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 02:49:12,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 02:49:12,190 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2025-01-09 02:49:12,190 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2025-01-09 02:49:12,190 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 02:49:12,190 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 02:49:12,190 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 02:49:12,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 02:49:12,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 02:49:12,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-09 02:49:12,190 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 02:49:12,190 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 02:49:12,190 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-09 02:49:12,190 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 02:49:12,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-01-09 02:49:12,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-01-09 02:49:12,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-01-09 02:49:12,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 02:49:12,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 02:49:12,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 02:49:12,191 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 02:49:12,191 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 02:49:12,311 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 02:49:12,313 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 02:49:12,506 INFO L? ?]: Removed 51 outVars from TransFormulas that were not future-live. [2025-01-09 02:49:12,507 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 02:49:12,515 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 02:49:12,517 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 02:49:12,518 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:49:12 BoogieIcfgContainer [2025-01-09 02:49:12,518 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 02:49:12,519 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 02:49:12,519 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 02:49:12,523 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 02:49:12,523 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:49:11" (1/3) ... [2025-01-09 02:49:12,523 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52a97847 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:49:12, skipping insertion in model container [2025-01-09 02:49:12,523 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:49:12" (2/3) ... [2025-01-09 02:49:12,523 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52a97847 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:49:12, skipping insertion in model container [2025-01-09 02:49:12,523 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:49:12" (3/3) ... [2025-01-09 02:49:12,524 INFO L128 eAbstractionObserver]: Analyzing ICFG sll2c_insert_equal.i [2025-01-09 02:49:12,536 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 02:49:12,538 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll2c_insert_equal.i that has 2 procedures, 33 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2025-01-09 02:49:12,574 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 02:49:12,589 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;@4adfc1f9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 02:49:12,593 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 02:49:12,596 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 28 states have internal predecessors, (39), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 02:49:12,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-01-09 02:49:12,606 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:49:12,607 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:49:12,608 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:49:12,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:49:12,611 INFO L85 PathProgramCache]: Analyzing trace with hash -873451054, now seen corresponding path program 1 times [2025-01-09 02:49:12,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:49:12,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566949011] [2025-01-09 02:49:12,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:49:12,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:49:12,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-09 02:49:12,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 02:49:12,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:49:12,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:49:12,907 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-09 02:49:12,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:49:12,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566949011] [2025-01-09 02:49:12,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566949011] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:49:12,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:49:12,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 02:49:12,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501081686] [2025-01-09 02:49:12,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:49:12,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 02:49:12,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:49:12,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 02:49:12,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 02:49:12,943 INFO L87 Difference]: Start difference. First operand has 33 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 28 states have internal predecessors, (39), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 02:49:12,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:49:12,980 INFO L93 Difference]: Finished difference Result 62 states and 85 transitions. [2025-01-09 02:49:12,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 02:49:12,983 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2025-01-09 02:49:12,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:49:12,986 INFO L225 Difference]: With dead ends: 62 [2025-01-09 02:49:12,987 INFO L226 Difference]: Without dead ends: 29 [2025-01-09 02:49:12,989 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 02:49:12,992 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 1 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 02:49:12,993 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 77 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 02:49:13,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-01-09 02:49:13,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2025-01-09 02:49:13,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 02:49:13,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2025-01-09 02:49:13,019 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 24 [2025-01-09 02:49:13,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:49:13,019 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2025-01-09 02:49:13,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 02:49:13,019 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2025-01-09 02:49:13,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-01-09 02:49:13,020 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:49:13,021 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:49:13,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 02:49:13,021 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:49:13,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:49:13,021 INFO L85 PathProgramCache]: Analyzing trace with hash -1600969173, now seen corresponding path program 1 times [2025-01-09 02:49:13,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:49:13,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324287359] [2025-01-09 02:49:13,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:49:13,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:49:13,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-09 02:49:13,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-09 02:49:13,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:49:13,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:49:13,130 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-01-09 02:49:13,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:49:13,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324287359] [2025-01-09 02:49:13,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324287359] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:49:13,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:49:13,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 02:49:13,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402438666] [2025-01-09 02:49:13,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:49:13,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 02:49:13,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:49:13,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 02:49:13,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 02:49:13,133 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 02:49:13,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:49:13,144 INFO L93 Difference]: Finished difference Result 36 states and 46 transitions. [2025-01-09 02:49:13,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 02:49:13,144 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 32 [2025-01-09 02:49:13,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:49:13,145 INFO L225 Difference]: With dead ends: 36 [2025-01-09 02:49:13,145 INFO L226 Difference]: Without dead ends: 29 [2025-01-09 02:49:13,145 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 02:49:13,145 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 02:49:13,145 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 59 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 02:49:13,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-01-09 02:49:13,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2025-01-09 02:49:13,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 02:49:13,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2025-01-09 02:49:13,148 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 32 [2025-01-09 02:49:13,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:49:13,148 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. [2025-01-09 02:49:13,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 02:49:13,149 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2025-01-09 02:49:13,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-01-09 02:49:13,149 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:49:13,149 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:49:13,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 02:49:13,150 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:49:13,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:49:13,150 INFO L85 PathProgramCache]: Analyzing trace with hash 38386709, now seen corresponding path program 1 times [2025-01-09 02:49:13,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:49:13,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066345057] [2025-01-09 02:49:13,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:49:13,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:49:13,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-09 02:49:13,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-09 02:49:13,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:49:13,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:49:14,983 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:49:14,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:49:14,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066345057] [2025-01-09 02:49:14,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066345057] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:49:14,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1798781953] [2025-01-09 02:49:14,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:49:14,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:49:14,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:49:14,988 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 02:49:14,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 02:49:15,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-09 02:49:15,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-09 02:49:15,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:49:15,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:49:15,358 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 107 conjuncts are in the unsatisfiable core [2025-01-09 02:49:15,364 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:49:15,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-09 02:49:15,567 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 02:49:15,634 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-01-09 02:49:15,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-01-09 02:49:15,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-01-09 02:49:15,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-01-09 02:49:15,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-01-09 02:49:15,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2025-01-09 02:49:16,057 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-01-09 02:49:16,058 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2025-01-09 02:49:16,083 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2025-01-09 02:49:16,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2025-01-09 02:49:16,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 15 [2025-01-09 02:49:16,335 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-01-09 02:49:16,387 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-01-09 02:49:16,451 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:49:16,451 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 02:49:16,522 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_239 (Array Int Int)) (v_ArrVal_240 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_240) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_239) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (not (= v_ArrVal_240 (store (select |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| (select v_ArrVal_240 |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset|)))))) is different from false [2025-01-09 02:49:16,536 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_239 (Array Int Int)) (v_ArrVal_240 (Array Int Int))) (or (not (= v_ArrVal_240 (store (select |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| (select v_ArrVal_240 |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset|)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_240) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_239) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))) is different from false [2025-01-09 02:49:16,545 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_239 (Array Int Int)) (v_ArrVal_240 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| .cse0 v_ArrVal_240) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_239) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (not (= v_ArrVal_240 (let ((.cse1 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (store (select |c_#memory_int#2| .cse0) .cse1 (select v_ArrVal_240 .cse1)))))))) is different from false [2025-01-09 02:49:16,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1798781953] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:49:16,658 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 02:49:16,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 41 [2025-01-09 02:49:16,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211336209] [2025-01-09 02:49:16,658 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 02:49:16,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-01-09 02:49:16,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:49:16,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-01-09 02:49:16,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=1753, Unknown=4, NotChecked=258, Total=2162 [2025-01-09 02:49:16,661 INFO L87 Difference]: Start difference. First operand 29 states and 37 transitions. Second operand has 41 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 32 states have internal predecessors, (48), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-09 02:49:17,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:49:17,622 INFO L93 Difference]: Finished difference Result 51 states and 63 transitions. [2025-01-09 02:49:17,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-01-09 02:49:17,623 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 32 states have internal predecessors, (48), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 33 [2025-01-09 02:49:17,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:49:17,623 INFO L225 Difference]: With dead ends: 51 [2025-01-09 02:49:17,623 INFO L226 Difference]: Without dead ends: 49 [2025-01-09 02:49:17,625 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 734 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=258, Invalid=2942, Unknown=4, NotChecked=336, Total=3540 [2025-01-09 02:49:17,625 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 37 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 743 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 759 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 02:49:17,625 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 346 Invalid, 759 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 743 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 02:49:17,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-01-09 02:49:17,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 39. [2025-01-09 02:49:17,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 33 states have internal predecessors, (42), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 02:49:17,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 48 transitions. [2025-01-09 02:49:17,637 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 48 transitions. Word has length 33 [2025-01-09 02:49:17,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:49:17,637 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 48 transitions. [2025-01-09 02:49:17,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 32 states have internal predecessors, (48), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-09 02:49:17,637 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 48 transitions. [2025-01-09 02:49:17,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-01-09 02:49:17,639 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:49:17,639 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:49:17,657 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-01-09 02:49:17,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:49:17,840 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:49:17,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:49:17,841 INFO L85 PathProgramCache]: Analyzing trace with hash -681188501, now seen corresponding path program 2 times [2025-01-09 02:49:17,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:49:17,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7172551] [2025-01-09 02:49:17,841 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 02:49:17,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:49:17,874 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-01-09 02:49:17,894 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-01-09 02:49:17,898 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 02:49:17,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:49:18,039 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-09 02:49:18,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:49:18,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7172551] [2025-01-09 02:49:18,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7172551] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:49:18,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1236810576] [2025-01-09 02:49:18,040 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 02:49:18,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:49:18,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:49:18,042 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 02:49:18,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 02:49:18,142 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-01-09 02:49:18,178 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-01-09 02:49:18,178 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 02:49:18,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:49:18,180 INFO L256 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 02:49:18,182 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:49:18,214 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-01-09 02:49:18,214 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 02:49:18,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1236810576] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:49:18,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 02:49:18,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 6 [2025-01-09 02:49:18,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256093178] [2025-01-09 02:49:18,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:49:18,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 02:49:18,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:49:18,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 02:49:18,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 02:49:18,216 INFO L87 Difference]: Start difference. First operand 39 states and 48 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-09 02:49:18,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:49:18,260 INFO L93 Difference]: Finished difference Result 50 states and 60 transitions. [2025-01-09 02:49:18,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 02:49:18,262 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 34 [2025-01-09 02:49:18,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:49:18,264 INFO L225 Difference]: With dead ends: 50 [2025-01-09 02:49:18,264 INFO L226 Difference]: Without dead ends: 39 [2025-01-09 02:49:18,264 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-01-09 02:49:18,264 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 16 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 02:49:18,265 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 65 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 02:49:18,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-01-09 02:49:18,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2025-01-09 02:49:18,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 02:49:18,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2025-01-09 02:49:18,272 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 34 [2025-01-09 02:49:18,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:49:18,272 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2025-01-09 02:49:18,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-09 02:49:18,273 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2025-01-09 02:49:18,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-01-09 02:49:18,273 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:49:18,273 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:49:18,282 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-01-09 02:49:18,473 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-01-09 02:49:18,474 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:49:18,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:49:18,475 INFO L85 PathProgramCache]: Analyzing trace with hash 721626543, now seen corresponding path program 1 times [2025-01-09 02:49:18,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:49:18,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049114793] [2025-01-09 02:49:18,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:49:18,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:49:18,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-09 02:49:18,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-09 02:49:18,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:49:18,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:49:18,553 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-01-09 02:49:18,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:49:18,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049114793] [2025-01-09 02:49:18,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049114793] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:49:18,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:49:18,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 02:49:18,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261019067] [2025-01-09 02:49:18,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:49:18,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 02:49:18,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:49:18,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 02:49:18,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 02:49:18,556 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-09 02:49:18,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:49:18,573 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2025-01-09 02:49:18,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 02:49:18,574 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 34 [2025-01-09 02:49:18,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:49:18,574 INFO L225 Difference]: With dead ends: 48 [2025-01-09 02:49:18,574 INFO L226 Difference]: Without dead ends: 38 [2025-01-09 02:49:18,575 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 02:49:18,576 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 16 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 02:49:18,577 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 67 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 02:49:18,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-01-09 02:49:18,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2025-01-09 02:49:18,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 02:49:18,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2025-01-09 02:49:18,584 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 34 [2025-01-09 02:49:18,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:49:18,584 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2025-01-09 02:49:18,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-09 02:49:18,584 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2025-01-09 02:49:18,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-01-09 02:49:18,586 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:49:18,586 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:49:18,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 02:49:18,587 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:49:18,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:49:18,587 INFO L85 PathProgramCache]: Analyzing trace with hash -1765039956, now seen corresponding path program 1 times [2025-01-09 02:49:18,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:49:18,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389669973] [2025-01-09 02:49:18,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:49:18,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:49:18,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-09 02:49:18,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-09 02:49:18,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:49:18,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:49:19,079 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 02:49:19,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:49:19,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389669973] [2025-01-09 02:49:19,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389669973] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:49:19,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [899846053] [2025-01-09 02:49:19,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:49:19,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:49:19,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:49:19,084 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 02:49:19,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 02:49:19,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-09 02:49:19,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-09 02:49:19,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:49:19,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:49:19,215 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 62 conjuncts are in the unsatisfiable core [2025-01-09 02:49:19,218 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:49:19,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-09 02:49:19,381 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-01-09 02:49:19,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-01-09 02:49:19,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 02:49:19,503 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-09 02:49:19,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2025-01-09 02:49:19,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 14 [2025-01-09 02:49:19,593 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-01-09 02:49:19,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:49:19,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 35 [2025-01-09 02:49:19,773 INFO L349 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2025-01-09 02:49:19,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 34 [2025-01-09 02:49:19,916 INFO L349 Elim1Store]: treesize reduction 33, result has 48.4 percent of original size [2025-01-09 02:49:19,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 59 [2025-01-09 02:49:19,951 INFO L349 Elim1Store]: treesize reduction 56, result has 25.3 percent of original size [2025-01-09 02:49:19,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 74 [2025-01-09 02:49:19,966 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 22 treesize of output 16 [2025-01-09 02:49:20,002 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2025-01-09 02:49:20,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2025-01-09 02:49:20,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2025-01-09 02:49:20,070 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 02:49:20,070 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 02:49:20,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [899846053] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:49:20,343 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 02:49:20,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 21] total 31 [2025-01-09 02:49:20,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40571715] [2025-01-09 02:49:20,343 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 02:49:20,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-01-09 02:49:20,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:49:20,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-01-09 02:49:20,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=1068, Unknown=32, NotChecked=0, Total=1190 [2025-01-09 02:49:20,346 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand has 31 states, 29 states have (on average 1.6896551724137931) internal successors, (49), 24 states have internal predecessors, (49), 4 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-01-09 02:49:21,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:49:21,021 INFO L93 Difference]: Finished difference Result 60 states and 72 transitions. [2025-01-09 02:49:21,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-01-09 02:49:21,022 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 29 states have (on average 1.6896551724137931) internal successors, (49), 24 states have internal predecessors, (49), 4 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 35 [2025-01-09 02:49:21,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:49:21,022 INFO L225 Difference]: With dead ends: 60 [2025-01-09 02:49:21,022 INFO L226 Difference]: Without dead ends: 57 [2025-01-09 02:49:21,023 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 382 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=197, Invalid=2221, Unknown=32, NotChecked=0, Total=2450 [2025-01-09 02:49:21,024 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 32 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 02:49:21,024 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 344 Invalid, 648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 632 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 02:49:21,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-01-09 02:49:21,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 37. [2025-01-09 02:49:21,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 states have internal predecessors, (36), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 02:49:21,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2025-01-09 02:49:21,036 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 35 [2025-01-09 02:49:21,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:49:21,037 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2025-01-09 02:49:21,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 29 states have (on average 1.6896551724137931) internal successors, (49), 24 states have internal predecessors, (49), 4 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-01-09 02:49:21,037 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2025-01-09 02:49:21,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-01-09 02:49:21,037 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:49:21,037 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:49:21,045 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-01-09 02:49:21,238 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-01-09 02:49:21,238 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:49:21,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:49:21,239 INFO L85 PathProgramCache]: Analyzing trace with hash -110368487, now seen corresponding path program 1 times [2025-01-09 02:49:21,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:49:21,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214998192] [2025-01-09 02:49:21,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:49:21,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:49:21,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-09 02:49:21,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-09 02:49:21,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:49:21,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:49:21,444 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-09 02:49:21,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:49:21,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214998192] [2025-01-09 02:49:21,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214998192] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:49:21,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1720791207] [2025-01-09 02:49:21,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:49:21,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:49:21,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:49:21,449 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 02:49:21,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 02:49:21,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-09 02:49:21,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-09 02:49:21,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:49:21,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:49:21,569 INFO L256 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-01-09 02:49:21,571 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:49:21,634 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-01-09 02:49:21,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-01-09 02:49:21,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 02:49:21,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 02:49:21,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2025-01-09 02:49:21,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2025-01-09 02:49:21,889 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-09 02:49:21,889 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 02:49:21,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1720791207] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:49:21,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 02:49:21,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [10] total 19 [2025-01-09 02:49:21,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18750284] [2025-01-09 02:49:21,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:49:21,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 02:49:21,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:49:21,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 02:49:21,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342 [2025-01-09 02:49:21,891 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-09 02:49:22,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:49:22,073 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2025-01-09 02:49:22,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 02:49:22,073 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 35 [2025-01-09 02:49:22,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:49:22,074 INFO L225 Difference]: With dead ends: 51 [2025-01-09 02:49:22,074 INFO L226 Difference]: Without dead ends: 49 [2025-01-09 02:49:22,074 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2025-01-09 02:49:22,075 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 28 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 02:49:22,075 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 133 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 02:49:22,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-01-09 02:49:22,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 41. [2025-01-09 02:49:22,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 35 states have (on average 1.1428571428571428) internal successors, (40), 35 states have internal predecessors, (40), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 02:49:22,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2025-01-09 02:49:22,081 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 35 [2025-01-09 02:49:22,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:49:22,082 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2025-01-09 02:49:22,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-09 02:49:22,082 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2025-01-09 02:49:22,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-01-09 02:49:22,082 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:49:22,082 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:49:22,090 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 02:49:22,282 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-01-09 02:49:22,283 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:49:22,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:49:22,283 INFO L85 PathProgramCache]: Analyzing trace with hash -167626789, now seen corresponding path program 1 times [2025-01-09 02:49:22,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:49:22,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409389511] [2025-01-09 02:49:22,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:49:22,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:49:22,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-09 02:49:22,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-09 02:49:22,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:49:22,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:49:22,368 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-01-09 02:49:22,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:49:22,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409389511] [2025-01-09 02:49:22,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409389511] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:49:22,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1382706146] [2025-01-09 02:49:22,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:49:22,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:49:22,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:49:22,375 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 02:49:22,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 02:49:22,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-09 02:49:22,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-09 02:49:22,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:49:22,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:49:22,503 INFO L256 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-01-09 02:49:22,504 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:49:22,521 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-01-09 02:49:22,521 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 02:49:22,572 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-01-09 02:49:22,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1382706146] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 02:49:22,573 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 02:49:22,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-01-09 02:49:22,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620147448] [2025-01-09 02:49:22,573 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 02:49:22,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 02:49:22,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:49:22,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 02:49:22,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 02:49:22,574 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 02:49:22,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:49:22,629 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2025-01-09 02:49:22,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 02:49:22,629 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 35 [2025-01-09 02:49:22,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:49:22,630 INFO L225 Difference]: With dead ends: 47 [2025-01-09 02:49:22,630 INFO L226 Difference]: Without dead ends: 39 [2025-01-09 02:49:22,630 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-01-09 02:49:22,630 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 2 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 02:49:22,630 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 120 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 02:49:22,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-01-09 02:49:22,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2025-01-09 02:49:22,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 33 states have (on average 1.121212121212121) internal successors, (37), 33 states have internal predecessors, (37), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 02:49:22,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2025-01-09 02:49:22,635 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 35 [2025-01-09 02:49:22,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:49:22,635 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2025-01-09 02:49:22,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 02:49:22,636 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2025-01-09 02:49:22,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-01-09 02:49:22,636 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:49:22,636 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:49:22,646 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-09 02:49:22,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:49:22,840 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:49:22,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:49:22,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1118259406, now seen corresponding path program 1 times [2025-01-09 02:49:22,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:49:22,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68137798] [2025-01-09 02:49:22,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:49:22,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:49:22,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-09 02:49:22,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 02:49:22,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:49:22,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:49:23,403 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 02:49:23,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:49:23,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68137798] [2025-01-09 02:49:23,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68137798] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:49:23,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1775225551] [2025-01-09 02:49:23,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:49:23,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:49:23,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:49:23,406 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 02:49:23,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 02:49:23,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-09 02:49:23,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 02:49:23,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:49:23,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:49:23,575 INFO L256 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 132 conjuncts are in the unsatisfiable core [2025-01-09 02:49:23,579 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:49:23,615 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-09 02:49:23,804 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-01-09 02:49:23,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-01-09 02:49:23,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 02:49:23,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-01-09 02:49:24,054 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-01-09 02:49:24,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2025-01-09 02:49:24,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 02:49:24,224 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-01-09 02:49:24,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2025-01-09 02:49:24,267 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2025-01-09 02:49:24,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2025-01-09 02:49:24,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:49:24,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 27 [2025-01-09 02:49:24,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2025-01-09 02:49:24,504 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2025-01-09 02:49:24,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 109 treesize of output 78 [2025-01-09 02:49:24,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 39 [2025-01-09 02:49:24,510 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 15 [2025-01-09 02:49:24,515 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 19 [2025-01-09 02:49:24,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 34 [2025-01-09 02:49:24,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-01-09 02:49:24,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 7 treesize of output 3 [2025-01-09 02:49:24,726 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:49:24,727 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 02:49:24,834 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_966 (Array Int Int)) (v_ArrVal_965 (Array Int Int)) (v_ArrVal_967 (Array Int Int)) (v_ArrVal_970 (Array Int Int))) (let ((.cse0 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_970))) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store .cse0 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_966) (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_965) .cse1) .cse2)) (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_967) .cse1) .cse2) 4)))) (not (= v_ArrVal_966 (store (select .cse0 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_966 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|))))))) is different from false [2025-01-09 02:49:24,864 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_966 (Array Int Int)) (v_ArrVal_965 (Array Int Int)) (v_ArrVal_967 (Array Int Int)) (v_ArrVal_970 (Array Int Int))) (let ((.cse0 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_970))) (or (not (= v_ArrVal_966 (store (select .cse0 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_966 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store .cse0 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_966) (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_965) .cse1) .cse2)) (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_967) .cse1) .cse2) 4))))))) is different from false [2025-01-09 02:49:24,876 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_966 (Array Int Int)) (v_ArrVal_965 (Array Int Int)) (v_ArrVal_967 (Array Int Int)) (v_ArrVal_970 (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse0 (store |c_#memory_int#2| .cse1 v_ArrVal_970))) (or (not (= v_ArrVal_966 (store (select .cse0 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_966 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset|)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse2 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store .cse0 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_966) (select (select (store (store |c_#memory_$Pointer$#2.base| .cse1 (store (select |c_#memory_$Pointer$#2.base| .cse1) .cse2 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|)) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_965) .cse3) .cse4)) (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse1 (store (select |c_#memory_$Pointer$#2.offset| .cse1) .cse2 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset|)) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_967) .cse3) .cse4) 4)))))))) is different from false [2025-01-09 02:49:24,923 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:49:24,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 92 treesize of output 89 [2025-01-09 02:49:24,964 INFO L349 Elim1Store]: treesize reduction 207, result has 52.7 percent of original size [2025-01-09 02:49:24,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 1224 treesize of output 1232 [2025-01-09 02:49:24,979 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:49:24,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1129 treesize of output 616 [2025-01-09 02:49:25,007 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 557 treesize of output 509 [2025-01-09 02:49:25,040 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:49:25,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 230 treesize of output 246 [2025-01-09 02:49:25,070 INFO L349 Elim1Store]: treesize reduction 92, result has 52.1 percent of original size [2025-01-09 02:49:25,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 179 treesize of output 231 [2025-01-09 02:49:25,429 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 45 treesize of output 3 [2025-01-09 02:49:25,543 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 45 treesize of output 3 [2025-01-09 02:49:25,558 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 45 treesize of output 3 [2025-01-09 02:49:25,628 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 45 treesize of output 3 [2025-01-09 02:49:25,713 INFO L349 Elim1Store]: treesize reduction 138, result has 43.4 percent of original size [2025-01-09 02:49:25,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 565 treesize of output 621 [2025-01-09 02:49:25,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-01-09 02:49:25,849 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:49:25,849 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 124 treesize of output 128 [2025-01-09 02:49:25,909 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:49:25,909 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 92 treesize of output 94 [2025-01-09 02:49:26,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1775225551] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:49:26,021 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 02:49:26,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 24] total 39 [2025-01-09 02:49:26,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490197628] [2025-01-09 02:49:26,022 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 02:49:26,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-01-09 02:49:26,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:49:26,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-01-09 02:49:26,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1682, Unknown=3, NotChecked=252, Total=2070 [2025-01-09 02:49:26,023 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand has 39 states, 36 states have (on average 1.6111111111111112) internal successors, (58), 32 states have internal predecessors, (58), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-01-09 02:49:26,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:49:26,767 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2025-01-09 02:49:26,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-01-09 02:49:26,767 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 36 states have (on average 1.6111111111111112) internal successors, (58), 32 states have internal predecessors, (58), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 36 [2025-01-09 02:49:26,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:49:26,769 INFO L225 Difference]: With dead ends: 52 [2025-01-09 02:49:26,769 INFO L226 Difference]: Without dead ends: 50 [2025-01-09 02:49:26,769 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 517 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=229, Invalid=2750, Unknown=3, NotChecked=324, Total=3306 [2025-01-09 02:49:26,770 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 35 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 684 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 02:49:26,770 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 293 Invalid, 691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 684 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 02:49:26,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-01-09 02:49:26,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 39. [2025-01-09 02:49:26,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 33 states have (on average 1.121212121212121) internal successors, (37), 33 states have internal predecessors, (37), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 02:49:26,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2025-01-09 02:49:26,775 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 36 [2025-01-09 02:49:26,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:49:26,775 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2025-01-09 02:49:26,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 36 states have (on average 1.6111111111111112) internal successors, (58), 32 states have internal predecessors, (58), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-01-09 02:49:26,775 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2025-01-09 02:49:26,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-01-09 02:49:26,776 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:49:26,776 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:49:26,786 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-09 02:49:26,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-01-09 02:49:26,977 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:49:26,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:49:26,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1310104752, now seen corresponding path program 1 times [2025-01-09 02:49:26,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:49:26,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70699376] [2025-01-09 02:49:26,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:49:26,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:49:26,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-09 02:49:26,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-09 02:49:26,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:49:26,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:49:27,111 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-09 02:49:27,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:49:27,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70699376] [2025-01-09 02:49:27,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70699376] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:49:27,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [446559392] [2025-01-09 02:49:27,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:49:27,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:49:27,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:49:27,114 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 02:49:27,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-09 02:49:27,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-09 02:49:27,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-09 02:49:27,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:49:27,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:49:27,238 INFO L256 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-01-09 02:49:27,239 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:49:27,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2025-01-09 02:49:27,308 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 02:49:27,308 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 02:49:27,333 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-09 02:49:27,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [446559392] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 02:49:27,333 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 02:49:27,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 14 [2025-01-09 02:49:27,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376148266] [2025-01-09 02:49:27,333 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 02:49:27,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 02:49:27,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:49:27,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 02:49:27,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2025-01-09 02:49:27,334 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 13 states have internal predecessors, (36), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2025-01-09 02:49:31,350 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 02:49:35,364 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 02:49:39,372 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 02:49:43,476 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 02:49:43,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:49:43,482 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2025-01-09 02:49:43,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 02:49:43,482 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 13 states have internal predecessors, (36), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 37 [2025-01-09 02:49:43,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:49:43,483 INFO L225 Difference]: With dead ends: 49 [2025-01-09 02:49:43,483 INFO L226 Difference]: Without dead ends: 38 [2025-01-09 02:49:43,483 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2025-01-09 02:49:43,483 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 17 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 0 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.1s IncrementalHoareTripleChecker+Time [2025-01-09 02:49:43,484 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 243 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 154 Invalid, 4 Unknown, 0 Unchecked, 16.1s Time] [2025-01-09 02:49:43,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-01-09 02:49:43,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2025-01-09 02:49:43,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 30 states have (on average 1.1) internal successors, (33), 30 states have internal predecessors, (33), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 02:49:43,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2025-01-09 02:49:43,489 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 37 [2025-01-09 02:49:43,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:49:43,489 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2025-01-09 02:49:43,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 13 states have internal predecessors, (36), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2025-01-09 02:49:43,489 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2025-01-09 02:49:43,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-01-09 02:49:43,489 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:49:43,489 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:49:43,497 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-01-09 02:49:43,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:49:43,694 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:49:43,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:49:43,695 INFO L85 PathProgramCache]: Analyzing trace with hash 905503525, now seen corresponding path program 1 times [2025-01-09 02:49:43,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:49:43,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474884147] [2025-01-09 02:49:43,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:49:43,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:49:43,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-01-09 02:49:43,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-09 02:49:43,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:49:43,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:49:44,407 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:49:44,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:49:44,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474884147] [2025-01-09 02:49:44,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474884147] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:49:44,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [251149317] [2025-01-09 02:49:44,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:49:44,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:49:44,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:49:44,410 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 02:49:44,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-09 02:49:44,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-01-09 02:49:44,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-09 02:49:44,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:49:44,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:49:44,592 INFO L256 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 99 conjuncts are in the unsatisfiable core [2025-01-09 02:49:44,594 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:49:44,616 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-09 02:49:44,754 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-01-09 02:49:44,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-01-09 02:49:44,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 02:49:44,849 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-09 02:49:44,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2025-01-09 02:49:44,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2025-01-09 02:49:44,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-01-09 02:49:45,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:49:45,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 27 [2025-01-09 02:49:45,091 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2025-01-09 02:49:45,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2025-01-09 02:49:45,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 36 [2025-01-09 02:49:45,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 44 [2025-01-09 02:49:45,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 73 [2025-01-09 02:49:45,466 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 48 [2025-01-09 02:49:45,478 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-01-09 02:49:45,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2025-01-09 02:49:45,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 51 [2025-01-09 02:49:45,539 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-01-09 02:49:45,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 19 [2025-01-09 02:49:45,542 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:49:45,542 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 02:49:45,556 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:49:45,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 95 treesize of output 96 [2025-01-09 02:49:45,566 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:49:45,567 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 196 treesize of output 188 [2025-01-09 02:49:45,570 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 168 treesize of output 162 [2025-01-09 02:49:46,229 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse13 (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_29| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_29|) 0)) (forall ((v_arrayElimCell_93 Int) (v_ArrVal_1236 (Array Int Int)) (v_arrayElimCell_92 Int)) (not (= (select (let ((.cse21 (let ((.cse23 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_29| v_ArrVal_1236))) (let ((.cse24 (select .cse23 .cse3))) (let ((.cse22 (store .cse24 .cse7 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_29|))) (store (store |c_#memory_$Pointer$#2.base| .cse3 .cse22) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_29| (store (select (store .cse23 .cse3 .cse22) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_29|) v_arrayElimCell_93 (select .cse24 .cse7)))))))) (select .cse21 (select (select .cse21 .cse0) .cse2))) v_arrayElimCell_92) .cse0))) (= .cse0 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_29|)))) (.cse12 (not (= 0 (select |c_#valid| .cse0))))) (and (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_29| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_29|) 0)) (forall ((v_ArrVal_1236 (Array Int Int)) (v_arrayElimCell_92 Int)) (not (= .cse0 (select (let ((.cse1 (let ((.cse5 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_29| v_ArrVal_1236))) (let ((.cse6 (select .cse5 .cse3))) (let ((.cse4 (store .cse6 .cse7 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_29|))) (store (store |c_#memory_$Pointer$#2.base| .cse3 .cse4) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_29| (store (select (store .cse5 .cse3 .cse4) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_29|) v_arrayElimCell_92 (select .cse6 .cse7)))))))) (select .cse1 (select (select .cse1 .cse0) .cse2))) v_arrayElimCell_92)))) (= .cse0 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_29|))) (or (forall ((v_arrayElimCell_94 Int) (v_ArrVal_1236 (Array Int Int)) (v_arrayElimCell_92 Int)) (not (= (select (let ((.cse10 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_1236))) (let ((.cse11 (select .cse10 .cse3))) (let ((.cse8 (store .cse11 .cse7 .cse0))) (let ((.cse9 (store (select (store .cse10 .cse3 .cse8) .cse0) v_arrayElimCell_92 (select .cse11 .cse7)))) (select (store (store |c_#memory_$Pointer$#2.base| .cse3 .cse8) .cse0 .cse9) (select .cse9 .cse2)))))) v_arrayElimCell_94) .cse0))) .cse12) (or (and .cse13 (or (forall ((v_arrayElimCell_94 Int) (v_arrayElimCell_93 Int) (v_ArrVal_1236 (Array Int Int))) (not (= (select (let ((.cse16 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_1236))) (let ((.cse17 (select .cse16 .cse3))) (let ((.cse14 (store .cse17 .cse7 .cse0))) (let ((.cse15 (store (select (store .cse16 .cse3 .cse14) .cse0) v_arrayElimCell_93 (select .cse17 .cse7)))) (select (store (store |c_#memory_$Pointer$#2.base| .cse3 .cse14) .cse0 .cse15) (select .cse15 .cse2)))))) v_arrayElimCell_94) .cse0))) .cse12)) (= .cse2 .cse7)) (or (and .cse13 (or (forall ((v_arrayElimCell_94 Int) (v_arrayElimCell_93 Int) (v_ArrVal_1236 (Array Int Int))) (not (= .cse0 (select (let ((.cse20 (select |c_#memory_$Pointer$#2.base| .cse3))) (let ((.cse18 (store .cse20 .cse7 .cse0))) (let ((.cse19 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_1236) .cse3 .cse18) .cse0) v_arrayElimCell_93 (select .cse20 .cse7)))) (select (store (store |c_#memory_$Pointer$#2.base| .cse3 .cse18) .cse0 .cse19) (select .cse19 .cse2))))) v_arrayElimCell_94)))) .cse12)) (= .cse0 .cse3))))) is different from false [2025-01-09 02:49:46,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [251149317] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:49:46,236 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 02:49:46,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24] total 41 [2025-01-09 02:49:46,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378462172] [2025-01-09 02:49:46,236 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 02:49:46,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-01-09 02:49:46,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:49:46,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-01-09 02:49:46,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1762, Unknown=1, NotChecked=84, Total=1980 [2025-01-09 02:49:46,237 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand has 41 states, 38 states have (on average 1.4736842105263157) internal successors, (56), 32 states have internal predecessors, (56), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-09 02:49:46,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:49:46,984 INFO L93 Difference]: Finished difference Result 68 states and 75 transitions. [2025-01-09 02:49:46,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-01-09 02:49:46,985 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 38 states have (on average 1.4736842105263157) internal successors, (56), 32 states have internal predecessors, (56), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 38 [2025-01-09 02:49:46,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:49:46,985 INFO L225 Difference]: With dead ends: 68 [2025-01-09 02:49:46,986 INFO L226 Difference]: Without dead ends: 65 [2025-01-09 02:49:46,987 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 537 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=214, Invalid=2759, Unknown=1, NotChecked=106, Total=3080 [2025-01-09 02:49:46,987 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 36 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 694 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 694 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 02:49:46,987 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 289 Invalid, 703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 694 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 02:49:46,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-01-09 02:49:46,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 57. [2025-01-09 02:49:46,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 48 states have (on average 1.0833333333333333) internal successors, (52), 48 states have internal predecessors, (52), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-09 02:49:46,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2025-01-09 02:49:46,994 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 38 [2025-01-09 02:49:46,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:49:46,995 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2025-01-09 02:49:46,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 38 states have (on average 1.4736842105263157) internal successors, (56), 32 states have internal predecessors, (56), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-09 02:49:46,995 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2025-01-09 02:49:46,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-01-09 02:49:46,995 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:49:46,995 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:49:47,005 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-01-09 02:49:47,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:49:47,200 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:49:47,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:49:47,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1994238603, now seen corresponding path program 2 times [2025-01-09 02:49:47,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:49:47,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038122040] [2025-01-09 02:49:47,201 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 02:49:47,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:49:47,212 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-01-09 02:49:47,222 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-01-09 02:49:47,223 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 02:49:47,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:49:48,752 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:49:48,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:49:48,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038122040] [2025-01-09 02:49:48,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038122040] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:49:48,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [210197875] [2025-01-09 02:49:48,753 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 02:49:48,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:49:48,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:49:48,755 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 02:49:48,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-09 02:49:48,855 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-01-09 02:49:48,904 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-01-09 02:49:48,904 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 02:49:48,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:49:48,908 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 166 conjuncts are in the unsatisfiable core [2025-01-09 02:49:48,912 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:49:48,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-09 02:49:48,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 02:49:49,168 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-01-09 02:49:49,168 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2025-01-09 02:49:49,194 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-01-09 02:49:49,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-01-09 02:49:49,251 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 02:49:49,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-01-09 02:49:49,264 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 02:49:49,327 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2025-01-09 02:49:49,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 60 [2025-01-09 02:49:49,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 15 [2025-01-09 02:49:49,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2025-01-09 02:49:49,485 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-01-09 02:49:49,485 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 38 [2025-01-09 02:49:49,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-01-09 02:49:49,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2025-01-09 02:49:49,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 7 treesize of output 3 [2025-01-09 02:49:49,628 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 9 treesize of output 12 [2025-01-09 02:49:49,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:49:49,742 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2025-01-09 02:49:49,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 87 treesize of output 64 [2025-01-09 02:49:49,761 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2025-01-09 02:49:49,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2025-01-09 02:49:49,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2025-01-09 02:49:49,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2025-01-09 02:49:50,192 INFO L349 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2025-01-09 02:49:50,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 93 treesize of output 62 [2025-01-09 02:49:50,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40 [2025-01-09 02:49:50,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 36 [2025-01-09 02:49:50,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2025-01-09 02:49:50,292 INFO L349 Elim1Store]: treesize reduction 114, result has 35.6 percent of original size [2025-01-09 02:49:50,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 129 treesize of output 114 [2025-01-09 02:49:50,350 INFO L349 Elim1Store]: treesize reduction 112, result has 23.3 percent of original size [2025-01-09 02:49:50,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 51 [2025-01-09 02:49:50,388 INFO L349 Elim1Store]: treesize reduction 95, result has 17.4 percent of original size [2025-01-09 02:49:50,389 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 91 treesize of output 115 [2025-01-09 02:49:50,399 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 02:49:50,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 15 [2025-01-09 02:49:51,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 636 treesize of output 428 [2025-01-09 02:49:51,829 INFO L349 Elim1Store]: treesize reduction 81, result has 28.3 percent of original size [2025-01-09 02:49:51,830 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 425 treesize of output 246 [2025-01-09 02:49:51,858 INFO L349 Elim1Store]: treesize reduction 18, result has 45.5 percent of original size [2025-01-09 02:49:51,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 210 treesize of output 183 [2025-01-09 02:49:52,602 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 18 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:49:52,602 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 02:50:15,364 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:50:15,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 963 treesize of output 964 [2025-01-09 02:50:16,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [210197875] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:50:16,438 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 02:50:16,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 27] total 47 [2025-01-09 02:50:16,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468278823] [2025-01-09 02:50:16,438 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 02:50:16,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2025-01-09 02:50:16,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:50:16,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2025-01-09 02:50:16,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=2950, Unknown=75, NotChecked=0, Total=3192 [2025-01-09 02:50:16,440 INFO L87 Difference]: Start difference. First operand 57 states and 62 transitions. Second operand has 47 states, 43 states have (on average 1.3953488372093024) internal successors, (60), 38 states have internal predecessors, (60), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-09 02:50:35,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:50:36,000 INFO L93 Difference]: Finished difference Result 75 states and 86 transitions. [2025-01-09 02:50:36,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-01-09 02:50:36,000 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 43 states have (on average 1.3953488372093024) internal successors, (60), 38 states have internal predecessors, (60), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 39 [2025-01-09 02:50:36,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:50:36,001 INFO L225 Difference]: With dead ends: 75 [2025-01-09 02:50:36,001 INFO L226 Difference]: Without dead ends: 73 [2025-01-09 02:50:36,003 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1078 ImplicationChecksByTransitivity, 43.1s TimeCoverageRelationStatistics Valid=395, Invalid=6126, Unknown=121, NotChecked=0, Total=6642 [2025-01-09 02:50:36,003 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 64 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 1512 mSolverCounterSat, 16 mSolverCounterUnsat, 14 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 1542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1512 IncrementalHoareTripleChecker+Invalid, 14 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-01-09 02:50:36,003 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 372 Invalid, 1542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1512 Invalid, 14 Unknown, 0 Unchecked, 1.8s Time] [2025-01-09 02:50:36,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-01-09 02:50:36,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 63. [2025-01-09 02:50:36,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 54 states have (on average 1.1296296296296295) internal successors, (61), 54 states have internal predecessors, (61), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-09 02:50:36,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 71 transitions. [2025-01-09 02:50:36,014 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 71 transitions. Word has length 39 [2025-01-09 02:50:36,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:50:36,014 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 71 transitions. [2025-01-09 02:50:36,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 43 states have (on average 1.3953488372093024) internal successors, (60), 38 states have internal predecessors, (60), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-09 02:50:36,014 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 71 transitions. [2025-01-09 02:50:36,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-01-09 02:50:36,015 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:50:36,015 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:50:36,022 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-01-09 02:50:36,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:50:36,218 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:50:36,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:50:36,218 INFO L85 PathProgramCache]: Analyzing trace with hash -907845108, now seen corresponding path program 2 times [2025-01-09 02:50:36,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:50:36,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882609832] [2025-01-09 02:50:36,218 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 02:50:36,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:50:36,230 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 41 statements into 2 equivalence classes. [2025-01-09 02:50:36,234 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 41 of 41 statements. [2025-01-09 02:50:36,235 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 02:50:36,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:50:36,316 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-01-09 02:50:36,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:50:36,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882609832] [2025-01-09 02:50:36,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882609832] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:50:36,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [481294626] [2025-01-09 02:50:36,317 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 02:50:36,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:50:36,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:50:36,319 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 02:50:36,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-01-09 02:50:36,428 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 41 statements into 2 equivalence classes. [2025-01-09 02:50:36,463 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 41 of 41 statements. [2025-01-09 02:50:36,464 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 02:50:36,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:50:36,465 INFO L256 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-09 02:50:36,466 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:50:36,517 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-01-09 02:50:36,517 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 02:50:36,587 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-01-09 02:50:36,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [481294626] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 02:50:36,588 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 02:50:36,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2025-01-09 02:50:36,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220364004] [2025-01-09 02:50:36,588 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 02:50:36,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 02:50:36,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:50:36,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 02:50:36,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-01-09 02:50:36,590 INFO L87 Difference]: Start difference. First operand 63 states and 71 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 02:50:36,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:50:36,652 INFO L93 Difference]: Finished difference Result 81 states and 89 transitions. [2025-01-09 02:50:36,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 02:50:36,653 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 41 [2025-01-09 02:50:36,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:50:36,653 INFO L225 Difference]: With dead ends: 81 [2025-01-09 02:50:36,653 INFO L226 Difference]: Without dead ends: 78 [2025-01-09 02:50:36,653 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-01-09 02:50:36,654 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 17 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 02:50:36,654 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 205 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 02:50:36,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-01-09 02:50:36,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 69. [2025-01-09 02:50:36,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 60 states have (on average 1.1333333333333333) internal successors, (68), 60 states have internal predecessors, (68), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-09 02:50:36,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 78 transitions. [2025-01-09 02:50:36,664 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 78 transitions. Word has length 41 [2025-01-09 02:50:36,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:50:36,665 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 78 transitions. [2025-01-09 02:50:36,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 02:50:36,665 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 78 transitions. [2025-01-09 02:50:36,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-01-09 02:50:36,665 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:50:36,665 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:50:36,672 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-01-09 02:50:36,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-01-09 02:50:36,866 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:50:36,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:50:36,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1921495918, now seen corresponding path program 3 times [2025-01-09 02:50:36,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:50:36,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837541830] [2025-01-09 02:50:36,867 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 02:50:36,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:50:36,881 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 42 statements into 4 equivalence classes. [2025-01-09 02:50:36,902 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 42 of 42 statements. [2025-01-09 02:50:36,903 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-01-09 02:50:36,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:50:38,451 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 13 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:50:38,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:50:38,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837541830] [2025-01-09 02:50:38,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837541830] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:50:38,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [633754288] [2025-01-09 02:50:38,452 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 02:50:38,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:50:38,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:50:38,455 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 02:50:38,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-01-09 02:50:38,596 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 42 statements into 4 equivalence classes. [2025-01-09 02:50:38,784 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 42 of 42 statements. [2025-01-09 02:50:38,785 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-01-09 02:50:38,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:50:38,793 INFO L256 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 141 conjuncts are in the unsatisfiable core [2025-01-09 02:50:38,797 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:50:38,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-09 02:50:39,006 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_32| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_32| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_32| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_32| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_32| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 0))) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) is different from false [2025-01-09 02:50:39,009 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_32| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_32| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_32| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_32| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_32| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 0))) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) is different from true [2025-01-09 02:50:39,020 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 02:50:39,035 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 02:50:39,040 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0)) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) 0) (exists ((|v_old(#valid)_AFTER_CALL_32| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_32| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_32| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_32| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_32| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1)))) is different from false [2025-01-09 02:50:39,043 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0)) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) 0) (exists ((|v_old(#valid)_AFTER_CALL_32| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_32| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_32| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_32| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_32| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1)))) is different from true [2025-01-09 02:50:39,066 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2025-01-09 02:50:39,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 34 [2025-01-09 02:50:39,081 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2025-01-09 02:50:39,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 22 [2025-01-09 02:50:39,098 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 0))) (and (= |c_ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| (select (select |c_#memory_$Pointer$#2.base| .cse0) 0)) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 0) 0) (exists ((|v_old(#valid)_AFTER_CALL_32| (Array Int Int))) (and (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_32| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_32| .cse1 (select |c_#valid| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_32| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_32| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 0))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 0) 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 1))) is different from false [2025-01-09 02:50:39,102 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 0))) (and (= |c_ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| (select (select |c_#memory_$Pointer$#2.base| .cse0) 0)) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 0) 0) (exists ((|v_old(#valid)_AFTER_CALL_32| (Array Int Int))) (and (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_32| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_32| .cse1 (select |c_#valid| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_32| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_32| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 0))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 0) 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 1))) is different from true [2025-01-09 02:50:39,137 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 0) 0) (= (select |c_#valid| .cse1) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_32| (Array Int Int))) (and (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_32| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_32| .cse2 (select |c_#valid| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_32| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_32| .cse0) 1))) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 0) .cse1) (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_insert_~head#1.offset| 0) (= 0 (select (select |c_#memory_$Pointer$#2.offset| .cse1) 0)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0)))) is different from false [2025-01-09 02:50:39,140 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 0) 0) (= (select |c_#valid| .cse1) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_32| (Array Int Int))) (and (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_32| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_32| .cse2 (select |c_#valid| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_32| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_32| .cse0) 1))) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 0) .cse1) (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_insert_~head#1.offset| 0) (= 0 (select (select |c_#memory_$Pointer$#2.offset| .cse1) 0)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0)))) is different from true [2025-01-09 02:50:39,154 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-01-09 02:50:39,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 23 [2025-01-09 02:50:39,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:50:39,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2025-01-09 02:50:39,184 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (exists ((|v_old(#valid)_AFTER_CALL_32| (Array Int Int)) (|v_#valid_BEFORE_CALL_23| (Array Int Int)) (v_arrayElimIndex_15 Int) (|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_32| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_23| .cse0) 1) (= |v_#valid_BEFORE_CALL_23| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_32| |v_#valid_BEFORE_CALL_23|))) (store |v_old(#valid)_AFTER_CALL_32| .cse1 (select |v_#valid_BEFORE_CALL_23| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_32| v_arrayElimIndex_15) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_7|) 0) 0)))) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from false [2025-01-09 02:50:39,187 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (exists ((|v_old(#valid)_AFTER_CALL_32| (Array Int Int)) (|v_#valid_BEFORE_CALL_23| (Array Int Int)) (v_arrayElimIndex_15 Int) (|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_32| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_23| .cse0) 1) (= |v_#valid_BEFORE_CALL_23| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_32| |v_#valid_BEFORE_CALL_23|))) (store |v_old(#valid)_AFTER_CALL_32| .cse1 (select |v_#valid_BEFORE_CALL_23| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_32| v_arrayElimIndex_15) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_7|) 0) 0)))) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from true [2025-01-09 02:50:39,214 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((|v_old(#valid)_AFTER_CALL_32| (Array Int Int)) (|v_#valid_BEFORE_CALL_23| (Array Int Int)) (v_arrayElimIndex_15 Int) (|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_32| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_23| .cse0) 1) (= |v_#valid_BEFORE_CALL_23| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_32| |v_#valid_BEFORE_CALL_23|))) (store |v_old(#valid)_AFTER_CALL_32| .cse1 (select |v_#valid_BEFORE_CALL_23| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_32| v_arrayElimIndex_15) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_7|) 0) 0)))) (= |c_node_create_~temp~0#1.offset| 0) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from false [2025-01-09 02:50:39,217 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_old(#valid)_AFTER_CALL_32| (Array Int Int)) (|v_#valid_BEFORE_CALL_23| (Array Int Int)) (v_arrayElimIndex_15 Int) (|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_32| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_23| .cse0) 1) (= |v_#valid_BEFORE_CALL_23| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_32| |v_#valid_BEFORE_CALL_23|))) (store |v_old(#valid)_AFTER_CALL_32| .cse1 (select |v_#valid_BEFORE_CALL_23| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_32| v_arrayElimIndex_15) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_7|) 0) 0)))) (= |c_node_create_~temp~0#1.offset| 0) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from true [2025-01-09 02:50:39,270 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (store |c_old(#memory_$Pointer$#2.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.offset| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.offset|) (exists ((|v_old(#valid)_AFTER_CALL_32| (Array Int Int)) (|v_#valid_BEFORE_CALL_23| (Array Int Int)) (v_arrayElimIndex_15 Int) (|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_32| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_23| .cse0) 1) (= |v_#valid_BEFORE_CALL_23| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_32| |v_#valid_BEFORE_CALL_23|))) (store |v_old(#valid)_AFTER_CALL_32| .cse1 (select |v_#valid_BEFORE_CALL_23| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_32| v_arrayElimIndex_15) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_7|) 0) 0)))) (= (store |c_old(#memory_$Pointer$#2.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.base| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.base|)) is different from false [2025-01-09 02:50:39,273 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (store |c_old(#memory_$Pointer$#2.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.offset| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.offset|) (exists ((|v_old(#valid)_AFTER_CALL_32| (Array Int Int)) (|v_#valid_BEFORE_CALL_23| (Array Int Int)) (v_arrayElimIndex_15 Int) (|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_32| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_23| .cse0) 1) (= |v_#valid_BEFORE_CALL_23| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_32| |v_#valid_BEFORE_CALL_23|))) (store |v_old(#valid)_AFTER_CALL_32| .cse1 (select |v_#valid_BEFORE_CALL_23| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_32| v_arrayElimIndex_15) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_7|) 0) 0)))) (= (store |c_old(#memory_$Pointer$#2.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.base| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.base|)) is different from true [2025-01-09 02:50:39,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:50:39,328 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2025-01-09 02:50:39,328 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 45 [2025-01-09 02:50:39,368 INFO L349 Elim1Store]: treesize reduction 48, result has 56.8 percent of original size [2025-01-09 02:50:39,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 73 [2025-01-09 02:50:39,480 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| .cse4) 0))) (and (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| .cse4)) (.cse1 (select |c_#memory_$Pointer$#2.offset| .cse6))) (let ((.cse2 (= .cse6 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|)) (.cse5 (= (select .cse1 0) 0)) (.cse3 (= 0 (select .cse0 0)))) (or (and (or (= .cse0 .cse1) .cse2) .cse3) (and (= .cse4 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) (or .cse5 .cse2)) (and .cse5 .cse3)))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_34| (Array Int Int)) (v_arrayElimIndex_15 Int) (|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse7 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select |v_#valid_BEFORE_CALL_23| .cse7) 1) (= |v_#valid_BEFORE_CALL_23| (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_34| |v_#valid_BEFORE_CALL_23|))) (store |v_old(#valid)_AFTER_CALL_34| .cse8 (select |v_#valid_BEFORE_CALL_23| .cse8)))) (= (select |v_old(#valid)_AFTER_CALL_34| v_arrayElimIndex_15) 1) (= (select |v_old(#valid)_AFTER_CALL_34| .cse7) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_7|) 0) 0)))) (= (select (select |c_#memory_$Pointer$#2.base| .cse6) 0) .cse4) (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_insert_~head#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_32| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_33| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_33| .cse4) 1) (= (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_32| |v_old(#valid)_AFTER_CALL_33|))) (store |v_old(#valid)_AFTER_CALL_32| .cse9 (select |v_old(#valid)_AFTER_CALL_33| .cse9))) |v_old(#valid)_AFTER_CALL_33|) (= (select |v_old(#valid)_AFTER_CALL_32| .cse4) 0) (= (select |v_old(#valid)_AFTER_CALL_33| |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_32| .cse6) 1))) (= |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0)))) is different from false [2025-01-09 02:50:39,484 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| .cse4) 0))) (and (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| .cse4)) (.cse1 (select |c_#memory_$Pointer$#2.offset| .cse6))) (let ((.cse2 (= .cse6 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|)) (.cse5 (= (select .cse1 0) 0)) (.cse3 (= 0 (select .cse0 0)))) (or (and (or (= .cse0 .cse1) .cse2) .cse3) (and (= .cse4 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) (or .cse5 .cse2)) (and .cse5 .cse3)))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_34| (Array Int Int)) (v_arrayElimIndex_15 Int) (|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse7 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select |v_#valid_BEFORE_CALL_23| .cse7) 1) (= |v_#valid_BEFORE_CALL_23| (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_34| |v_#valid_BEFORE_CALL_23|))) (store |v_old(#valid)_AFTER_CALL_34| .cse8 (select |v_#valid_BEFORE_CALL_23| .cse8)))) (= (select |v_old(#valid)_AFTER_CALL_34| v_arrayElimIndex_15) 1) (= (select |v_old(#valid)_AFTER_CALL_34| .cse7) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_7|) 0) 0)))) (= (select (select |c_#memory_$Pointer$#2.base| .cse6) 0) .cse4) (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_insert_~head#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_32| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_33| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_33| .cse4) 1) (= (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_32| |v_old(#valid)_AFTER_CALL_33|))) (store |v_old(#valid)_AFTER_CALL_32| .cse9 (select |v_old(#valid)_AFTER_CALL_33| .cse9))) |v_old(#valid)_AFTER_CALL_33|) (= (select |v_old(#valid)_AFTER_CALL_32| .cse4) 0) (= (select |v_old(#valid)_AFTER_CALL_33| |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_32| .cse6) 1))) (= |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0)))) is different from true [2025-01-09 02:50:39,565 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse3) 0))) (and (= |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_34| (Array Int Int)) (v_arrayElimIndex_15 Int) (|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select |v_#valid_BEFORE_CALL_23| .cse0) 1) (= |v_#valid_BEFORE_CALL_23| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_34| |v_#valid_BEFORE_CALL_23|))) (store |v_old(#valid)_AFTER_CALL_34| .cse1 (select |v_#valid_BEFORE_CALL_23| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_34| v_arrayElimIndex_15) 1) (= (select |v_old(#valid)_AFTER_CALL_34| .cse0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_7|) 0) 0)))) (= (select (select |c_#memory_$Pointer$#2.base| .cse2) 0) .cse3) (= .cse3 |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_32| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_33| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_33| .cse3) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_32| |v_old(#valid)_AFTER_CALL_33|))) (store |v_old(#valid)_AFTER_CALL_32| .cse4 (select |v_old(#valid)_AFTER_CALL_33| .cse4))) |v_old(#valid)_AFTER_CALL_33|) (= (select |v_old(#valid)_AFTER_CALL_32| .cse3) 0) (= (select |v_old(#valid)_AFTER_CALL_32| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_33| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0))) (let ((.cse6 (= .cse2 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) (.cse5 (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 0) 0)) (.cse7 (= 0 (select (select |c_#memory_$Pointer$#2.offset| .cse3) 0)))) (or (and (= .cse3 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) (or .cse5 .cse6)) (and .cse6 .cse7) (and .cse5 .cse7))) (= |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0)))) is different from false [2025-01-09 02:50:39,576 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse3) 0))) (and (= |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_34| (Array Int Int)) (v_arrayElimIndex_15 Int) (|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select |v_#valid_BEFORE_CALL_23| .cse0) 1) (= |v_#valid_BEFORE_CALL_23| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_34| |v_#valid_BEFORE_CALL_23|))) (store |v_old(#valid)_AFTER_CALL_34| .cse1 (select |v_#valid_BEFORE_CALL_23| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_34| v_arrayElimIndex_15) 1) (= (select |v_old(#valid)_AFTER_CALL_34| .cse0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_7|) 0) 0)))) (= (select (select |c_#memory_$Pointer$#2.base| .cse2) 0) .cse3) (= .cse3 |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_32| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_33| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_33| .cse3) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_32| |v_old(#valid)_AFTER_CALL_33|))) (store |v_old(#valid)_AFTER_CALL_32| .cse4 (select |v_old(#valid)_AFTER_CALL_33| .cse4))) |v_old(#valid)_AFTER_CALL_33|) (= (select |v_old(#valid)_AFTER_CALL_32| .cse3) 0) (= (select |v_old(#valid)_AFTER_CALL_32| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_33| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0))) (let ((.cse6 (= .cse2 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) (.cse5 (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 0) 0)) (.cse7 (= 0 (select (select |c_#memory_$Pointer$#2.offset| .cse3) 0)))) (or (and (= .cse3 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) (or .cse5 .cse6)) (and .cse6 .cse7) (and .cse5 .cse7))) (= |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0)))) is different from true [2025-01-09 02:50:39,735 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| .cse2) 0)) (.cse8 (select (select |c_#memory_$Pointer$#2.offset| .cse2) 0))) (and (= |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_34| (Array Int Int)) (v_arrayElimIndex_15 Int) (|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select |v_#valid_BEFORE_CALL_23| .cse0) 1) (= |v_#valid_BEFORE_CALL_23| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_34| |v_#valid_BEFORE_CALL_23|))) (store |v_old(#valid)_AFTER_CALL_34| .cse1 (select |v_#valid_BEFORE_CALL_23| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_34| v_arrayElimIndex_15) 1) (= (select |v_old(#valid)_AFTER_CALL_34| .cse0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_7|) 0) 0)))) (= |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| .cse2) (= (select (select |c_#memory_$Pointer$#2.base| .cse3) 0) .cse2) (= .cse3 |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_32| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_33| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_33| .cse2) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_32| |v_old(#valid)_AFTER_CALL_33|))) (store |v_old(#valid)_AFTER_CALL_32| .cse4 (select |v_old(#valid)_AFTER_CALL_33| .cse4))) |v_old(#valid)_AFTER_CALL_33|) (= (select |v_old(#valid)_AFTER_CALL_32| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_32| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_33| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0))) (let ((.cse6 (= .cse3 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) (.cse5 (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 0) 0)) (.cse7 (= 0 .cse8))) (or (and (= .cse2 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) (or .cse5 .cse6)) (and .cse6 .cse7) (and .cse5 .cse7))) (= |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| .cse8) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0)))) is different from false [2025-01-09 02:50:39,738 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| .cse2) 0)) (.cse8 (select (select |c_#memory_$Pointer$#2.offset| .cse2) 0))) (and (= |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_34| (Array Int Int)) (v_arrayElimIndex_15 Int) (|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select |v_#valid_BEFORE_CALL_23| .cse0) 1) (= |v_#valid_BEFORE_CALL_23| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_34| |v_#valid_BEFORE_CALL_23|))) (store |v_old(#valid)_AFTER_CALL_34| .cse1 (select |v_#valid_BEFORE_CALL_23| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_34| v_arrayElimIndex_15) 1) (= (select |v_old(#valid)_AFTER_CALL_34| .cse0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_7|) 0) 0)))) (= |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| .cse2) (= (select (select |c_#memory_$Pointer$#2.base| .cse3) 0) .cse2) (= .cse3 |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_32| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_33| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_33| .cse2) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_32| |v_old(#valid)_AFTER_CALL_33|))) (store |v_old(#valid)_AFTER_CALL_32| .cse4 (select |v_old(#valid)_AFTER_CALL_33| .cse4))) |v_old(#valid)_AFTER_CALL_33|) (= (select |v_old(#valid)_AFTER_CALL_32| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_32| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_33| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0))) (let ((.cse6 (= .cse3 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) (.cse5 (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 0) 0)) (.cse7 (= 0 .cse8))) (or (and (= .cse2 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) (or .cse5 .cse6)) (and .cse6 .cse7) (and .cse5 .cse7))) (= |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| .cse8) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0)))) is different from true [2025-01-09 02:50:39,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:50:39,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:50:39,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:50:39,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 178 treesize of output 112 [2025-01-09 02:50:39,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:50:39,870 INFO L349 Elim1Store]: treesize reduction 87, result has 7.4 percent of original size [2025-01-09 02:50:39,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 234 treesize of output 124 [2025-01-09 02:50:39,924 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse4) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 0) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_34| (Array Int Int)) (v_arrayElimIndex_15 Int) (|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select |v_#valid_BEFORE_CALL_23| .cse2) 1) (= |v_#valid_BEFORE_CALL_23| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_34| |v_#valid_BEFORE_CALL_23|))) (store |v_old(#valid)_AFTER_CALL_34| .cse3 (select |v_#valid_BEFORE_CALL_23| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_34| v_arrayElimIndex_15) 1) (= (select |v_old(#valid)_AFTER_CALL_34| .cse2) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_7|) 0) 0)))) (= .cse4 (select (select |c_#memory_$Pointer$#2.base| .cse1) 0)) (exists ((|v_old(#valid)_AFTER_CALL_32| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_33| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_33| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_33| .cse4) 1) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_32| |v_old(#valid)_AFTER_CALL_33|))) (store |v_old(#valid)_AFTER_CALL_32| .cse5 (select |v_old(#valid)_AFTER_CALL_33| .cse5))) |v_old(#valid)_AFTER_CALL_33|) (= (select |v_old(#valid)_AFTER_CALL_32| .cse4) 0) (= (select |v_old(#valid)_AFTER_CALL_32| .cse1) 1))) (= 0 (select (select |c_#memory_$Pointer$#2.offset| .cse4) 0)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0))))) is different from false [2025-01-09 02:50:39,928 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse4) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 0) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_34| (Array Int Int)) (v_arrayElimIndex_15 Int) (|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select |v_#valid_BEFORE_CALL_23| .cse2) 1) (= |v_#valid_BEFORE_CALL_23| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_34| |v_#valid_BEFORE_CALL_23|))) (store |v_old(#valid)_AFTER_CALL_34| .cse3 (select |v_#valid_BEFORE_CALL_23| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_34| v_arrayElimIndex_15) 1) (= (select |v_old(#valid)_AFTER_CALL_34| .cse2) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_7|) 0) 0)))) (= .cse4 (select (select |c_#memory_$Pointer$#2.base| .cse1) 0)) (exists ((|v_old(#valid)_AFTER_CALL_32| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_33| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_33| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_33| .cse4) 1) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_32| |v_old(#valid)_AFTER_CALL_33|))) (store |v_old(#valid)_AFTER_CALL_32| .cse5 (select |v_old(#valid)_AFTER_CALL_33| .cse5))) |v_old(#valid)_AFTER_CALL_33|) (= (select |v_old(#valid)_AFTER_CALL_32| .cse4) 0) (= (select |v_old(#valid)_AFTER_CALL_32| .cse1) 1))) (= 0 (select (select |c_#memory_$Pointer$#2.offset| .cse4) 0)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0))))) is different from true [2025-01-09 02:50:39,988 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse0) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 0) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse1) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 0) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_34| (Array Int Int)) (v_arrayElimIndex_15 Int) (|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select |v_#valid_BEFORE_CALL_23| .cse3) 1) (= |v_#valid_BEFORE_CALL_23| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_34| |v_#valid_BEFORE_CALL_23|))) (store |v_old(#valid)_AFTER_CALL_34| .cse4 (select |v_#valid_BEFORE_CALL_23| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_34| v_arrayElimIndex_15) 1) (= (select |v_old(#valid)_AFTER_CALL_34| .cse3) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_7|) 0) 0)))) (= .cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) 0)) (exists ((|v_old(#valid)_AFTER_CALL_32| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_33| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_33| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_33| .cse1) 1) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_32| |v_old(#valid)_AFTER_CALL_33|))) (store |v_old(#valid)_AFTER_CALL_32| .cse5 (select |v_old(#valid)_AFTER_CALL_33| .cse5))) |v_old(#valid)_AFTER_CALL_33|) (= (select |v_old(#valid)_AFTER_CALL_32| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_32| .cse2) 1))) (= 0 (select (select |c_#memory_$Pointer$#2.offset| .cse1) 0)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0))))) is different from false [2025-01-09 02:50:39,991 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse0) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 0) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse1) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 0) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_34| (Array Int Int)) (v_arrayElimIndex_15 Int) (|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select |v_#valid_BEFORE_CALL_23| .cse3) 1) (= |v_#valid_BEFORE_CALL_23| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_34| |v_#valid_BEFORE_CALL_23|))) (store |v_old(#valid)_AFTER_CALL_34| .cse4 (select |v_#valid_BEFORE_CALL_23| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_34| v_arrayElimIndex_15) 1) (= (select |v_old(#valid)_AFTER_CALL_34| .cse3) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_7|) 0) 0)))) (= .cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) 0)) (exists ((|v_old(#valid)_AFTER_CALL_32| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_33| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_33| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_33| .cse1) 1) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_32| |v_old(#valid)_AFTER_CALL_33|))) (store |v_old(#valid)_AFTER_CALL_32| .cse5 (select |v_old(#valid)_AFTER_CALL_33| .cse5))) |v_old(#valid)_AFTER_CALL_33|) (= (select |v_old(#valid)_AFTER_CALL_32| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_32| .cse2) 1))) (= 0 (select (select |c_#memory_$Pointer$#2.offset| .cse1) 0)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0))))) is different from true [2025-01-09 02:50:40,103 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse4) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 0) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 0) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_34| (Array Int Int)) (v_arrayElimIndex_15 Int) (|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select |v_#valid_BEFORE_CALL_23| .cse2) 1) (= |v_#valid_BEFORE_CALL_23| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_34| |v_#valid_BEFORE_CALL_23|))) (store |v_old(#valid)_AFTER_CALL_34| .cse3 (select |v_#valid_BEFORE_CALL_23| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_34| v_arrayElimIndex_15) 1) (= (select |v_old(#valid)_AFTER_CALL_34| .cse2) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_7|) 0) 0)))) (= .cse4 (select (select |c_#memory_$Pointer$#2.base| .cse1) 0)) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse0) (exists ((|v_old(#valid)_AFTER_CALL_32| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_33| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_33| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_33| .cse4) 1) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_32| |v_old(#valid)_AFTER_CALL_33|))) (store |v_old(#valid)_AFTER_CALL_32| .cse5 (select |v_old(#valid)_AFTER_CALL_33| .cse5))) |v_old(#valid)_AFTER_CALL_33|) (= (select |v_old(#valid)_AFTER_CALL_32| .cse4) 0) (= (select |v_old(#valid)_AFTER_CALL_32| .cse1) 1))) (= 0 (select (select |c_#memory_$Pointer$#2.offset| .cse4) 0)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0))))) is different from false [2025-01-09 02:50:40,106 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse4) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 0) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 0) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_34| (Array Int Int)) (v_arrayElimIndex_15 Int) (|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select |v_#valid_BEFORE_CALL_23| .cse2) 1) (= |v_#valid_BEFORE_CALL_23| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_34| |v_#valid_BEFORE_CALL_23|))) (store |v_old(#valid)_AFTER_CALL_34| .cse3 (select |v_#valid_BEFORE_CALL_23| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_34| v_arrayElimIndex_15) 1) (= (select |v_old(#valid)_AFTER_CALL_34| .cse2) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_7|) 0) 0)))) (= .cse4 (select (select |c_#memory_$Pointer$#2.base| .cse1) 0)) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse0) (exists ((|v_old(#valid)_AFTER_CALL_32| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_33| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_33| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_33| .cse4) 1) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_32| |v_old(#valid)_AFTER_CALL_33|))) (store |v_old(#valid)_AFTER_CALL_32| .cse5 (select |v_old(#valid)_AFTER_CALL_33| .cse5))) |v_old(#valid)_AFTER_CALL_33|) (= (select |v_old(#valid)_AFTER_CALL_32| .cse4) 0) (= (select |v_old(#valid)_AFTER_CALL_32| .cse1) 1))) (= 0 (select (select |c_#memory_$Pointer$#2.offset| .cse4) 0)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0))))) is different from true [2025-01-09 02:50:40,282 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse4) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 0) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 0) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_34| (Array Int Int)) (v_arrayElimIndex_15 Int) (|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select |v_#valid_BEFORE_CALL_23| .cse2) 1) (= |v_#valid_BEFORE_CALL_23| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_34| |v_#valid_BEFORE_CALL_23|))) (store |v_old(#valid)_AFTER_CALL_34| .cse3 (select |v_#valid_BEFORE_CALL_23| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_34| v_arrayElimIndex_15) 1) (= (select |v_old(#valid)_AFTER_CALL_34| .cse2) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_7|) 0) 0)))) (= .cse4 (select (select |c_#memory_$Pointer$#2.base| .cse1) 0)) (exists ((|v_old(#valid)_AFTER_CALL_32| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_33| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_33| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_33| .cse4) 1) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_32| |v_old(#valid)_AFTER_CALL_33|))) (store |v_old(#valid)_AFTER_CALL_32| .cse5 (select |v_old(#valid)_AFTER_CALL_33| .cse5))) |v_old(#valid)_AFTER_CALL_33|) (= (select |v_old(#valid)_AFTER_CALL_32| .cse4) 0) (= (select |v_old(#valid)_AFTER_CALL_32| .cse1) 1))) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse1) (= 0 (select (select |c_#memory_$Pointer$#2.offset| .cse4) 0)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0))))) is different from false [2025-01-09 02:50:40,287 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse4) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 0) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 0) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_34| (Array Int Int)) (v_arrayElimIndex_15 Int) (|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select |v_#valid_BEFORE_CALL_23| .cse2) 1) (= |v_#valid_BEFORE_CALL_23| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_34| |v_#valid_BEFORE_CALL_23|))) (store |v_old(#valid)_AFTER_CALL_34| .cse3 (select |v_#valid_BEFORE_CALL_23| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_34| v_arrayElimIndex_15) 1) (= (select |v_old(#valid)_AFTER_CALL_34| .cse2) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_7|) 0) 0)))) (= .cse4 (select (select |c_#memory_$Pointer$#2.base| .cse1) 0)) (exists ((|v_old(#valid)_AFTER_CALL_32| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_33| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_33| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_33| .cse4) 1) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_32| |v_old(#valid)_AFTER_CALL_33|))) (store |v_old(#valid)_AFTER_CALL_32| .cse5 (select |v_old(#valid)_AFTER_CALL_33| .cse5))) |v_old(#valid)_AFTER_CALL_33|) (= (select |v_old(#valid)_AFTER_CALL_32| .cse4) 0) (= (select |v_old(#valid)_AFTER_CALL_32| .cse1) 1))) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse1) (= 0 (select (select |c_#memory_$Pointer$#2.offset| .cse4) 0)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0))))) is different from true [2025-01-09 02:50:40,413 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:50:40,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 161 treesize of output 117 [2025-01-09 02:50:40,424 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-01-09 02:50:40,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2025-01-09 02:50:40,435 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2025-01-09 02:50:40,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 79 treesize of output 37 [2025-01-09 02:50:40,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:50:40,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:50:40,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:50:40,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-01-09 02:50:40,494 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_#t~mem21#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_32| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_33| (Array Int Int)) (v_arrayElimIndex_19 Int) (v_arrayElimIndex_18 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_33| |c_ULTIMATE.start_main_#t~mem21#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_32| |c_ULTIMATE.start_main_#t~mem21#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_33| v_arrayElimIndex_18) 0) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_32| |v_old(#valid)_AFTER_CALL_33|))) (store |v_old(#valid)_AFTER_CALL_32| .cse0 (select |v_old(#valid)_AFTER_CALL_33| .cse0))) |v_old(#valid)_AFTER_CALL_33|) (= (select |v_old(#valid)_AFTER_CALL_32| v_arrayElimIndex_19) 1))) (= |c_ULTIMATE.start_main_~ptr~0#1.base| |c_ULTIMATE.start_main_#t~mem21#1.base|)) is different from false [2025-01-09 02:50:40,497 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_#t~mem21#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_32| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_33| (Array Int Int)) (v_arrayElimIndex_19 Int) (v_arrayElimIndex_18 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_33| |c_ULTIMATE.start_main_#t~mem21#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_32| |c_ULTIMATE.start_main_#t~mem21#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_33| v_arrayElimIndex_18) 0) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_32| |v_old(#valid)_AFTER_CALL_33|))) (store |v_old(#valid)_AFTER_CALL_32| .cse0 (select |v_old(#valid)_AFTER_CALL_33| .cse0))) |v_old(#valid)_AFTER_CALL_33|) (= (select |v_old(#valid)_AFTER_CALL_32| v_arrayElimIndex_19) 1))) (= |c_ULTIMATE.start_main_~ptr~0#1.base| |c_ULTIMATE.start_main_#t~mem21#1.base|)) is different from true [2025-01-09 02:50:40,498 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 20 not checked. [2025-01-09 02:50:40,498 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 02:50:41,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [633754288] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:50:41,323 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 02:50:41,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25] total 42 [2025-01-09 02:50:41,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117069015] [2025-01-09 02:50:41,323 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 02:50:41,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-01-09 02:50:41,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:50:41,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-01-09 02:50:41,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=859, Unknown=30, NotChecked=1080, Total=2070 [2025-01-09 02:50:41,325 INFO L87 Difference]: Start difference. First operand 69 states and 78 transitions. Second operand has 42 states, 39 states have (on average 1.5384615384615385) internal successors, (60), 33 states have internal predecessors, (60), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-09 02:50:41,634 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (not (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|)) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_32| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_32| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_32| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_32| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_32| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 0))) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) is different from false [2025-01-09 02:50:41,638 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (not (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|)) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_32| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_32| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_32| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_32| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_32| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 0))) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) is different from true [2025-01-09 02:50:41,642 WARN L851 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0)) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) 0) (exists ((|v_old(#valid)_AFTER_CALL_32| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_32| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_32| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_32| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_32| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1)))) is different from false [2025-01-09 02:50:41,646 WARN L873 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0)) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) 0) (exists ((|v_old(#valid)_AFTER_CALL_32| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_32| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_32| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_32| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_32| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1)))) is different from true [2025-01-09 02:50:41,651 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 0))) (and (= |c_ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| (select (select |c_#memory_$Pointer$#2.base| .cse0) 0)) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 0) 0) (not (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| .cse0)) (exists ((|v_old(#valid)_AFTER_CALL_32| (Array Int Int))) (and (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_32| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_32| .cse1 (select |c_#valid| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_32| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_32| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 0))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 0) 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 1))) is different from false [2025-01-09 02:50:41,655 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 0))) (and (= |c_ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| (select (select |c_#memory_$Pointer$#2.base| .cse0) 0)) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 0) 0) (not (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| .cse0)) (exists ((|v_old(#valid)_AFTER_CALL_32| (Array Int Int))) (and (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_32| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_32| .cse1 (select |c_#valid| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_32| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_32| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 0))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 0) 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 1))) is different from true [2025-01-09 02:50:41,661 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse2 (select .cse5 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) 0)) (.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse3) 0)) (.cse6 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_sll_circular_insert_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 0) 0) (= (select |c_#valid| .cse2) 1) (= (select |c_#valid| .cse3) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_32| (Array Int Int))) (and (= |c_#valid| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_32| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_32| .cse4 (select |c_#valid| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_32| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_32| .cse1) 1))) (= (select (select |c_#memory_$Pointer$#2.base| .cse1) 0) .cse2) (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_insert_~head#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 0) 0) (= 0 (select (select |c_#memory_$Pointer$#2.offset| .cse2) 0)) (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 0) 0) (not (= .cse0 .cse3)) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 0) (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= (select .cse6 0) 0) (= (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from false [2025-01-09 02:50:41,665 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse2 (select .cse5 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) 0)) (.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse3) 0)) (.cse6 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_sll_circular_insert_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 0) 0) (= (select |c_#valid| .cse2) 1) (= (select |c_#valid| .cse3) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_32| (Array Int Int))) (and (= |c_#valid| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_32| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_32| .cse4 (select |c_#valid| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_32| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_32| .cse1) 1))) (= (select (select |c_#memory_$Pointer$#2.base| .cse1) 0) .cse2) (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_insert_~head#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 0) 0) (= 0 (select (select |c_#memory_$Pointer$#2.offset| .cse2) 0)) (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 0) 0) (not (= .cse0 .cse3)) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 0) (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= (select .cse6 0) 0) (= (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) is different from true [2025-01-09 02:50:41,670 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((|v_old(#valid)_AFTER_CALL_32| (Array Int Int)) (|v_#valid_BEFORE_CALL_23| (Array Int Int)) (v_arrayElimIndex_15 Int) (|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_32| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_23| .cse0) 1) (= |v_#valid_BEFORE_CALL_23| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_32| |v_#valid_BEFORE_CALL_23|))) (store |v_old(#valid)_AFTER_CALL_32| .cse1 (select |v_#valid_BEFORE_CALL_23| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_32| v_arrayElimIndex_15) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_7|) 0) 0)))) (= |c_node_create_~temp~0#1.offset| 0) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= (select |c_#valid| |c_node_create_~temp~0#1.base|) 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from false [2025-01-09 02:50:41,673 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_old(#valid)_AFTER_CALL_32| (Array Int Int)) (|v_#valid_BEFORE_CALL_23| (Array Int Int)) (v_arrayElimIndex_15 Int) (|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_32| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_23| .cse0) 1) (= |v_#valid_BEFORE_CALL_23| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_32| |v_#valid_BEFORE_CALL_23|))) (store |v_old(#valid)_AFTER_CALL_32| .cse1 (select |v_#valid_BEFORE_CALL_23| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_32| v_arrayElimIndex_15) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_7|) 0) 0)))) (= |c_node_create_~temp~0#1.offset| 0) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= (select |c_#valid| |c_node_create_~temp~0#1.base|) 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from true [2025-01-09 02:50:41,680 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_node_create_#res#1.base|)) (.cse2 (@diff |c_old(#memory_$Pointer$#2.offset)| |c_#memory_$Pointer$#2.offset|)) (.cse1 (@diff |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|))) (and (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (store |c_old(#memory_$Pointer$#2.offset)| |c_node_create_#res#1.base| .cse0) |c_#memory_$Pointer$#2.offset|) (= (select .cse0 0) 0) (or (= .cse1 |c_node_create_#res#1.base|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= (store |c_old(#memory_$Pointer$#2.offset)| .cse2 (select |c_#memory_$Pointer$#2.offset| .cse2)) |c_#memory_$Pointer$#2.offset|) (exists ((|v_old(#valid)_AFTER_CALL_32| (Array Int Int)) (|v_#valid_BEFORE_CALL_23| (Array Int Int)) (v_arrayElimIndex_15 Int) (|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_32| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_23| .cse3) 1) (= |v_#valid_BEFORE_CALL_23| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_32| |v_#valid_BEFORE_CALL_23|))) (store |v_old(#valid)_AFTER_CALL_32| .cse4 (select |v_#valid_BEFORE_CALL_23| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_32| v_arrayElimIndex_15) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_7|) 0) 0)))) (= (store |c_old(#memory_$Pointer$#2.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.base| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.base|) (or (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= .cse2 |c_node_create_#res#1.base|)) (= (store |c_old(#memory_$Pointer$#2.base)| .cse1 (select |c_#memory_$Pointer$#2.base| .cse1)) |c_#memory_$Pointer$#2.base|))) is different from false [2025-01-09 02:50:41,684 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_node_create_#res#1.base|)) (.cse2 (@diff |c_old(#memory_$Pointer$#2.offset)| |c_#memory_$Pointer$#2.offset|)) (.cse1 (@diff |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|))) (and (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (store |c_old(#memory_$Pointer$#2.offset)| |c_node_create_#res#1.base| .cse0) |c_#memory_$Pointer$#2.offset|) (= (select .cse0 0) 0) (or (= .cse1 |c_node_create_#res#1.base|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= (store |c_old(#memory_$Pointer$#2.offset)| .cse2 (select |c_#memory_$Pointer$#2.offset| .cse2)) |c_#memory_$Pointer$#2.offset|) (exists ((|v_old(#valid)_AFTER_CALL_32| (Array Int Int)) (|v_#valid_BEFORE_CALL_23| (Array Int Int)) (v_arrayElimIndex_15 Int) (|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_32| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_23| .cse3) 1) (= |v_#valid_BEFORE_CALL_23| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_32| |v_#valid_BEFORE_CALL_23|))) (store |v_old(#valid)_AFTER_CALL_32| .cse4 (select |v_#valid_BEFORE_CALL_23| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_32| v_arrayElimIndex_15) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_7|) 0) 0)))) (= (store |c_old(#memory_$Pointer$#2.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.base| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.base|) (or (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= .cse2 |c_node_create_#res#1.base|)) (= (store |c_old(#memory_$Pointer$#2.base)| .cse1 (select |c_#memory_$Pointer$#2.base| .cse1)) |c_#memory_$Pointer$#2.base|))) is different from true [2025-01-09 02:50:41,695 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse12 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse15 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse7 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse14 (select .cse15 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (select .cse12 0))) (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| .cse4) 0)) (.cse11 (select (select |c_#memory_$Pointer$#2.base| .cse7) .cse14)) (.cse8 (select (select |c_#memory_$Pointer$#2.offset| .cse7) .cse14))) (and (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| .cse4)) (.cse1 (select |c_#memory_$Pointer$#2.offset| .cse6))) (let ((.cse2 (= .cse6 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|)) (.cse5 (= (select .cse1 0) 0)) (.cse3 (= 0 (select .cse0 0)))) (or (and (or (= .cse0 .cse1) .cse2) .cse3) (and (= .cse4 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) (or .cse5 .cse2)) (and .cse5 .cse3)))) (not (= .cse7 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|)) (= |c_ULTIMATE.start_sll_circular_insert_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset|) .cse8) (= |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| .cse8) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_34| (Array Int Int)) (v_arrayElimIndex_15 Int) (|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse9 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select |v_#valid_BEFORE_CALL_23| .cse9) 1) (= |v_#valid_BEFORE_CALL_23| (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_34| |v_#valid_BEFORE_CALL_23|))) (store |v_old(#valid)_AFTER_CALL_34| .cse10 (select |v_#valid_BEFORE_CALL_23| .cse10)))) (= (select |v_old(#valid)_AFTER_CALL_34| v_arrayElimIndex_15) 1) (= (select |v_old(#valid)_AFTER_CALL_34| .cse9) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_7|) 0) 0)))) (= (select (select |c_#memory_$Pointer$#2.base| .cse6) 0) .cse4) (= (select (select |c_#memory_$Pointer$#2.base| .cse11) .cse8) (select .cse12 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (not (= .cse7 .cse11)) (not (= |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| .cse11)) (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_insert_~head#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_32| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_33| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_33| .cse4) 1) (= (let ((.cse13 (@diff |v_old(#valid)_AFTER_CALL_32| |v_old(#valid)_AFTER_CALL_33|))) (store |v_old(#valid)_AFTER_CALL_32| .cse13 (select |v_old(#valid)_AFTER_CALL_33| .cse13))) |v_old(#valid)_AFTER_CALL_33|) (= (select |v_old(#valid)_AFTER_CALL_32| .cse4) 0) (= (select |v_old(#valid)_AFTER_CALL_33| |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_32| .cse6) 1))) (= .cse14 (select (select |c_#memory_$Pointer$#2.offset| .cse11) .cse8)) (= |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| 0) (= (select .cse15 0) 0))))) is different from false [2025-01-09 02:50:41,700 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse12 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse15 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse7 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse14 (select .cse15 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (select .cse12 0))) (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| .cse4) 0)) (.cse11 (select (select |c_#memory_$Pointer$#2.base| .cse7) .cse14)) (.cse8 (select (select |c_#memory_$Pointer$#2.offset| .cse7) .cse14))) (and (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| .cse4)) (.cse1 (select |c_#memory_$Pointer$#2.offset| .cse6))) (let ((.cse2 (= .cse6 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|)) (.cse5 (= (select .cse1 0) 0)) (.cse3 (= 0 (select .cse0 0)))) (or (and (or (= .cse0 .cse1) .cse2) .cse3) (and (= .cse4 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) (or .cse5 .cse2)) (and .cse5 .cse3)))) (not (= .cse7 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|)) (= |c_ULTIMATE.start_sll_circular_insert_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset|) .cse8) (= |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| .cse8) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_34| (Array Int Int)) (v_arrayElimIndex_15 Int) (|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse9 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select |v_#valid_BEFORE_CALL_23| .cse9) 1) (= |v_#valid_BEFORE_CALL_23| (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_34| |v_#valid_BEFORE_CALL_23|))) (store |v_old(#valid)_AFTER_CALL_34| .cse10 (select |v_#valid_BEFORE_CALL_23| .cse10)))) (= (select |v_old(#valid)_AFTER_CALL_34| v_arrayElimIndex_15) 1) (= (select |v_old(#valid)_AFTER_CALL_34| .cse9) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_7|) 0) 0)))) (= (select (select |c_#memory_$Pointer$#2.base| .cse6) 0) .cse4) (= (select (select |c_#memory_$Pointer$#2.base| .cse11) .cse8) (select .cse12 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (not (= .cse7 .cse11)) (not (= |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| .cse11)) (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_insert_~head#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_32| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_33| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_33| .cse4) 1) (= (let ((.cse13 (@diff |v_old(#valid)_AFTER_CALL_32| |v_old(#valid)_AFTER_CALL_33|))) (store |v_old(#valid)_AFTER_CALL_32| .cse13 (select |v_old(#valid)_AFTER_CALL_33| .cse13))) |v_old(#valid)_AFTER_CALL_33|) (= (select |v_old(#valid)_AFTER_CALL_32| .cse4) 0) (= (select |v_old(#valid)_AFTER_CALL_33| |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_32| .cse6) 1))) (= .cse14 (select (select |c_#memory_$Pointer$#2.offset| .cse11) .cse8)) (= |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| 0) (= (select .cse15 0) 0))))) is different from true [2025-01-09 02:50:41,712 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse13 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse6 (select .cse13 0)) (.cse12 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse1 (select .cse12 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (select (select |c_#memory_$Pointer$#2.base| .cse6) 0)) (.cse4 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset|)) (.cse7 (select .cse13 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset|))) (and (= |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| 0) (not (= .cse0 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) (= .cse1 |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_34| (Array Int Int)) (v_arrayElimIndex_15 Int) (|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select |v_#valid_BEFORE_CALL_23| .cse2) 1) (= |v_#valid_BEFORE_CALL_23| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_34| |v_#valid_BEFORE_CALL_23|))) (store |v_old(#valid)_AFTER_CALL_34| .cse3 (select |v_#valid_BEFORE_CALL_23| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_34| v_arrayElimIndex_15) 1) (= (select |v_old(#valid)_AFTER_CALL_34| .cse2) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_7|) 0) 0)))) (= .cse4 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|) (= (select (select |c_#memory_$Pointer$#2.base| .cse5) 0) .cse6) (= .cse6 |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|) (= .cse7 |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|) (= .cse1 (select (select |c_#memory_$Pointer$#2.offset| .cse0) .cse4)) (= .cse4 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) (exists ((|v_old(#valid)_AFTER_CALL_32| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_33| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_33| .cse6) 1) (= (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_32| |v_old(#valid)_AFTER_CALL_33|))) (store |v_old(#valid)_AFTER_CALL_32| .cse8 (select |v_old(#valid)_AFTER_CALL_33| .cse8))) |v_old(#valid)_AFTER_CALL_33|) (= (select |v_old(#valid)_AFTER_CALL_32| .cse6) 0) (= (select |v_old(#valid)_AFTER_CALL_32| .cse5) 1) (= (select |v_old(#valid)_AFTER_CALL_33| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0))) (let ((.cse10 (= .cse5 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) (.cse9 (= (select (select |c_#memory_$Pointer$#2.offset| .cse5) 0) 0)) (.cse11 (= 0 (select (select |c_#memory_$Pointer$#2.offset| .cse6) 0)))) (or (and (= .cse6 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) (or .cse9 .cse10)) (and .cse10 .cse11) (and .cse9 .cse11))) (= |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| 0) (not (= |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) .cse4) .cse7) (not (= .cse0 |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|)) (= (select .cse12 0) 0))))) is different from false [2025-01-09 02:50:41,717 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse13 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse6 (select .cse13 0)) (.cse12 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse1 (select .cse12 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (select (select |c_#memory_$Pointer$#2.base| .cse6) 0)) (.cse4 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset|)) (.cse7 (select .cse13 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset|))) (and (= |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| 0) (not (= .cse0 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) (= .cse1 |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_34| (Array Int Int)) (v_arrayElimIndex_15 Int) (|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select |v_#valid_BEFORE_CALL_23| .cse2) 1) (= |v_#valid_BEFORE_CALL_23| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_34| |v_#valid_BEFORE_CALL_23|))) (store |v_old(#valid)_AFTER_CALL_34| .cse3 (select |v_#valid_BEFORE_CALL_23| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_34| v_arrayElimIndex_15) 1) (= (select |v_old(#valid)_AFTER_CALL_34| .cse2) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_7|) 0) 0)))) (= .cse4 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|) (= (select (select |c_#memory_$Pointer$#2.base| .cse5) 0) .cse6) (= .cse6 |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|) (= .cse7 |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|) (= .cse1 (select (select |c_#memory_$Pointer$#2.offset| .cse0) .cse4)) (= .cse4 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) (exists ((|v_old(#valid)_AFTER_CALL_32| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_33| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_33| .cse6) 1) (= (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_32| |v_old(#valid)_AFTER_CALL_33|))) (store |v_old(#valid)_AFTER_CALL_32| .cse8 (select |v_old(#valid)_AFTER_CALL_33| .cse8))) |v_old(#valid)_AFTER_CALL_33|) (= (select |v_old(#valid)_AFTER_CALL_32| .cse6) 0) (= (select |v_old(#valid)_AFTER_CALL_32| .cse5) 1) (= (select |v_old(#valid)_AFTER_CALL_33| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0))) (let ((.cse10 (= .cse5 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) (.cse9 (= (select (select |c_#memory_$Pointer$#2.offset| .cse5) 0) 0)) (.cse11 (= 0 (select (select |c_#memory_$Pointer$#2.offset| .cse6) 0)))) (or (and (= .cse6 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) (or .cse9 .cse10)) (and .cse10 .cse11) (and .cse9 .cse11))) (= |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| 0) (not (= |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) .cse4) .cse7) (not (= .cse0 |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|)) (= (select .cse12 0) 0))))) is different from true [2025-01-09 02:50:41,733 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse12 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse2 (select .cse12 0)) (.cse11 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse4 (select .cse11 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (select .cse12 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$#2.base| .cse2) 0)) (.cse10 (select (select |c_#memory_$Pointer$#2.offset| .cse2) 0))) (and (= |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|) |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_34| (Array Int Int)) (v_arrayElimIndex_15 Int) (|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select |v_#valid_BEFORE_CALL_23| .cse0) 1) (= |v_#valid_BEFORE_CALL_23| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_34| |v_#valid_BEFORE_CALL_23|))) (store |v_old(#valid)_AFTER_CALL_34| .cse1 (select |v_#valid_BEFORE_CALL_23| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_34| v_arrayElimIndex_15) 1) (= (select |v_old(#valid)_AFTER_CALL_34| .cse0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_7|) 0) 0)))) (= |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| .cse2) (= (select (select |c_#memory_$Pointer$#2.base| .cse3) 0) .cse2) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset|) .cse4) (not (= |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|)) (= .cse3 |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|) (= .cse4 |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| .cse5) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|) (= .cse5 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset|)) (exists ((|v_old(#valid)_AFTER_CALL_32| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_33| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_33| .cse2) 1) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_32| |v_old(#valid)_AFTER_CALL_33|))) (store |v_old(#valid)_AFTER_CALL_32| .cse6 (select |v_old(#valid)_AFTER_CALL_33| .cse6))) |v_old(#valid)_AFTER_CALL_33|) (= (select |v_old(#valid)_AFTER_CALL_32| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_32| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_33| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0))) (let ((.cse8 (= .cse3 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) (.cse7 (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 0) 0)) (.cse9 (= 0 .cse10))) (or (and (= .cse2 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) (or .cse7 .cse8)) (and .cse8 .cse9) (and .cse7 .cse9))) (not (= |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) (not (= |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) (= |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| .cse10) (= (select .cse11 0) 0))))) is different from false [2025-01-09 02:50:41,737 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse12 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse2 (select .cse12 0)) (.cse11 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse4 (select .cse11 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (select .cse12 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$#2.base| .cse2) 0)) (.cse10 (select (select |c_#memory_$Pointer$#2.offset| .cse2) 0))) (and (= |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|) |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_34| (Array Int Int)) (v_arrayElimIndex_15 Int) (|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select |v_#valid_BEFORE_CALL_23| .cse0) 1) (= |v_#valid_BEFORE_CALL_23| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_34| |v_#valid_BEFORE_CALL_23|))) (store |v_old(#valid)_AFTER_CALL_34| .cse1 (select |v_#valid_BEFORE_CALL_23| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_34| v_arrayElimIndex_15) 1) (= (select |v_old(#valid)_AFTER_CALL_34| .cse0) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_7|) 0) 0)))) (= |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| .cse2) (= (select (select |c_#memory_$Pointer$#2.base| .cse3) 0) .cse2) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset|) .cse4) (not (= |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|)) (= .cse3 |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|) (= .cse4 |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| .cse5) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|) (= .cse5 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset|)) (exists ((|v_old(#valid)_AFTER_CALL_32| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_33| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_33| .cse2) 1) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_32| |v_old(#valid)_AFTER_CALL_33|))) (store |v_old(#valid)_AFTER_CALL_32| .cse6 (select |v_old(#valid)_AFTER_CALL_33| .cse6))) |v_old(#valid)_AFTER_CALL_33|) (= (select |v_old(#valid)_AFTER_CALL_32| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_32| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_33| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0))) (let ((.cse8 (= .cse3 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) (.cse7 (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 0) 0)) (.cse9 (= 0 .cse10))) (or (and (= .cse2 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) (or .cse7 .cse8)) (and .cse8 .cse9) (and .cse7 .cse9))) (not (= |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) (not (= |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) (= |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| .cse10) (= (select .cse11 0) 0))))) is different from true [2025-01-09 02:50:41,747 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse13 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse4 (select .cse13 0)) (.cse8 (select .cse13 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse10 (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse11 (select (select |c_#memory_$Pointer$#2.base| .cse8) .cse10)) (.cse12 (select (select |c_#memory_$Pointer$#2.offset| .cse8) .cse10)) (.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse4) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) 0)) (.cse6 (select (select |c_#memory_$Pointer$#2.base| .cse11) .cse12)) (.cse7 (select (select |c_#memory_$Pointer$#2.offset| .cse11) .cse12))) (and (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 0) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_34| (Array Int Int)) (v_arrayElimIndex_15 Int) (|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select |v_#valid_BEFORE_CALL_23| .cse2) 1) (= |v_#valid_BEFORE_CALL_23| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_34| |v_#valid_BEFORE_CALL_23|))) (store |v_old(#valid)_AFTER_CALL_34| .cse3 (select |v_#valid_BEFORE_CALL_23| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_34| v_arrayElimIndex_15) 1) (= (select |v_old(#valid)_AFTER_CALL_34| .cse2) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_7|) 0) 0)))) (= .cse4 (select (select |c_#memory_$Pointer$#2.base| .cse1) 0)) (exists ((|v_old(#valid)_AFTER_CALL_32| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_33| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_33| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_33| .cse4) 1) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_32| |v_old(#valid)_AFTER_CALL_33|))) (store |v_old(#valid)_AFTER_CALL_32| .cse5 (select |v_old(#valid)_AFTER_CALL_33| .cse5))) |v_old(#valid)_AFTER_CALL_33|) (= (select |v_old(#valid)_AFTER_CALL_32| .cse4) 0) (= (select |v_old(#valid)_AFTER_CALL_32| .cse1) 1))) (= (select (select |c_#memory_$Pointer$#2.base| .cse6) .cse7) .cse8) (= 0 (select (select |c_#memory_$Pointer$#2.offset| .cse4) 0)) (= (select .cse9 0) 0) (= .cse10 (select (select |c_#memory_$Pointer$#2.offset| .cse6) .cse7))))))) is different from false [2025-01-09 02:50:41,751 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse13 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse4 (select .cse13 0)) (.cse8 (select .cse13 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse10 (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse11 (select (select |c_#memory_$Pointer$#2.base| .cse8) .cse10)) (.cse12 (select (select |c_#memory_$Pointer$#2.offset| .cse8) .cse10)) (.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse4) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) 0)) (.cse6 (select (select |c_#memory_$Pointer$#2.base| .cse11) .cse12)) (.cse7 (select (select |c_#memory_$Pointer$#2.offset| .cse11) .cse12))) (and (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 0) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_34| (Array Int Int)) (v_arrayElimIndex_15 Int) (|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select |v_#valid_BEFORE_CALL_23| .cse2) 1) (= |v_#valid_BEFORE_CALL_23| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_34| |v_#valid_BEFORE_CALL_23|))) (store |v_old(#valid)_AFTER_CALL_34| .cse3 (select |v_#valid_BEFORE_CALL_23| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_34| v_arrayElimIndex_15) 1) (= (select |v_old(#valid)_AFTER_CALL_34| .cse2) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_7|) 0) 0)))) (= .cse4 (select (select |c_#memory_$Pointer$#2.base| .cse1) 0)) (exists ((|v_old(#valid)_AFTER_CALL_32| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_33| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_33| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_33| .cse4) 1) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_32| |v_old(#valid)_AFTER_CALL_33|))) (store |v_old(#valid)_AFTER_CALL_32| .cse5 (select |v_old(#valid)_AFTER_CALL_33| .cse5))) |v_old(#valid)_AFTER_CALL_33|) (= (select |v_old(#valid)_AFTER_CALL_32| .cse4) 0) (= (select |v_old(#valid)_AFTER_CALL_32| .cse1) 1))) (= (select (select |c_#memory_$Pointer$#2.base| .cse6) .cse7) .cse8) (= 0 (select (select |c_#memory_$Pointer$#2.offset| .cse4) 0)) (= (select .cse9 0) 0) (= .cse10 (select (select |c_#memory_$Pointer$#2.offset| .cse6) .cse7))))))) is different from true [2025-01-09 02:50:41,761 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse1 (select .cse8 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) 0)) (.cse10 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) |c_ULTIMATE.start_main_~ptr~0#1.offset|)) (.cse11 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) |c_ULTIMATE.start_main_~ptr~0#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| .cse10) .cse11)) (.cse4 (select (select |c_#memory_$Pointer$#2.offset| .cse10) .cse11)) (.cse5 (select (select |c_#memory_$Pointer$#2.base| .cse0) 0)) (.cse2 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 0) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse1) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.offset|) (select (select |c_#memory_$Pointer$#2.offset| .cse3) .cse4)) (= (select (select |c_#memory_$Pointer$#2.offset| .cse5) 0) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_34| (Array Int Int)) (v_arrayElimIndex_15 Int) (|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select |v_#valid_BEFORE_CALL_23| .cse6) 1) (= |v_#valid_BEFORE_CALL_23| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_34| |v_#valid_BEFORE_CALL_23|))) (store |v_old(#valid)_AFTER_CALL_34| .cse7 (select |v_#valid_BEFORE_CALL_23| .cse7)))) (= (select |v_old(#valid)_AFTER_CALL_34| v_arrayElimIndex_15) 1) (= (select |v_old(#valid)_AFTER_CALL_34| .cse6) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_7|) 0) 0)))) (= .cse1 (select (select |c_#memory_$Pointer$#2.base| .cse5) 0)) (= (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.offset|) (select (select |c_#memory_$Pointer$#2.base| .cse3) .cse4)) (exists ((|v_old(#valid)_AFTER_CALL_32| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_33| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_33| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_33| .cse1) 1) (= (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_32| |v_old(#valid)_AFTER_CALL_33|))) (store |v_old(#valid)_AFTER_CALL_32| .cse9 (select |v_old(#valid)_AFTER_CALL_33| .cse9))) |v_old(#valid)_AFTER_CALL_33|) (= (select |v_old(#valid)_AFTER_CALL_32| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_32| .cse5) 1))) (= 0 (select (select |c_#memory_$Pointer$#2.offset| .cse1) 0)) (= (select .cse2 0) 0)))))) is different from false [2025-01-09 02:50:41,765 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse1 (select .cse8 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) 0)) (.cse10 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) |c_ULTIMATE.start_main_~ptr~0#1.offset|)) (.cse11 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) |c_ULTIMATE.start_main_~ptr~0#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| .cse10) .cse11)) (.cse4 (select (select |c_#memory_$Pointer$#2.offset| .cse10) .cse11)) (.cse5 (select (select |c_#memory_$Pointer$#2.base| .cse0) 0)) (.cse2 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 0) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse1) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.offset|) (select (select |c_#memory_$Pointer$#2.offset| .cse3) .cse4)) (= (select (select |c_#memory_$Pointer$#2.offset| .cse5) 0) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_34| (Array Int Int)) (v_arrayElimIndex_15 Int) (|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select |v_#valid_BEFORE_CALL_23| .cse6) 1) (= |v_#valid_BEFORE_CALL_23| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_34| |v_#valid_BEFORE_CALL_23|))) (store |v_old(#valid)_AFTER_CALL_34| .cse7 (select |v_#valid_BEFORE_CALL_23| .cse7)))) (= (select |v_old(#valid)_AFTER_CALL_34| v_arrayElimIndex_15) 1) (= (select |v_old(#valid)_AFTER_CALL_34| .cse6) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_7|) 0) 0)))) (= .cse1 (select (select |c_#memory_$Pointer$#2.base| .cse5) 0)) (= (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.offset|) (select (select |c_#memory_$Pointer$#2.base| .cse3) .cse4)) (exists ((|v_old(#valid)_AFTER_CALL_32| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_33| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_33| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_33| .cse1) 1) (= (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_32| |v_old(#valid)_AFTER_CALL_33|))) (store |v_old(#valid)_AFTER_CALL_32| .cse9 (select |v_old(#valid)_AFTER_CALL_33| .cse9))) |v_old(#valid)_AFTER_CALL_33|) (= (select |v_old(#valid)_AFTER_CALL_32| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_32| .cse5) 1))) (= 0 (select (select |c_#memory_$Pointer$#2.offset| .cse1) 0)) (= (select .cse2 0) 0)))))) is different from true [2025-01-09 02:50:41,777 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse7 (select .cse9 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse7) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) 0)) (.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) |c_ULTIMATE.start_main_~ptr~0#1.offset|)) (.cse4 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) |c_ULTIMATE.start_main_~ptr~0#1.offset|)) (.cse2 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 0) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 0) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.offset|) (select (select |c_#memory_$Pointer$#2.offset| .cse3) .cse4)) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_34| (Array Int Int)) (v_arrayElimIndex_15 Int) (|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select |v_#valid_BEFORE_CALL_23| .cse5) 1) (= |v_#valid_BEFORE_CALL_23| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_34| |v_#valid_BEFORE_CALL_23|))) (store |v_old(#valid)_AFTER_CALL_34| .cse6 (select |v_#valid_BEFORE_CALL_23| .cse6)))) (= (select |v_old(#valid)_AFTER_CALL_34| v_arrayElimIndex_15) 1) (= (select |v_old(#valid)_AFTER_CALL_34| .cse5) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_7|) 0) 0)))) (= .cse7 (select (select |c_#memory_$Pointer$#2.base| .cse1) 0)) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse0) (exists ((|v_old(#valid)_AFTER_CALL_32| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_33| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_33| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_33| .cse7) 1) (= (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_32| |v_old(#valid)_AFTER_CALL_33|))) (store |v_old(#valid)_AFTER_CALL_32| .cse8 (select |v_old(#valid)_AFTER_CALL_33| .cse8))) |v_old(#valid)_AFTER_CALL_33|) (= (select |v_old(#valid)_AFTER_CALL_32| .cse7) 0) (= (select |v_old(#valid)_AFTER_CALL_32| .cse1) 1))) (= 0 (select (select |c_#memory_$Pointer$#2.offset| .cse7) 0)) (= (select (select |c_#memory_$Pointer$#2.base| .cse3) .cse4) (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= (select .cse2 0) 0)))))) is different from false [2025-01-09 02:50:41,781 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse7 (select .cse9 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse7) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) 0)) (.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) |c_ULTIMATE.start_main_~ptr~0#1.offset|)) (.cse4 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) |c_ULTIMATE.start_main_~ptr~0#1.offset|)) (.cse2 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 0) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 0) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.offset|) (select (select |c_#memory_$Pointer$#2.offset| .cse3) .cse4)) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_34| (Array Int Int)) (v_arrayElimIndex_15 Int) (|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select |v_#valid_BEFORE_CALL_23| .cse5) 1) (= |v_#valid_BEFORE_CALL_23| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_34| |v_#valid_BEFORE_CALL_23|))) (store |v_old(#valid)_AFTER_CALL_34| .cse6 (select |v_#valid_BEFORE_CALL_23| .cse6)))) (= (select |v_old(#valid)_AFTER_CALL_34| v_arrayElimIndex_15) 1) (= (select |v_old(#valid)_AFTER_CALL_34| .cse5) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_7|) 0) 0)))) (= .cse7 (select (select |c_#memory_$Pointer$#2.base| .cse1) 0)) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse0) (exists ((|v_old(#valid)_AFTER_CALL_32| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_33| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_33| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_33| .cse7) 1) (= (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_32| |v_old(#valid)_AFTER_CALL_33|))) (store |v_old(#valid)_AFTER_CALL_32| .cse8 (select |v_old(#valid)_AFTER_CALL_33| .cse8))) |v_old(#valid)_AFTER_CALL_33|) (= (select |v_old(#valid)_AFTER_CALL_32| .cse7) 0) (= (select |v_old(#valid)_AFTER_CALL_32| .cse1) 1))) (= 0 (select (select |c_#memory_$Pointer$#2.offset| .cse7) 0)) (= (select (select |c_#memory_$Pointer$#2.base| .cse3) .cse4) (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= (select .cse2 0) 0)))))) is different from true [2025-01-09 02:50:41,792 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse5 (select .cse0 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse5) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse1) 0)) (.cse7 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) |c_ULTIMATE.start_main_~ptr~0#1.offset|) (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 0) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 0) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_34| (Array Int Int)) (v_arrayElimIndex_15 Int) (|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select |v_#valid_BEFORE_CALL_23| .cse3) 1) (= |v_#valid_BEFORE_CALL_23| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_34| |v_#valid_BEFORE_CALL_23|))) (store |v_old(#valid)_AFTER_CALL_34| .cse4 (select |v_#valid_BEFORE_CALL_23| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_34| v_arrayElimIndex_15) 1) (= (select |v_old(#valid)_AFTER_CALL_34| .cse3) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_7|) 0) 0)))) (= .cse5 (select (select |c_#memory_$Pointer$#2.base| .cse2) 0)) (exists ((|v_old(#valid)_AFTER_CALL_32| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_33| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_33| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_33| .cse5) 1) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_32| |v_old(#valid)_AFTER_CALL_33|))) (store |v_old(#valid)_AFTER_CALL_32| .cse6 (select |v_old(#valid)_AFTER_CALL_33| .cse6))) |v_old(#valid)_AFTER_CALL_33|) (= (select |v_old(#valid)_AFTER_CALL_32| .cse5) 0) (= (select |v_old(#valid)_AFTER_CALL_32| .cse2) 1))) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse2) (= (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) |c_ULTIMATE.start_main_~ptr~0#1.offset|)) (= 0 (select (select |c_#memory_$Pointer$#2.offset| .cse5) 0)) (= (select .cse7 0) 0)))))) is different from false [2025-01-09 02:50:41,797 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse5 (select .cse0 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse5) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse1) 0)) (.cse7 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) |c_ULTIMATE.start_main_~ptr~0#1.offset|) (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 0) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 0) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_23| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_34| (Array Int Int)) (v_arrayElimIndex_15 Int) (|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_7| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_7|) 0))) (and (= (select |v_#valid_BEFORE_CALL_23| .cse3) 1) (= |v_#valid_BEFORE_CALL_23| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_34| |v_#valid_BEFORE_CALL_23|))) (store |v_old(#valid)_AFTER_CALL_34| .cse4 (select |v_#valid_BEFORE_CALL_23| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_34| v_arrayElimIndex_15) 1) (= (select |v_old(#valid)_AFTER_CALL_34| .cse3) 0) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_7|) 0) 0)))) (= .cse5 (select (select |c_#memory_$Pointer$#2.base| .cse2) 0)) (exists ((|v_old(#valid)_AFTER_CALL_32| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_33| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_33| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_33| .cse5) 1) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_32| |v_old(#valid)_AFTER_CALL_33|))) (store |v_old(#valid)_AFTER_CALL_32| .cse6 (select |v_old(#valid)_AFTER_CALL_33| .cse6))) |v_old(#valid)_AFTER_CALL_33|) (= (select |v_old(#valid)_AFTER_CALL_32| .cse5) 0) (= (select |v_old(#valid)_AFTER_CALL_32| .cse2) 1))) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse2) (= (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) |c_ULTIMATE.start_main_~ptr~0#1.offset|)) (= 0 (select (select |c_#memory_$Pointer$#2.offset| .cse5) 0)) (= (select .cse7 0) 0)))))) is different from true [2025-01-09 02:50:41,802 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_#t~mem21#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_32| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_33| (Array Int Int)) (v_arrayElimIndex_19 Int) (v_arrayElimIndex_18 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_33| |c_ULTIMATE.start_main_#t~mem21#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_32| |c_ULTIMATE.start_main_#t~mem21#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_33| v_arrayElimIndex_18) 0) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_32| |v_old(#valid)_AFTER_CALL_33|))) (store |v_old(#valid)_AFTER_CALL_32| .cse0 (select |v_old(#valid)_AFTER_CALL_33| .cse0))) |v_old(#valid)_AFTER_CALL_33|) (= (select |v_old(#valid)_AFTER_CALL_32| v_arrayElimIndex_19) 1))) (= |c_ULTIMATE.start_main_#t~mem21#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.offset|) (= |c_ULTIMATE.start_main_~ptr~0#1.base| |c_ULTIMATE.start_main_#t~mem21#1.base|)) is different from false [2025-01-09 02:50:41,805 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_#t~mem21#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_32| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_33| (Array Int Int)) (v_arrayElimIndex_19 Int) (v_arrayElimIndex_18 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_33| |c_ULTIMATE.start_main_#t~mem21#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_32| |c_ULTIMATE.start_main_#t~mem21#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_33| v_arrayElimIndex_18) 0) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_32| |v_old(#valid)_AFTER_CALL_33|))) (store |v_old(#valid)_AFTER_CALL_32| .cse0 (select |v_old(#valid)_AFTER_CALL_33| .cse0))) |v_old(#valid)_AFTER_CALL_33|) (= (select |v_old(#valid)_AFTER_CALL_32| v_arrayElimIndex_19) 1))) (= |c_ULTIMATE.start_main_#t~mem21#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.offset|) (= |c_ULTIMATE.start_main_~ptr~0#1.base| |c_ULTIMATE.start_main_#t~mem21#1.base|)) is different from true [2025-01-09 02:50:41,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:50:41,959 INFO L93 Difference]: Finished difference Result 75 states and 85 transitions. [2025-01-09 02:50:41,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-01-09 02:50:41,960 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 39 states have (on average 1.5384615384615385) internal successors, (60), 33 states have internal predecessors, (60), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 42 [2025-01-09 02:50:41,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:50:41,960 INFO L225 Difference]: With dead ends: 75 [2025-01-09 02:50:41,960 INFO L226 Difference]: Without dead ends: 43 [2025-01-09 02:50:41,961 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 29 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=139, Invalid=975, Unknown=58, NotChecked=2610, Total=3782 [2025-01-09 02:50:41,961 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 1666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1374 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 02:50:41,962 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 312 Invalid, 1666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 283 Invalid, 0 Unknown, 1374 Unchecked, 0.3s Time] [2025-01-09 02:50:41,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-01-09 02:50:41,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2025-01-09 02:50:41,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 36 states have internal predecessors, (41), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-09 02:50:41,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2025-01-09 02:50:41,969 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 42 [2025-01-09 02:50:41,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:50:41,969 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2025-01-09 02:50:41,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 39 states have (on average 1.5384615384615385) internal successors, (60), 33 states have internal predecessors, (60), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-09 02:50:41,970 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2025-01-09 02:50:41,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-01-09 02:50:41,970 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:50:41,970 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:50:41,978 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-01-09 02:50:42,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-01-09 02:50:42,171 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:50:42,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:50:42,171 INFO L85 PathProgramCache]: Analyzing trace with hash 339947517, now seen corresponding path program 3 times [2025-01-09 02:50:42,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:50:42,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080809293] [2025-01-09 02:50:42,171 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 02:50:42,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:50:42,183 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 46 statements into 4 equivalence classes. [2025-01-09 02:50:42,190 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 38 of 46 statements. [2025-01-09 02:50:42,190 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-01-09 02:50:42,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:50:42,235 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-01-09 02:50:42,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:50:42,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080809293] [2025-01-09 02:50:42,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080809293] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:50:42,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [113985463] [2025-01-09 02:50:42,236 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 02:50:42,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:50:42,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:50:42,237 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 02:50:42,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-01-09 02:50:42,357 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 46 statements into 4 equivalence classes. [2025-01-09 02:50:42,442 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 38 of 46 statements. [2025-01-09 02:50:42,442 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-01-09 02:50:42,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:50:42,443 INFO L256 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 02:50:42,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:50:42,467 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-01-09 02:50:42,467 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 02:50:42,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [113985463] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:50:42,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 02:50:42,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-01-09 02:50:42,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002685091] [2025-01-09 02:50:42,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:50:42,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 02:50:42,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:50:42,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 02:50:42,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 02:50:42,469 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-09 02:50:42,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:50:42,481 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2025-01-09 02:50:42,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 02:50:42,481 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 46 [2025-01-09 02:50:42,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:50:42,481 INFO L225 Difference]: With dead ends: 48 [2025-01-09 02:50:42,481 INFO L226 Difference]: Without dead ends: 0 [2025-01-09 02:50:42,482 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 02:50:42,482 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 0 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 02:50:42,483 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 26 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 02:50:42,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-09 02:50:42,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-09 02:50:42,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:50:42,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-09 02:50:42,484 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 46 [2025-01-09 02:50:42,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:50:42,484 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-09 02:50:42,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-09 02:50:42,484 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-09 02:50:42,484 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-09 02:50:42,486 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 02:50:42,494 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-01-09 02:50:42,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:50:42,696 INFO L422 BasicCegarLoop]: Path program histogram: [3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:50:42,698 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-09 02:50:45,653 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 02:50:45,667 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalArgumentException: unknown symbol (@diff (Array Int Int) (Array Int Int) Int) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.getBinaryOperator(Term2Expression.java:580) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:283) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:138) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translateStore(Term2Expression.java:358) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:166) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:138) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:174) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:138) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:174) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:138) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:483) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:144) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:174) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:138) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:174) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:403) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.lib.translation.DefaultTranslator.translateExpressionWithContext(DefaultTranslator.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionWithContext(ModelTranslationContainer.java:109) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionWithContext(ModelTranslationContainer.java:91) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.BacktranslationService.translateExpressionWithContext(BacktranslationService.java:117) at de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.FloydHoareUtils.createInvariantResults(FloydHoareUtils.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:132) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2025-01-09 02:50:45,676 INFO L158 Benchmark]: Toolchain (without parser) took 93921.85ms. Allocated memory was 142.6MB in the beginning and 729.8MB in the end (delta: 587.2MB). Free memory was 111.6MB in the beginning and 621.3MB in the end (delta: -509.7MB). Peak memory consumption was 438.2MB. Max. memory is 16.1GB. [2025-01-09 02:50:45,677 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 123.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 02:50:45,678 INFO L158 Benchmark]: CACSL2BoogieTranslator took 307.83ms. Allocated memory is still 142.6MB. Free memory was 111.1MB in the beginning and 93.5MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 02:50:45,678 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.35ms. Allocated memory is still 142.6MB. Free memory was 93.5MB in the beginning and 91.6MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 02:50:45,679 INFO L158 Benchmark]: Boogie Preprocessor took 31.99ms. Allocated memory is still 142.6MB. Free memory was 91.6MB in the beginning and 88.6MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 02:50:45,679 INFO L158 Benchmark]: RCFGBuilder took 394.89ms. Allocated memory is still 142.6MB. Free memory was 88.6MB in the beginning and 71.3MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 02:50:45,679 INFO L158 Benchmark]: TraceAbstraction took 93156.59ms. Allocated memory was 142.6MB in the beginning and 729.8MB in the end (delta: 587.2MB). Free memory was 70.8MB in the beginning and 621.3MB in the end (delta: -550.4MB). Peak memory consumption was 404.7MB. Max. memory is 16.1GB. [2025-01-09 02:50:45,680 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 123.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 307.83ms. Allocated memory is still 142.6MB. Free memory was 111.1MB in the beginning and 93.5MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.35ms. Allocated memory is still 142.6MB. Free memory was 93.5MB in the beginning and 91.6MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 31.99ms. Allocated memory is still 142.6MB. Free memory was 91.6MB in the beginning and 88.6MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 394.89ms. Allocated memory is still 142.6MB. Free memory was 88.6MB in the beginning and 71.3MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 93156.59ms. Allocated memory was 142.6MB in the beginning and 729.8MB in the end (delta: 587.2MB). Free memory was 70.8MB in the beginning and 621.3MB in the end (delta: -550.4MB). Peak memory consumption was 404.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 647]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 33 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 90.1s, OverallIterations: 15, TraceHistogramMax: 4, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 40.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 18 mSolverCounterUnknown, 308 SdHoareTripleChecker+Valid, 20.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 301 mSDsluCounter, 2951 SdHoareTripleChecker+Invalid, 19.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 1374 IncrementalHoareTripleChecker+Unchecked, 2592 mSDsCounter, 77 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5020 IncrementalHoareTripleChecker+Invalid, 6489 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 77 mSolverCounterUnsat, 359 mSDtfsCounter, 5020 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 921 GetRequests, 494 SyntacticMatches, 2 SemanticMatches, 425 ConstructedPredicates, 36 IntricatePredicates, 0 DeprecatedPredicates, 3411 ImplicationChecksByTransitivity, 51.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=69occurred in iteration=13, InterpolantAutomatonStates: 206, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 84 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 44.8s InterpolantComputationTime, 992 NumberOfCodeBlocks, 976 NumberOfCodeBlocksAsserted, 43 NumberOfCheckSat, 1075 ConstructedInterpolants, 83 QuantifiedInterpolants, 17807 SizeOfPredicates, 85 NumberOfNonLiveVariables, 4257 ConjunctsInSsa, 824 ConjunctsInUnsatCore, 30 InterpolantComputations, 6 PerfectInterpolantSequences, 415/625 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ExceptionOrErrorResult: IllegalArgumentException: unknown symbol (@diff (Array Int Int) (Array Int Int) Int) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalArgumentException: unknown symbol (@diff (Array Int Int) (Array Int Int) Int): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.getBinaryOperator(Term2Expression.java:580) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2025-01-09 02:50:45,743 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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/list-simple/sll2c_insert_equal.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 32bit --witnessprinter.graph.data.programhash 8eaca07dd267d84d5b5f55ad6096951e873362e33b975be77e0f552bdb4e3bcb --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 02:50:47,653 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 02:50:47,725 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 02:50:47,731 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 02:50:47,733 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 02:50:47,781 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 02:50:47,782 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 02:50:47,783 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 02:50:47,783 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 02:50:47,790 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 02:50:47,790 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 02:50:47,790 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 02:50:47,790 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 02:50:47,790 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 02:50:47,791 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 02:50:47,791 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 02:50:47,791 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 02:50:47,791 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 02:50:47,791 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 02:50:47,791 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 02:50:47,791 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 02:50:47,791 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 02:50:47,791 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 02:50:47,791 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 02:50:47,791 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 02:50:47,791 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 02:50:47,791 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 02:50:47,791 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 02:50:47,791 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 02:50:47,791 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 02:50:47,791 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 02:50:47,791 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 02:50:47,792 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 02:50:47,792 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 02:50:47,792 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 02:50:47,792 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 02:50:47,792 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 02:50:47,792 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 02:50:47,792 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 02:50:47,792 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 02:50:47,792 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 02:50:47,798 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 02:50:47,798 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 02:50:47,798 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 02:50:47,798 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 02:50:47,798 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 02:50:47,798 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 02:50:47,798 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 02:50:47,798 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 02:50:47,798 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 02:50:47,798 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8eaca07dd267d84d5b5f55ad6096951e873362e33b975be77e0f552bdb4e3bcb [2025-01-09 02:50:48,043 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 02:50:48,050 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 02:50:48,053 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 02:50:48,055 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 02:50:48,055 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 02:50:48,056 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2c_insert_equal.i