./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-simple/dll2c_insert_unequal.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/dll2c_insert_unequal.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 1b81f923e96224472f8219a473f794261ff02356a47c6b09b527f0fc600725a8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 02:47:23,795 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 02:47:23,868 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:47:23,873 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 02:47:23,873 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 02:47:23,901 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 02:47:23,903 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 02:47:23,903 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 02:47:23,904 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 02:47:23,904 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 02:47:23,904 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 02:47:23,905 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 02:47:23,905 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 02:47:23,905 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 02:47:23,905 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 02:47:23,906 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 02:47:23,906 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 02:47:23,906 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 02:47:23,906 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 02:47:23,906 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 02:47:23,907 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 02:47:23,907 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 02:47:23,907 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 02:47:23,907 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 02:47:23,907 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 02:47:23,907 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 02:47:23,907 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 02:47:23,907 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 02:47:23,907 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 02:47:23,908 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 02:47:23,908 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 02:47:23,908 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 02:47:23,908 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 02:47:23,908 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 02:47:23,908 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 02:47:23,908 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 02:47:23,908 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 02:47:23,908 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 02:47:23,908 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 02:47:23,908 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 02:47:23,908 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 02:47:23,908 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 02:47:23,908 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 02:47:23,909 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 02:47:23,910 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 02:47:23,910 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 02:47:23,910 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 02:47:23,910 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 02:47:23,910 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 -> 1b81f923e96224472f8219a473f794261ff02356a47c6b09b527f0fc600725a8 [2025-01-09 02:47:24,162 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 02:47:24,171 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 02:47:24,175 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 02:47:24,177 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 02:47:24,178 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 02:47:24,179 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2c_insert_unequal.i [2025-01-09 02:47:25,457 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/579d09a64/80adc52ffd6e4f86b23a2577677676c1/FLAG8901cb470 [2025-01-09 02:47:25,762 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 02:47:25,763 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_insert_unequal.i [2025-01-09 02:47:25,775 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/579d09a64/80adc52ffd6e4f86b23a2577677676c1/FLAG8901cb470 [2025-01-09 02:47:25,788 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/579d09a64/80adc52ffd6e4f86b23a2577677676c1 [2025-01-09 02:47:25,790 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 02:47:25,792 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 02:47:25,794 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 02:47:25,794 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 02:47:25,801 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 02:47:25,802 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:47:25" (1/1) ... [2025-01-09 02:47:25,803 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7783aab6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:25, skipping insertion in model container [2025-01-09 02:47:25,803 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:47:25" (1/1) ... [2025-01-09 02:47:25,838 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 02:47:26,145 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/dll2c_insert_unequal.i[25148,25161] [2025-01-09 02:47:26,152 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 02:47:26,161 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 02:47:26,220 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/dll2c_insert_unequal.i[25148,25161] [2025-01-09 02:47:26,222 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 02:47:26,256 INFO L204 MainTranslator]: Completed translation [2025-01-09 02:47:26,257 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:26 WrapperNode [2025-01-09 02:47:26,257 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 02:47:26,260 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 02:47:26,260 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 02:47:26,260 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 02:47:26,267 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:47:26" (1/1) ... [2025-01-09 02:47:26,279 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:47:26" (1/1) ... [2025-01-09 02:47:26,305 INFO L138 Inliner]: procedures = 127, calls = 58, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 176 [2025-01-09 02:47:26,306 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 02:47:26,306 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 02:47:26,306 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 02:47:26,306 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 02:47:26,312 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:26" (1/1) ... [2025-01-09 02:47:26,313 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:26" (1/1) ... [2025-01-09 02:47:26,316 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:26" (1/1) ... [2025-01-09 02:47:26,338 INFO L175 MemorySlicer]: Split 40 memory accesses to 3 slices as follows [2, 26, 12]. 65 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 18 writes are split as follows [0, 17, 1]. [2025-01-09 02:47:26,338 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:26" (1/1) ... [2025-01-09 02:47:26,339 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:26" (1/1) ... [2025-01-09 02:47:26,351 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:26" (1/1) ... [2025-01-09 02:47:26,352 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:26" (1/1) ... [2025-01-09 02:47:26,358 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:26" (1/1) ... [2025-01-09 02:47:26,360 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:26" (1/1) ... [2025-01-09 02:47:26,361 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:26" (1/1) ... [2025-01-09 02:47:26,367 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 02:47:26,368 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 02:47:26,368 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 02:47:26,368 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 02:47:26,369 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:26" (1/1) ... [2025-01-09 02:47:26,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 02:47:26,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:47:26,394 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:47:26,396 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:47:26,418 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 02:47:26,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 02:47:26,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 02:47:26,419 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 02:47:26,419 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 02:47:26,419 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 02:47:26,419 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2025-01-09 02:47:26,420 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2025-01-09 02:47:26,420 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 02:47:26,420 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 02:47:26,420 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 02:47:26,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 02:47:26,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 02:47:26,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-09 02:47:26,420 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 02:47:26,420 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 02:47:26,420 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-09 02:47:26,420 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 02:47:26,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-01-09 02:47:26,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-01-09 02:47:26,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-01-09 02:47:26,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 02:47:26,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 02:47:26,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 02:47:26,420 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 02:47:26,421 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 02:47:26,538 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 02:47:26,540 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 02:47:26,792 INFO L? ?]: Removed 59 outVars from TransFormulas that were not future-live. [2025-01-09 02:47:26,792 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 02:47:26,801 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 02:47:26,801 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-01-09 02:47:26,802 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:47:26 BoogieIcfgContainer [2025-01-09 02:47:26,802 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 02:47:26,804 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 02:47:26,804 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 02:47:26,808 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 02:47:26,808 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:47:25" (1/3) ... [2025-01-09 02:47:26,809 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f766402 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:47:26, skipping insertion in model container [2025-01-09 02:47:26,809 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:47:26" (2/3) ... [2025-01-09 02:47:26,810 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f766402 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:47:26, skipping insertion in model container [2025-01-09 02:47:26,810 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:47:26" (3/3) ... [2025-01-09 02:47:26,811 INFO L128 eAbstractionObserver]: Analyzing ICFG dll2c_insert_unequal.i [2025-01-09 02:47:26,826 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 02:47:26,827 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dll2c_insert_unequal.i that has 2 procedures, 40 locations, 1 initial locations, 5 loop locations, and 1 error locations. [2025-01-09 02:47:26,875 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 02:47:26,886 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;@4360d654, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 02:47:26,886 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 02:47:26,891 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 34 states have (on average 1.5) internal successors, (51), 35 states have internal predecessors, (51), 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:47:26,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-01-09 02:47:26,898 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:47:26,898 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:47:26,899 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:47:26,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:47:26,905 INFO L85 PathProgramCache]: Analyzing trace with hash 962023410, now seen corresponding path program 1 times [2025-01-09 02:47:26,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:47:26,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570909768] [2025-01-09 02:47:26,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:47:26,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:47:27,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-09 02:47:27,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 02:47:27,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:47:27,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:47:27,419 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:47:27,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:47:27,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570909768] [2025-01-09 02:47:27,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570909768] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:47:27,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:47:27,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 02:47:27,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179320928] [2025-01-09 02:47:27,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:47:27,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 02:47:27,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:47:27,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 02:47:27,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 02:47:27,444 INFO L87 Difference]: Start difference. First operand has 40 states, 34 states have (on average 1.5) internal successors, (51), 35 states have internal predecessors, (51), 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:47:27,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:47:27,477 INFO L93 Difference]: Finished difference Result 76 states and 109 transitions. [2025-01-09 02:47:27,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 02:47:27,480 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:47:27,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:47:27,485 INFO L225 Difference]: With dead ends: 76 [2025-01-09 02:47:27,485 INFO L226 Difference]: Without dead ends: 38 [2025-01-09 02:47:27,488 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:47:27,492 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 4 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 99 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:47:27,494 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 99 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 02:47:27,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-01-09 02:47:27,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 34. [2025-01-09 02:47:27,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 29 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:47:27,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2025-01-09 02:47:27,528 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 45 transitions. Word has length 24 [2025-01-09 02:47:27,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:47:27,528 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 45 transitions. [2025-01-09 02:47:27,529 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:47:27,529 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2025-01-09 02:47:27,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-01-09 02:47:27,530 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:47:27,531 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:47:27,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 02:47:27,532 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:47:27,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:47:27,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1325089798, now seen corresponding path program 1 times [2025-01-09 02:47:27,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:47:27,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490598945] [2025-01-09 02:47:27,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:47:27,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:47:27,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-09 02:47:27,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-09 02:47:27,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:47:27,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:47:27,727 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:47:27,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:47:27,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490598945] [2025-01-09 02:47:27,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490598945] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:47:27,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:47:27,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 02:47:27,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105952476] [2025-01-09 02:47:27,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:47:27,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 02:47:27,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:47:27,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 02:47:27,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 02:47:27,732 INFO L87 Difference]: Start difference. First operand 34 states and 45 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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:47:27,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:47:27,756 INFO L93 Difference]: Finished difference Result 48 states and 65 transitions. [2025-01-09 02:47:27,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 02:47:27,757 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 34 [2025-01-09 02:47:27,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:47:27,758 INFO L225 Difference]: With dead ends: 48 [2025-01-09 02:47:27,759 INFO L226 Difference]: Without dead ends: 36 [2025-01-09 02:47:27,759 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:47:27,760 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 0 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 81 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:47:27,761 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 81 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 02:47:27,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-01-09 02:47:27,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2025-01-09 02:47:27,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 31 states have internal predecessors, (42), 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:47:27,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 48 transitions. [2025-01-09 02:47:27,770 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 48 transitions. Word has length 34 [2025-01-09 02:47:27,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:47:27,771 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 48 transitions. [2025-01-09 02:47:27,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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:47:27,771 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2025-01-09 02:47:27,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-01-09 02:47:27,772 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:47:27,772 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:47:27,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 02:47:27,773 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:47:27,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:47:27,773 INFO L85 PathProgramCache]: Analyzing trace with hash 551900881, now seen corresponding path program 1 times [2025-01-09 02:47:27,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:47:27,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49141122] [2025-01-09 02:47:27,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:47:27,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:47:27,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-09 02:47:27,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-09 02:47:27,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:47:27,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:47:30,910 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:47:30,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:47:30,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49141122] [2025-01-09 02:47:30,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49141122] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:47:30,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1463241453] [2025-01-09 02:47:30,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:47:30,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:47:30,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:47:30,914 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:47:30,916 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:47:31,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-09 02:47:31,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-09 02:47:31,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:47:31,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:47:31,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 126 conjuncts are in the unsatisfiable core [2025-01-09 02:47:31,440 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:47:31,535 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:47:31,795 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:47:31,916 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-01-09 02:47:31,917 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:47:32,007 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:47:32,018 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:47:32,121 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-09 02:47:32,121 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 57 treesize of output 50 [2025-01-09 02:47:32,131 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 24 treesize of output 11 [2025-01-09 02:47:32,330 INFO L349 Elim1Store]: treesize reduction 48, result has 23.8 percent of original size [2025-01-09 02:47:32,331 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 2 case distinctions, treesize of input 94 treesize of output 55 [2025-01-09 02:47:32,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:47:32,348 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:47:32,353 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 18 treesize of output 11 [2025-01-09 02:47:32,602 INFO L349 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2025-01-09 02:47:32,602 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 68 treesize of output 27 [2025-01-09 02:47:32,615 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 11 treesize of output 3 [2025-01-09 02:47:32,622 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:47:32,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:47:32,908 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2025-01-09 02:47:32,908 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 76 treesize of output 53 [2025-01-09 02:47:32,928 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2025-01-09 02:47:32,928 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:47:32,953 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 20 treesize of output 15 [2025-01-09 02:47:33,245 INFO L349 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2025-01-09 02:47:33,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 74 treesize of output 29 [2025-01-09 02:47:33,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 39 [2025-01-09 02:47:33,410 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 25 treesize of output 15 [2025-01-09 02:47:33,500 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:47:33,600 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:47:33,600 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 02:47:38,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1463241453] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:47:38,173 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 02:47:38,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 46 [2025-01-09 02:47:38,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205869523] [2025-01-09 02:47:38,173 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 02:47:38,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-01-09 02:47:38,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:47:38,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-01-09 02:47:38,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=2326, Unknown=57, NotChecked=0, Total=2550 [2025-01-09 02:47:38,179 INFO L87 Difference]: Start difference. First operand 36 states and 48 transitions. Second operand has 46 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 37 states have internal predecessors, (55), 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:47:40,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:47:40,277 INFO L93 Difference]: Finished difference Result 77 states and 104 transitions. [2025-01-09 02:47:40,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-01-09 02:47:40,278 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 37 states have internal predecessors, (55), 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 35 [2025-01-09 02:47:40,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:47:40,280 INFO L225 Difference]: With dead ends: 77 [2025-01-09 02:47:40,281 INFO L226 Difference]: Without dead ends: 75 [2025-01-09 02:47:40,283 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1061 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=306, Invalid=4058, Unknown=58, NotChecked=0, Total=4422 [2025-01-09 02:47:40,287 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 75 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 1012 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 1031 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1012 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 02:47:40,287 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 414 Invalid, 1031 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1012 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 02:47:40,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-01-09 02:47:40,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 55. [2025-01-09 02:47:40,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 47 states have (on average 1.3404255319148937) internal successors, (63), 47 states have internal predecessors, (63), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-09 02:47:40,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 73 transitions. [2025-01-09 02:47:40,302 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 73 transitions. Word has length 35 [2025-01-09 02:47:40,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:47:40,302 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 73 transitions. [2025-01-09 02:47:40,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 37 states have internal predecessors, (55), 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:47:40,303 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 73 transitions. [2025-01-09 02:47:40,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-01-09 02:47:40,304 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:47:40,304 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:47:40,316 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:47:40,508 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:47:40,508 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:47:40,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:47:40,509 INFO L85 PathProgramCache]: Analyzing trace with hash -1942119066, now seen corresponding path program 2 times [2025-01-09 02:47:40,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:47:40,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278186724] [2025-01-09 02:47:40,509 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 02:47:40,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:47:40,532 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-01-09 02:47:40,546 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 02:47:40,547 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 02:47:40,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:47:40,726 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:47:40,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:47:40,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278186724] [2025-01-09 02:47:40,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278186724] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:47:40,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1974430839] [2025-01-09 02:47:40,727 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 02:47:40,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:47:40,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:47:40,729 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:47:40,731 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:47:40,848 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-01-09 02:47:40,995 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 02:47:40,995 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 02:47:40,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:47:40,999 INFO L256 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-09 02:47:41,003 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:47:41,036 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:47:41,036 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 02:47:41,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1974430839] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:47:41,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 02:47:41,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 6 [2025-01-09 02:47:41,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204274814] [2025-01-09 02:47:41,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:47:41,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 02:47:41,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:47:41,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 02:47:41,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 02:47:41,040 INFO L87 Difference]: Start difference. First operand 55 states and 73 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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:47:41,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:47:41,076 INFO L93 Difference]: Finished difference Result 73 states and 97 transitions. [2025-01-09 02:47:41,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 02:47:41,077 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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 36 [2025-01-09 02:47:41,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:47:41,079 INFO L225 Difference]: With dead ends: 73 [2025-01-09 02:47:41,079 INFO L226 Difference]: Without dead ends: 57 [2025-01-09 02:47:41,079 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 37 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:47:41,081 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 25 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 02:47:41,082 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 124 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 02:47:41,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-01-09 02:47:41,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2025-01-09 02:47:41,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 47 states have (on average 1.297872340425532) internal successors, (61), 47 states have internal predecessors, (61), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-09 02:47:41,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 71 transitions. [2025-01-09 02:47:41,094 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 71 transitions. Word has length 36 [2025-01-09 02:47:41,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:47:41,094 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 71 transitions. [2025-01-09 02:47:41,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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:47:41,094 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 71 transitions. [2025-01-09 02:47:41,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-01-09 02:47:41,095 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:47:41,095 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] [2025-01-09 02:47:41,105 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:47:41,296 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:47:41,296 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:47:41,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:47:41,297 INFO L85 PathProgramCache]: Analyzing trace with hash -596562324, now seen corresponding path program 1 times [2025-01-09 02:47:41,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:47:41,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498997768] [2025-01-09 02:47:41,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:47:41,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:47:41,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-09 02:47:41,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 02:47:41,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:47:41,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:47:41,464 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-09 02:47:41,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:47:41,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498997768] [2025-01-09 02:47:41,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498997768] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:47:41,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [353890024] [2025-01-09 02:47:41,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:47:41,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:47:41,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:47:41,467 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:47:41,470 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:47:41,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-09 02:47:41,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 02:47:41,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:47:41,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:47:41,651 INFO L256 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 02:47:41,653 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:47:41,685 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:47:41,685 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 02:47:41,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [353890024] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:47:41,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 02:47:41,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2025-01-09 02:47:41,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582474705] [2025-01-09 02:47:41,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:47:41,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 02:47:41,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:47:41,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 02:47:41,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 02:47:41,688 INFO L87 Difference]: Start difference. First operand 55 states and 71 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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:47:41,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:47:41,714 INFO L93 Difference]: Finished difference Result 71 states and 91 transitions. [2025-01-09 02:47:41,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 02:47:41,716 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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 36 [2025-01-09 02:47:41,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:47:41,717 INFO L225 Difference]: With dead ends: 71 [2025-01-09 02:47:41,717 INFO L226 Difference]: Without dead ends: 56 [2025-01-09 02:47:41,717 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 02:47:41,720 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 25 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 87 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:47:41,720 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 87 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 02:47:41,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-01-09 02:47:41,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2025-01-09 02:47:41,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 46 states have internal predecessors, (58), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-09 02:47:41,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 68 transitions. [2025-01-09 02:47:41,735 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 68 transitions. Word has length 36 [2025-01-09 02:47:41,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:47:41,736 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 68 transitions. [2025-01-09 02:47:41,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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:47:41,736 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 68 transitions. [2025-01-09 02:47:41,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-01-09 02:47:41,737 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:47:41,737 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:47:41,747 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:47:41,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:47:41,937 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:47:41,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:47:41,938 INFO L85 PathProgramCache]: Analyzing trace with hash -601769353, now seen corresponding path program 1 times [2025-01-09 02:47:41,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:47:41,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614763264] [2025-01-09 02:47:41,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:47:41,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:47:41,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-09 02:47:41,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-09 02:47:41,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:47:41,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:47:42,063 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:47:42,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:47:42,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614763264] [2025-01-09 02:47:42,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614763264] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:47:42,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [751464084] [2025-01-09 02:47:42,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:47:42,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:47:42,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:47:42,066 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:47:42,068 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:47:42,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-09 02:47:42,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-09 02:47:42,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:47:42,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:47:42,245 INFO L256 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-01-09 02:47:42,247 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:47:42,278 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:47:42,278 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 02:47:42,346 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:47:42,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [751464084] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 02:47:42,347 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 02:47:42,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-01-09 02:47:42,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813124138] [2025-01-09 02:47:42,347 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 02:47:42,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 02:47:42,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:47:42,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 02:47:42,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 02:47:42,348 INFO L87 Difference]: Start difference. First operand 54 states and 68 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 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:47:42,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:47:42,442 INFO L93 Difference]: Finished difference Result 67 states and 85 transitions. [2025-01-09 02:47:42,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 02:47:42,446 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 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 37 [2025-01-09 02:47:42,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:47:42,447 INFO L225 Difference]: With dead ends: 67 [2025-01-09 02:47:42,447 INFO L226 Difference]: Without dead ends: 54 [2025-01-09 02:47:42,447 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 72 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:47:42,448 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 2 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 02:47:42,448 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 139 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 02:47:42,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-01-09 02:47:42,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2025-01-09 02:47:42,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 46 states have internal predecessors, (57), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-09 02:47:42,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 67 transitions. [2025-01-09 02:47:42,458 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 67 transitions. Word has length 37 [2025-01-09 02:47:42,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:47:42,458 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 67 transitions. [2025-01-09 02:47:42,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 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:47:42,459 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 67 transitions. [2025-01-09 02:47:42,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-01-09 02:47:42,460 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:47:42,460 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:47:42,468 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-09 02:47:42,660 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,SelfDestructingSolverStorable5 [2025-01-09 02:47:42,661 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:47:42,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:47:42,662 INFO L85 PathProgramCache]: Analyzing trace with hash -544511051, now seen corresponding path program 1 times [2025-01-09 02:47:42,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:47:42,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722640975] [2025-01-09 02:47:42,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:47:42,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:47:42,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-09 02:47:42,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-09 02:47:42,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:47:42,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:47:42,922 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:47:42,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:47:42,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722640975] [2025-01-09 02:47:42,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722640975] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:47:42,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [8951332] [2025-01-09 02:47:42,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:47:42,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:47:42,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:47:42,926 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:47:42,928 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:47:43,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-09 02:47:43,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-09 02:47:43,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:47:43,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:47:43,120 INFO L256 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-01-09 02:47:43,124 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:47:43,211 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:47:43,237 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:47:43,238 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 02:47:43,286 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:47:43,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [8951332] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 02:47:43,287 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 02:47:43,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 11] total 15 [2025-01-09 02:47:43,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415884964] [2025-01-09 02:47:43,287 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 02:47:43,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 02:47:43,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:47:43,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 02:47:43,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2025-01-09 02:47:43,288 INFO L87 Difference]: Start difference. First operand 54 states and 67 transitions. Second operand has 15 states, 15 states have (on average 2.4) internal successors, (36), 14 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:47:47,324 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:47:51,342 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:47:55,370 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:47:59,398 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:48:03,597 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:48:07,619 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:48:07,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:48:07,624 INFO L93 Difference]: Finished difference Result 87 states and 107 transitions. [2025-01-09 02:48:07,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 02:48:07,624 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.4) internal successors, (36), 14 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:48:07,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:48:07,625 INFO L225 Difference]: With dead ends: 87 [2025-01-09 02:48:07,625 INFO L226 Difference]: Without dead ends: 57 [2025-01-09 02:48:07,625 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2025-01-09 02:48:07,626 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 23 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 1 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.2s IncrementalHoareTripleChecker+Time [2025-01-09 02:48:07,626 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 363 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 204 Invalid, 6 Unknown, 0 Unchecked, 24.2s Time] [2025-01-09 02:48:07,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-01-09 02:48:07,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2025-01-09 02:48:07,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 48 states have (on average 1.1666666666666667) internal successors, (56), 48 states have internal predecessors, (56), 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:48:07,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 66 transitions. [2025-01-09 02:48:07,643 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 66 transitions. Word has length 37 [2025-01-09 02:48:07,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:48:07,643 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 66 transitions. [2025-01-09 02:48:07,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.4) internal successors, (36), 14 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:48:07,643 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 66 transitions. [2025-01-09 02:48:07,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-01-09 02:48:07,644 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:48:07,644 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, 1, 1] [2025-01-09 02:48:07,656 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:48:07,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:48:07,844 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:48:07,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:48:07,845 INFO L85 PathProgramCache]: Analyzing trace with hash 544741097, now seen corresponding path program 1 times [2025-01-09 02:48:07,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:48:07,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663265247] [2025-01-09 02:48:07,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:48:07,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:48:07,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-01-09 02:48:07,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-09 02:48:07,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:48:07,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:48:08,136 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-09 02:48:08,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:48:08,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663265247] [2025-01-09 02:48:08,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663265247] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:48:08,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1938760363] [2025-01-09 02:48:08,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:48:08,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:48:08,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:48:08,139 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:48:08,141 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:48:08,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-01-09 02:48:08,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-09 02:48:08,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:48:08,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:48:08,347 INFO L256 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-09 02:48:08,349 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:48:08,394 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-01-09 02:48:08,395 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 02:48:08,480 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-01-09 02:48:08,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1938760363] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 02:48:08,480 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 02:48:08,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2025-01-09 02:48:08,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271777343] [2025-01-09 02:48:08,480 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 02:48:08,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 02:48:08,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:48:08,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 02:48:08,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-01-09 02:48:08,482 INFO L87 Difference]: Start difference. First operand 57 states and 66 transitions. Second operand has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 5 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2025-01-09 02:48:08,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:48:08,605 INFO L93 Difference]: Finished difference Result 72 states and 83 transitions. [2025-01-09 02:48:08,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 02:48:08,607 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 5 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 38 [2025-01-09 02:48:08,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:48:08,608 INFO L225 Difference]: With dead ends: 72 [2025-01-09 02:48:08,608 INFO L226 Difference]: Without dead ends: 61 [2025-01-09 02:48:08,608 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2025-01-09 02:48:08,608 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 33 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 02:48:08,609 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 217 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 02:48:08,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-01-09 02:48:08,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 57. [2025-01-09 02:48:08,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 48 states have internal predecessors, (55), 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:48:08,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 65 transitions. [2025-01-09 02:48:08,622 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 65 transitions. Word has length 38 [2025-01-09 02:48:08,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:48:08,623 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 65 transitions. [2025-01-09 02:48:08,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 5 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2025-01-09 02:48:08,623 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 65 transitions. [2025-01-09 02:48:08,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-01-09 02:48:08,624 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:48:08,624 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, 1] [2025-01-09 02:48:08,634 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-09 02:48:08,825 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,SelfDestructingSolverStorable7 [2025-01-09 02:48:08,825 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:48:08,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:48:08,825 INFO L85 PathProgramCache]: Analyzing trace with hash 544815559, now seen corresponding path program 1 times [2025-01-09 02:48:08,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:48:08,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815047892] [2025-01-09 02:48:08,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:48:08,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:48:08,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-01-09 02:48:08,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-09 02:48:08,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:48:08,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:48:10,847 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:48:10,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:48:10,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815047892] [2025-01-09 02:48:10,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815047892] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:48:10,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1448099925] [2025-01-09 02:48:10,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:48:10,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:48:10,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:48:10,851 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:48:10,853 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:48:11,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-01-09 02:48:11,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-09 02:48:11,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:48:11,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:48:11,358 INFO L256 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 134 conjuncts are in the unsatisfiable core [2025-01-09 02:48:11,365 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:48:11,393 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:48:11,531 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 0))) (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 1)) is different from false [2025-01-09 02:48:11,536 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 0))) (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 1)) is different from true [2025-01-09 02:48:11,555 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:48:11,565 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0)) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1)) is different from false [2025-01-09 02:48:11,568 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0)) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1)) is different from true [2025-01-09 02:48:11,591 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-01-09 02:48:11,592 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:48:11,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-01-09 02:48:11,617 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0)) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0)))) is different from false [2025-01-09 02:48:11,619 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0)) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0)))) is different from true [2025-01-09 02:48:11,650 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0)))))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)) is different from false [2025-01-09 02:48:11,652 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0)))))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)) is different from true [2025-01-09 02:48:11,702 INFO L349 Elim1Store]: treesize reduction 60, result has 34.1 percent of original size [2025-01-09 02:48:11,703 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 2 case distinctions, treesize of input 67 treesize of output 46 [2025-01-09 02:48:11,725 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|))) (let ((.cse0 (select .cse1 4))) (and (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= .cse0 |c_ULTIMATE.start_dll_circular_create_#res#1.base|) (= .cse0 (select .cse1 0))) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 0) (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse2 (select |c_#valid| .cse2)))))) (= |c_ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_8| Int)) (= (select (select |c_#memory_$Pointer$#1.base| .cse0) |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_8|) |c_ULTIMATE.start_dll_circular_create_#res#1.base|))))) is different from false [2025-01-09 02:48:11,728 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|))) (let ((.cse0 (select .cse1 4))) (and (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= .cse0 |c_ULTIMATE.start_dll_circular_create_#res#1.base|) (= .cse0 (select .cse1 0))) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 0) (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse2 (select |c_#valid| .cse2)))))) (= |c_ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_8| Int)) (= (select (select |c_#memory_$Pointer$#1.base| .cse0) |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_8|) |c_ULTIMATE.start_dll_circular_create_#res#1.base|))))) is different from true [2025-01-09 02:48:11,771 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select |c_#memory_$Pointer$#1.base| .cse0))) (let ((.cse1 (select .cse2 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~uneq~0#1| |c_ULTIMATE.start_dll_circular_insert_~data#1|) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_8| Int)) (= (select (select |c_#memory_$Pointer$#1.base| .cse1) |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_8|) .cse0)) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (or (= .cse1 (select .cse2 0)) (= .cse1 .cse0)) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| .cse1) 1) (= |c_#valid| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse3 (select |c_#valid| .cse3)))) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0))) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.offset| 0))))) is different from false [2025-01-09 02:48:11,774 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select |c_#memory_$Pointer$#1.base| .cse0))) (let ((.cse1 (select .cse2 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~uneq~0#1| |c_ULTIMATE.start_dll_circular_insert_~data#1|) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_8| Int)) (= (select (select |c_#memory_$Pointer$#1.base| .cse1) |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_8|) .cse0)) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (or (= .cse1 (select .cse2 0)) (= .cse1 .cse0)) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| .cse1) 1) (= |c_#valid| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse3 (select |c_#valid| .cse3)))) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0))) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.offset| 0))))) is different from true [2025-01-09 02:48:11,792 INFO L349 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2025-01-09 02:48:11,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 68 treesize of output 27 [2025-01-09 02:48:11,817 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (exists ((v_arrayElimIndex_6 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimIndex_6) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))))))) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from false [2025-01-09 02:48:11,820 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (exists ((v_arrayElimIndex_6 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimIndex_6) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))))))) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from true [2025-01-09 02:48:11,851 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimIndex_6 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimIndex_6) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))))))) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_node_create_~temp~0#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from false [2025-01-09 02:48:11,853 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimIndex_6 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimIndex_6) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))))))) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_node_create_~temp~0#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from true [2025-01-09 02:48:11,914 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:48:11,920 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) (= |c_node_create_#in~data#1| (select (select |c_#memory_int#1| |c_node_create_#res#1.base|) 8)) (exists ((v_arrayElimIndex_6 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimIndex_6) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))))))) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.base| |c_node_create_#res#1.base|)))) is different from false [2025-01-09 02:48:11,922 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) (= |c_node_create_#in~data#1| (select (select |c_#memory_int#1| |c_node_create_#res#1.base|) 8)) (exists ((v_arrayElimIndex_6 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimIndex_6) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))))))) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.base| |c_node_create_#res#1.base|)))) is different from true [2025-01-09 02:48:12,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:48:12,016 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2025-01-09 02:48:12,016 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 76 treesize of output 53 [2025-01-09 02:48:12,049 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| .cse1))) (let ((.cse0 (select .cse5 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int))) (and (= 1 (select |v_#valid_BEFORE_CALL_9| .cse0)) (= 0 (select |v_old(#valid)_AFTER_CALL_21| |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|)) (= 0 (select |v_#valid_BEFORE_CALL_9| .cse1)) (= (select |v_old(#valid)_AFTER_CALL_21| .cse1) 1) (= |v_old(#valid)_AFTER_CALL_21| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_21|))) (store |v_#valid_BEFORE_CALL_9| .cse2 (select |v_old(#valid)_AFTER_CALL_21| .cse2)))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((v_arrayElimIndex_6 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse3) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimIndex_6) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse4 (select |v_#valid_BEFORE_CALL_7| .cse4))))))) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_8| Int)) (= (select (select |c_#memory_$Pointer$#1.base| .cse0) |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_8|) .cse1)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) 8)) (= |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (or (= .cse0 (select .cse5 0)) (= .cse0 .cse1)) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.offset| 0))))) is different from false [2025-01-09 02:48:12,052 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| .cse1))) (let ((.cse0 (select .cse5 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int))) (and (= 1 (select |v_#valid_BEFORE_CALL_9| .cse0)) (= 0 (select |v_old(#valid)_AFTER_CALL_21| |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|)) (= 0 (select |v_#valid_BEFORE_CALL_9| .cse1)) (= (select |v_old(#valid)_AFTER_CALL_21| .cse1) 1) (= |v_old(#valid)_AFTER_CALL_21| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_21|))) (store |v_#valid_BEFORE_CALL_9| .cse2 (select |v_old(#valid)_AFTER_CALL_21| .cse2)))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((v_arrayElimIndex_6 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse3) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimIndex_6) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse4 (select |v_#valid_BEFORE_CALL_7| .cse4))))))) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_8| Int)) (= (select (select |c_#memory_$Pointer$#1.base| .cse0) |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_8|) .cse1)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) 8)) (= |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (or (= .cse0 (select .cse5 0)) (= .cse0 .cse1)) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.offset| 0))))) is different from true [2025-01-09 02:48:12,142 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| .cse1))) (let ((.cse0 (select .cse5 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_21| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0) (= 1 (select |v_#valid_BEFORE_CALL_9| .cse0)) (= 0 (select |v_#valid_BEFORE_CALL_9| .cse1)) (= (select |v_old(#valid)_AFTER_CALL_21| .cse1) 1) (= |v_old(#valid)_AFTER_CALL_21| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_21|))) (store |v_#valid_BEFORE_CALL_9| .cse2 (select |v_old(#valid)_AFTER_CALL_21| .cse2)))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((v_arrayElimIndex_6 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse3) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimIndex_6) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse4 (select |v_#valid_BEFORE_CALL_7| .cse4))))))) (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_8| Int)) (= (select (select |c_#memory_$Pointer$#1.base| .cse0) |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_8|) .cse1)) (or (= .cse0 (select .cse5 0)) (= .cse0 .cse1)) (= .cse1 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 8)))))) is different from false [2025-01-09 02:48:12,145 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| .cse1))) (let ((.cse0 (select .cse5 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_21| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0) (= 1 (select |v_#valid_BEFORE_CALL_9| .cse0)) (= 0 (select |v_#valid_BEFORE_CALL_9| .cse1)) (= (select |v_old(#valid)_AFTER_CALL_21| .cse1) 1) (= |v_old(#valid)_AFTER_CALL_21| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_21|))) (store |v_#valid_BEFORE_CALL_9| .cse2 (select |v_old(#valid)_AFTER_CALL_21| .cse2)))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((v_arrayElimIndex_6 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse3) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimIndex_6) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse4 (select |v_#valid_BEFORE_CALL_7| .cse4))))))) (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_8| Int)) (= (select (select |c_#memory_$Pointer$#1.base| .cse0) |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_8|) .cse1)) (or (= .cse0 (select .cse5 0)) (= .cse0 .cse1)) (= .cse1 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 8)))))) is different from true [2025-01-09 02:48:12,232 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse6 (select |c_#memory_$Pointer$#1.base| .cse1))) (let ((.cse3 (select .cse6 0)) (.cse0 (select .cse6 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_21| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0) (= 1 (select |v_#valid_BEFORE_CALL_9| .cse0)) (= 0 (select |v_#valid_BEFORE_CALL_9| .cse1)) (= (select |v_old(#valid)_AFTER_CALL_21| .cse1) 1) (= |v_old(#valid)_AFTER_CALL_21| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_21|))) (store |v_#valid_BEFORE_CALL_9| .cse2 (select |v_old(#valid)_AFTER_CALL_21| .cse2)))))) (= .cse1 |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| .cse3) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((v_arrayElimIndex_6 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse4) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimIndex_6) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse5 (select |v_#valid_BEFORE_CALL_7| .cse5))))))) (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_8| Int)) (= (select (select |c_#memory_$Pointer$#1.base| .cse0) |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_8|) .cse1)) (= |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| 0) (or (= .cse0 .cse3) (= .cse0 .cse1)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 8)))))) is different from false [2025-01-09 02:48:12,234 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse6 (select |c_#memory_$Pointer$#1.base| .cse1))) (let ((.cse3 (select .cse6 0)) (.cse0 (select .cse6 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_21| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0) (= 1 (select |v_#valid_BEFORE_CALL_9| .cse0)) (= 0 (select |v_#valid_BEFORE_CALL_9| .cse1)) (= (select |v_old(#valid)_AFTER_CALL_21| .cse1) 1) (= |v_old(#valid)_AFTER_CALL_21| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_21|))) (store |v_#valid_BEFORE_CALL_9| .cse2 (select |v_old(#valid)_AFTER_CALL_21| .cse2)))))) (= .cse1 |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| .cse3) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((v_arrayElimIndex_6 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse4) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimIndex_6) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse5 (select |v_#valid_BEFORE_CALL_7| .cse5))))))) (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_8| Int)) (= (select (select |c_#memory_$Pointer$#1.base| .cse0) |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_8|) .cse1)) (= |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| 0) (or (= .cse0 .cse3) (= .cse0 .cse1)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 8)))))) is different from true [2025-01-09 02:48:12,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:48:12,366 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 60 treesize of output 14 [2025-01-09 02:48:12,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 41 [2025-01-09 02:48:12,401 INFO L349 Elim1Store]: treesize reduction 65, result has 9.7 percent of original size [2025-01-09 02:48:12,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 170 treesize of output 94 [2025-01-09 02:48:12,430 INFO L349 Elim1Store]: treesize reduction 109, result has 7.6 percent of original size [2025-01-09 02:48:12,430 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 4 new quantified variables, introduced 4 case distinctions, treesize of input 187 treesize of output 107 [2025-01-09 02:48:12,453 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 49 treesize of output 19 [2025-01-09 02:48:12,460 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 41 treesize of output 15 [2025-01-09 02:48:12,475 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 9 treesize of output 7 [2025-01-09 02:48:12,484 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 02:48:12,488 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-01-09 02:48:12,503 INFO L349 Elim1Store]: treesize reduction 71, result has 1.4 percent of original size [2025-01-09 02:48:12,503 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 277 treesize of output 138 [2025-01-09 02:48:12,513 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 02:48:12,515 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-01-09 02:48:12,525 INFO L349 Elim1Store]: treesize reduction 71, result has 1.4 percent of original size [2025-01-09 02:48:12,525 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 297 treesize of output 158 [2025-01-09 02:48:12,536 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 02:48:12,539 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-01-09 02:48:12,566 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse6 (select |c_#memory_$Pointer$#1.base| .cse2))) (let ((.cse0 (select .cse6 0)) (.cse1 (select .cse6 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| .cse0) 8)) (exists ((|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_21| .cse0) 0) (= 1 (select |v_#valid_BEFORE_CALL_9| .cse1)) (= 0 (select |v_#valid_BEFORE_CALL_9| .cse2)) (= (select |v_old(#valid)_AFTER_CALL_21| .cse2) 1) (= |v_old(#valid)_AFTER_CALL_21| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_21|))) (store |v_#valid_BEFORE_CALL_9| .cse3 (select |v_old(#valid)_AFTER_CALL_21| .cse3)))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((v_arrayElimIndex_6 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse4) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimIndex_6) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse5 (select |v_#valid_BEFORE_CALL_7| .cse5))))))) (not (= .cse2 .cse0)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 0) 0) (or (not (= .cse1 .cse0)) (= .cse1 .cse2)))))) is different from false [2025-01-09 02:48:12,570 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse6 (select |c_#memory_$Pointer$#1.base| .cse2))) (let ((.cse0 (select .cse6 0)) (.cse1 (select .cse6 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| .cse0) 8)) (exists ((|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_21| .cse0) 0) (= 1 (select |v_#valid_BEFORE_CALL_9| .cse1)) (= 0 (select |v_#valid_BEFORE_CALL_9| .cse2)) (= (select |v_old(#valid)_AFTER_CALL_21| .cse2) 1) (= |v_old(#valid)_AFTER_CALL_21| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_21|))) (store |v_#valid_BEFORE_CALL_9| .cse3 (select |v_old(#valid)_AFTER_CALL_21| .cse3)))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((v_arrayElimIndex_6 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_7| .cse4) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimIndex_6) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse5 (select |v_#valid_BEFORE_CALL_7| .cse5))))))) (not (= .cse2 .cse0)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 0) 0) (or (not (= .cse1 .cse0)) (= .cse1 .cse2)))))) is different from true [2025-01-09 02:48:12,595 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:48:12,595 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 148 treesize of output 96 [2025-01-09 02:48:12,715 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|))) (let ((.cse2 (select .cse4 4)) (.cse0 (select .cse4 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse0)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| .cse0) 8)) (or (exists ((|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int)) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (not (= |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| |c_ULTIMATE.start_main_~#s~0#1.base|)))) (and (exists ((|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0)) (exists ((v_arrayElimIndex_6 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_7| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimIndex_6) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))))))) (exists ((|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_21| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_21| .cse0)) (= (select |v_#valid_BEFORE_CALL_9| .cse2) 1) (= |v_old(#valid)_AFTER_CALL_21| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_21|))) (store |v_#valid_BEFORE_CALL_9| .cse3 (select |v_old(#valid)_AFTER_CALL_21| .cse3)))) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0))) (not (= .cse2 .cse0))))) is different from false [2025-01-09 02:48:12,718 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|))) (let ((.cse2 (select .cse4 4)) (.cse0 (select .cse4 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse0)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| .cse0) 8)) (or (exists ((|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int)) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (not (= |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| |c_ULTIMATE.start_main_~#s~0#1.base|)))) (and (exists ((|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0)) (exists ((v_arrayElimIndex_6 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_7| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimIndex_6) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))))))) (exists ((|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_21| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_21| .cse0)) (= (select |v_#valid_BEFORE_CALL_9| .cse2) 1) (= |v_old(#valid)_AFTER_CALL_21| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_21|))) (store |v_#valid_BEFORE_CALL_9| .cse3 (select |v_old(#valid)_AFTER_CALL_21| .cse3)))) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0))) (not (= .cse2 .cse0))))) is different from true [2025-01-09 02:48:12,827 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 57 treesize of output 29 [2025-01-09 02:48:12,856 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:48:12,856 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 56 treesize of output 68 [2025-01-09 02:48:12,869 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:48:12,961 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~ptr~0#1.base|) 8)) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (v_arrayElimCell_54 Int) (|v_ULTIMATE.start_main_~ptr~0#1.base_22| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_21| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_54) 1) (= (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_main_~ptr~0#1.base_22|) 0) (= |v_old(#valid)_AFTER_CALL_21| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_21|))) (store |v_#valid_BEFORE_CALL_9| .cse0 (select |v_old(#valid)_AFTER_CALL_21| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_21| |v_ULTIMATE.start_main_~ptr~0#1.base_22|) 1)))) is different from false [2025-01-09 02:48:12,964 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~ptr~0#1.base|) 8)) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (v_arrayElimCell_54 Int) (|v_ULTIMATE.start_main_~ptr~0#1.base_22| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_21| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_54) 1) (= (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_main_~ptr~0#1.base_22|) 0) (= |v_old(#valid)_AFTER_CALL_21| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_21|))) (store |v_#valid_BEFORE_CALL_9| .cse0 (select |v_old(#valid)_AFTER_CALL_21| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_21| |v_ULTIMATE.start_main_~ptr~0#1.base_22|) 1)))) is different from true [2025-01-09 02:48:12,989 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 15 treesize of output 7 [2025-01-09 02:48:12,993 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2025-01-09 02:48:12,994 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 02:48:13,121 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:48:13,122 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 70 treesize of output 71 [2025-01-09 02:48:13,137 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:48:13,138 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 546 treesize of output 537 [2025-01-09 02:48:13,149 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 121 treesize of output 115 [2025-01-09 02:48:13,158 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 126 treesize of output 114 [2025-01-09 02:48:14,372 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse21 (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| .cse3))) (let ((.cse16 (not .cse21)) (.cse5 (+ |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 4)) (.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|))) (.cse4 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse6 (or .cse21 (forall ((v_arrayElimCell_61 Int) (v_ArrVal_1558 (Array Int Int)) (v_arrayElimCell_63 Int) (v_ArrVal_1557 (Array Int Int)) (v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1561 (Array Int Int)) (v_ArrVal_1560 (Array Int Int))) (let ((.cse32 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1560))) (let ((.cse31 (select (store (store .cse32 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1561) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1557) (select (select (store (store .cse2 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1558) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1556) .cse3) .cse4)))) (or (= (select .cse31 (+ 8 v_arrayElimCell_63)) |c_ULTIMATE.start_main_~uneq~0#1|) (not (= v_ArrVal_1561 (store (store (select .cse32 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse5 (select v_ArrVal_1561 .cse5)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1561 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse31 (+ 8 v_arrayElimCell_61))))))))) (.cse7 (forall ((v_arrayElimCell_61 Int) (v_ArrVal_1561 (Array Int Int)) (v_ArrVal_1560 (Array Int Int))) (let ((.cse29 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1560))) (or (not (= v_ArrVal_1561 (store (store (select .cse29 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse5 (select v_ArrVal_1561 .cse5)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1561 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)))) (forall ((v_ArrVal_1558 (Array Int Int)) (v_arrayElimCell_63 Int) (v_ArrVal_1557 (Array Int Int)) (v_arrayElimCell_62 Int) (v_ArrVal_1556 (Array Int Int))) (let ((.cse30 (select (store (store .cse29 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1561) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1557) (select (select (store (store .cse2 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1558) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1556) .cse3) .cse4)))) (or (= (select .cse30 (+ 8 v_arrayElimCell_63)) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse30 (+ 8 v_arrayElimCell_62))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse30 (+ 8 v_arrayElimCell_61)))))))))) (.cse8 (or (forall ((v_arrayElimCell_61 Int) (v_ArrVal_1558 (Array Int Int)) (v_ArrVal_1557 (Array Int Int)) (v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1561 (Array Int Int)) (v_ArrVal_1560 (Array Int Int))) (let ((.cse28 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1560))) (or (not (= v_ArrVal_1561 (store (store (select .cse28 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse5 (select v_ArrVal_1561 .cse5)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1561 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store .cse28 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1561) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1557) (select (select (store (store .cse2 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1558) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1556) .cse3) .cse4)) (+ 8 v_arrayElimCell_61)))))) .cse21)) (.cse9 (forall ((v_arrayElimCell_61 Int) (v_ArrVal_1561 (Array Int Int)) (v_ArrVal_1560 (Array Int Int))) (let ((.cse26 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1560))) (or (not (= v_ArrVal_1561 (store (store (select .cse26 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse5 (select v_ArrVal_1561 .cse5)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1561 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)))) (forall ((v_ArrVal_1558 (Array Int Int)) (v_ArrVal_1557 (Array Int Int)) (v_arrayElimCell_62 Int) (v_ArrVal_1556 (Array Int Int))) (let ((.cse27 (select (store (store .cse26 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1561) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1557) (select (select (store (store .cse2 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1558) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1556) .cse3) .cse4)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse27 (+ 8 v_arrayElimCell_62))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse27 (+ 8 v_arrayElimCell_61)))))))))) (.cse12 (+ |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 8)) (.cse10 (or (forall ((v_ArrVal_1558 (Array Int Int)) (v_ArrVal_1557 (Array Int Int)) (v_arrayElimCell_62 Int) (v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1561 (Array Int Int)) (v_ArrVal_1560 (Array Int Int))) (let ((.cse25 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1560))) (or (not (= v_ArrVal_1561 (store (store (select .cse25 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse5 (select v_ArrVal_1561 .cse5)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1561 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store .cse25 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1561) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1557) (select (select (store (store .cse2 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1558) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1556) .cse3) .cse4)) (+ 8 v_arrayElimCell_62)))))) .cse16)) (.cse0 (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| .cse3))) (and (or (not .cse0) (forall ((v_ArrVal_1558 (Array Int Int)) (v_arrayElimCell_63 Int) (v_ArrVal_1557 (Array Int Int)) (v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1561 (Array Int Int)) (v_ArrVal_1560 (Array Int Int))) (let ((.cse1 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1560))) (or (= (select (select (store (store .cse1 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1561) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1557) (select (select (store (store .cse2 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1558) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1556) .cse3) .cse4)) (+ 8 v_arrayElimCell_63)) |c_ULTIMATE.start_main_~uneq~0#1|) (not (= v_ArrVal_1561 (store (store (select .cse1 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse5 (select v_ArrVal_1561 .cse5)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1561 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)))))))) (or (and .cse6 .cse7 (or .cse0 (and .cse8 .cse9 .cse10))) (= |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| .cse4)) (forall ((v_ArrVal_1561 (Array Int Int)) (v_ArrVal_1560 (Array Int Int))) (let ((.cse13 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1560))) (or (forall ((v_ArrVal_1558 (Array Int Int)) (v_arrayElimCell_63 Int) (v_ArrVal_1557 (Array Int Int)) (v_arrayElimCell_62 Int) (v_ArrVal_1556 (Array Int Int))) (let ((.cse11 (select (store (store .cse13 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1561) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1557) (select (select (store (store .cse2 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1558) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1556) .cse3) .cse4)))) (or (= (select .cse11 (+ 8 v_arrayElimCell_63)) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse11 (+ 8 v_arrayElimCell_62))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse11 .cse12))))) (not (= v_ArrVal_1561 (store (store (select .cse13 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse5 (select v_ArrVal_1561 .cse5)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1561 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|))))))) (or (= |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| .cse3) (let ((.cse15 (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|))) (and .cse6 .cse7 (or (forall ((v_ArrVal_1558 (Array Int Int)) (v_arrayElimCell_63 Int) (v_ArrVal_1557 (Array Int Int)) (v_arrayElimCell_62 Int) (v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1561 (Array Int Int)) (v_ArrVal_1560 (Array Int Int))) (let ((.cse14 (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1560) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1561) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1557) (select (select (store (store .cse2 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1558) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1556) .cse3) .cse4)))) (or (= (select .cse14 (+ 8 v_arrayElimCell_63)) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse14 (+ 8 v_arrayElimCell_62))) (not (= (store (store .cse15 .cse5 (select v_ArrVal_1561 .cse5)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1561 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_1561))))) .cse16) (or (and (or .cse16 (forall ((v_ArrVal_1558 (Array Int Int)) (v_ArrVal_1557 (Array Int Int)) (v_arrayElimCell_62 Int) (v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1561 (Array Int Int)) (v_ArrVal_1560 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1560) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1561) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1557) (select (select (store (store .cse2 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1558) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1556) .cse3) .cse4)) (+ 8 v_arrayElimCell_62))) (not (= (store (store .cse15 .cse5 (select v_ArrVal_1561 .cse5)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1561 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_1561))))) .cse8 .cse9) .cse0)))) (or (forall ((v_ArrVal_1558 (Array Int Int)) (v_arrayElimCell_63 Int) (v_ArrVal_1557 (Array Int Int)) (v_arrayElimCell_62 Int) (v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1561 (Array Int Int)) (v_ArrVal_1560 (Array Int Int))) (let ((.cse18 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1560))) (let ((.cse17 (select (store (store .cse18 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1561) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1557) (select (select (store (store .cse2 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1558) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1556) .cse3) .cse4)))) (or (= (select .cse17 (+ 8 v_arrayElimCell_63)) |c_ULTIMATE.start_main_~uneq~0#1|) (not (= v_ArrVal_1561 (store (store (select .cse18 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse5 (select v_ArrVal_1561 .cse5)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1561 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse17 (+ 8 v_arrayElimCell_62))))))) .cse16) (or (forall ((v_ArrVal_1558 (Array Int Int)) (v_arrayElimCell_63 Int) (v_ArrVal_1557 (Array Int Int)) (v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1561 (Array Int Int)) (v_ArrVal_1560 (Array Int Int))) (let ((.cse20 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1560))) (let ((.cse19 (select (store (store .cse20 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1561) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1557) (select (select (store (store .cse2 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1558) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1556) .cse3) .cse4)))) (or (= (select .cse19 (+ 8 v_arrayElimCell_63)) |c_ULTIMATE.start_main_~uneq~0#1|) (not (= v_ArrVal_1561 (store (store (select .cse20 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse5 (select v_ArrVal_1561 .cse5)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1561 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse19 .cse12)))))) .cse21) (or (and (forall ((v_ArrVal_1561 (Array Int Int)) (v_ArrVal_1560 (Array Int Int))) (let ((.cse22 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1560))) (or (not (= v_ArrVal_1561 (store (store (select .cse22 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse5 (select v_ArrVal_1561 .cse5)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1561 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)))) (forall ((v_ArrVal_1558 (Array Int Int)) (v_ArrVal_1557 (Array Int Int)) (v_arrayElimCell_62 Int) (v_ArrVal_1556 (Array Int Int))) (let ((.cse23 (select (store (store .cse22 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1561) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1557) (select (select (store (store .cse2 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1558) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1556) .cse3) .cse4)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse23 (+ 8 v_arrayElimCell_62))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse23 .cse12)))))))) (or (forall ((v_ArrVal_1558 (Array Int Int)) (v_ArrVal_1557 (Array Int Int)) (v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1561 (Array Int Int)) (v_ArrVal_1560 (Array Int Int))) (let ((.cse24 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1560))) (or (not (= v_ArrVal_1561 (store (store (select .cse24 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse5 (select v_ArrVal_1561 .cse5)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1561 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store .cse24 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1561) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1557) (select (select (store (store .cse2 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1558) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1556) .cse3) .cse4)) .cse12))))) .cse21) .cse10) .cse0)))))) is different from false [2025-01-09 02:48:18,678 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse34 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|)) (.cse22 (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| .cse5))) (let ((.cse14 (not .cse22)) (.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store .cse34 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|))) (.cse3 (select .cse34 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|)) (.cse6 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (+ |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 4))) (let ((.cse8 (forall ((v_arrayElimCell_61 Int) (v_ArrVal_1561 (Array Int Int)) (v_ArrVal_1560 (Array Int Int))) (let ((.cse33 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1560))) (or (forall ((v_ArrVal_1558 (Array Int Int)) (v_arrayElimCell_63 Int) (v_ArrVal_1557 (Array Int Int)) (v_arrayElimCell_62 Int) (v_ArrVal_1556 (Array Int Int))) (let ((.cse32 (select (store (store .cse33 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1561) .cse3 v_ArrVal_1557) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1558) .cse3 v_ArrVal_1556) .cse5) .cse6)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse32 (+ 8 v_arrayElimCell_61))) (= (select .cse32 (+ 8 v_arrayElimCell_62)) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse32 (+ 8 v_arrayElimCell_63)))))) (not (= (store (store (select .cse33 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse7 (select v_ArrVal_1561 .cse7)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1561 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_1561)))))) (.cse9 (or .cse22 (forall ((v_arrayElimCell_61 Int) (v_ArrVal_1558 (Array Int Int)) (v_arrayElimCell_63 Int) (v_ArrVal_1557 (Array Int Int)) (v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1561 (Array Int Int)) (v_ArrVal_1560 (Array Int Int))) (let ((.cse30 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1560))) (let ((.cse31 (select (store (store .cse30 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1561) .cse3 v_ArrVal_1557) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1558) .cse3 v_ArrVal_1556) .cse5) .cse6)))) (or (not (= (store (store (select .cse30 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse7 (select v_ArrVal_1561 .cse7)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1561 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_1561)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse31 (+ 8 v_arrayElimCell_61))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse31 (+ 8 v_arrayElimCell_63))))))))) (.cse12 (forall ((v_arrayElimCell_61 Int) (v_ArrVal_1561 (Array Int Int)) (v_ArrVal_1560 (Array Int Int))) (let ((.cse28 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1560))) (or (not (= (store (store (select .cse28 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse7 (select v_ArrVal_1561 .cse7)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1561 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_1561)) (forall ((v_ArrVal_1558 (Array Int Int)) (v_ArrVal_1557 (Array Int Int)) (v_arrayElimCell_62 Int) (v_ArrVal_1556 (Array Int Int))) (let ((.cse29 (select (store (store .cse28 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1561) .cse3 v_ArrVal_1557) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1558) .cse3 v_ArrVal_1556) .cse5) .cse6)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse29 (+ 8 v_arrayElimCell_61))) (= (select .cse29 (+ 8 v_arrayElimCell_62)) |c_ULTIMATE.start_main_~uneq~0#1|)))))))) (.cse13 (or .cse22 (forall ((v_arrayElimCell_61 Int) (v_ArrVal_1558 (Array Int Int)) (v_ArrVal_1557 (Array Int Int)) (v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1561 (Array Int Int)) (v_ArrVal_1560 (Array Int Int))) (let ((.cse27 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1560))) (or (not (= (store (store (select .cse27 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse7 (select v_ArrVal_1561 .cse7)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1561 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_1561)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store .cse27 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1561) .cse3 v_ArrVal_1557) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1558) .cse3 v_ArrVal_1556) .cse5) .cse6)) (+ 8 v_arrayElimCell_61)))))))) (.cse11 (or .cse14 (forall ((v_ArrVal_1558 (Array Int Int)) (v_ArrVal_1557 (Array Int Int)) (v_arrayElimCell_62 Int) (v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1561 (Array Int Int)) (v_ArrVal_1560 (Array Int Int))) (let ((.cse26 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1560))) (or (not (= (store (store (select .cse26 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse7 (select v_ArrVal_1561 .cse7)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1561 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_1561)) (= (select (select (store (store .cse26 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1561) .cse3 v_ArrVal_1557) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1558) .cse3 v_ArrVal_1556) .cse5) .cse6)) (+ 8 v_arrayElimCell_62)) |c_ULTIMATE.start_main_~uneq~0#1|)))))) (.cse1 (+ |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 8)) (.cse10 (= .cse3 .cse5))) (and (forall ((v_ArrVal_1561 (Array Int Int)) (v_ArrVal_1560 (Array Int Int))) (let ((.cse2 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1560))) (or (forall ((v_ArrVal_1558 (Array Int Int)) (v_arrayElimCell_63 Int) (v_ArrVal_1557 (Array Int Int)) (v_arrayElimCell_62 Int) (v_ArrVal_1556 (Array Int Int))) (let ((.cse0 (select (store (store .cse2 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1561) .cse3 v_ArrVal_1557) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1558) .cse3 v_ArrVal_1556) .cse5) .cse6)))) (or (= (select .cse0 .cse1) |c_ULTIMATE.start_main_~uneq~0#1|) (= (select .cse0 (+ 8 v_arrayElimCell_62)) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse0 (+ 8 v_arrayElimCell_63)))))) (not (= (store (store (select .cse2 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse7 (select v_ArrVal_1561 .cse7)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1561 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_1561))))) (or (and .cse8 .cse9 (or .cse10 (and .cse11 .cse12 .cse13))) (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| .cse6)) (or (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| .cse5) (let ((.cse15 (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|))) (and .cse8 .cse9 (or .cse10 (and .cse12 .cse13 (or .cse14 (forall ((v_ArrVal_1558 (Array Int Int)) (v_ArrVal_1557 (Array Int Int)) (v_arrayElimCell_62 Int) (v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1561 (Array Int Int)) (v_ArrVal_1560 (Array Int Int))) (or (not (= (store (store .cse15 .cse7 (select v_ArrVal_1561 .cse7)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1561 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_1561)) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1560) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1561) .cse3 v_ArrVal_1557) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1558) .cse3 v_ArrVal_1556) .cse5) .cse6)) (+ 8 v_arrayElimCell_62)) |c_ULTIMATE.start_main_~uneq~0#1|)))))) (or (forall ((v_ArrVal_1558 (Array Int Int)) (v_arrayElimCell_63 Int) (v_ArrVal_1557 (Array Int Int)) (v_arrayElimCell_62 Int) (v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1561 (Array Int Int)) (v_ArrVal_1560 (Array Int Int))) (let ((.cse16 (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1560) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1561) .cse3 v_ArrVal_1557) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1558) .cse3 v_ArrVal_1556) .cse5) .cse6)))) (or (not (= (store (store .cse15 .cse7 (select v_ArrVal_1561 .cse7)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1561 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_1561)) (= (select .cse16 (+ 8 v_arrayElimCell_62)) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse16 (+ 8 v_arrayElimCell_63)))))) .cse14)))) (or (forall ((v_ArrVal_1558 (Array Int Int)) (v_arrayElimCell_63 Int) (v_ArrVal_1557 (Array Int Int)) (v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1561 (Array Int Int)) (v_ArrVal_1560 (Array Int Int))) (let ((.cse17 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1560))) (or (not (= (store (store (select .cse17 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse7 (select v_ArrVal_1561 .cse7)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1561 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_1561)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store .cse17 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1561) .cse3 v_ArrVal_1557) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1558) .cse3 v_ArrVal_1556) .cse5) .cse6)) (+ 8 v_arrayElimCell_63)))))) (not .cse10)) (or (forall ((v_ArrVal_1558 (Array Int Int)) (v_arrayElimCell_63 Int) (v_ArrVal_1557 (Array Int Int)) (v_arrayElimCell_62 Int) (v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1561 (Array Int Int)) (v_ArrVal_1560 (Array Int Int))) (let ((.cse18 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1560))) (let ((.cse19 (select (store (store .cse18 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1561) .cse3 v_ArrVal_1557) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1558) .cse3 v_ArrVal_1556) .cse5) .cse6)))) (or (not (= (store (store (select .cse18 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse7 (select v_ArrVal_1561 .cse7)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1561 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_1561)) (= (select .cse19 (+ 8 v_arrayElimCell_62)) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse19 (+ 8 v_arrayElimCell_63))))))) .cse14) (or (forall ((v_ArrVal_1558 (Array Int Int)) (v_arrayElimCell_63 Int) (v_ArrVal_1557 (Array Int Int)) (v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1561 (Array Int Int)) (v_ArrVal_1560 (Array Int Int))) (let ((.cse21 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1560))) (let ((.cse20 (select (store (store .cse21 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1561) .cse3 v_ArrVal_1557) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1558) .cse3 v_ArrVal_1556) .cse5) .cse6)))) (or (= (select .cse20 .cse1) |c_ULTIMATE.start_main_~uneq~0#1|) (not (= (store (store (select .cse21 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse7 (select v_ArrVal_1561 .cse7)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1561 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_1561)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse20 (+ 8 v_arrayElimCell_63))))))) .cse22) (or (and .cse11 (or (forall ((v_ArrVal_1558 (Array Int Int)) (v_ArrVal_1557 (Array Int Int)) (v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1561 (Array Int Int)) (v_ArrVal_1560 (Array Int Int))) (let ((.cse23 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1560))) (or (= (select (select (store (store .cse23 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1561) .cse3 v_ArrVal_1557) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1558) .cse3 v_ArrVal_1556) .cse5) .cse6)) .cse1) |c_ULTIMATE.start_main_~uneq~0#1|) (not (= (store (store (select .cse23 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse7 (select v_ArrVal_1561 .cse7)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1561 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_1561))))) .cse22) (forall ((v_ArrVal_1561 (Array Int Int)) (v_ArrVal_1560 (Array Int Int))) (let ((.cse24 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1560))) (or (not (= (store (store (select .cse24 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse7 (select v_ArrVal_1561 .cse7)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1561 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_1561)) (forall ((v_ArrVal_1558 (Array Int Int)) (v_ArrVal_1557 (Array Int Int)) (v_arrayElimCell_62 Int) (v_ArrVal_1556 (Array Int Int))) (let ((.cse25 (select (store (store .cse24 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1561) .cse3 v_ArrVal_1557) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1558) .cse3 v_ArrVal_1556) .cse5) .cse6)))) (or (= (select .cse25 .cse1) |c_ULTIMATE.start_main_~uneq~0#1|) (= (select .cse25 (+ 8 v_arrayElimCell_62)) |c_ULTIMATE.start_main_~uneq~0#1|)))))))) .cse10)))))) is different from false [2025-01-09 02:48:19,145 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse8 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse36 (select |c_#memory_$Pointer$#1.base| .cse8)) (.cse10 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|)) (.cse9 (= .cse6 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|))) (let ((.cse18 (not .cse9)) (.cse5 (store |c_#memory_$Pointer$#1.base| .cse8 (store .cse36 .cse10 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|))) (.cse4 (select .cse36 .cse10)) (.cse7 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| 4))) (let ((.cse11 (forall ((v_arrayElimCell_61 Int) (v_ArrVal_1561 (Array Int Int)) (v_ArrVal_1560 (Array Int Int))) (let ((.cse35 (store |c_#memory_int#1| .cse8 v_ArrVal_1560))) (or (forall ((v_ArrVal_1558 (Array Int Int)) (v_arrayElimCell_63 Int) (v_ArrVal_1557 (Array Int Int)) (v_arrayElimCell_62 Int) (v_ArrVal_1556 (Array Int Int))) (let ((.cse34 (select (store (store .cse35 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1561) .cse4 v_ArrVal_1557) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1558) .cse4 v_ArrVal_1556) .cse6) .cse7)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse34 (+ 8 v_arrayElimCell_61))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse34 (+ 8 v_arrayElimCell_62))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse34 (+ 8 v_arrayElimCell_63)))))) (not (= v_ArrVal_1561 (store (store (select .cse35 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse1 (select v_ArrVal_1561 .cse1)) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_1561 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset|)))))))) (.cse14 (or (forall ((v_arrayElimCell_61 Int) (v_ArrVal_1558 (Array Int Int)) (v_ArrVal_1557 (Array Int Int)) (v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1561 (Array Int Int)) (v_ArrVal_1560 (Array Int Int))) (let ((.cse33 (store |c_#memory_int#1| .cse8 v_ArrVal_1560))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store .cse33 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1561) .cse4 v_ArrVal_1557) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1558) .cse4 v_ArrVal_1556) .cse6) .cse7)) (+ 8 v_arrayElimCell_61))) (not (= v_ArrVal_1561 (store (store (select .cse33 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse1 (select v_ArrVal_1561 .cse1)) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_1561 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset|))))))) .cse9)) (.cse15 (forall ((v_arrayElimCell_61 Int) (v_ArrVal_1561 (Array Int Int)) (v_ArrVal_1560 (Array Int Int))) (let ((.cse32 (store |c_#memory_int#1| .cse8 v_ArrVal_1560))) (or (forall ((v_ArrVal_1558 (Array Int Int)) (v_ArrVal_1557 (Array Int Int)) (v_arrayElimCell_62 Int) (v_ArrVal_1556 (Array Int Int))) (let ((.cse31 (select (store (store .cse32 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1561) .cse4 v_ArrVal_1557) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1558) .cse4 v_ArrVal_1556) .cse6) .cse7)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse31 (+ 8 v_arrayElimCell_61))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse31 (+ 8 v_arrayElimCell_62)))))) (not (= v_ArrVal_1561 (store (store (select .cse32 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse1 (select v_ArrVal_1561 .cse1)) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_1561 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset|)))))))) (.cse16 (or (forall ((v_arrayElimCell_61 Int) (v_ArrVal_1558 (Array Int Int)) (v_arrayElimCell_63 Int) (v_ArrVal_1557 (Array Int Int)) (v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1561 (Array Int Int)) (v_ArrVal_1560 (Array Int Int))) (let ((.cse30 (store |c_#memory_int#1| .cse8 v_ArrVal_1560))) (let ((.cse29 (select (store (store .cse30 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1561) .cse4 v_ArrVal_1557) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1558) .cse4 v_ArrVal_1556) .cse6) .cse7)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse29 (+ 8 v_arrayElimCell_61))) (not (= v_ArrVal_1561 (store (store (select .cse30 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse1 (select v_ArrVal_1561 .cse1)) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_1561 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset|)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse29 (+ 8 v_arrayElimCell_63))))))) .cse9)) (.cse12 (= .cse4 .cse6)) (.cse13 (or (forall ((v_ArrVal_1558 (Array Int Int)) (v_ArrVal_1557 (Array Int Int)) (v_arrayElimCell_62 Int) (v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1561 (Array Int Int)) (v_ArrVal_1560 (Array Int Int))) (let ((.cse28 (store |c_#memory_int#1| .cse8 v_ArrVal_1560))) (or (not (= v_ArrVal_1561 (store (store (select .cse28 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse1 (select v_ArrVal_1561 .cse1)) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_1561 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset|)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store .cse28 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1561) .cse4 v_ArrVal_1557) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1558) .cse4 v_ArrVal_1556) .cse6) .cse7)) (+ 8 v_arrayElimCell_62)))))) .cse18)) (.cse3 (+ |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| 8))) (and (or (forall ((v_ArrVal_1558 (Array Int Int)) (v_arrayElimCell_63 Int) (v_ArrVal_1557 (Array Int Int)) (v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1561 (Array Int Int)) (v_ArrVal_1560 (Array Int Int))) (let ((.cse0 (store |c_#memory_int#1| .cse8 v_ArrVal_1560))) (let ((.cse2 (select (store (store .cse0 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1561) .cse4 v_ArrVal_1557) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1558) .cse4 v_ArrVal_1556) .cse6) .cse7)))) (or (not (= v_ArrVal_1561 (store (store (select .cse0 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse1 (select v_ArrVal_1561 .cse1)) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_1561 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset|)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse2 .cse3)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse2 (+ 8 v_arrayElimCell_63))))))) .cse9) (or (= .cse10 .cse7) (and .cse11 (or .cse12 (and .cse13 .cse14 .cse15)) .cse16)) (or (let ((.cse17 (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|))) (and .cse11 (or .cse12 (and .cse14 .cse15 (or (forall ((v_ArrVal_1558 (Array Int Int)) (v_ArrVal_1557 (Array Int Int)) (v_arrayElimCell_62 Int) (v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1561 (Array Int Int)) (v_ArrVal_1560 (Array Int Int))) (or (not (= v_ArrVal_1561 (store (store .cse17 .cse1 (select v_ArrVal_1561 .cse1)) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_1561 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset|)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store (store |c_#memory_int#1| .cse8 v_ArrVal_1560) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1561) .cse4 v_ArrVal_1557) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1558) .cse4 v_ArrVal_1556) .cse6) .cse7)) (+ 8 v_arrayElimCell_62))))) .cse18))) .cse16 (or .cse18 (forall ((v_ArrVal_1558 (Array Int Int)) (v_arrayElimCell_63 Int) (v_ArrVal_1557 (Array Int Int)) (v_arrayElimCell_62 Int) (v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1561 (Array Int Int)) (v_ArrVal_1560 (Array Int Int))) (let ((.cse19 (select (store (store (store |c_#memory_int#1| .cse8 v_ArrVal_1560) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1561) .cse4 v_ArrVal_1557) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1558) .cse4 v_ArrVal_1556) .cse6) .cse7)))) (or (not (= v_ArrVal_1561 (store (store .cse17 .cse1 (select v_ArrVal_1561 .cse1)) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_1561 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset|)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse19 (+ 8 v_arrayElimCell_62))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse19 (+ 8 v_arrayElimCell_63))))))))) (= .cse8 .cse6)) (or (forall ((v_ArrVal_1558 (Array Int Int)) (v_arrayElimCell_63 Int) (v_ArrVal_1557 (Array Int Int)) (v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1561 (Array Int Int)) (v_ArrVal_1560 (Array Int Int))) (let ((.cse20 (store |c_#memory_int#1| .cse8 v_ArrVal_1560))) (or (not (= v_ArrVal_1561 (store (store (select .cse20 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse1 (select v_ArrVal_1561 .cse1)) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_1561 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset|)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store .cse20 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1561) .cse4 v_ArrVal_1557) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1558) .cse4 v_ArrVal_1556) .cse6) .cse7)) (+ 8 v_arrayElimCell_63)))))) (not .cse12)) (or .cse12 (and (forall ((v_ArrVal_1561 (Array Int Int)) (v_ArrVal_1560 (Array Int Int))) (let ((.cse21 (store |c_#memory_int#1| .cse8 v_ArrVal_1560))) (or (not (= v_ArrVal_1561 (store (store (select .cse21 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse1 (select v_ArrVal_1561 .cse1)) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_1561 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset|)))) (forall ((v_ArrVal_1558 (Array Int Int)) (v_ArrVal_1557 (Array Int Int)) (v_arrayElimCell_62 Int) (v_ArrVal_1556 (Array Int Int))) (let ((.cse22 (select (store (store .cse21 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1561) .cse4 v_ArrVal_1557) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1558) .cse4 v_ArrVal_1556) .cse6) .cse7)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse22 (+ 8 v_arrayElimCell_62))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse22 .cse3)))))))) .cse13 (or .cse9 (forall ((v_ArrVal_1558 (Array Int Int)) (v_ArrVal_1557 (Array Int Int)) (v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1561 (Array Int Int)) (v_ArrVal_1560 (Array Int Int))) (let ((.cse23 (store |c_#memory_int#1| .cse8 v_ArrVal_1560))) (or (not (= v_ArrVal_1561 (store (store (select .cse23 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse1 (select v_ArrVal_1561 .cse1)) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_1561 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset|)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store .cse23 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1561) .cse4 v_ArrVal_1557) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1558) .cse4 v_ArrVal_1556) .cse6) .cse7)) .cse3)))))))) (or (forall ((v_ArrVal_1558 (Array Int Int)) (v_arrayElimCell_63 Int) (v_ArrVal_1557 (Array Int Int)) (v_arrayElimCell_62 Int) (v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1561 (Array Int Int)) (v_ArrVal_1560 (Array Int Int))) (let ((.cse24 (store |c_#memory_int#1| .cse8 v_ArrVal_1560))) (let ((.cse25 (select (store (store .cse24 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1561) .cse4 v_ArrVal_1557) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1558) .cse4 v_ArrVal_1556) .cse6) .cse7)))) (or (not (= v_ArrVal_1561 (store (store (select .cse24 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse1 (select v_ArrVal_1561 .cse1)) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_1561 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset|)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse25 (+ 8 v_arrayElimCell_62))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse25 (+ 8 v_arrayElimCell_63))))))) .cse18) (forall ((v_ArrVal_1561 (Array Int Int)) (v_ArrVal_1560 (Array Int Int))) (let ((.cse26 (store |c_#memory_int#1| .cse8 v_ArrVal_1560))) (or (not (= v_ArrVal_1561 (store (store (select .cse26 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse1 (select v_ArrVal_1561 .cse1)) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_1561 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset|)))) (forall ((v_ArrVal_1558 (Array Int Int)) (v_arrayElimCell_63 Int) (v_ArrVal_1557 (Array Int Int)) (v_arrayElimCell_62 Int) (v_ArrVal_1556 (Array Int Int))) (let ((.cse27 (select (store (store .cse26 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1561) .cse4 v_ArrVal_1557) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1558) .cse4 v_ArrVal_1556) .cse6) .cse7)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse27 (+ 8 v_arrayElimCell_62))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse27 .cse3)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse27 (+ 8 v_arrayElimCell_63)))))))))))))) is different from false [2025-01-09 02:48:38,441 WARN L286 SmtUtils]: Spent 18.95s on a formula simplification. DAG size of input: 985 DAG size of output: 319 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2025-01-09 02:48:38,442 INFO L349 Elim1Store]: treesize reduction 20610, result has 14.1 percent of original size [2025-01-09 02:48:38,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 19 select indices, 19 select index equivalence classes, 0 disjoint index pairs (out of 171 index pairs), introduced 20 new quantified variables, introduced 191 case distinctions, treesize of input 125794 treesize of output 122716 [2025-01-09 02:48:38,964 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 32472 treesize of output 32456 [2025-01-09 02:48:39,225 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 32456 treesize of output 32452 [2025-01-09 02:48:39,685 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:48:39,686 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 32452 treesize of output 32429 [2025-01-09 02:48:40,699 INFO L224 Elim1Store]: Index analysis took 719 ms [2025-01-09 02:48:45,675 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:48:45,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 19 select indices, 19 select index equivalence classes, 0 disjoint index pairs (out of 171 index pairs), introduced 19 new quantified variables, introduced 171 case distinctions, treesize of input 35044 treesize of output 53478 [2025-01-09 02:48:47,143 INFO L349 Elim1Store]: treesize reduction 76, result has 46.9 percent of original size [2025-01-09 02:48:47,144 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 5 case distinctions, treesize of input 32836 treesize of output 32885 [2025-01-09 02:48:48,046 INFO L349 Elim1Store]: treesize reduction 38, result has 50.0 percent of original size [2025-01-09 02:48:48,047 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 32818 treesize of output 32842 [2025-01-09 02:48:48,908 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 32804 treesize of output 32788 [2025-01-09 02:48:49,750 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:48:49,751 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 32788 treesize of output 32765 [2025-01-09 02:48:50,591 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:48:50,592 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 32756 treesize of output 32757 [2025-01-09 02:48:51,815 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:48:51,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 32748 treesize of output 32725 [2025-01-09 02:48:52,937 INFO L349 Elim1Store]: treesize reduction 114, result has 47.7 percent of original size [2025-01-09 02:48:52,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 case distinctions, treesize of input 32700 treesize of output 32782