./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 e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/list-simple/dll2c_insert_unequal.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1b81f923e96224472f8219a473f794261ff02356a47c6b09b527f0fc600725a8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 04:32:53,002 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 04:32:53,060 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 04:32:53,066 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 04:32:53,066 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 04:32:53,087 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 04:32:53,087 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 04:32:53,087 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 04:32:53,088 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 04:32:53,088 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 04:32:53,088 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 04:32:53,088 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 04:32:53,088 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 04:32:53,088 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 04:32:53,088 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 04:32:53,088 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 04:32:53,088 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 04:32:53,088 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 04:32:53,088 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 04:32:53,088 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 04:32:53,090 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 04:32:53,090 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 04:32:53,090 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 04:32:53,090 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 04:32:53,090 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 04:32:53,091 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 04:32:53,091 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 04:32:53,091 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 04:32:53,091 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 04:32:53,091 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 04:32:53,091 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 04:32:53,091 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 04:32:53,091 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 04:32:53,092 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 04:32:53,092 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 04:32:53,092 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 04:32:53,092 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 04:32:53,092 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 04:32:53,092 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 04:32:53,092 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 04:32:53,092 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 04:32:53,092 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 04:32:53,092 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 04:32:53,092 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1b81f923e96224472f8219a473f794261ff02356a47c6b09b527f0fc600725a8 [2025-03-08 04:32:53,335 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 04:32:53,344 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 04:32:53,346 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 04:32:53,347 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 04:32:53,347 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 04:32:53,348 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2c_insert_unequal.i [2025-03-08 04:32:54,523 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c796d39e/8bb343170d474a07956e210127b8e675/FLAG1a5336c62 [2025-03-08 04:32:54,783 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 04:32:54,785 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_insert_unequal.i [2025-03-08 04:32:54,796 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c796d39e/8bb343170d474a07956e210127b8e675/FLAG1a5336c62 [2025-03-08 04:32:54,812 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c796d39e/8bb343170d474a07956e210127b8e675 [2025-03-08 04:32:54,814 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 04:32:54,816 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 04:32:54,818 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 04:32:54,818 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 04:32:54,821 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 04:32:54,821 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:32:54" (1/1) ... [2025-03-08 04:32:54,824 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77b60dd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:32:54, skipping insertion in model container [2025-03-08 04:32:54,824 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:32:54" (1/1) ... [2025-03-08 04:32:54,850 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 04:32:55,073 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_insert_unequal.i[25148,25161] [2025-03-08 04:32:55,077 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 04:32:55,085 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 04:32:55,132 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_insert_unequal.i[25148,25161] [2025-03-08 04:32:55,132 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 04:32:55,154 INFO L204 MainTranslator]: Completed translation [2025-03-08 04:32:55,156 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:32:55 WrapperNode [2025-03-08 04:32:55,156 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 04:32:55,157 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 04:32:55,157 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 04:32:55,157 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 04:32:55,163 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:32:55" (1/1) ... [2025-03-08 04:32:55,174 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:32:55" (1/1) ... [2025-03-08 04:32:55,195 INFO L138 Inliner]: procedures = 127, calls = 58, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 176 [2025-03-08 04:32:55,196 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 04:32:55,196 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 04:32:55,196 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 04:32:55,197 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 04:32:55,202 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:32:55" (1/1) ... [2025-03-08 04:32:55,203 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:32:55" (1/1) ... [2025-03-08 04:32:55,206 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:32:55" (1/1) ... [2025-03-08 04:32:55,231 INFO L175 MemorySlicer]: Split 40 memory accesses to 3 slices as follows [2, 12, 26]. 65 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 18 writes are split as follows [0, 1, 17]. [2025-03-08 04:32:55,231 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:32:55" (1/1) ... [2025-03-08 04:32:55,231 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:32:55" (1/1) ... [2025-03-08 04:32:55,238 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:32:55" (1/1) ... [2025-03-08 04:32:55,241 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:32:55" (1/1) ... [2025-03-08 04:32:55,242 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:32:55" (1/1) ... [2025-03-08 04:32:55,244 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:32:55" (1/1) ... [2025-03-08 04:32:55,245 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 04:32:55,250 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 04:32:55,251 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 04:32:55,251 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 04:32:55,252 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:32:55" (1/1) ... [2025-03-08 04:32:55,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 04:32:55,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:32:55,274 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 04:32:55,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 04:32:55,291 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 04:32:55,291 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 04:32:55,291 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 04:32:55,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 04:32:55,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 04:32:55,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 04:32:55,291 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2025-03-08 04:32:55,292 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2025-03-08 04:32:55,292 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 04:32:55,292 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 04:32:55,292 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 04:32:55,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-08 04:32:55,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-08 04:32:55,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-08 04:32:55,292 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-08 04:32:55,292 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-08 04:32:55,292 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-08 04:32:55,292 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 04:32:55,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-08 04:32:55,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-08 04:32:55,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-08 04:32:55,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 04:32:55,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 04:32:55,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 04:32:55,292 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 04:32:55,292 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 04:32:55,380 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 04:32:55,381 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 04:32:55,576 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L642: call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; [2025-03-08 04:32:55,591 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint myexit_returnLabel#1: havoc myexit_~s#1;havoc myexit_#in~s#1;assume { :end_inline_myexit } true; [2025-03-08 04:32:55,606 INFO L? ?]: Removed 59 outVars from TransFormulas that were not future-live. [2025-03-08 04:32:55,606 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 04:32:55,612 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 04:32:55,614 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 04:32:55,614 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:32:55 BoogieIcfgContainer [2025-03-08 04:32:55,614 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 04:32:55,616 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 04:32:55,616 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 04:32:55,619 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 04:32:55,619 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 04:32:54" (1/3) ... [2025-03-08 04:32:55,620 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a3bd0de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:32:55, skipping insertion in model container [2025-03-08 04:32:55,620 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:32:55" (2/3) ... [2025-03-08 04:32:55,621 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a3bd0de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:32:55, skipping insertion in model container [2025-03-08 04:32:55,621 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:32:55" (3/3) ... [2025-03-08 04:32:55,622 INFO L128 eAbstractionObserver]: Analyzing ICFG dll2c_insert_unequal.i [2025-03-08 04:32:55,632 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 04:32:55,634 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-03-08 04:32:55,671 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 04:32:55,680 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;@60f5f92d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 04:32:55,680 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 04:32:55,684 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-03-08 04:32:55,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-08 04:32:55,689 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:32:55,690 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-03-08 04:32:55,690 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:32:55,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:32:55,694 INFO L85 PathProgramCache]: Analyzing trace with hash 215534064, now seen corresponding path program 1 times [2025-03-08 04:32:55,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:32:55,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940732604] [2025-03-08 04:32:55,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:32:55,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:32:55,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-08 04:32:55,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-08 04:32:55,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:32:55,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:32:56,066 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 04:32:56,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:32:56,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940732604] [2025-03-08 04:32:56,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940732604] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:32:56,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 04:32:56,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 04:32:56,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58034657] [2025-03-08 04:32:56,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:32:56,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 04:32:56,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:32:56,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 04:32:56,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 04:32:56,088 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-03-08 04:32:56,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:32:56,118 INFO L93 Difference]: Finished difference Result 76 states and 109 transitions. [2025-03-08 04:32:56,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 04:32:56,121 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-03-08 04:32:56,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:32:56,125 INFO L225 Difference]: With dead ends: 76 [2025-03-08 04:32:56,125 INFO L226 Difference]: Without dead ends: 38 [2025-03-08 04:32:56,128 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-03-08 04:32:56,131 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-03-08 04:32:56,132 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-03-08 04:32:56,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-03-08 04:32:56,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 34. [2025-03-08 04:32:56,179 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-03-08 04:32:56,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2025-03-08 04:32:56,184 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 45 transitions. Word has length 24 [2025-03-08 04:32:56,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:32:56,185 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 45 transitions. [2025-03-08 04:32:56,185 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-03-08 04:32:56,185 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2025-03-08 04:32:56,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-08 04:32:56,187 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:32:56,187 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-03-08 04:32:56,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 04:32:56,188 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:32:56,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:32:56,189 INFO L85 PathProgramCache]: Analyzing trace with hash -831123441, now seen corresponding path program 1 times [2025-03-08 04:32:56,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:32:56,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255642562] [2025-03-08 04:32:56,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:32:56,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:32:56,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-08 04:32:56,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-08 04:32:56,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:32:56,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:32:56,346 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-08 04:32:56,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:32:56,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255642562] [2025-03-08 04:32:56,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255642562] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:32:56,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 04:32:56,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 04:32:56,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203952890] [2025-03-08 04:32:56,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:32:56,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 04:32:56,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:32:56,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 04:32:56,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 04:32:56,349 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-03-08 04:32:56,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:32:56,371 INFO L93 Difference]: Finished difference Result 48 states and 65 transitions. [2025-03-08 04:32:56,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 04:32:56,373 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-03-08 04:32:56,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:32:56,374 INFO L225 Difference]: With dead ends: 48 [2025-03-08 04:32:56,374 INFO L226 Difference]: Without dead ends: 36 [2025-03-08 04:32:56,374 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-03-08 04:32:56,375 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-03-08 04:32:56,375 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-03-08 04:32:56,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-03-08 04:32:56,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2025-03-08 04:32:56,380 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-03-08 04:32:56,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 48 transitions. [2025-03-08 04:32:56,381 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 48 transitions. Word has length 34 [2025-03-08 04:32:56,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:32:56,381 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 48 transitions. [2025-03-08 04:32:56,381 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-03-08 04:32:56,381 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2025-03-08 04:32:56,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-08 04:32:56,382 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:32:56,382 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-03-08 04:32:56,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 04:32:56,382 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:32:56,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:32:56,383 INFO L85 PathProgramCache]: Analyzing trace with hash -709764719, now seen corresponding path program 1 times [2025-03-08 04:32:56,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:32:56,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805092152] [2025-03-08 04:32:56,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:32:56,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:32:56,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-08 04:32:56,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-08 04:32:56,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:32:56,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:32:58,621 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:32:58,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:32:58,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805092152] [2025-03-08 04:32:58,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805092152] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:32:58,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [143653960] [2025-03-08 04:32:58,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:32:58,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:32:58,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:32:58,624 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 04:32:58,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 04:32:58,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-08 04:32:58,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-08 04:32:58,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:32:58,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:32:58,925 INFO L256 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 125 conjuncts are in the unsatisfiable core [2025-03-08 04:32:58,935 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:32:59,000 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-03-08 04:32:59,213 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-03-08 04:32:59,313 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-08 04:32:59,314 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-03-08 04:32:59,383 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-03-08 04:32:59,393 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-03-08 04:32:59,465 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-08 04:32:59,465 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-03-08 04:32:59,475 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-03-08 04:32:59,635 INFO L349 Elim1Store]: treesize reduction 42, result has 20.8 percent of original size [2025-03-08 04:32:59,636 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 107 treesize of output 115 [2025-03-08 04:32:59,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:32:59,648 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 28 treesize of output 25 [2025-03-08 04:32:59,656 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-03-08 04:32:59,664 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 70 treesize of output 51 [2025-03-08 04:32:59,670 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 26 [2025-03-08 04:32:59,796 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2025-03-08 04:32:59,801 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-03-08 04:32:59,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2025-03-08 04:33:00,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:33:00,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 27 [2025-03-08 04:33:00,032 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2025-03-08 04:33:00,033 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-03-08 04:33:00,042 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-03-08 04:33:00,228 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 16 [2025-03-08 04:33:00,343 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 64 treesize of output 26 [2025-03-08 04:33:00,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 15 [2025-03-08 04:33:00,409 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-03-08 04:33:00,489 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:33:00,489 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:33:00,581 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_380 (Array Int Int)) (v_ArrVal_376 (Array Int Int)) (v_ArrVal_379 (Array Int Int))) (or (not (= v_ArrVal_376 (store (select |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| (select v_ArrVal_376 |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset|)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_376) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_380) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_379) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8))))) is different from false [2025-03-08 04:33:00,599 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_380 (Array Int Int)) (v_ArrVal_376 (Array Int Int)) (v_ArrVal_379 (Array Int Int))) (or (not (= v_ArrVal_376 (store (select |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| (select v_ArrVal_376 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_376) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_380) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|) v_ArrVal_379) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8))))) is different from false [2025-03-08 04:33:00,613 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_380 (Array Int Int)) (v_ArrVal_376 (Array Int Int)) (v_ArrVal_379 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int#2| .cse0 v_ArrVal_376) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_380) (select (select |c_#memory_$Pointer$#2.base| .cse0) .cse1) v_ArrVal_379) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8))) (not (= v_ArrVal_376 (store (select |c_#memory_int#2| .cse0) .cse1 (select v_ArrVal_376 .cse1))))))) is different from false [2025-03-08 04:33:00,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [143653960] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:33:00,737 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 04:33:00,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 46 [2025-03-08 04:33:00,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961206203] [2025-03-08 04:33:00,738 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 04:33:00,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-03-08 04:33:00,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:33:00,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-03-08 04:33:00,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=2195, Unknown=4, NotChecked=288, Total=2652 [2025-03-08 04:33:00,740 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-03-08 04:33:02,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:33:02,196 INFO L93 Difference]: Finished difference Result 77 states and 104 transitions. [2025-03-08 04:33:02,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-08 04:33:02,196 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-03-08 04:33:02,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:33:02,197 INFO L225 Difference]: With dead ends: 77 [2025-03-08 04:33:02,197 INFO L226 Difference]: Without dead ends: 75 [2025-03-08 04:33:02,200 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1019 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=302, Invalid=3866, Unknown=4, NotChecked=384, Total=4556 [2025-03-08 04:33:02,202 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 75 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 1012 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 04:33:02,202 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 414 Invalid, 1031 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1012 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 04:33:02,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-03-08 04:33:02,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 55. [2025-03-08 04:33:02,210 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-03-08 04:33:02,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 73 transitions. [2025-03-08 04:33:02,211 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 73 transitions. Word has length 35 [2025-03-08 04:33:02,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:33:02,211 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 73 transitions. [2025-03-08 04:33:02,211 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-03-08 04:33:02,211 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 73 transitions. [2025-03-08 04:33:02,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-08 04:33:02,213 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:33:02,213 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-03-08 04:33:02,223 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 04:33:02,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:33:02,414 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:33:02,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:33:02,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1242611633, now seen corresponding path program 2 times [2025-03-08 04:33:02,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:33:02,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554228110] [2025-03-08 04:33:02,415 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 04:33:02,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:33:02,440 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-03-08 04:33:02,455 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-03-08 04:33:02,455 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 04:33:02,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:33:02,547 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-08 04:33:02,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:33:02,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554228110] [2025-03-08 04:33:02,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554228110] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:33:02,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 04:33:02,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 04:33:02,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866049218] [2025-03-08 04:33:02,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:33:02,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 04:33:02,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:33:02,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 04:33:02,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 04:33:02,549 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-03-08 04:33:02,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:33:02,570 INFO L93 Difference]: Finished difference Result 73 states and 97 transitions. [2025-03-08 04:33:02,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 04:33:02,570 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-03-08 04:33:02,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:33:02,571 INFO L225 Difference]: With dead ends: 73 [2025-03-08 04:33:02,571 INFO L226 Difference]: Without dead ends: 57 [2025-03-08 04:33:02,571 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-08 04:33:02,571 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-03-08 04:33:02,571 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-03-08 04:33:02,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-03-08 04:33:02,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2025-03-08 04:33:02,578 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-03-08 04:33:02,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 71 transitions. [2025-03-08 04:33:02,579 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 71 transitions. Word has length 36 [2025-03-08 04:33:02,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:33:02,580 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 71 transitions. [2025-03-08 04:33:02,580 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-03-08 04:33:02,580 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 71 transitions. [2025-03-08 04:33:02,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-08 04:33:02,581 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:33:02,582 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-03-08 04:33:02,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 04:33:02,582 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:33:02,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:33:02,583 INFO L85 PathProgramCache]: Analyzing trace with hash -500898062, now seen corresponding path program 1 times [2025-03-08 04:33:02,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:33:02,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598524081] [2025-03-08 04:33:02,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:33:02,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:33:02,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-08 04:33:02,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-08 04:33:02,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:33:02,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:33:02,712 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-08 04:33:02,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:33:02,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598524081] [2025-03-08 04:33:02,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598524081] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:33:02,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [399561371] [2025-03-08 04:33:02,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:33:02,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:33:02,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:33:02,715 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 04:33:02,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 04:33:02,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-08 04:33:02,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-08 04:33:02,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:33:02,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:33:02,845 INFO L256 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 04:33:02,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:33:02,881 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-08 04:33:02,881 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 04:33:02,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [399561371] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:33:02,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 04:33:02,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2025-03-08 04:33:02,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671717437] [2025-03-08 04:33:02,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:33:02,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 04:33:02,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:33:02,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 04:33:02,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 04:33:02,882 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-03-08 04:33:02,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:33:02,899 INFO L93 Difference]: Finished difference Result 71 states and 91 transitions. [2025-03-08 04:33:02,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 04:33:02,900 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-03-08 04:33:02,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:33:02,900 INFO L225 Difference]: With dead ends: 71 [2025-03-08 04:33:02,902 INFO L226 Difference]: Without dead ends: 56 [2025-03-08 04:33:02,903 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-03-08 04:33:02,903 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-03-08 04:33:02,903 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-03-08 04:33:02,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-03-08 04:33:02,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2025-03-08 04:33:02,912 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-03-08 04:33:02,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 68 transitions. [2025-03-08 04:33:02,912 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 68 transitions. Word has length 36 [2025-03-08 04:33:02,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:33:02,914 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 68 transitions. [2025-03-08 04:33:02,914 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-03-08 04:33:02,914 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 68 transitions. [2025-03-08 04:33:02,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-08 04:33:02,915 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:33:02,915 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-03-08 04:33:02,922 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 04:33:03,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:33:03,116 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:33:03,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:33:03,116 INFO L85 PathProgramCache]: Analyzing trace with hash 160716788, now seen corresponding path program 1 times [2025-03-08 04:33:03,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:33:03,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501259548] [2025-03-08 04:33:03,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:33:03,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:33:03,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-08 04:33:03,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-08 04:33:03,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:33:03,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:33:03,225 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-08 04:33:03,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:33:03,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501259548] [2025-03-08 04:33:03,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501259548] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:33:03,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1866169094] [2025-03-08 04:33:03,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:33:03,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:33:03,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:33:03,228 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 04:33:03,230 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 04:33:03,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-08 04:33:03,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-08 04:33:03,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:33:03,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:33:03,372 INFO L256 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-08 04:33:03,374 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:33:03,394 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-08 04:33:03,395 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:33:03,447 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-08 04:33:03,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1866169094] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:33:03,447 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 04:33:03,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-03-08 04:33:03,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944630481] [2025-03-08 04:33:03,447 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 04:33:03,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 04:33:03,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:33:03,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 04:33:03,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 04:33:03,448 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-03-08 04:33:03,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:33:03,529 INFO L93 Difference]: Finished difference Result 67 states and 85 transitions. [2025-03-08 04:33:03,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 04:33:03,530 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-03-08 04:33:03,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:33:03,531 INFO L225 Difference]: With dead ends: 67 [2025-03-08 04:33:03,531 INFO L226 Difference]: Without dead ends: 54 [2025-03-08 04:33:03,531 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-03-08 04:33:03,532 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 2 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 04:33:03,532 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 204 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 04:33:03,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-03-08 04:33:03,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2025-03-08 04:33:03,541 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-03-08 04:33:03,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 67 transitions. [2025-03-08 04:33:03,543 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 67 transitions. Word has length 37 [2025-03-08 04:33:03,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:33:03,544 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 67 transitions. [2025-03-08 04:33:03,544 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-03-08 04:33:03,544 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 67 transitions. [2025-03-08 04:33:03,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-08 04:33:03,544 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:33:03,544 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-03-08 04:33:03,552 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 04:33:03,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:33:03,745 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:33:03,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:33:03,746 INFO L85 PathProgramCache]: Analyzing trace with hash 189345939, now seen corresponding path program 1 times [2025-03-08 04:33:03,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:33:03,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813133393] [2025-03-08 04:33:03,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:33:03,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:33:03,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-08 04:33:03,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-08 04:33:03,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:33:03,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:33:03,935 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-08 04:33:03,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:33:03,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813133393] [2025-03-08 04:33:03,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813133393] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:33:03,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1225190435] [2025-03-08 04:33:03,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:33:03,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:33:03,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:33:03,938 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 04:33:03,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 04:33:04,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-08 04:33:04,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-08 04:33:04,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:33:04,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:33:04,077 INFO L256 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-08 04:33:04,080 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:33:04,152 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-03-08 04:33:04,175 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 04:33:04,176 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:33:04,206 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-08 04:33:04,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1225190435] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:33:04,206 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 04:33:04,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 11] total 15 [2025-03-08 04:33:04,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369756801] [2025-03-08 04:33:04,206 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 04:33:04,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 04:33:04,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:33:04,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 04:33:04,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2025-03-08 04:33:04,207 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-03-08 04:33:08,223 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-03-08 04:33:12,241 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-03-08 04:33:16,249 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-03-08 04:33:20,265 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-03-08 04:33:24,410 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-03-08 04:33:28,425 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-03-08 04:33:28,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:33:28,430 INFO L93 Difference]: Finished difference Result 87 states and 107 transitions. [2025-03-08 04:33:28,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 04:33:28,431 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-03-08 04:33:28,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:33:28,431 INFO L225 Difference]: With dead ends: 87 [2025-03-08 04:33:28,431 INFO L226 Difference]: Without dead ends: 57 [2025-03-08 04:33:28,432 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-03-08 04:33:28,432 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 31 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 1 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.2s IncrementalHoareTripleChecker+Time [2025-03-08 04:33:28,432 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 321 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 187 Invalid, 6 Unknown, 0 Unchecked, 24.2s Time] [2025-03-08 04:33:28,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-03-08 04:33:28,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2025-03-08 04:33:28,441 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-03-08 04:33:28,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 66 transitions. [2025-03-08 04:33:28,444 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 66 transitions. Word has length 37 [2025-03-08 04:33:28,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:33:28,444 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 66 transitions. [2025-03-08 04:33:28,444 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-03-08 04:33:28,444 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 66 transitions. [2025-03-08 04:33:28,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-08 04:33:28,444 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:33:28,444 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-03-08 04:33:28,453 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-08 04:33:28,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:33:28,645 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:33:28,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:33:28,645 INFO L85 PathProgramCache]: Analyzing trace with hash -474034660, now seen corresponding path program 1 times [2025-03-08 04:33:28,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:33:28,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425097401] [2025-03-08 04:33:28,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:33:28,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:33:28,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-08 04:33:28,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-08 04:33:28,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:33:28,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:33:30,060 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:33:30,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:33:30,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425097401] [2025-03-08 04:33:30,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425097401] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:33:30,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1012854541] [2025-03-08 04:33:30,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:33:30,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:33:30,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:33:30,063 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 04:33:30,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 04:33:30,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-08 04:33:30,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-08 04:33:30,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:33:30,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:33:30,429 INFO L256 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 135 conjuncts are in the unsatisfiable core [2025-03-08 04:33:30,435 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:33:30,461 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-03-08 04:33:30,612 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_#t~ret5#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_14| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_14| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)))) is different from false [2025-03-08 04:33:30,614 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_#t~ret5#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_14| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_14| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)))) is different from true [2025-03-08 04:33:30,636 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-03-08 04:33:30,646 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) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_14| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_14| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_14| |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-03-08 04:33:30,648 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) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_14| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_14| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_14| |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-03-08 04:33:30,666 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-08 04:33:30,667 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 33 treesize of output 32 [2025-03-08 04:33:30,680 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_14| .cse0) 1) (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_14| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_14| .cse1 (select |c_#valid| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse0) (= |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))) is different from false [2025-03-08 04:33:30,682 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_14| .cse0) 1) (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_14| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_14| .cse1 (select |c_#valid| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse0) (= |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))) is different from true [2025-03-08 04:33:30,699 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_14| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_14| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_14| .cse1) 1))) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) is different from false [2025-03-08 04:33:30,701 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_14| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_14| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_14| .cse1) 1))) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) is different from true [2025-03-08 04:33:30,722 INFO L349 Elim1Store]: treesize reduction 42, result has 20.8 percent of original size [2025-03-08 04:33:30,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 70 treesize of output 84 [2025-03-08 04:33:30,726 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 84 treesize of output 74 [2025-03-08 04:33:30,765 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|))) (let ((.cse0 (select .cse2 0))) (and (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse1 (select (store (store |c_#memory_$Pointer$#2.base| .cse0 v_DerPreprocessor_1) |c_ULTIMATE.start_dll_circular_create_#res#1.base| v_DerPreprocessor_2) .cse0))) (and (= (select |c_#memory_$Pointer$#2.base| .cse0) .cse1) (= (store .cse1 4 (select .cse2 4)) v_DerPreprocessor_2)))) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= |c_#valid| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_14| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_14| .cse3 (select |c_#valid| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_14| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 0)))))) is different from false [2025-03-08 04:33:30,766 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|))) (let ((.cse0 (select .cse2 0))) (and (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse1 (select (store (store |c_#memory_$Pointer$#2.base| .cse0 v_DerPreprocessor_1) |c_ULTIMATE.start_dll_circular_create_#res#1.base| v_DerPreprocessor_2) .cse0))) (and (= (select |c_#memory_$Pointer$#2.base| .cse0) .cse1) (= (store .cse1 4 (select .cse2 4)) v_DerPreprocessor_2)))) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= |c_#valid| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_14| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_14| .cse3 (select |c_#valid| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_14| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 0)))))) is different from true [2025-03-08 04:33:30,801 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select |c_#memory_$Pointer$#2.base| .cse3))) (let ((.cse0 (select .cse2 0))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse1 (select (store (store |c_#memory_$Pointer$#2.base| .cse0 v_DerPreprocessor_1) .cse3 v_DerPreprocessor_2) .cse0))) (and (= (select |c_#memory_$Pointer$#2.base| .cse0) .cse1) (= v_DerPreprocessor_2 (store .cse1 4 (select .cse2 4)))))) (= (select |c_#valid| .cse3) 1) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= |c_#valid| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_14| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_14| .cse4 (select |c_#valid| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_14| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_14| .cse3) 0))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~uneq~0#1| |c_ULTIMATE.start_dll_circular_insert_~data#1|) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0))))) is different from false [2025-03-08 04:33:30,802 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select |c_#memory_$Pointer$#2.base| .cse3))) (let ((.cse0 (select .cse2 0))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse1 (select (store (store |c_#memory_$Pointer$#2.base| .cse0 v_DerPreprocessor_1) .cse3 v_DerPreprocessor_2) .cse0))) (and (= (select |c_#memory_$Pointer$#2.base| .cse0) .cse1) (= v_DerPreprocessor_2 (store .cse1 4 (select .cse2 4)))))) (= (select |c_#valid| .cse3) 1) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= |c_#valid| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_14| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_14| .cse4 (select |c_#valid| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_14| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_14| .cse3) 0))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~uneq~0#1| |c_ULTIMATE.start_dll_circular_insert_~data#1|) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0))))) is different from true [2025-03-08 04:33:30,813 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-03-08 04:33:30,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 135 treesize of output 78 [2025-03-08 04:33:30,818 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 73 treesize of output 59 [2025-03-08 04:33:30,841 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimCell_31 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_14| .cse0 (select |v_#valid_BEFORE_CALL_7| .cse0))) |v_#valid_BEFORE_CALL_7|) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimCell_31) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_14| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse1) 1))))) is different from false [2025-03-08 04:33:30,843 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimCell_31 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_14| .cse0 (select |v_#valid_BEFORE_CALL_7| .cse0))) |v_#valid_BEFORE_CALL_7|) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimCell_31) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_14| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse1) 1))))) is different from true [2025-03-08 04:33:30,862 WARN L851 $PredicateComparison]: unable to prove that (and (= |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_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimCell_31 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_14| .cse0 (select |v_#valid_BEFORE_CALL_7| .cse0))) |v_#valid_BEFORE_CALL_7|) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimCell_31) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_14| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse1) 1))))) is different from false [2025-03-08 04:33:30,863 WARN L873 $PredicateComparison]: unable to prove that (and (= |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_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimCell_31 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_14| .cse0 (select |v_#valid_BEFORE_CALL_7| .cse0))) |v_#valid_BEFORE_CALL_7|) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimCell_31) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_14| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse1) 1))))) is different from true [2025-03-08 04:33:30,903 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-03-08 04:33:30,908 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) (= (select (select |c_#memory_int#2| |c_node_create_#res#1.base|) 8) |c_node_create_#in~data#1|) (= (store |c_old(#memory_$Pointer$#2.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.base| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.base|) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimCell_31 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_14| .cse0 (select |v_#valid_BEFORE_CALL_7| .cse0))) |v_#valid_BEFORE_CALL_7|) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimCell_31) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_14| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse1) 1))))) is different from false [2025-03-08 04:33:30,910 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) (= (select (select |c_#memory_int#2| |c_node_create_#res#1.base|) 8) |c_node_create_#in~data#1|) (= (store |c_old(#memory_$Pointer$#2.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.base| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.base|) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimCell_31 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_14| .cse0 (select |v_#valid_BEFORE_CALL_7| .cse0))) |v_#valid_BEFORE_CALL_7|) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimCell_31) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_14| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse1) 1))))) is different from true [2025-03-08 04:33:30,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:33:30,975 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2025-03-08 04:33:30,975 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 143 treesize of output 92 [2025-03-08 04:33:30,997 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) 8)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |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|) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_15| .cse0) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_16| |v_old(#valid)_AFTER_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_16| .cse1 (select |v_old(#valid)_AFTER_CALL_15| .cse1))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) 0) (= 1 (select |v_old(#valid)_AFTER_CALL_16| (select (select |c_#memory_$Pointer$#2.base| .cse0) 0))) (= (select |v_old(#valid)_AFTER_CALL_16| .cse0) 0)))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimCell_31 Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_14| .cse2 (select |v_#valid_BEFORE_CALL_7| .cse2))) |v_#valid_BEFORE_CALL_7|) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimCell_31) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_14| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse3) 1))))) is different from false [2025-03-08 04:33:30,999 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) 8)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |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|) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (and (= (select |v_old(#valid)_AFTER_CALL_15| .cse0) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_16| |v_old(#valid)_AFTER_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_16| .cse1 (select |v_old(#valid)_AFTER_CALL_15| .cse1))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) 0) (= 1 (select |v_old(#valid)_AFTER_CALL_16| (select (select |c_#memory_$Pointer$#2.base| .cse0) 0))) (= (select |v_old(#valid)_AFTER_CALL_16| .cse0) 0)))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimCell_31 Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_14| .cse2 (select |v_#valid_BEFORE_CALL_7| .cse2))) |v_#valid_BEFORE_CALL_7|) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimCell_31) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_14| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse3) 1))))) is different from true [2025-03-08 04:33:31,043 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 8)) (exists ((|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_15| .cse0) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_16| |v_old(#valid)_AFTER_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_16| .cse1 (select |v_old(#valid)_AFTER_CALL_15| .cse1))) |v_old(#valid)_AFTER_CALL_15|) (= 1 (select |v_old(#valid)_AFTER_CALL_16| (select (select |c_#memory_$Pointer$#2.base| .cse0) 0))) (= (select |v_old(#valid)_AFTER_CALL_16| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= .cse0 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimCell_31 Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_14| .cse2 (select |v_#valid_BEFORE_CALL_7| .cse2))) |v_#valid_BEFORE_CALL_7|) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimCell_31) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_14| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse3) 1)))))) is different from false [2025-03-08 04:33:31,045 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 8)) (exists ((|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_15| .cse0) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_16| |v_old(#valid)_AFTER_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_16| .cse1 (select |v_old(#valid)_AFTER_CALL_15| .cse1))) |v_old(#valid)_AFTER_CALL_15|) (= 1 (select |v_old(#valid)_AFTER_CALL_16| (select (select |c_#memory_$Pointer$#2.base| .cse0) 0))) (= (select |v_old(#valid)_AFTER_CALL_16| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= .cse0 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimCell_31 Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_14| .cse2 (select |v_#valid_BEFORE_CALL_7| .cse2))) |v_#valid_BEFORE_CALL_7|) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimCell_31) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_14| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse3) 1)))))) is different from true [2025-03-08 04:33:31,088 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 8)) (= |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| 0) (= .cse0 |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_15| .cse0) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_16| |v_old(#valid)_AFTER_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_16| .cse1 (select |v_old(#valid)_AFTER_CALL_15| .cse1))) |v_old(#valid)_AFTER_CALL_15|) (= 1 (select |v_old(#valid)_AFTER_CALL_16| (select (select |c_#memory_$Pointer$#2.base| .cse0) 0))) (= (select |v_old(#valid)_AFTER_CALL_16| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimCell_31 Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_14| .cse2 (select |v_#valid_BEFORE_CALL_7| .cse2))) |v_#valid_BEFORE_CALL_7|) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimCell_31) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_14| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse3) 1)))))) is different from false [2025-03-08 04:33:31,090 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 8)) (= |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| 0) (= .cse0 |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_15| .cse0) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_16| |v_old(#valid)_AFTER_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_16| .cse1 (select |v_old(#valid)_AFTER_CALL_15| .cse1))) |v_old(#valid)_AFTER_CALL_15|) (= 1 (select |v_old(#valid)_AFTER_CALL_16| (select (select |c_#memory_$Pointer$#2.base| .cse0) 0))) (= (select |v_old(#valid)_AFTER_CALL_16| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimCell_31 Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_14| .cse2 (select |v_#valid_BEFORE_CALL_7| .cse2))) |v_#valid_BEFORE_CALL_7|) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimCell_31) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_14| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse3) 1)))))) is different from true [2025-03-08 04:33:31,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:33:31,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:33:31,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:33:31,172 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 50 treesize of output 26 [2025-03-08 04:33:31,178 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 41 [2025-03-08 04:33:31,183 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 47 [2025-03-08 04:33:31,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:33:31,202 INFO L349 Elim1Store]: treesize reduction 56, result has 13.8 percent of original size [2025-03-08 04:33:31,202 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 127 treesize of output 70 [2025-03-08 04:33:31,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:33:31,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:33:31,209 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-03-08 04:33:31,226 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-03-08 04:33:31,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 183 treesize of output 90 [2025-03-08 04:33:31,239 INFO L349 Elim1Store]: treesize reduction 39, result has 2.5 percent of original size [2025-03-08 04:33:31,240 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 159 treesize of output 101 [2025-03-08 04:33:31,244 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-03-08 04:33:31,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 169 treesize of output 76 [2025-03-08 04:33:31,255 INFO L349 Elim1Store]: treesize reduction 39, result has 2.5 percent of original size [2025-03-08 04:33:31,255 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 145 treesize of output 87 [2025-03-08 04:33:31,259 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-03-08 04:33:31,270 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) 0))) (and (= (select (select |c_#memory_int#2| .cse0) 8) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((v_arrayElimCell_36 Int) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_15| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_15| .cse0) 0) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_16| |v_old(#valid)_AFTER_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_16| .cse2 (select |v_old(#valid)_AFTER_CALL_15| .cse2))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_16| v_arrayElimCell_36) 1) (= (select |v_old(#valid)_AFTER_CALL_16| .cse1) 0))) (= 0 (select (select |c_#memory_$Pointer$#2.offset| .cse1) 0)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimCell_31 Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_14| .cse3 (select |v_#valid_BEFORE_CALL_7| .cse3))) |v_#valid_BEFORE_CALL_7|) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimCell_31) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_14| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse4) 1))))))) is different from false [2025-03-08 04:33:31,272 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) 0))) (and (= (select (select |c_#memory_int#2| .cse0) 8) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((v_arrayElimCell_36 Int) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_15| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_15| .cse0) 0) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_16| |v_old(#valid)_AFTER_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_16| .cse2 (select |v_old(#valid)_AFTER_CALL_15| .cse2))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_16| v_arrayElimCell_36) 1) (= (select |v_old(#valid)_AFTER_CALL_16| .cse1) 0))) (= 0 (select (select |c_#memory_$Pointer$#2.offset| .cse1) 0)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimCell_31 Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_14| .cse3 (select |v_#valid_BEFORE_CALL_7| .cse3))) |v_#valid_BEFORE_CALL_7|) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimCell_31) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_14| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse4) 1))))))) is different from true [2025-03-08 04:33:31,295 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:33:31,296 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 83 treesize of output 59 [2025-03-08 04:33:31,390 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((v_arrayElimCell_36 Int) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_16| |v_old(#valid)_AFTER_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_16| .cse0 (select |v_old(#valid)_AFTER_CALL_15| .cse0))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_16| v_arrayElimCell_36) 1) (= (select |v_old(#valid)_AFTER_CALL_16| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_15| .cse1) 0))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#2| .cse1) 8)) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) 0) (or (and (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (v_arrayElimCell_31 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_14| .cse2 (select |v_#valid_BEFORE_CALL_7| .cse2))) |v_#valid_BEFORE_CALL_7|) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimCell_31) 1) (= (select |v_#valid_BEFORE_CALL_7| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1))) (exists ((|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0))) (exists ((|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int)) (and (= (select (select |c_#memory_$Pointer$#1.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|))))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0))) is different from false [2025-03-08 04:33:31,393 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((v_arrayElimCell_36 Int) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_16| |v_old(#valid)_AFTER_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_16| .cse0 (select |v_old(#valid)_AFTER_CALL_15| .cse0))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_16| v_arrayElimCell_36) 1) (= (select |v_old(#valid)_AFTER_CALL_16| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_15| .cse1) 0))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#2| .cse1) 8)) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) 0) (or (and (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (v_arrayElimCell_31 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_14| .cse2 (select |v_#valid_BEFORE_CALL_7| .cse2))) |v_#valid_BEFORE_CALL_7|) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimCell_31) 1) (= (select |v_#valid_BEFORE_CALL_7| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1))) (exists ((|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0))) (exists ((|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int)) (and (= (select (select |c_#memory_$Pointer$#1.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|))))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0))) is different from true [2025-03-08 04:33:31,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2025-03-08 04:33:31,484 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:33:31,485 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-03-08 04:33:31,490 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 7 treesize of output 3 [2025-03-08 04:33:31,541 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_main_~ptr~0#1.base|) 8) |c_ULTIMATE.start_main_~uneq~0#1|) (exists ((v_arrayElimCell_36 Int) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_20| Int) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int))) (and (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_16| |v_old(#valid)_AFTER_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_16| .cse0 (select |v_old(#valid)_AFTER_CALL_15| .cse0))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_16| v_arrayElimCell_36) 1) (= (select |v_old(#valid)_AFTER_CALL_15| |v_ULTIMATE.start_main_~ptr~0#1.base_20|) 1) (= (select |v_old(#valid)_AFTER_CALL_16| |v_ULTIMATE.start_main_~ptr~0#1.base_20|) 0)))) is different from false [2025-03-08 04:33:31,542 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_main_~ptr~0#1.base|) 8) |c_ULTIMATE.start_main_~uneq~0#1|) (exists ((v_arrayElimCell_36 Int) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_20| Int) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int))) (and (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_16| |v_old(#valid)_AFTER_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_16| .cse0 (select |v_old(#valid)_AFTER_CALL_15| .cse0))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_16| v_arrayElimCell_36) 1) (= (select |v_old(#valid)_AFTER_CALL_15| |v_ULTIMATE.start_main_~ptr~0#1.base_20|) 1) (= (select |v_old(#valid)_AFTER_CALL_16| |v_ULTIMATE.start_main_~ptr~0#1.base_20|) 0)))) is different from true [2025-03-08 04:33:31,559 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-03-08 04:33:31,563 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2025-03-08 04:33:31,563 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:33:31,625 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:33:31,625 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 83 treesize of output 84 [2025-03-08 04:33:31,633 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:33:31,634 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 320 treesize of output 323 [2025-03-08 04:33:31,643 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 152 treesize of output 146 [2025-03-08 04:33:31,650 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 294 treesize of output 282 [2025-03-08 04:33:32,039 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse7 (= .cse5 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|)) (.cse3 (+ |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 4)) (.cse4 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$#2.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|))) (.cse6 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse17 (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| .cse5))) (let ((.cse10 (not .cse17)) (.cse11 (forall ((v_arrayElimCell_52 Int) (v_ArrVal_1277 Int) (v_ArrVal_1278 Int) (v_ArrVal_1275 (Array Int Int)) (v_ArrVal_1274 (Array Int Int)) (v_ArrVal_1273 (Array Int Int)) (v_arrayElimCell_54 Int) (v_ArrVal_1272 (Array Int Int)) (v_arrayElimCell_55 Int)) (let ((.cse32 (select (store (let ((.cse33 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1274))) (store .cse33 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse33 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse3 v_ArrVal_1278) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1277))) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1273) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1275) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1272) .cse5) .cse6)))) (or (= (select .cse32 (+ 8 v_arrayElimCell_55)) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse32 (+ 8 v_arrayElimCell_54))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse32 (+ 8 v_arrayElimCell_52))))))) (.cse12 (or .cse17 (and (or .cse7 (forall ((v_arrayElimCell_52 Int) (v_ArrVal_1277 Int) (v_ArrVal_1278 Int) (v_ArrVal_1275 (Array Int Int)) (v_ArrVal_1274 (Array Int Int)) (v_ArrVal_1273 (Array Int Int)) (v_ArrVal_1272 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse29 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1274))) (store .cse29 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse29 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse3 v_ArrVal_1278) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1277))) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1273) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1275) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1272) .cse5) .cse6)) (+ 8 v_arrayElimCell_52))))) (forall ((v_arrayElimCell_52 Int) (v_ArrVal_1277 Int) (v_ArrVal_1278 Int) (v_ArrVal_1275 (Array Int Int)) (v_ArrVal_1274 (Array Int Int)) (v_ArrVal_1273 (Array Int Int)) (v_ArrVal_1272 (Array Int Int)) (v_arrayElimCell_55 Int)) (let ((.cse30 (select (store (let ((.cse31 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1274))) (store .cse31 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse31 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse3 v_ArrVal_1278) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1277))) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1273) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1275) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1272) .cse5) .cse6)))) (or (= (select .cse30 (+ 8 v_arrayElimCell_55)) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse30 (+ 8 v_arrayElimCell_52))))))))) (.cse13 (or .cse7 (forall ((v_arrayElimCell_52 Int) (v_ArrVal_1277 Int) (v_ArrVal_1278 Int) (v_ArrVal_1275 (Array Int Int)) (v_ArrVal_1274 (Array Int Int)) (v_ArrVal_1273 (Array Int Int)) (v_arrayElimCell_54 Int) (v_ArrVal_1272 (Array Int Int))) (let ((.cse27 (select (store (let ((.cse28 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1274))) (store .cse28 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse28 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse3 v_ArrVal_1278) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1277))) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1273) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1275) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1272) .cse5) .cse6)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse27 (+ 8 v_arrayElimCell_54))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse27 (+ 8 v_arrayElimCell_52)))))))) (.cse1 (+ |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 8)) (.cse14 (not .cse7))) (and (or (forall ((v_ArrVal_1277 Int) (v_ArrVal_1278 Int) (v_ArrVal_1275 (Array Int Int)) (v_ArrVal_1274 (Array Int Int)) (v_ArrVal_1273 (Array Int Int)) (v_arrayElimCell_54 Int) (v_ArrVal_1272 (Array Int Int))) (let ((.cse0 (select (store (let ((.cse2 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1274))) (store .cse2 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse2 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse3 v_ArrVal_1278) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1277))) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1273) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1275) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1272) .cse5) .cse6)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse0 (+ 8 v_arrayElimCell_54))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse0 .cse1))))) .cse7) (or (= .cse5 |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) (and (or (let ((.cse8 (select |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|))) (and (or .cse7 (forall ((v_ArrVal_1277 Int) (v_ArrVal_1278 Int) (v_ArrVal_1275 (Array Int Int)) (v_ArrVal_1274 (Array Int Int)) (v_ArrVal_1273 (Array Int Int)) (v_arrayElimCell_54 Int) (v_ArrVal_1272 (Array Int Int))) (= (select (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1274) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store .cse8 .cse3 v_ArrVal_1278) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1277)) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1273) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1275) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1272) .cse5) .cse6)) (+ 8 v_arrayElimCell_54)) |c_ULTIMATE.start_main_~uneq~0#1|))) (forall ((v_ArrVal_1277 Int) (v_ArrVal_1278 Int) (v_ArrVal_1275 (Array Int Int)) (v_ArrVal_1274 (Array Int Int)) (v_ArrVal_1273 (Array Int Int)) (v_arrayElimCell_54 Int) (v_ArrVal_1272 (Array Int Int))) (let ((.cse9 (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1274) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store .cse8 .cse3 v_ArrVal_1278) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1277)) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1273) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1275) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1272) .cse5) .cse6)))) (or (= (select .cse9 (+ 8 v_arrayElimCell_54)) |c_ULTIMATE.start_main_~uneq~0#1|) (forall ((v_arrayElimCell_55 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse9 (+ 8 v_arrayElimCell_55))))))))) .cse10) .cse11 .cse12 .cse13)) (or .cse14 (forall ((v_ArrVal_1277 Int) (v_ArrVal_1278 Int) (v_ArrVal_1275 (Array Int Int)) (v_ArrVal_1274 (Array Int Int)) (v_ArrVal_1273 (Array Int Int)) (v_arrayElimCell_54 Int) (v_ArrVal_1272 (Array Int Int)) (v_arrayElimCell_55 Int)) (let ((.cse15 (select (store (let ((.cse16 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1274))) (store .cse16 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse16 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse3 v_ArrVal_1278) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1277))) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1273) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1275) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1272) .cse5) .cse6)))) (or (= (select .cse15 (+ 8 v_arrayElimCell_55)) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse15 (+ 8 v_arrayElimCell_54))))))) (or .cse17 (and (or (forall ((v_ArrVal_1277 Int) (v_ArrVal_1278 Int) (v_ArrVal_1275 (Array Int Int)) (v_ArrVal_1274 (Array Int Int)) (v_ArrVal_1273 (Array Int Int)) (v_ArrVal_1272 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse18 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1274))) (store .cse18 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse18 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse3 v_ArrVal_1278) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1277))) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1273) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1275) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1272) .cse5) .cse6)) .cse1))) .cse7) (forall ((v_ArrVal_1277 Int) (v_ArrVal_1278 Int) (v_ArrVal_1275 (Array Int Int)) (v_ArrVal_1274 (Array Int Int)) (v_ArrVal_1273 (Array Int Int)) (v_ArrVal_1272 (Array Int Int)) (v_arrayElimCell_55 Int)) (let ((.cse19 (select (store (let ((.cse20 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1274))) (store .cse20 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse20 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse3 v_ArrVal_1278) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1277))) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1273) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1275) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1272) .cse5) .cse6)))) (or (= (select .cse19 (+ 8 v_arrayElimCell_55)) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse19 .cse1))))))) (or .cse10 (and (or .cse7 (forall ((v_ArrVal_1277 Int) (v_ArrVal_1278 Int) (v_ArrVal_1275 (Array Int Int)) (v_ArrVal_1274 (Array Int Int)) (v_ArrVal_1273 (Array Int Int)) (v_arrayElimCell_54 Int) (v_ArrVal_1272 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse21 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1274))) (store .cse21 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse21 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse3 v_ArrVal_1278) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1277))) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1273) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1275) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1272) .cse5) .cse6)) (+ 8 v_arrayElimCell_54))))) (forall ((v_ArrVal_1277 Int) (v_ArrVal_1278 Int) (v_ArrVal_1275 (Array Int Int)) (v_ArrVal_1274 (Array Int Int)) (v_ArrVal_1273 (Array Int Int)) (v_arrayElimCell_54 Int) (v_ArrVal_1272 (Array Int Int))) (let ((.cse22 (select (store (let ((.cse23 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1274))) (store .cse23 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse23 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse3 v_ArrVal_1278) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1277))) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1273) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1275) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1272) .cse5) .cse6)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse22 (+ 8 v_arrayElimCell_54))) (forall ((v_arrayElimCell_55 Int)) (= (select .cse22 (+ 8 v_arrayElimCell_55)) |c_ULTIMATE.start_main_~uneq~0#1|))))))) (or (and .cse11 .cse12 .cse13) (= .cse6 |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset|)) (forall ((v_ArrVal_1277 Int) (v_ArrVal_1278 Int) (v_ArrVal_1275 (Array Int Int)) (v_ArrVal_1274 (Array Int Int)) (v_ArrVal_1273 (Array Int Int)) (v_arrayElimCell_54 Int) (v_ArrVal_1272 (Array Int Int)) (v_arrayElimCell_55 Int)) (let ((.cse24 (select (store (let ((.cse25 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1274))) (store .cse25 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse25 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse3 v_ArrVal_1278) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1277))) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1273) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1275) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1272) .cse5) .cse6)))) (or (= (select .cse24 (+ 8 v_arrayElimCell_55)) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse24 (+ 8 v_arrayElimCell_54))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse24 .cse1))))) (or .cse14 (forall ((v_ArrVal_1277 Int) (v_ArrVal_1278 Int) (v_ArrVal_1275 (Array Int Int)) (v_ArrVal_1274 (Array Int Int)) (v_ArrVal_1273 (Array Int Int)) (v_ArrVal_1272 (Array Int Int)) (v_arrayElimCell_55 Int)) (= (select (select (store (let ((.cse26 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1274))) (store .cse26 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse26 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse3 v_ArrVal_1278) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1277))) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1273) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1275) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1272) .cse5) .cse6)) (+ 8 v_arrayElimCell_55)) |c_ULTIMATE.start_main_~uneq~0#1|))))))) is different from false [2025-03-08 04:33:32,540 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse35 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|))) (let ((.cse4 (select .cse35 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|)) (.cse6 (select (select |c_#memory_$Pointer$#1.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| .cse6)) (.cse3 (+ |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 4)) (.cse5 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store .cse35 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|))) (.cse7 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse15 (= .cse4 .cse6))) (let ((.cse11 (or (forall ((v_arrayElimCell_52 Int) (v_ArrVal_1277 Int) (v_ArrVal_1278 Int) (v_ArrVal_1275 (Array Int Int)) (v_ArrVal_1274 (Array Int Int)) (v_ArrVal_1273 (Array Int Int)) (v_arrayElimCell_54 Int) (v_ArrVal_1272 (Array Int Int))) (let ((.cse33 (select (store (let ((.cse34 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1274))) (store .cse34 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse34 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse3 v_ArrVal_1278) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1277))) .cse4 v_ArrVal_1273) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1275) .cse4 v_ArrVal_1272) .cse6) .cse7)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse33 (+ 8 v_arrayElimCell_54))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse33 (+ 8 v_arrayElimCell_52)))))) .cse15)) (.cse12 (or .cse21 (and (forall ((v_arrayElimCell_52 Int) (v_ArrVal_1277 Int) (v_ArrVal_1278 Int) (v_ArrVal_1275 (Array Int Int)) (v_ArrVal_1274 (Array Int Int)) (v_ArrVal_1273 (Array Int Int)) (v_ArrVal_1272 (Array Int Int)) (v_arrayElimCell_55 Int)) (let ((.cse30 (select (store (let ((.cse31 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1274))) (store .cse31 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse31 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse3 v_ArrVal_1278) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1277))) .cse4 v_ArrVal_1273) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1275) .cse4 v_ArrVal_1272) .cse6) .cse7)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse30 (+ 8 v_arrayElimCell_55))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse30 (+ 8 v_arrayElimCell_52)))))) (or (forall ((v_arrayElimCell_52 Int) (v_ArrVal_1277 Int) (v_ArrVal_1278 Int) (v_ArrVal_1275 (Array Int Int)) (v_ArrVal_1274 (Array Int Int)) (v_ArrVal_1273 (Array Int Int)) (v_ArrVal_1272 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse32 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1274))) (store .cse32 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse32 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse3 v_ArrVal_1278) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1277))) .cse4 v_ArrVal_1273) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1275) .cse4 v_ArrVal_1272) .cse6) .cse7)) (+ 8 v_arrayElimCell_52)))) .cse15)))) (.cse17 (forall ((v_arrayElimCell_52 Int) (v_ArrVal_1277 Int) (v_ArrVal_1278 Int) (v_ArrVal_1275 (Array Int Int)) (v_ArrVal_1274 (Array Int Int)) (v_ArrVal_1273 (Array Int Int)) (v_arrayElimCell_54 Int) (v_ArrVal_1272 (Array Int Int)) (v_arrayElimCell_55 Int)) (let ((.cse28 (select (store (let ((.cse29 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1274))) (store .cse29 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse29 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse3 v_ArrVal_1278) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1277))) .cse4 v_ArrVal_1273) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1275) .cse4 v_ArrVal_1272) .cse6) .cse7)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse28 (+ 8 v_arrayElimCell_55))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse28 (+ 8 v_arrayElimCell_54))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse28 (+ 8 v_arrayElimCell_52))))))) (.cse0 (not .cse15)) (.cse9 (+ |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 8)) (.cse16 (not .cse21))) (and (or .cse0 (forall ((v_ArrVal_1277 Int) (v_ArrVal_1278 Int) (v_ArrVal_1275 (Array Int Int)) (v_ArrVal_1274 (Array Int Int)) (v_ArrVal_1273 (Array Int Int)) (v_arrayElimCell_54 Int) (v_ArrVal_1272 (Array Int Int)) (v_arrayElimCell_55 Int)) (let ((.cse1 (select (store (let ((.cse2 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1274))) (store .cse2 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse2 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse3 v_ArrVal_1278) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1277))) .cse4 v_ArrVal_1273) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1275) .cse4 v_ArrVal_1272) .cse6) .cse7)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse1 (+ 8 v_arrayElimCell_55))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse1 (+ 8 v_arrayElimCell_54))))))) (forall ((v_ArrVal_1277 Int) (v_ArrVal_1278 Int) (v_ArrVal_1275 (Array Int Int)) (v_ArrVal_1274 (Array Int Int)) (v_ArrVal_1273 (Array Int Int)) (v_arrayElimCell_54 Int) (v_ArrVal_1272 (Array Int Int)) (v_arrayElimCell_55 Int)) (let ((.cse8 (select (store (let ((.cse10 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1274))) (store .cse10 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse10 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse3 v_ArrVal_1278) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1277))) .cse4 v_ArrVal_1273) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1275) .cse4 v_ArrVal_1272) .cse6) .cse7)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse8 (+ 8 v_arrayElimCell_55))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse8 (+ 8 v_arrayElimCell_54))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse8 .cse9))))) (or (and .cse11 .cse12 (or (let ((.cse14 (select |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|))) (and (forall ((v_ArrVal_1277 Int) (v_ArrVal_1278 Int) (v_ArrVal_1275 (Array Int Int)) (v_ArrVal_1274 (Array Int Int)) (v_ArrVal_1273 (Array Int Int)) (v_arrayElimCell_54 Int) (v_ArrVal_1272 (Array Int Int))) (let ((.cse13 (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1274) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store .cse14 .cse3 v_ArrVal_1278) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1277)) .cse4 v_ArrVal_1273) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1275) .cse4 v_ArrVal_1272) .cse6) .cse7)))) (or (forall ((v_arrayElimCell_55 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse13 (+ 8 v_arrayElimCell_55)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse13 (+ 8 v_arrayElimCell_54)))))) (or (forall ((v_ArrVal_1277 Int) (v_ArrVal_1278 Int) (v_ArrVal_1275 (Array Int Int)) (v_ArrVal_1274 (Array Int Int)) (v_ArrVal_1273 (Array Int Int)) (v_arrayElimCell_54 Int) (v_ArrVal_1272 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1274) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store .cse14 .cse3 v_ArrVal_1278) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1277)) .cse4 v_ArrVal_1273) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1275) .cse4 v_ArrVal_1272) .cse6) .cse7)) (+ 8 v_arrayElimCell_54)))) .cse15))) .cse16) .cse17) (= .cse6 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|)) (or (= .cse7 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|) (and .cse11 .cse12 .cse17)) (or .cse15 (forall ((v_ArrVal_1277 Int) (v_ArrVal_1278 Int) (v_ArrVal_1275 (Array Int Int)) (v_ArrVal_1274 (Array Int Int)) (v_ArrVal_1273 (Array Int Int)) (v_arrayElimCell_54 Int) (v_ArrVal_1272 (Array Int Int))) (let ((.cse18 (select (store (let ((.cse19 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1274))) (store .cse19 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse19 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse3 v_ArrVal_1278) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1277))) .cse4 v_ArrVal_1273) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1275) .cse4 v_ArrVal_1272) .cse6) .cse7)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse18 (+ 8 v_arrayElimCell_54))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse18 .cse9)))))) (or (forall ((v_ArrVal_1277 Int) (v_ArrVal_1278 Int) (v_ArrVal_1275 (Array Int Int)) (v_ArrVal_1274 (Array Int Int)) (v_ArrVal_1273 (Array Int Int)) (v_ArrVal_1272 (Array Int Int)) (v_arrayElimCell_55 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse20 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1274))) (store .cse20 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse20 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse3 v_ArrVal_1278) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1277))) .cse4 v_ArrVal_1273) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1275) .cse4 v_ArrVal_1272) .cse6) .cse7)) (+ 8 v_arrayElimCell_55)))) .cse0) (or .cse21 (and (or .cse15 (forall ((v_ArrVal_1277 Int) (v_ArrVal_1278 Int) (v_ArrVal_1275 (Array Int Int)) (v_ArrVal_1274 (Array Int Int)) (v_ArrVal_1273 (Array Int Int)) (v_ArrVal_1272 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse22 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1274))) (store .cse22 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse22 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse3 v_ArrVal_1278) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1277))) .cse4 v_ArrVal_1273) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1275) .cse4 v_ArrVal_1272) .cse6) .cse7)) .cse9)))) (forall ((v_ArrVal_1277 Int) (v_ArrVal_1278 Int) (v_ArrVal_1275 (Array Int Int)) (v_ArrVal_1274 (Array Int Int)) (v_ArrVal_1273 (Array Int Int)) (v_ArrVal_1272 (Array Int Int)) (v_arrayElimCell_55 Int)) (let ((.cse23 (select (store (let ((.cse24 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1274))) (store .cse24 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse24 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse3 v_ArrVal_1278) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1277))) .cse4 v_ArrVal_1273) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1275) .cse4 v_ArrVal_1272) .cse6) .cse7)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse23 (+ 8 v_arrayElimCell_55))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse23 .cse9))))))) (or .cse16 (and (forall ((v_ArrVal_1277 Int) (v_ArrVal_1278 Int) (v_ArrVal_1275 (Array Int Int)) (v_ArrVal_1274 (Array Int Int)) (v_ArrVal_1273 (Array Int Int)) (v_arrayElimCell_54 Int) (v_ArrVal_1272 (Array Int Int))) (let ((.cse25 (select (store (let ((.cse26 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1274))) (store .cse26 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse26 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse3 v_ArrVal_1278) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1277))) .cse4 v_ArrVal_1273) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1275) .cse4 v_ArrVal_1272) .cse6) .cse7)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse25 (+ 8 v_arrayElimCell_54))) (forall ((v_arrayElimCell_55 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse25 (+ 8 v_arrayElimCell_55))))))) (or .cse15 (forall ((v_ArrVal_1277 Int) (v_ArrVal_1278 Int) (v_ArrVal_1275 (Array Int Int)) (v_ArrVal_1274 (Array Int Int)) (v_ArrVal_1273 (Array Int Int)) (v_arrayElimCell_54 Int) (v_ArrVal_1272 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse27 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1274))) (store .cse27 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse27 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse3 v_ArrVal_1278) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1277))) .cse4 v_ArrVal_1273) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1275) .cse4 v_ArrVal_1272) .cse6) .cse7)) (+ 8 v_arrayElimCell_54)))))))))))) is different from false [2025-03-08 04:33:32,815 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse37 (select |c_#memory_$Pointer$#2.base| .cse8)) (.cse4 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse9 (select .cse37 .cse4)) (.cse11 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse7 (+ |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| 4)) (.cse10 (store |c_#memory_$Pointer$#2.base| .cse8 (store .cse37 .cse4 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|))) (.cse3 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse20 (= .cse11 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|)) (.cse13 (= .cse9 .cse11))) (let ((.cse18 (+ |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| 8)) (.cse16 (not .cse13)) (.cse0 (or (and (or .cse13 (forall ((v_arrayElimCell_52 Int) (v_ArrVal_1277 Int) (v_ArrVal_1278 Int) (v_ArrVal_1275 (Array Int Int)) (v_ArrVal_1274 (Array Int Int)) (v_ArrVal_1273 (Array Int Int)) (v_ArrVal_1272 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse34 (store |c_#memory_int#2| .cse8 v_ArrVal_1274))) (store .cse34 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse34 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse7 v_ArrVal_1278) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_1277))) .cse9 v_ArrVal_1273) (select (select (store (store .cse10 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1275) .cse9 v_ArrVal_1272) .cse11) .cse3)) (+ 8 v_arrayElimCell_52))))) (forall ((v_arrayElimCell_52 Int) (v_ArrVal_1277 Int) (v_ArrVal_1278 Int) (v_ArrVal_1275 (Array Int Int)) (v_ArrVal_1274 (Array Int Int)) (v_ArrVal_1273 (Array Int Int)) (v_ArrVal_1272 (Array Int Int)) (v_arrayElimCell_55 Int)) (let ((.cse35 (select (store (let ((.cse36 (store |c_#memory_int#2| .cse8 v_ArrVal_1274))) (store .cse36 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse36 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse7 v_ArrVal_1278) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_1277))) .cse9 v_ArrVal_1273) (select (select (store (store .cse10 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1275) .cse9 v_ArrVal_1272) .cse11) .cse3)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse35 (+ 8 v_arrayElimCell_52))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse35 (+ 8 v_arrayElimCell_55))))))) .cse20)) (.cse14 (not .cse20)) (.cse1 (forall ((v_arrayElimCell_52 Int) (v_ArrVal_1277 Int) (v_ArrVal_1278 Int) (v_ArrVal_1275 (Array Int Int)) (v_ArrVal_1274 (Array Int Int)) (v_ArrVal_1273 (Array Int Int)) (v_arrayElimCell_54 Int) (v_ArrVal_1272 (Array Int Int)) (v_arrayElimCell_55 Int)) (let ((.cse32 (select (store (let ((.cse33 (store |c_#memory_int#2| .cse8 v_ArrVal_1274))) (store .cse33 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse33 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse7 v_ArrVal_1278) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_1277))) .cse9 v_ArrVal_1273) (select (select (store (store .cse10 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1275) .cse9 v_ArrVal_1272) .cse11) .cse3)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse32 (+ 8 v_arrayElimCell_52))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse32 (+ 8 v_arrayElimCell_55))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse32 (+ 8 v_arrayElimCell_54))))))) (.cse2 (or (forall ((v_arrayElimCell_52 Int) (v_ArrVal_1277 Int) (v_ArrVal_1278 Int) (v_ArrVal_1275 (Array Int Int)) (v_ArrVal_1274 (Array Int Int)) (v_ArrVal_1273 (Array Int Int)) (v_arrayElimCell_54 Int) (v_ArrVal_1272 (Array Int Int))) (let ((.cse30 (select (store (let ((.cse31 (store |c_#memory_int#2| .cse8 v_ArrVal_1274))) (store .cse31 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse31 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse7 v_ArrVal_1278) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_1277))) .cse9 v_ArrVal_1273) (select (select (store (store .cse10 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1275) .cse9 v_ArrVal_1272) .cse11) .cse3)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse30 (+ 8 v_arrayElimCell_52))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse30 (+ 8 v_arrayElimCell_54)))))) .cse13))) (and (or (and .cse0 .cse1 .cse2) (= .cse3 .cse4)) (or (and (forall ((v_ArrVal_1277 Int) (v_ArrVal_1278 Int) (v_ArrVal_1275 (Array Int Int)) (v_ArrVal_1274 (Array Int Int)) (v_ArrVal_1273 (Array Int Int)) (v_arrayElimCell_54 Int) (v_ArrVal_1272 (Array Int Int))) (let ((.cse5 (select (store (let ((.cse6 (store |c_#memory_int#2| .cse8 v_ArrVal_1274))) (store .cse6 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse6 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse7 v_ArrVal_1278) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_1277))) .cse9 v_ArrVal_1273) (select (select (store (store .cse10 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1275) .cse9 v_ArrVal_1272) .cse11) .cse3)))) (or (forall ((v_arrayElimCell_55 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse5 (+ 8 v_arrayElimCell_55)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse5 (+ 8 v_arrayElimCell_54)))))) (or (forall ((v_ArrVal_1277 Int) (v_ArrVal_1278 Int) (v_ArrVal_1275 (Array Int Int)) (v_ArrVal_1274 (Array Int Int)) (v_ArrVal_1273 (Array Int Int)) (v_arrayElimCell_54 Int) (v_ArrVal_1272 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse12 (store |c_#memory_int#2| .cse8 v_ArrVal_1274))) (store .cse12 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse12 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse7 v_ArrVal_1278) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_1277))) .cse9 v_ArrVal_1273) (select (select (store (store .cse10 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1275) .cse9 v_ArrVal_1272) .cse11) .cse3)) (+ 8 v_arrayElimCell_54)))) .cse13)) .cse14) (or (forall ((v_ArrVal_1277 Int) (v_ArrVal_1278 Int) (v_ArrVal_1275 (Array Int Int)) (v_ArrVal_1274 (Array Int Int)) (v_ArrVal_1273 (Array Int Int)) (v_ArrVal_1272 (Array Int Int)) (v_arrayElimCell_55 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse15 (store |c_#memory_int#2| .cse8 v_ArrVal_1274))) (store .cse15 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse15 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse7 v_ArrVal_1278) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_1277))) .cse9 v_ArrVal_1273) (select (select (store (store .cse10 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1275) .cse9 v_ArrVal_1272) .cse11) .cse3)) (+ 8 v_arrayElimCell_55)))) .cse16) (forall ((v_ArrVal_1277 Int) (v_ArrVal_1278 Int) (v_ArrVal_1275 (Array Int Int)) (v_ArrVal_1274 (Array Int Int)) (v_ArrVal_1273 (Array Int Int)) (v_arrayElimCell_54 Int) (v_ArrVal_1272 (Array Int Int)) (v_arrayElimCell_55 Int)) (let ((.cse17 (select (store (let ((.cse19 (store |c_#memory_int#2| .cse8 v_ArrVal_1274))) (store .cse19 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse19 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse7 v_ArrVal_1278) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_1277))) .cse9 v_ArrVal_1273) (select (select (store (store .cse10 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1275) .cse9 v_ArrVal_1272) .cse11) .cse3)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse17 .cse18)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse17 (+ 8 v_arrayElimCell_55))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse17 (+ 8 v_arrayElimCell_54)))))) (or .cse20 (and (or .cse13 (forall ((v_ArrVal_1277 Int) (v_ArrVal_1278 Int) (v_ArrVal_1275 (Array Int Int)) (v_ArrVal_1274 (Array Int Int)) (v_ArrVal_1273 (Array Int Int)) (v_ArrVal_1272 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse21 (store |c_#memory_int#2| .cse8 v_ArrVal_1274))) (store .cse21 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse21 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse7 v_ArrVal_1278) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_1277))) .cse9 v_ArrVal_1273) (select (select (store (store .cse10 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1275) .cse9 v_ArrVal_1272) .cse11) .cse3)) .cse18)))) (forall ((v_ArrVal_1277 Int) (v_ArrVal_1278 Int) (v_ArrVal_1275 (Array Int Int)) (v_ArrVal_1274 (Array Int Int)) (v_ArrVal_1273 (Array Int Int)) (v_ArrVal_1272 (Array Int Int)) (v_arrayElimCell_55 Int)) (let ((.cse22 (select (store (let ((.cse23 (store |c_#memory_int#2| .cse8 v_ArrVal_1274))) (store .cse23 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse23 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse7 v_ArrVal_1278) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_1277))) .cse9 v_ArrVal_1273) (select (select (store (store .cse10 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1275) .cse9 v_ArrVal_1272) .cse11) .cse3)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse22 .cse18)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse22 (+ 8 v_arrayElimCell_55)))))))) (or (forall ((v_ArrVal_1277 Int) (v_ArrVal_1278 Int) (v_ArrVal_1275 (Array Int Int)) (v_ArrVal_1274 (Array Int Int)) (v_ArrVal_1273 (Array Int Int)) (v_arrayElimCell_54 Int) (v_ArrVal_1272 (Array Int Int))) (let ((.cse24 (select (store (let ((.cse25 (store |c_#memory_int#2| .cse8 v_ArrVal_1274))) (store .cse25 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse25 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse7 v_ArrVal_1278) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_1277))) .cse9 v_ArrVal_1273) (select (select (store (store .cse10 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1275) .cse9 v_ArrVal_1272) .cse11) .cse3)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse24 .cse18)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse24 (+ 8 v_arrayElimCell_54)))))) .cse13) (or (forall ((v_ArrVal_1277 Int) (v_ArrVal_1278 Int) (v_ArrVal_1275 (Array Int Int)) (v_ArrVal_1274 (Array Int Int)) (v_ArrVal_1273 (Array Int Int)) (v_arrayElimCell_54 Int) (v_ArrVal_1272 (Array Int Int)) (v_arrayElimCell_55 Int)) (let ((.cse26 (select (store (let ((.cse27 (store |c_#memory_int#2| .cse8 v_ArrVal_1274))) (store .cse27 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse27 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse7 v_ArrVal_1278) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_1277))) .cse9 v_ArrVal_1273) (select (select (store (store .cse10 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1275) .cse9 v_ArrVal_1272) .cse11) .cse3)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse26 (+ 8 v_arrayElimCell_55))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse26 (+ 8 v_arrayElimCell_54)))))) .cse16) (or (= .cse8 .cse11) (and .cse0 (or (let ((.cse28 (select |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|))) (and (or .cse13 (forall ((v_ArrVal_1277 Int) (v_ArrVal_1278 Int) (v_ArrVal_1275 (Array Int Int)) (v_ArrVal_1274 (Array Int Int)) (v_ArrVal_1273 (Array Int Int)) (v_arrayElimCell_54 Int) (v_ArrVal_1272 (Array Int Int))) (= (select (select (store (store (store |c_#memory_int#2| .cse8 v_ArrVal_1274) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store .cse28 .cse7 v_ArrVal_1278) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_1277)) .cse9 v_ArrVal_1273) (select (select (store (store .cse10 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1275) .cse9 v_ArrVal_1272) .cse11) .cse3)) (+ 8 v_arrayElimCell_54)) |c_ULTIMATE.start_main_~uneq~0#1|))) (forall ((v_ArrVal_1277 Int) (v_ArrVal_1278 Int) (v_ArrVal_1275 (Array Int Int)) (v_ArrVal_1274 (Array Int Int)) (v_ArrVal_1273 (Array Int Int)) (v_arrayElimCell_54 Int) (v_ArrVal_1272 (Array Int Int))) (let ((.cse29 (select (store (store (store |c_#memory_int#2| .cse8 v_ArrVal_1274) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store .cse28 .cse7 v_ArrVal_1278) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_1277)) .cse9 v_ArrVal_1273) (select (select (store (store .cse10 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1275) .cse9 v_ArrVal_1272) .cse11) .cse3)))) (or (forall ((v_arrayElimCell_55 Int)) (= (select .cse29 (+ 8 v_arrayElimCell_55)) |c_ULTIMATE.start_main_~uneq~0#1|)) (= (select .cse29 (+ 8 v_arrayElimCell_54)) |c_ULTIMATE.start_main_~uneq~0#1|)))))) .cse14) .cse1 .cse2)))))))) is different from false [2025-03-08 04:33:41,574 WARN L286 SmtUtils]: Spent 8.50s 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-03-08 04:33:41,575 INFO L349 Elim1Store]: treesize reduction 20610, result has 14.1 percent of original size [2025-03-08 04:33:41,577 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 151073 treesize of output 145435 [2025-03-08 04:33:42,007 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:33:42,008 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 34143 treesize of output 34144 [2025-03-08 04:33:42,274 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:33:42,275 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 34135 treesize of output 34112 [2025-03-08 04:33:42,501 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 34103 treesize of output 34099 [2025-03-08 04:33:42,741 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 34099 treesize of output 34083 [2025-03-08 04:33:43,638 INFO L224 Elim1Store]: Index analysis took 574 ms [2025-03-08 04:33:47,597 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:33:47,599 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 37683 treesize of output 56029 [2025-03-08 04:33:49,177 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:33:49,178 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 35947 treesize of output 35916 [2025-03-08 04:33:50,544 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:33:50,545 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 35981 treesize of output 35962 [2025-03-08 04:33:51,778 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:33:51,779 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 35879 treesize of output 35864 [2025-03-08 04:33:52,808 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:33:52,809 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 35787 treesize of output 35764 [2025-03-08 04:33:53,688 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:33:53,689 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 35755 treesize of output 35732 [2025-03-08 04:33:54,550 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:33:54,551 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 35707 treesize of output 35684 [2025-03-08 04:33:55,278 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 35909 treesize of output 35889 [2025-03-08 04:33:56,173 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 35719 treesize of output 35703 [2025-03-08 04:33:57,106 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:33:57,108 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 36171 treesize of output 36140 [2025-03-08 04:33:58,329 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:33:58,331 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 36115 treesize of output 36102 [2025-03-08 04:33:59,826 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:33:59,827 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 36107 treesize of output 36090 [2025-03-08 04:34:00,903 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:34:00,904 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 35911 treesize of output 35888 [2025-03-08 04:34:01,909 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 35969 treesize of output 35957 [2025-03-08 04:34:03,433 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:34:03,435 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 36247 treesize of output 36224 [2025-03-08 04:34:05,054 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 36245 treesize of output 36225 [2025-03-08 04:34:06,585 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 36055 treesize of output 36039 [2025-03-08 04:34:07,676 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:34:07,677 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 36039 treesize of output 36024 [2025-03-08 04:34:08,730 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 36015 treesize of output 36009 [2025-03-08 04:34:09,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36009 treesize of output 36001 [2025-03-08 04:34:11,200 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:34:11,201 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 36181 treesize of output 36166 [2025-03-08 04:34:13,037 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:34:13,040 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 36323 treesize of output 36306 [2025-03-08 04:34:14,708 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:34:14,709 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 36127 treesize of output 36112 [2025-03-08 04:34:15,972 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:34:15,974 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 36103 treesize of output 36088 [2025-03-08 04:34:17,276 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:34:17,277 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 36063 treesize of output 36040 [2025-03-08 04:34:18,615 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:34:18,616 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36031 treesize of output 36008 [2025-03-08 04:34:19,889 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 36233 treesize of output 36213 [2025-03-08 04:34:21,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36043 treesize of output 36027 [2025-03-08 04:34:22,581 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:34:22,583 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 36441 treesize of output 36422 [2025-03-08 04:34:24,148 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:34:24,150 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 36339 treesize of output 36324 [2025-03-08 04:34:26,027 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:34:26,028 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 36247 treesize of output 36224 [2025-03-08 04:34:27,445 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:34:27,446 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 36215 treesize of output 36192 [2025-03-08 04:34:28,977 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 36167 treesize of output 36151