./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/list-simple/dll2c_insert_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version da043454 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 ../../../trunk/examples/svcomp/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-wip.fs.system-includes-da04345-m [2025-04-30 10:12:36,765 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-30 10:12:36,804 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-30 10:12:36,808 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-30 10:12:36,808 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-30 10:12:36,827 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-30 10:12:36,827 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-30 10:12:36,827 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-30 10:12:36,828 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-30 10:12:36,828 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-30 10:12:36,828 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-30 10:12:36,828 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-30 10:12:36,828 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-30 10:12:36,828 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-30 10:12:36,828 INFO L153 SettingsManager]: * Use SBE=true [2025-04-30 10:12:36,829 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-30 10:12:36,829 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-30 10:12:36,829 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-30 10:12:36,829 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-30 10:12:36,829 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-30 10:12:36,829 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-30 10:12:36,829 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-30 10:12:36,829 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-30 10:12:36,829 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-30 10:12:36,829 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-30 10:12:36,829 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-30 10:12:36,829 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-30 10:12:36,830 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-30 10:12:36,830 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-30 10:12:36,830 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:12:36,830 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:12:36,830 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:12:36,830 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:12:36,830 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-30 10:12:36,830 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:12:36,830 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:12:36,830 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:12:36,830 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:12:36,831 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-30 10:12:36,831 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-30 10:12:36,831 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-30 10:12:36,831 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-30 10:12:36,831 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-30 10:12:36,831 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-30 10:12:36,831 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-30 10:12:36,831 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-30 10:12:36,831 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-30 10:12:36,831 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-04-30 10:12:37,041 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-30 10:12:37,048 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-30 10:12:37,050 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-30 10:12:37,051 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-30 10:12:37,052 INFO L274 PluginConnector]: CDTParser initialized [2025-04-30 10:12:37,053 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/dll2c_insert_unequal.i [2025-04-30 10:12:38,315 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9cc7d75dc/4ec40fb4b2764d23b908964d435b5dd9/FLAGee5df64d2 [2025-04-30 10:12:38,549 INFO L389 CDTParser]: Found 1 translation units. [2025-04-30 10:12:38,549 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2c_insert_unequal.i [2025-04-30 10:12:38,558 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9cc7d75dc/4ec40fb4b2764d23b908964d435b5dd9/FLAGee5df64d2 [2025-04-30 10:12:39,364 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9cc7d75dc/4ec40fb4b2764d23b908964d435b5dd9 [2025-04-30 10:12:39,366 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-30 10:12:39,367 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-30 10:12:39,368 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-30 10:12:39,368 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-30 10:12:39,372 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-30 10:12:39,375 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:12:39" (1/1) ... [2025-04-30 10:12:39,376 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@627de62a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:12:39, skipping insertion in model container [2025-04-30 10:12:39,376 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:12:39" (1/1) ... [2025-04-30 10:12:39,401 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-30 10:12:39,675 WARN L117 LibraryModelHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2c_insert_unequal.i[25148,25161] [2025-04-30 10:12:39,680 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:12:39,689 INFO L200 MainTranslator]: Completed pre-run [2025-04-30 10:12:39,754 WARN L117 LibraryModelHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2c_insert_unequal.i[25148,25161] [2025-04-30 10:12:39,755 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:12:39,777 INFO L204 MainTranslator]: Completed translation [2025-04-30 10:12:39,777 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:12:39 WrapperNode [2025-04-30 10:12:39,777 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-30 10:12:39,778 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-30 10:12:39,778 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-30 10:12:39,778 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-30 10:12:39,782 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:12:39" (1/1) ... [2025-04-30 10:12:39,795 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:12:39" (1/1) ... [2025-04-30 10:12:39,818 INFO L138 Inliner]: procedures = 127, calls = 58, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 176 [2025-04-30 10:12:39,818 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-30 10:12:39,818 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-30 10:12:39,818 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-30 10:12:39,818 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-30 10:12:39,826 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:12:39" (1/1) ... [2025-04-30 10:12:39,826 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:12:39" (1/1) ... [2025-04-30 10:12:39,829 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:12:39" (1/1) ... [2025-04-30 10:12:39,851 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-04-30 10:12:39,851 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:12:39" (1/1) ... [2025-04-30 10:12:39,851 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:12:39" (1/1) ... [2025-04-30 10:12:39,860 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:12:39" (1/1) ... [2025-04-30 10:12:39,864 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:12:39" (1/1) ... [2025-04-30 10:12:39,866 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:12:39" (1/1) ... [2025-04-30 10:12:39,869 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:12:39" (1/1) ... [2025-04-30 10:12:39,870 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:12:39" (1/1) ... [2025-04-30 10:12:39,877 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-30 10:12:39,878 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-30 10:12:39,878 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-30 10:12:39,878 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-30 10:12:39,878 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:12:39" (1/1) ... [2025-04-30 10:12:39,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:12:39,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:12:39,903 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-04-30 10:12:39,904 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-04-30 10:12:39,919 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-30 10:12:39,919 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-30 10:12:39,919 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-04-30 10:12:39,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-30 10:12:39,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-30 10:12:39,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-04-30 10:12:39,919 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2025-04-30 10:12:39,919 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2025-04-30 10:12:39,919 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-30 10:12:39,919 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-30 10:12:39,919 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-04-30 10:12:39,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-04-30 10:12:39,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-04-30 10:12:39,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-04-30 10:12:39,919 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-04-30 10:12:39,919 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-04-30 10:12:39,919 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-04-30 10:12:39,919 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-30 10:12:39,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-04-30 10:12:39,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-04-30 10:12:39,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-04-30 10:12:39,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-30 10:12:39,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-30 10:12:39,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-04-30 10:12:39,920 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-30 10:12:39,920 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-30 10:12:40,013 INFO L234 CfgBuilder]: Building ICFG [2025-04-30 10:12:40,014 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-30 10:12:40,201 INFO L? ?]: Removed 59 outVars from TransFormulas that were not future-live. [2025-04-30 10:12:40,201 INFO L283 CfgBuilder]: Performing block encoding [2025-04-30 10:12:40,208 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-30 10:12:40,208 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-04-30 10:12:40,209 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:12:40 BoogieIcfgContainer [2025-04-30 10:12:40,209 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-30 10:12:40,210 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-30 10:12:40,210 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-30 10:12:40,213 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-30 10:12:40,214 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.04 10:12:39" (1/3) ... [2025-04-30 10:12:40,214 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16063724 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:12:40, skipping insertion in model container [2025-04-30 10:12:40,214 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:12:39" (2/3) ... [2025-04-30 10:12:40,214 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16063724 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:12:40, skipping insertion in model container [2025-04-30 10:12:40,214 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:12:40" (3/3) ... [2025-04-30 10:12:40,215 INFO L128 eAbstractionObserver]: Analyzing ICFG dll2c_insert_unequal.i [2025-04-30 10:12:40,224 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-30 10:12:40,226 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dll2c_insert_unequal.i that has 2 procedures, 40 locations, 60 edges, 1 initial locations, 5 loop locations, and 1 error locations. [2025-04-30 10:12:40,262 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-30 10:12:40,271 INFO L340 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;@223219fe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-30 10:12:40,272 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-04-30 10:12:40,275 INFO L278 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-04-30 10:12:40,279 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-30 10:12:40,279 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:12:40,280 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-04-30 10:12:40,280 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-30 10:12:40,283 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:12:40,283 INFO L85 PathProgramCache]: Analyzing trace with hash 962023410, now seen corresponding path program 1 times [2025-04-30 10:12:40,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:12:40,289 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281377889] [2025-04-30 10:12:40,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:12:40,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:12:40,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-30 10:12:40,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-30 10:12:40,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:12:40,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:12:40,639 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-30 10:12:40,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:12:40,639 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281377889] [2025-04-30 10:12:40,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281377889] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:12:40,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:12:40,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:12:40,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447737300] [2025-04-30 10:12:40,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:12:40,644 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:12:40,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:12:40,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:12:40,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:12:40,659 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-04-30 10:12:40,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:12:40,704 INFO L93 Difference]: Finished difference Result 76 states and 109 transitions. [2025-04-30 10:12:40,705 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:12:40,705 INFO L79 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-04-30 10:12:40,706 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:12:40,710 INFO L225 Difference]: With dead ends: 76 [2025-04-30 10:12:40,710 INFO L226 Difference]: Without dead ends: 38 [2025-04-30 10:12:40,712 INFO L436 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-04-30 10:12:40,715 INFO L437 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-04-30 10:12:40,716 INFO L438 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-04-30 10:12:40,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-04-30 10:12:40,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 34. [2025-04-30 10:12:40,737 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-04-30 10:12:40,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2025-04-30 10:12:40,743 INFO L79 Accepts]: Start accepts. Automaton has 34 states and 45 transitions. Word has length 24 [2025-04-30 10:12:40,743 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:12:40,743 INFO L485 AbstractCegarLoop]: Abstraction has 34 states and 45 transitions. [2025-04-30 10:12:40,744 INFO L486 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-04-30 10:12:40,744 INFO L278 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2025-04-30 10:12:40,745 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-04-30 10:12:40,745 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:12:40,745 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-04-30 10:12:40,745 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-30 10:12:40,745 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-30 10:12:40,746 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:12:40,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1325089798, now seen corresponding path program 1 times [2025-04-30 10:12:40,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:12:40,746 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447339293] [2025-04-30 10:12:40,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:12:40,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:12:40,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-30 10:12:40,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-30 10:12:40,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:12:40,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:12:40,870 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-04-30 10:12:40,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:12:40,870 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447339293] [2025-04-30 10:12:40,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447339293] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:12:40,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:12:40,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:12:40,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317138379] [2025-04-30 10:12:40,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:12:40,871 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:12:40,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:12:40,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:12:40,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:12:40,872 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-04-30 10:12:40,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:12:40,890 INFO L93 Difference]: Finished difference Result 48 states and 65 transitions. [2025-04-30 10:12:40,894 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:12:40,894 INFO L79 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-04-30 10:12:40,894 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:12:40,894 INFO L225 Difference]: With dead ends: 48 [2025-04-30 10:12:40,894 INFO L226 Difference]: Without dead ends: 36 [2025-04-30 10:12:40,895 INFO L436 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-04-30 10:12:40,895 INFO L437 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-04-30 10:12:40,895 INFO L438 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-04-30 10:12:40,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-04-30 10:12:40,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2025-04-30 10:12:40,898 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-04-30 10:12:40,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 48 transitions. [2025-04-30 10:12:40,899 INFO L79 Accepts]: Start accepts. Automaton has 36 states and 48 transitions. Word has length 34 [2025-04-30 10:12:40,899 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:12:40,899 INFO L485 AbstractCegarLoop]: Abstraction has 36 states and 48 transitions. [2025-04-30 10:12:40,899 INFO L486 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-04-30 10:12:40,899 INFO L278 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2025-04-30 10:12:40,900 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-04-30 10:12:40,900 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:12:40,900 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-04-30 10:12:40,900 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-30 10:12:40,900 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-30 10:12:40,900 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:12:40,901 INFO L85 PathProgramCache]: Analyzing trace with hash 551900881, now seen corresponding path program 1 times [2025-04-30 10:12:40,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:12:40,901 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510450964] [2025-04-30 10:12:40,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:12:40,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:12:40,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-30 10:12:41,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-30 10:12:41,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:12:41,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:12:43,227 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:12:43,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:12:43,228 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510450964] [2025-04-30 10:12:43,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510450964] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:12:43,228 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [399551621] [2025-04-30 10:12:43,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:12:43,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:12:43,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:12:43,230 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-04-30 10:12:43,232 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-04-30 10:12:43,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-30 10:12:43,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-30 10:12:43,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:12:43,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:12:43,699 INFO L256 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 134 conjuncts are in the unsatisfiable core [2025-04-30 10:12:43,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:12:43,797 INFO L354 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-04-30 10:12:43,993 INFO L354 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-04-30 10:12:44,088 INFO L325 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-04-30 10:12:44,089 INFO L354 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-04-30 10:12:44,152 INFO L354 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-04-30 10:12:44,162 INFO L354 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-04-30 10:12:44,246 INFO L325 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-04-30 10:12:44,246 INFO L354 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-04-30 10:12:44,252 INFO L354 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-04-30 10:12:44,418 INFO L325 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2025-04-30 10:12:44,418 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 110 treesize of output 59 [2025-04-30 10:12:44,428 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:12:44,431 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 27 [2025-04-30 10:12:44,435 INFO L354 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-04-30 10:12:44,572 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 17 [2025-04-30 10:12:44,579 INFO L354 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-04-30 10:12:44,582 INFO L354 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-04-30 10:12:44,785 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:12:44,787 INFO L354 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 57 treesize of output 34 [2025-04-30 10:12:44,807 INFO L325 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2025-04-30 10:12:44,807 INFO L354 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-04-30 10:12:44,816 INFO L354 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-04-30 10:12:45,010 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 19 [2025-04-30 10:12:45,113 INFO L354 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-04-30 10:12:45,118 INFO L354 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-04-30 10:12:45,176 INFO L354 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-04-30 10:12:45,247 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:12:45,248 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:12:45,301 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_377 (Array Int Int)) (v_ArrVal_379 (Array Int Int)) (v_ArrVal_378 (Array Int Int))) (or (= |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_378) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_377) |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))) (not (= v_ArrVal_378 (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_378 |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset|)))))) is different from false [2025-04-30 10:12:45,318 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_377 (Array Int Int)) (v_ArrVal_379 (Array Int Int)) (v_ArrVal_378 (Array Int Int))) (or (= |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_378) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_377) (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))) (not (= v_ArrVal_378 (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_378 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|)))))) is different from false [2025-04-30 10:12:45,329 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_377 (Array Int Int)) (v_ArrVal_379 (Array Int Int)) (v_ArrVal_378 (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 (not (= v_ArrVal_378 (store (select |c_#memory_int#2| .cse0) .cse1 (select v_ArrVal_378 .cse1)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int#2| .cse0 v_ArrVal_378) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_377) (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)))))) is different from false [2025-04-30 10:12:45,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [399551621] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:12:45,460 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-30 10:12:45,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 46 [2025-04-30 10:12:45,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595722654] [2025-04-30 10:12:45,460 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-30 10:12:45,461 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-04-30 10:12:45,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:12:45,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-04-30 10:12:45,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=2104, Unknown=3, NotChecked=282, Total=2550 [2025-04-30 10:12:45,462 INFO L87 Difference]: Start difference. First operand 36 states and 48 transitions. Second operand has 46 states, 42 states have (on average 1.2857142857142858) internal successors, (54), 37 states have internal predecessors, (54), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-04-30 10:12:46,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:12:46,984 INFO L93 Difference]: Finished difference Result 77 states and 104 transitions. [2025-04-30 10:12:46,984 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-30 10:12:46,985 INFO L79 Accepts]: Start accepts. Automaton has has 46 states, 42 states have (on average 1.2857142857142858) internal successors, (54), 37 states have internal predecessors, (54), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 35 [2025-04-30 10:12:46,985 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:12:46,986 INFO L225 Difference]: With dead ends: 77 [2025-04-30 10:12:46,986 INFO L226 Difference]: Without dead ends: 75 [2025-04-30 10:12:46,988 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1018 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=296, Invalid=3745, Unknown=3, NotChecked=378, Total=4422 [2025-04-30 10:12:46,990 INFO L437 NwaCegarLoop]: 22 mSDtfsCounter, 75 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 1088 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 1107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1088 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-04-30 10:12:46,991 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 446 Invalid, 1107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1088 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-04-30 10:12:46,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-04-30 10:12:46,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 55. [2025-04-30 10:12:46,999 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-04-30 10:12:47,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 73 transitions. [2025-04-30 10:12:47,001 INFO L79 Accepts]: Start accepts. Automaton has 55 states and 73 transitions. Word has length 35 [2025-04-30 10:12:47,002 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:12:47,002 INFO L485 AbstractCegarLoop]: Abstraction has 55 states and 73 transitions. [2025-04-30 10:12:47,002 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 42 states have (on average 1.2857142857142858) internal successors, (54), 37 states have internal predecessors, (54), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-04-30 10:12:47,002 INFO L278 IsEmpty]: Start isEmpty. Operand 55 states and 73 transitions. [2025-04-30 10:12:47,003 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-30 10:12:47,003 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:12:47,004 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-04-30 10:12:47,013 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-04-30 10:12:47,204 WARN L466 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-04-30 10:12:47,204 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-30 10:12:47,205 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:12:47,205 INFO L85 PathProgramCache]: Analyzing trace with hash -1942119066, now seen corresponding path program 2 times [2025-04-30 10:12:47,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:12:47,205 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702193921] [2025-04-30 10:12:47,205 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:12:47,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:12:47,223 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-04-30 10:12:47,239 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-04-30 10:12:47,239 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:12:47,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:12:47,375 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-30 10:12:47,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:12:47,376 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702193921] [2025-04-30 10:12:47,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702193921] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:12:47,376 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1661549971] [2025-04-30 10:12:47,376 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:12:47,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:12:47,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:12:47,378 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-04-30 10:12:47,380 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-04-30 10:12:47,455 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-04-30 10:12:47,522 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-04-30 10:12:47,522 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:12:47,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:12:47,524 INFO L256 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-30 10:12:47,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:12:47,543 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-04-30 10:12:47,544 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:12:47,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1661549971] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:12:47,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-30 10:12:47,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 6 [2025-04-30 10:12:47,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126045879] [2025-04-30 10:12:47,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:12:47,544 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:12:47,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:12:47,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:12:47,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:12:47,545 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-04-30 10:12:47,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:12:47,572 INFO L93 Difference]: Finished difference Result 73 states and 97 transitions. [2025-04-30 10:12:47,574 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:12:47,574 INFO L79 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-04-30 10:12:47,575 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:12:47,575 INFO L225 Difference]: With dead ends: 73 [2025-04-30 10:12:47,575 INFO L226 Difference]: Without dead ends: 57 [2025-04-30 10:12:47,575 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-04-30 10:12:47,576 INFO L437 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-04-30 10:12:47,576 INFO L438 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-04-30 10:12:47,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-04-30 10:12:47,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2025-04-30 10:12:47,582 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-04-30 10:12:47,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 71 transitions. [2025-04-30 10:12:47,584 INFO L79 Accepts]: Start accepts. Automaton has 55 states and 71 transitions. Word has length 36 [2025-04-30 10:12:47,584 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:12:47,584 INFO L485 AbstractCegarLoop]: Abstraction has 55 states and 71 transitions. [2025-04-30 10:12:47,584 INFO L486 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-04-30 10:12:47,584 INFO L278 IsEmpty]: Start isEmpty. Operand 55 states and 71 transitions. [2025-04-30 10:12:47,585 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-30 10:12:47,585 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:12:47,585 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-04-30 10:12:47,592 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-04-30 10:12:47,786 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-04-30 10:12:47,786 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-30 10:12:47,786 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:12:47,786 INFO L85 PathProgramCache]: Analyzing trace with hash -596562324, now seen corresponding path program 1 times [2025-04-30 10:12:47,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:12:47,786 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209400740] [2025-04-30 10:12:47,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:12:47,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:12:47,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-30 10:12:47,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-30 10:12:47,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:12:47,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:12:47,912 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-30 10:12:47,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:12:47,912 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209400740] [2025-04-30 10:12:47,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209400740] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:12:47,912 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1541101316] [2025-04-30 10:12:47,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:12:47,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:12:47,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:12:47,914 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-04-30 10:12:47,916 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-04-30 10:12:48,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-30 10:12:48,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-30 10:12:48,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:12:48,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:12:48,052 INFO L256 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-30 10:12:48,054 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:12:48,080 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-04-30 10:12:48,080 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:12:48,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1541101316] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:12:48,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-30 10:12:48,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2025-04-30 10:12:48,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031732325] [2025-04-30 10:12:48,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:12:48,080 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:12:48,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:12:48,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:12:48,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:12:48,081 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-04-30 10:12:48,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:12:48,100 INFO L93 Difference]: Finished difference Result 71 states and 91 transitions. [2025-04-30 10:12:48,100 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:12:48,100 INFO L79 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-04-30 10:12:48,100 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:12:48,101 INFO L225 Difference]: With dead ends: 71 [2025-04-30 10:12:48,101 INFO L226 Difference]: Without dead ends: 56 [2025-04-30 10:12:48,101 INFO L436 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-04-30 10:12:48,101 INFO L437 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-04-30 10:12:48,101 INFO L438 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-04-30 10:12:48,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-04-30 10:12:48,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2025-04-30 10:12:48,111 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-04-30 10:12:48,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 68 transitions. [2025-04-30 10:12:48,113 INFO L79 Accepts]: Start accepts. Automaton has 54 states and 68 transitions. Word has length 36 [2025-04-30 10:12:48,113 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:12:48,113 INFO L485 AbstractCegarLoop]: Abstraction has 54 states and 68 transitions. [2025-04-30 10:12:48,113 INFO L486 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-04-30 10:12:48,113 INFO L278 IsEmpty]: Start isEmpty. Operand 54 states and 68 transitions. [2025-04-30 10:12:48,114 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-04-30 10:12:48,114 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:12:48,114 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-04-30 10:12:48,121 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-04-30 10:12:48,318 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:12:48,318 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-30 10:12:48,319 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:12:48,319 INFO L85 PathProgramCache]: Analyzing trace with hash -601769353, now seen corresponding path program 1 times [2025-04-30 10:12:48,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:12:48,319 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884753721] [2025-04-30 10:12:48,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:12:48,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:12:48,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-30 10:12:48,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-30 10:12:48,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:12:48,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:12:48,421 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-04-30 10:12:48,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:12:48,422 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884753721] [2025-04-30 10:12:48,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884753721] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:12:48,422 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1966405780] [2025-04-30 10:12:48,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:12:48,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:12:48,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:12:48,424 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-04-30 10:12:48,425 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-04-30 10:12:48,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-30 10:12:48,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-30 10:12:48,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:12:48,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:12:48,566 INFO L256 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-04-30 10:12:48,568 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:12:48,587 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-04-30 10:12:48,587 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:12:48,649 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-04-30 10:12:48,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1966405780] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:12:48,650 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:12:48,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-04-30 10:12:48,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815196394] [2025-04-30 10:12:48,651 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:12:48,652 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-30 10:12:48,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:12:48,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-30 10:12:48,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:12:48,652 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-04-30 10:12:48,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:12:48,729 INFO L93 Difference]: Finished difference Result 67 states and 85 transitions. [2025-04-30 10:12:48,729 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:12:48,730 INFO L79 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-04-30 10:12:48,730 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:12:48,730 INFO L225 Difference]: With dead ends: 67 [2025-04-30 10:12:48,732 INFO L226 Difference]: Without dead ends: 54 [2025-04-30 10:12:48,733 INFO L436 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-04-30 10:12:48,733 INFO L437 NwaCegarLoop]: 38 mSDtfsCounter, 2 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:12:48,733 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 139 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:12:48,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-04-30 10:12:48,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2025-04-30 10:12:48,742 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-04-30 10:12:48,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 67 transitions. [2025-04-30 10:12:48,743 INFO L79 Accepts]: Start accepts. Automaton has 54 states and 67 transitions. Word has length 37 [2025-04-30 10:12:48,744 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:12:48,744 INFO L485 AbstractCegarLoop]: Abstraction has 54 states and 67 transitions. [2025-04-30 10:12:48,744 INFO L486 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-04-30 10:12:48,744 INFO L278 IsEmpty]: Start isEmpty. Operand 54 states and 67 transitions. [2025-04-30 10:12:48,744 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-04-30 10:12:48,744 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:12:48,745 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-04-30 10:12:48,752 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-04-30 10:12:48,949 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:12:48,949 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-30 10:12:48,949 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:12:48,949 INFO L85 PathProgramCache]: Analyzing trace with hash -544511051, now seen corresponding path program 1 times [2025-04-30 10:12:48,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:12:48,950 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626383085] [2025-04-30 10:12:48,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:12:48,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:12:48,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-30 10:12:48,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-30 10:12:48,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:12:48,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:12:49,114 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-30 10:12:49,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:12:49,115 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626383085] [2025-04-30 10:12:49,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626383085] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:12:49,115 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1260823596] [2025-04-30 10:12:49,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:12:49,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:12:49,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:12:49,117 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-04-30 10:12:49,119 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-04-30 10:12:49,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-30 10:12:49,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-30 10:12:49,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:12:49,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:12:49,267 INFO L256 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-30 10:12:49,268 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:12:49,356 INFO L354 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-04-30 10:12:49,382 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:12:49,382 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:12:49,423 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-30 10:12:49,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1260823596] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:12:49,423 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:12:49,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 11] total 15 [2025-04-30 10:12:49,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021233100] [2025-04-30 10:12:49,423 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:12:49,424 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-30 10:12:49,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:12:49,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-30 10:12:49,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2025-04-30 10:12:49,424 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-04-30 10:12:53,447 WARN L532 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-04-30 10:12:57,468 WARN L532 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-04-30 10:13:01,475 WARN L532 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-04-30 10:13:05,494 WARN L532 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-04-30 10:13:09,647 WARN L532 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-04-30 10:13:13,665 WARN L532 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-04-30 10:13:13,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:13:13,672 INFO L93 Difference]: Finished difference Result 87 states and 107 transitions. [2025-04-30 10:13:13,673 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-30 10:13:13,673 INFO L79 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-04-30 10:13:13,673 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:13:13,673 INFO L225 Difference]: With dead ends: 87 [2025-04-30 10:13:13,673 INFO L226 Difference]: Without dead ends: 57 [2025-04-30 10:13:13,674 INFO L436 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-04-30 10:13:13,675 INFO L437 NwaCegarLoop]: 31 mSDtfsCounter, 23 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 1 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.2s IncrementalHoareTripleChecker+Time [2025-04-30 10:13:13,675 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 363 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 204 Invalid, 6 Unknown, 0 Unchecked, 24.2s Time] [2025-04-30 10:13:13,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-04-30 10:13:13,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2025-04-30 10:13:13,686 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-04-30 10:13:13,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 66 transitions. [2025-04-30 10:13:13,687 INFO L79 Accepts]: Start accepts. Automaton has 57 states and 66 transitions. Word has length 37 [2025-04-30 10:13:13,687 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:13:13,687 INFO L485 AbstractCegarLoop]: Abstraction has 57 states and 66 transitions. [2025-04-30 10:13:13,687 INFO L486 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-04-30 10:13:13,687 INFO L278 IsEmpty]: Start isEmpty. Operand 57 states and 66 transitions. [2025-04-30 10:13:13,688 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-04-30 10:13:13,688 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:13:13,688 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:13:13,695 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-30 10:13:13,889 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:13:13,889 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-30 10:13:13,890 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:13:13,890 INFO L85 PathProgramCache]: Analyzing trace with hash 544741097, now seen corresponding path program 1 times [2025-04-30 10:13:13,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:13:13,890 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835461720] [2025-04-30 10:13:13,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:13:13,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:13:13,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-04-30 10:13:13,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-04-30 10:13:13,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:13:13,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:13:14,156 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-30 10:13:14,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:13:14,157 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835461720] [2025-04-30 10:13:14,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835461720] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:13:14,158 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1637813698] [2025-04-30 10:13:14,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:13:14,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:13:14,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:13:14,164 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:13:14,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-30 10:13:14,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-04-30 10:13:14,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-04-30 10:13:14,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:13:14,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:13:14,342 INFO L256 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-30 10:13:14,344 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:13:14,377 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-04-30 10:13:14,377 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:13:14,443 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-04-30 10:13:14,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1637813698] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:13:14,444 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:13:14,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2025-04-30 10:13:14,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027665073] [2025-04-30 10:13:14,444 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:13:14,444 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-30 10:13:14,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:13:14,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-30 10:13:14,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-04-30 10:13:14,445 INFO L87 Difference]: Start difference. First operand 57 states and 66 transitions. Second operand has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 5 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2025-04-30 10:13:14,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:13:14,543 INFO L93 Difference]: Finished difference Result 72 states and 83 transitions. [2025-04-30 10:13:14,543 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-30 10:13:14,543 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 5 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 38 [2025-04-30 10:13:14,544 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:13:14,547 INFO L225 Difference]: With dead ends: 72 [2025-04-30 10:13:14,548 INFO L226 Difference]: Without dead ends: 61 [2025-04-30 10:13:14,548 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2025-04-30 10:13:14,548 INFO L437 NwaCegarLoop]: 32 mSDtfsCounter, 33 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:13:14,548 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 217 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:13:14,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-04-30 10:13:14,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 57. [2025-04-30 10:13:14,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 48 states have internal predecessors, (55), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-04-30 10:13:14,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 65 transitions. [2025-04-30 10:13:14,556 INFO L79 Accepts]: Start accepts. Automaton has 57 states and 65 transitions. Word has length 38 [2025-04-30 10:13:14,557 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:13:14,557 INFO L485 AbstractCegarLoop]: Abstraction has 57 states and 65 transitions. [2025-04-30 10:13:14,557 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 5 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2025-04-30 10:13:14,557 INFO L278 IsEmpty]: Start isEmpty. Operand 57 states and 65 transitions. [2025-04-30 10:13:14,557 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-04-30 10:13:14,557 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:13:14,557 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-04-30 10:13:14,564 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-04-30 10:13:14,758 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:13:14,758 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-30 10:13:14,759 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:13:14,759 INFO L85 PathProgramCache]: Analyzing trace with hash 544815559, now seen corresponding path program 1 times [2025-04-30 10:13:14,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:13:14,759 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193023148] [2025-04-30 10:13:14,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:13:14,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:13:14,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-04-30 10:13:14,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-04-30 10:13:14,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:13:14,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:13:16,309 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:13:16,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:13:16,309 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193023148] [2025-04-30 10:13:16,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193023148] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:13:16,309 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1243467918] [2025-04-30 10:13:16,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:13:16,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:13:16,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:13:16,311 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:13:16,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-30 10:13:16,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-04-30 10:13:16,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-04-30 10:13:16,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:13:16,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:13:16,575 INFO L256 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 130 conjuncts are in the unsatisfiable core [2025-04-30 10:13:16,579 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:13:16,608 INFO L354 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-04-30 10:13:16,773 WARN L849 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 0))) (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 1)) is different from false [2025-04-30 10:13:16,775 WARN L871 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 0))) (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 1)) is different from true [2025-04-30 10:13:16,792 INFO L354 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-04-30 10:13:16,800 WARN L849 $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_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1)) is different from false [2025-04-30 10:13:16,802 WARN L871 $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_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1)) is different from true [2025-04-30 10:13:16,817 INFO L325 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-04-30 10:13:16,817 INFO L354 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-04-30 10:13:16,829 WARN L849 $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_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| .cse0) 1) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_6| |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-04-30 10:13:16,831 WARN L871 $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_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| .cse0) 1) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_6| |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-04-30 10:13:16,848 WARN L849 $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 (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_6| .cse1) 1))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= 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-04-30 10:13:16,849 WARN L871 $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 (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_6| .cse1) 1))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= 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-04-30 10:13:16,873 INFO L325 Elim1Store]: treesize reduction 64, result has 9.9 percent of original size [2025-04-30 10:13:16,873 INFO L354 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 86 treesize of output 32 [2025-04-30 10:13:16,886 INFO L354 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 32 treesize of output 23 [2025-04-30 10:13:16,893 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|))) (let ((.cse1 (select .cse0 0))) (and (= (select .cse0 4) .cse1) (= (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_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 0) (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse2 (select |c_#valid| .cse2))))))))) is different from false [2025-04-30 10:13:16,895 WARN L871 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|))) (let ((.cse1 (select .cse0 0))) (and (= (select .cse0 4) .cse1) (= (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_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 0) (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse2 (select |c_#valid| .cse2))))))))) is different from true [2025-04-30 10:13:16,932 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select |c_#memory_$Pointer$#2.base| .cse2))) (let ((.cse1 (select .cse0 0))) (and (= (select .cse0 4) .cse1) (= (select |c_#valid| .cse2) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~uneq~0#1| |c_ULTIMATE.start_dll_circular_insert_~data#1|) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= |c_#valid| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse3 (select |c_#valid| .cse3)))) (= (select |v_#valid_BEFORE_CALL_6| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_6| .cse1) 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-04-30 10:13:16,934 WARN L871 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select |c_#memory_$Pointer$#2.base| .cse2))) (let ((.cse1 (select .cse0 0))) (and (= (select .cse0 4) .cse1) (= (select |c_#valid| .cse2) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~uneq~0#1| |c_ULTIMATE.start_dll_circular_insert_~data#1|) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= |c_#valid| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse3 (select |c_#valid| .cse3)))) (= (select |v_#valid_BEFORE_CALL_6| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_6| .cse1) 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-04-30 10:13:16,950 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 9 [2025-04-30 10:13:16,968 WARN L849 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_28 Int) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_28) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))))))) (= |c_#valid| |c_old(#valid)|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from false [2025-04-30 10:13:16,969 WARN L871 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_28 Int) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_28) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))))))) (= |c_#valid| |c_old(#valid)|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from true [2025-04-30 10:13:16,990 WARN L849 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_28 Int) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_28) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))))))) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_node_create_~temp~0#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from false [2025-04-30 10:13:16,991 WARN L871 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_28 Int) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_28) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))))))) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_node_create_~temp~0#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from true [2025-04-30 10:13:17,030 INFO L354 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-04-30 10:13:17,035 WARN L849 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_28 Int) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_28) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))))))) (= |c_node_create_#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|)) is different from false [2025-04-30 10:13:17,036 WARN L871 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_28 Int) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_28) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))))))) (= |c_node_create_#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|)) is different from true [2025-04-30 10:13:17,094 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:13:17,094 INFO L354 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 41 treesize of output 24 [2025-04-30 10:13:17,127 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse5 (select |c_#memory_$Pointer$#2.base| .cse0))) (let ((.cse1 (select .cse5 0))) (and (exists ((|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_21| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_9| .cse1) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_21| |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|)) (= (select |v_#valid_BEFORE_CALL_9| .cse0) 0) (= |v_old(#valid)_AFTER_CALL_21| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_21|))) (store |v_#valid_BEFORE_CALL_9| .cse2 (select |v_old(#valid)_AFTER_CALL_21| .cse2)))))) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_28 Int) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_28) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse3) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse4 (select |v_#valid_BEFORE_CALL_7| .cse4))))))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) 8)) (= (select .cse5 4) .cse1) (= |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) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0))))) is different from false [2025-04-30 10:13:17,130 WARN L871 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse5 (select |c_#memory_$Pointer$#2.base| .cse0))) (let ((.cse1 (select .cse5 0))) (and (exists ((|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_21| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_9| .cse1) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_21| |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|)) (= (select |v_#valid_BEFORE_CALL_9| .cse0) 0) (= |v_old(#valid)_AFTER_CALL_21| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_21|))) (store |v_#valid_BEFORE_CALL_9| .cse2 (select |v_old(#valid)_AFTER_CALL_21| .cse2)))))) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_28 Int) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_28) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse3) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse4 (select |v_#valid_BEFORE_CALL_7| .cse4))))))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) 8)) (= (select .cse5 4) .cse1) (= |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) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0))))) is different from true [2025-04-30 10:13:17,202 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select |c_#memory_$Pointer$#2.base| .cse4))) (let ((.cse3 (select .cse2 0))) (and (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_28 Int) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_28) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))))))) (= (select .cse2 4) .cse3) (= |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_21| (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_21| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_21| .cse4) 1) (= (select |v_#valid_BEFORE_CALL_9| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_9| .cse4) 0) (= |v_old(#valid)_AFTER_CALL_21| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_21|))) (store |v_#valid_BEFORE_CALL_9| .cse5 (select |v_old(#valid)_AFTER_CALL_21| .cse5)))))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= .cse4 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|))))) is different from false [2025-04-30 10:13:17,205 WARN L871 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select |c_#memory_$Pointer$#2.base| .cse4))) (let ((.cse3 (select .cse2 0))) (and (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_28 Int) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_28) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))))))) (= (select .cse2 4) .cse3) (= |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_21| (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_21| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_21| .cse4) 1) (= (select |v_#valid_BEFORE_CALL_9| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_9| .cse4) 0) (= |v_old(#valid)_AFTER_CALL_21| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_21|))) (store |v_#valid_BEFORE_CALL_9| .cse5 (select |v_old(#valid)_AFTER_CALL_21| .cse5)))))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= .cse4 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|))))) is different from true [2025-04-30 10:13:17,276 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse3 (select |c_#memory_$Pointer$#2.base| .cse4))) (let ((.cse2 (select .cse3 0))) (and (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_28 Int) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_28) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))))))) (= .cse2 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) (= (select .cse3 4) .cse2) (= |c_ULTIMATE.start_main_~#s~0#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)) (= |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| 0) (= .cse4 |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_21| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_21| .cse4) 1) (= (select |v_#valid_BEFORE_CALL_9| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_9| .cse4) 0) (= |v_old(#valid)_AFTER_CALL_21| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_21|))) (store |v_#valid_BEFORE_CALL_9| .cse5 (select |v_old(#valid)_AFTER_CALL_21| .cse5)))))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0))))) is different from false [2025-04-30 10:13:17,279 WARN L871 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse3 (select |c_#memory_$Pointer$#2.base| .cse4))) (let ((.cse2 (select .cse3 0))) (and (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_28 Int) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_28) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))))))) (= .cse2 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) (= (select .cse3 4) .cse2) (= |c_ULTIMATE.start_main_~#s~0#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)) (= |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| 0) (= .cse4 |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_21| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_21| .cse4) 1) (= (select |v_#valid_BEFORE_CALL_9| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_9| .cse4) 0) (= |v_old(#valid)_AFTER_CALL_21| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_21|))) (store |v_#valid_BEFORE_CALL_9| .cse5 (select |v_old(#valid)_AFTER_CALL_21| .cse5)))))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0))))) is different from true [2025-04-30 10:13:17,363 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:13:17,367 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:13:17,368 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:13:17,369 INFO L354 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-04-30 10:13:17,380 INFO L354 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-04-30 10:13:17,385 INFO L354 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 0 case distinctions, treesize of input 119 treesize of output 61 [2025-04-30 10:13:17,404 INFO L325 Elim1Store]: treesize reduction 94, result has 8.7 percent of original size [2025-04-30 10:13:17,404 INFO L354 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 180 treesize of output 97 [2025-04-30 10:13:17,418 INFO L354 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-04-30 10:13:17,439 INFO L325 Elim1Store]: treesize reduction 88, result has 31.3 percent of original size [2025-04-30 10:13:17,439 INFO L354 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 1 case distinctions, treesize of input 57 treesize of output 46 [2025-04-30 10:13:17,455 INFO L354 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 0 case distinctions, treesize of input 202 treesize of output 104 [2025-04-30 10:13:17,463 INFO L325 Elim1Store]: treesize reduction 39, result has 2.5 percent of original size [2025-04-30 10:13:17,463 INFO L354 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 178 treesize of output 108 [2025-04-30 10:13:17,468 WARN L195 Elim1Store]: Array PQE input equivalent to false [2025-04-30 10:13:17,473 INFO L354 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 0 case distinctions, treesize of input 188 treesize of output 90 [2025-04-30 10:13:17,480 INFO L325 Elim1Store]: treesize reduction 39, result has 2.5 percent of original size [2025-04-30 10:13:17,480 INFO L354 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 164 treesize of output 94 [2025-04-30 10:13:17,486 WARN L195 Elim1Store]: Array PQE input equivalent to false [2025-04-30 10:13:17,498 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse6 (select |c_#memory_$Pointer$#2.base| .cse3))) (let ((.cse4 (select .cse6 4)) (.cse2 (select .cse6 0))) (and (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_28 Int) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_28) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))))))) (= (select (select |c_#memory_int#2| .cse2) 8) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= .cse3 .cse2) (= .cse4 .cse3) (= 0 (select (select |c_#memory_$Pointer$#2.offset| .cse3) 0))) (exists ((|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_9| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_21| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_21| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_9| .cse3) 0) (= |v_old(#valid)_AFTER_CALL_21| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_21|))) (store |v_#valid_BEFORE_CALL_9| .cse5 (select |v_old(#valid)_AFTER_CALL_21| .cse5)))))) (not (= .cse4 .cse2)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0))))) is different from false [2025-04-30 10:13:17,501 WARN L871 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse6 (select |c_#memory_$Pointer$#2.base| .cse3))) (let ((.cse4 (select .cse6 4)) (.cse2 (select .cse6 0))) (and (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_28 Int) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_28) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))))))) (= (select (select |c_#memory_int#2| .cse2) 8) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= .cse3 .cse2) (= .cse4 .cse3) (= 0 (select (select |c_#memory_$Pointer$#2.offset| .cse3) 0))) (exists ((|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_9| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_21| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_21| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_9| .cse3) 0) (= |v_old(#valid)_AFTER_CALL_21| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_21|))) (store |v_#valid_BEFORE_CALL_9| .cse5 (select |v_old(#valid)_AFTER_CALL_21| .cse5)))))) (not (= .cse4 .cse2)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0))))) is different from true [2025-04-30 10:13:17,523 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:13:17,524 INFO L354 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 147 treesize of output 95 [2025-04-30 10:13:17,608 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~ptr~0#1.base|))) (let ((.cse1 (select .cse4 4)) (.cse0 (select .cse4 0))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse0) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse1)) (exists ((|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_21| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= 1 (select |v_#valid_BEFORE_CALL_9| .cse1)) (= |v_old(#valid)_AFTER_CALL_21| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_21|))) (store |v_#valid_BEFORE_CALL_9| .cse2 (select |v_old(#valid)_AFTER_CALL_21| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_21| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#2| .cse0) 8)) (or (and (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_28 Int)) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_7| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_28) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse3 (select |v_#valid_BEFORE_CALL_7| .cse3)))))) (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|))))) (not (= .cse1 .cse0)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0)))) is different from false [2025-04-30 10:13:17,615 WARN L871 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~ptr~0#1.base|))) (let ((.cse1 (select .cse4 4)) (.cse0 (select .cse4 0))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse0) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse1)) (exists ((|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_21| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= 1 (select |v_#valid_BEFORE_CALL_9| .cse1)) (= |v_old(#valid)_AFTER_CALL_21| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_21|))) (store |v_#valid_BEFORE_CALL_9| .cse2 (select |v_old(#valid)_AFTER_CALL_21| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_21| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#2| .cse0) 8)) (or (and (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (v_arrayElimCell_28 Int)) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_7| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_28) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse3 (select |v_#valid_BEFORE_CALL_7| .cse3)))))) (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|))))) (not (= .cse1 .cse0)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0)))) is different from true [2025-04-30 10:13:17,692 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 39 [2025-04-30 10:13:17,699 INFO L354 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 22 treesize of output 14 [2025-04-30 10:13:17,713 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:13:17,713 INFO L354 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-04-30 10:13:17,818 WARN L849 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (v_arrayElimCell_46 Int) (|v_ULTIMATE.start_main_~ptr~0#1.base_22| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_21| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_main_~ptr~0#1.base_22|) 0) (= |v_old(#valid)_AFTER_CALL_21| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_21|))) (store |v_#valid_BEFORE_CALL_9| .cse0 (select |v_old(#valid)_AFTER_CALL_21| .cse0)))) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_46) 1) (= (select |v_old(#valid)_AFTER_CALL_21| |v_ULTIMATE.start_main_~ptr~0#1.base_22|) 1))) (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_main_~ptr~0#1.base|) 8) |c_ULTIMATE.start_main_~uneq~0#1|)) is different from false [2025-04-30 10:13:17,820 WARN L871 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (v_arrayElimCell_46 Int) (|v_ULTIMATE.start_main_~ptr~0#1.base_22| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_21| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_main_~ptr~0#1.base_22|) 0) (= |v_old(#valid)_AFTER_CALL_21| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_9| |v_old(#valid)_AFTER_CALL_21|))) (store |v_#valid_BEFORE_CALL_9| .cse0 (select |v_old(#valid)_AFTER_CALL_21| .cse0)))) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_46) 1) (= (select |v_old(#valid)_AFTER_CALL_21| |v_ULTIMATE.start_main_~ptr~0#1.base_22|) 1))) (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_main_~ptr~0#1.base|) 8) |c_ULTIMATE.start_main_~uneq~0#1|)) is different from true [2025-04-30 10:13:17,845 INFO L354 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-04-30 10:13:17,848 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2025-04-30 10:13:17,848 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:13:17,921 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:13:17,922 INFO L354 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-04-30 10:13:17,929 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:13:17,929 INFO L354 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-04-30 10:13:17,934 INFO L354 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 300 treesize of output 288 [2025-04-30 10:13:17,940 INFO L354 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 146 treesize of output 140 [2025-04-30 10:13:18,363 WARN L849 $PredicateComparison]: unable to prove that (let ((.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 ((.cse9 (+ |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 4)) (.cse10 (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|))) (.cse0 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (= .cse11 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|))) (let ((.cse7 (+ |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 8)) (.cse14 (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| .cse11)) (.cse23 (not .cse5)) (.cse29 (forall ((v_arrayElimCell_52 Int) (v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1565 Int) (v_ArrVal_1562 (Array Int Int)) (v_ArrVal_1564 Int) (v_ArrVal_1561 (Array Int Int)) (v_ArrVal_1560 (Array Int Int)) (v_arrayElimCell_54 Int)) (let ((.cse33 (select (store (let ((.cse34 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1560))) (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|) .cse9 v_ArrVal_1565) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1564))) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1556) (select (select (store (store .cse10 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1562) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1561) .cse11) .cse0)))) (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)))))))) (let ((.cse1 (forall ((v_arrayElimCell_52 Int) (v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1565 Int) (v_ArrVal_1562 (Array Int Int)) (v_ArrVal_1564 Int) (v_ArrVal_1561 (Array Int Int)) (v_ArrVal_1560 (Array Int Int)) (v_arrayElimCell_54 Int)) (let ((.cse31 (select (store (let ((.cse32 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1560))) (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|) .cse9 v_ArrVal_1565) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1564))) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1556) (select (select (store (store .cse10 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1562) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1561) .cse11) .cse0)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse31 (+ 8 v_arrayElimCell_54))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse31 (+ 8 v_arrayElimCell_52))) (forall ((v_arrayElimCell_55 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse31 (+ 8 v_arrayElimCell_55)))))))) (.cse2 (or .cse23 .cse29)) (.cse3 (or .cse14 (and .cse29 (or (forall ((v_arrayElimCell_52 Int) (v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1565 Int) (v_ArrVal_1562 (Array Int Int)) (v_ArrVal_1564 Int) (v_ArrVal_1561 (Array Int Int)) (v_ArrVal_1560 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse30 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1560))) (store .cse30 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse30 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse9 v_ArrVal_1565) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1564))) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1556) (select (select (store (store .cse10 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1562) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1561) .cse11) .cse0)) (+ 8 v_arrayElimCell_52)))) .cse5)))) (.cse4 (or (forall ((v_arrayElimCell_52 Int) (v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1565 Int) (v_ArrVal_1562 (Array Int Int)) (v_ArrVal_1564 Int) (v_ArrVal_1561 (Array Int Int)) (v_ArrVal_1560 (Array Int Int)) (v_arrayElimCell_55 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_1560))) (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|) .cse9 v_ArrVal_1565) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1564))) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1556) (select (select (store (store .cse10 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1562) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1561) .cse11) .cse0)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse27 (+ 8 v_arrayElimCell_52))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse27 (+ 8 v_arrayElimCell_55)))))) .cse5)) (.cse15 (not .cse14)) (.cse13 (forall ((v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1565 Int) (v_ArrVal_1562 (Array Int Int)) (v_ArrVal_1564 Int) (v_ArrVal_1561 (Array Int Int)) (v_ArrVal_1560 (Array Int Int)) (v_arrayElimCell_54 Int)) (let ((.cse25 (select (store (let ((.cse26 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1560))) (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|) .cse9 v_ArrVal_1565) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1564))) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1556) (select (select (store (store .cse10 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1562) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1561) .cse11) .cse0)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse25 .cse7)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse25 (+ 8 v_arrayElimCell_54)))))))) (and (or (= .cse0 |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset|) (and .cse1 .cse2 .cse3 .cse4)) (or .cse5 (forall ((v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1565 Int) (v_ArrVal_1562 (Array Int Int)) (v_ArrVal_1564 Int) (v_ArrVal_1561 (Array Int Int)) (v_ArrVal_1560 (Array Int Int)) (v_arrayElimCell_55 Int)) (let ((.cse6 (select (store (let ((.cse8 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1560))) (store .cse8 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse8 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse9 v_ArrVal_1565) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1564))) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1556) (select (select (store (store .cse10 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1562) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1561) .cse11) .cse0)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse6 .cse7)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse6 (+ 8 v_arrayElimCell_55))))))) (or (and (or (forall ((v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1565 Int) (v_ArrVal_1562 (Array Int Int)) (v_ArrVal_1564 Int) (v_ArrVal_1561 (Array Int Int)) (v_ArrVal_1560 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse12 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1560))) (store .cse12 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse12 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse9 v_ArrVal_1565) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1564))) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1556) (select (select (store (store .cse10 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1562) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1561) .cse11) .cse0)) .cse7))) .cse5) .cse13) .cse14) (or (= .cse11 |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) (and .cse1 (or .cse15 (let ((.cse17 (select |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|))) (and (forall ((v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1565 Int) (v_ArrVal_1562 (Array Int Int)) (v_ArrVal_1564 Int) (v_ArrVal_1561 (Array Int Int)) (v_ArrVal_1560 (Array Int Int)) (v_arrayElimCell_54 Int)) (let ((.cse16 (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1560) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store .cse17 .cse9 v_ArrVal_1565) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1564)) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1556) (select (select (store (store .cse10 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1562) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1561) .cse11) .cse0)))) (or (forall ((v_arrayElimCell_55 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse16 (+ 8 v_arrayElimCell_55)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse16 (+ 8 v_arrayElimCell_54)))))) (or (forall ((v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1565 Int) (v_ArrVal_1562 (Array Int Int)) (v_ArrVal_1564 Int) (v_ArrVal_1561 (Array Int Int)) (v_ArrVal_1560 (Array Int Int)) (v_arrayElimCell_55 Int)) (= |c_ULTIMATE.start_main_~uneq~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_1560) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store .cse17 .cse9 v_ArrVal_1565) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1564)) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1556) (select (select (store (store .cse10 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1562) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1561) .cse11) .cse0)) (+ 8 v_arrayElimCell_55)))) .cse5)))) .cse2 .cse3 .cse4)) (or (and (forall ((v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1565 Int) (v_ArrVal_1562 (Array Int Int)) (v_ArrVal_1564 Int) (v_ArrVal_1561 (Array Int Int)) (v_ArrVal_1560 (Array Int Int)) (v_arrayElimCell_54 Int)) (let ((.cse18 (select (store (let ((.cse19 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1560))) (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|) .cse9 v_ArrVal_1565) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1564))) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1556) (select (select (store (store .cse10 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1562) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1561) .cse11) .cse0)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse18 (+ 8 v_arrayElimCell_54))) (forall ((v_arrayElimCell_55 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse18 (+ 8 v_arrayElimCell_55))))))) (or (forall ((v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1565 Int) (v_ArrVal_1562 (Array Int Int)) (v_ArrVal_1564 Int) (v_ArrVal_1561 (Array Int Int)) (v_ArrVal_1560 (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_~snd_to_last~0#1.base| v_ArrVal_1560))) (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|) .cse9 v_ArrVal_1565) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1564))) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1556) (select (select (store (store .cse10 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1562) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1561) .cse11) .cse0)) (+ 8 v_arrayElimCell_55)))) .cse5)) .cse15) (forall ((v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1565 Int) (v_ArrVal_1562 (Array Int Int)) (v_ArrVal_1564 Int) (v_ArrVal_1561 (Array Int Int)) (v_ArrVal_1560 (Array Int Int)) (v_arrayElimCell_54 Int)) (let ((.cse21 (select (store (let ((.cse22 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1560))) (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|) .cse9 v_ArrVal_1565) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1564))) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1556) (select (select (store (store .cse10 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1562) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1561) .cse11) .cse0)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse21 .cse7)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse21 (+ 8 v_arrayElimCell_54))) (forall ((v_arrayElimCell_55 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse21 (+ 8 v_arrayElimCell_55))))))) (or .cse23 (forall ((v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1565 Int) (v_ArrVal_1562 (Array Int Int)) (v_ArrVal_1564 Int) (v_ArrVal_1561 (Array Int Int)) (v_ArrVal_1560 (Array Int Int)) (v_arrayElimCell_54 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse24 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1560))) (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|) .cse9 v_ArrVal_1565) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1564))) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1556) (select (select (store (store .cse10 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1562) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1561) .cse11) .cse0)) (+ 8 v_arrayElimCell_54))))) (or .cse23 .cse13)))))) is different from false [2025-04-30 10:13:18,998 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse36 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|))) (let ((.cse4 (select .cse36 |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 ((.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 .cse36 |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|)) (.cse16 (= .cse4 .cse6))) (let ((.cse1 (+ |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 8)) (.cse13 (not .cse16)) (.cse21 (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| .cse6)) (.cse28 (forall ((v_arrayElimCell_52 Int) (v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1565 Int) (v_ArrVal_1562 (Array Int Int)) (v_ArrVal_1564 Int) (v_ArrVal_1561 (Array Int Int)) (v_ArrVal_1560 (Array Int Int)) (v_arrayElimCell_54 Int)) (let ((.cse34 (select (store (let ((.cse35 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1560))) (store .cse35 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse35 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse3 v_ArrVal_1565) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1564))) .cse4 v_ArrVal_1556) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1562) .cse4 v_ArrVal_1561) .cse6) .cse7)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse34 (+ 8 v_arrayElimCell_54))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse34 (+ 8 v_arrayElimCell_52)))))))) (let ((.cse8 (forall ((v_arrayElimCell_52 Int) (v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1565 Int) (v_ArrVal_1562 (Array Int Int)) (v_ArrVal_1564 Int) (v_ArrVal_1561 (Array Int Int)) (v_ArrVal_1560 (Array Int Int)) (v_arrayElimCell_54 Int)) (let ((.cse32 (select (store (let ((.cse33 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1560))) (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_1565) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1564))) .cse4 v_ArrVal_1556) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1562) .cse4 v_ArrVal_1561) .cse6) .cse7)))) (or (= |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))) (forall ((v_arrayElimCell_55 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse32 (+ 8 v_arrayElimCell_55)))))))) (.cse9 (or .cse16 (forall ((v_arrayElimCell_52 Int) (v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1565 Int) (v_ArrVal_1562 (Array Int Int)) (v_ArrVal_1564 Int) (v_ArrVal_1561 (Array Int Int)) (v_ArrVal_1560 (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_1560))) (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_1565) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1564))) .cse4 v_ArrVal_1556) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1562) .cse4 v_ArrVal_1561) .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)))))))) (.cse10 (or .cse21 (and (or (forall ((v_arrayElimCell_52 Int) (v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1565 Int) (v_ArrVal_1562 (Array Int Int)) (v_ArrVal_1564 Int) (v_ArrVal_1561 (Array Int Int)) (v_ArrVal_1560 (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_~last~1#1.base| v_ArrVal_1560))) (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_1565) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1564))) .cse4 v_ArrVal_1556) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1562) .cse4 v_ArrVal_1561) .cse6) .cse7)) (+ 8 v_arrayElimCell_52)))) .cse16) .cse28))) (.cse18 (not .cse21)) (.cse11 (or .cse28 .cse13)) (.cse20 (forall ((v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1565 Int) (v_ArrVal_1562 (Array Int Int)) (v_ArrVal_1564 Int) (v_ArrVal_1561 (Array Int Int)) (v_ArrVal_1560 (Array Int Int)) (v_arrayElimCell_54 Int)) (let ((.cse26 (select (store (let ((.cse27 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1560))) (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_1565) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1564))) .cse4 v_ArrVal_1556) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1562) .cse4 v_ArrVal_1561) .cse6) .cse7)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse26 (+ 8 v_arrayElimCell_54))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse26 .cse1))))))) (and (forall ((v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1565 Int) (v_ArrVal_1562 (Array Int Int)) (v_ArrVal_1564 Int) (v_ArrVal_1561 (Array Int Int)) (v_ArrVal_1560 (Array Int Int)) (v_arrayElimCell_54 Int)) (let ((.cse0 (select (store (let ((.cse2 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1560))) (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_1565) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1564))) .cse4 v_ArrVal_1556) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1562) .cse4 v_ArrVal_1561) .cse6) .cse7)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse0 (+ 8 v_arrayElimCell_54))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse0 .cse1)) (forall ((v_arrayElimCell_55 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse0 (+ 8 v_arrayElimCell_55))))))) (or (and .cse8 .cse9 .cse10 .cse11) (= .cse7 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|)) (or (forall ((v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1565 Int) (v_ArrVal_1562 (Array Int Int)) (v_ArrVal_1564 Int) (v_ArrVal_1561 (Array Int Int)) (v_ArrVal_1560 (Array Int Int)) (v_arrayElimCell_54 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse12 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1560))) (store .cse12 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse12 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse3 v_ArrVal_1565) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1564))) .cse4 v_ArrVal_1556) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1562) .cse4 v_ArrVal_1561) .cse6) .cse7)) (+ 8 v_arrayElimCell_54)))) .cse13) (or (and (forall ((v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1565 Int) (v_ArrVal_1562 (Array Int Int)) (v_ArrVal_1564 Int) (v_ArrVal_1561 (Array Int Int)) (v_ArrVal_1560 (Array Int Int)) (v_arrayElimCell_54 Int)) (let ((.cse14 (select (store (let ((.cse15 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1560))) (store .cse15 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse15 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse3 v_ArrVal_1565) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1564))) .cse4 v_ArrVal_1556) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1562) .cse4 v_ArrVal_1561) .cse6) .cse7)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse14 (+ 8 v_arrayElimCell_54))) (forall ((v_arrayElimCell_55 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse14 (+ 8 v_arrayElimCell_55))))))) (or .cse16 (forall ((v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1565 Int) (v_ArrVal_1562 (Array Int Int)) (v_ArrVal_1564 Int) (v_ArrVal_1561 (Array Int Int)) (v_ArrVal_1560 (Array Int Int)) (v_arrayElimCell_55 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse17 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1560))) (store .cse17 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse17 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse3 v_ArrVal_1565) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1564))) .cse4 v_ArrVal_1556) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1562) .cse4 v_ArrVal_1561) .cse6) .cse7)) (+ 8 v_arrayElimCell_55)))))) .cse18) (or (and (or (forall ((v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1565 Int) (v_ArrVal_1562 (Array Int Int)) (v_ArrVal_1564 Int) (v_ArrVal_1561 (Array Int Int)) (v_ArrVal_1560 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse19 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1560))) (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_1565) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1564))) .cse4 v_ArrVal_1556) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1562) .cse4 v_ArrVal_1561) .cse6) .cse7)) .cse1))) .cse16) .cse20) .cse21) (or (and .cse8 .cse9 .cse10 (or (let ((.cse22 (select |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|))) (and (or (forall ((v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1565 Int) (v_ArrVal_1562 (Array Int Int)) (v_ArrVal_1564 Int) (v_ArrVal_1561 (Array Int Int)) (v_ArrVal_1560 (Array Int Int)) (v_arrayElimCell_55 Int)) (= (select (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1560) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store .cse22 .cse3 v_ArrVal_1565) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1564)) .cse4 v_ArrVal_1556) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1562) .cse4 v_ArrVal_1561) .cse6) .cse7)) (+ 8 v_arrayElimCell_55)) |c_ULTIMATE.start_main_~uneq~0#1|)) .cse16) (forall ((v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1565 Int) (v_ArrVal_1562 (Array Int Int)) (v_ArrVal_1564 Int) (v_ArrVal_1561 (Array Int Int)) (v_ArrVal_1560 (Array Int Int)) (v_arrayElimCell_54 Int)) (let ((.cse23 (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1560) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store .cse22 .cse3 v_ArrVal_1565) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1564)) .cse4 v_ArrVal_1556) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1562) .cse4 v_ArrVal_1561) .cse6) .cse7)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse23 (+ 8 v_arrayElimCell_54))) (forall ((v_arrayElimCell_55 Int)) (= (select .cse23 (+ 8 v_arrayElimCell_55)) |c_ULTIMATE.start_main_~uneq~0#1|))))))) .cse18) .cse11) (= .cse6 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|)) (or .cse13 .cse20) (or .cse16 (forall ((v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1565 Int) (v_ArrVal_1562 (Array Int Int)) (v_ArrVal_1564 Int) (v_ArrVal_1561 (Array Int Int)) (v_ArrVal_1560 (Array Int Int)) (v_arrayElimCell_55 Int)) (let ((.cse24 (select (store (let ((.cse25 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1560))) (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_1565) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1564))) .cse4 v_ArrVal_1556) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1562) .cse4 v_ArrVal_1561) .cse6) .cse7)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse24 (+ 8 v_arrayElimCell_55))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse24 .cse1)))))))))))) is different from false [2025-04-30 10:13:19,332 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse2 (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 ((.cse38 (select |c_#memory_$Pointer$#2.base| .cse2)) (.cse15 (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 ((.cse3 (select .cse38 .cse15)) (.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 ((.cse1 (+ |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| 4)) (.cse4 (store |c_#memory_$Pointer$#2.base| .cse2 (store .cse38 .cse15 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#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|)) (.cse7 (= .cse3 .cse5))) (let ((.cse17 (+ |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| 8)) (.cse24 (not .cse7)) (.cse33 (forall ((v_arrayElimCell_52 Int) (v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1565 Int) (v_ArrVal_1562 (Array Int Int)) (v_ArrVal_1564 Int) (v_ArrVal_1561 (Array Int Int)) (v_ArrVal_1560 (Array Int Int)) (v_arrayElimCell_54 Int)) (let ((.cse36 (select (store (let ((.cse37 (store |c_#memory_int#2| .cse2 v_ArrVal_1560))) (store .cse37 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse37 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse1 v_ArrVal_1565) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_1564))) .cse3 v_ArrVal_1556) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1562) .cse3 v_ArrVal_1561) .cse5) .cse6)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse36 (+ 8 v_arrayElimCell_52))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse36 (+ 8 v_arrayElimCell_54))))))) (.cse21 (= .cse5 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|))) (let ((.cse10 (not .cse21)) (.cse11 (forall ((v_arrayElimCell_52 Int) (v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1565 Int) (v_ArrVal_1562 (Array Int Int)) (v_ArrVal_1564 Int) (v_ArrVal_1561 (Array Int Int)) (v_ArrVal_1560 (Array Int Int)) (v_arrayElimCell_54 Int)) (let ((.cse34 (select (store (let ((.cse35 (store |c_#memory_int#2| .cse2 v_ArrVal_1560))) (store .cse35 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse35 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse1 v_ArrVal_1565) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_1564))) .cse3 v_ArrVal_1556) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1562) .cse3 v_ArrVal_1561) .cse5) .cse6)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse34 (+ 8 v_arrayElimCell_52))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse34 (+ 8 v_arrayElimCell_54))) (forall ((v_arrayElimCell_55 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse34 (+ 8 v_arrayElimCell_55)))))))) (.cse12 (or .cse24 .cse33)) (.cse13 (or .cse21 (and (or (forall ((v_arrayElimCell_52 Int) (v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1565 Int) (v_ArrVal_1562 (Array Int Int)) (v_ArrVal_1564 Int) (v_ArrVal_1561 (Array Int Int)) (v_ArrVal_1560 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse32 (store |c_#memory_int#2| .cse2 v_ArrVal_1560))) (store .cse32 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse32 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse1 v_ArrVal_1565) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_1564))) .cse3 v_ArrVal_1556) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1562) .cse3 v_ArrVal_1561) .cse5) .cse6)) (+ 8 v_arrayElimCell_52)))) .cse7) .cse33))) (.cse14 (or (forall ((v_arrayElimCell_52 Int) (v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1565 Int) (v_ArrVal_1562 (Array Int Int)) (v_ArrVal_1564 Int) (v_ArrVal_1561 (Array Int Int)) (v_ArrVal_1560 (Array Int Int)) (v_arrayElimCell_55 Int)) (let ((.cse30 (select (store (let ((.cse31 (store |c_#memory_int#2| .cse2 v_ArrVal_1560))) (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|) .cse1 v_ArrVal_1565) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_1564))) .cse3 v_ArrVal_1556) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1562) .cse3 v_ArrVal_1561) .cse5) .cse6)))) (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_55)))))) .cse7)) (.cse23 (forall ((v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1565 Int) (v_ArrVal_1562 (Array Int Int)) (v_ArrVal_1564 Int) (v_ArrVal_1561 (Array Int Int)) (v_ArrVal_1560 (Array Int Int)) (v_arrayElimCell_54 Int)) (let ((.cse28 (select (store (let ((.cse29 (store |c_#memory_int#2| .cse2 v_ArrVal_1560))) (store .cse29 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse29 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse1 v_ArrVal_1565) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_1564))) .cse3 v_ArrVal_1556) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1562) .cse3 v_ArrVal_1561) .cse5) .cse6)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse28 (+ 8 v_arrayElimCell_54))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse28 .cse17))))))) (and (or (and (or (forall ((v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1565 Int) (v_ArrVal_1562 (Array Int Int)) (v_ArrVal_1564 Int) (v_ArrVal_1561 (Array Int Int)) (v_ArrVal_1560 (Array Int Int)) (v_arrayElimCell_55 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse0 (store |c_#memory_int#2| .cse2 v_ArrVal_1560))) (store .cse0 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse0 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse1 v_ArrVal_1565) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_1564))) .cse3 v_ArrVal_1556) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1562) .cse3 v_ArrVal_1561) .cse5) .cse6)) (+ 8 v_arrayElimCell_55)))) .cse7) (forall ((v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1565 Int) (v_ArrVal_1562 (Array Int Int)) (v_ArrVal_1564 Int) (v_ArrVal_1561 (Array Int Int)) (v_ArrVal_1560 (Array Int Int)) (v_arrayElimCell_54 Int)) (let ((.cse8 (select (store (let ((.cse9 (store |c_#memory_int#2| .cse2 v_ArrVal_1560))) (store .cse9 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse9 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse1 v_ArrVal_1565) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_1564))) .cse3 v_ArrVal_1556) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1562) .cse3 v_ArrVal_1561) .cse5) .cse6)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse8 (+ 8 v_arrayElimCell_54))) (forall ((v_arrayElimCell_55 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse8 (+ 8 v_arrayElimCell_55)))))))) .cse10) (or (and .cse11 .cse12 .cse13 .cse14) (= .cse6 .cse15)) (forall ((v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1565 Int) (v_ArrVal_1562 (Array Int Int)) (v_ArrVal_1564 Int) (v_ArrVal_1561 (Array Int Int)) (v_ArrVal_1560 (Array Int Int)) (v_arrayElimCell_54 Int)) (let ((.cse16 (select (store (let ((.cse18 (store |c_#memory_int#2| .cse2 v_ArrVal_1560))) (store .cse18 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse18 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse1 v_ArrVal_1565) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_1564))) .cse3 v_ArrVal_1556) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1562) .cse3 v_ArrVal_1561) .cse5) .cse6)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse16 (+ 8 v_arrayElimCell_54))) (forall ((v_arrayElimCell_55 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse16 (+ 8 v_arrayElimCell_55)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse16 .cse17))))) (or (and (or (let ((.cse19 (select |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|))) (and (or (forall ((v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1565 Int) (v_ArrVal_1562 (Array Int Int)) (v_ArrVal_1564 Int) (v_ArrVal_1561 (Array Int Int)) (v_ArrVal_1560 (Array Int Int)) (v_arrayElimCell_55 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store (store |c_#memory_int#2| .cse2 v_ArrVal_1560) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store .cse19 .cse1 v_ArrVal_1565) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_1564)) .cse3 v_ArrVal_1556) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1562) .cse3 v_ArrVal_1561) .cse5) .cse6)) (+ 8 v_arrayElimCell_55)))) .cse7) (forall ((v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1565 Int) (v_ArrVal_1562 (Array Int Int)) (v_ArrVal_1564 Int) (v_ArrVal_1561 (Array Int Int)) (v_ArrVal_1560 (Array Int Int)) (v_arrayElimCell_54 Int)) (let ((.cse20 (select (store (store (store |c_#memory_int#2| .cse2 v_ArrVal_1560) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store .cse19 .cse1 v_ArrVal_1565) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_1564)) .cse3 v_ArrVal_1556) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1562) .cse3 v_ArrVal_1561) .cse5) .cse6)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse20 (+ 8 v_arrayElimCell_54))) (forall ((v_arrayElimCell_55 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse20 (+ 8 v_arrayElimCell_55))))))))) .cse10) .cse11 .cse12 .cse13 .cse14) (= .cse2 .cse5)) (or .cse21 (and (or .cse7 (forall ((v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1565 Int) (v_ArrVal_1562 (Array Int Int)) (v_ArrVal_1564 Int) (v_ArrVal_1561 (Array Int Int)) (v_ArrVal_1560 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse22 (store |c_#memory_int#2| .cse2 v_ArrVal_1560))) (store .cse22 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse22 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse1 v_ArrVal_1565) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_1564))) .cse3 v_ArrVal_1556) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1562) .cse3 v_ArrVal_1561) .cse5) .cse6)) .cse17)))) .cse23)) (or .cse24 .cse23) (or .cse24 (forall ((v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1565 Int) (v_ArrVal_1562 (Array Int Int)) (v_ArrVal_1564 Int) (v_ArrVal_1561 (Array Int Int)) (v_ArrVal_1560 (Array Int Int)) (v_arrayElimCell_54 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse25 (store |c_#memory_int#2| .cse2 v_ArrVal_1560))) (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|) .cse1 v_ArrVal_1565) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_1564))) .cse3 v_ArrVal_1556) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1562) .cse3 v_ArrVal_1561) .cse5) .cse6)) (+ 8 v_arrayElimCell_54))))) (or (forall ((v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1565 Int) (v_ArrVal_1562 (Array Int Int)) (v_ArrVal_1564 Int) (v_ArrVal_1561 (Array Int Int)) (v_ArrVal_1560 (Array Int Int)) (v_arrayElimCell_55 Int)) (let ((.cse26 (select (store (let ((.cse27 (store |c_#memory_int#2| .cse2 v_ArrVal_1560))) (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|) .cse1 v_ArrVal_1565) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_1564))) .cse3 v_ArrVal_1556) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1562) .cse3 v_ArrVal_1561) .cse5) .cse6)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse26 (+ 8 v_arrayElimCell_55))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse26 .cse17))))) .cse7)))))))) is different from false [2025-04-30 10:13:41,455 WARN L286 SmtUtils]: Spent 21.85s on a formula simplification. DAG size of input: 1171 DAG size of output: 351 (called from [L 323] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2025-04-30 10:13:41,456 INFO L325 Elim1Store]: treesize reduction 25300, result has 12.9 percent of original size [2025-04-30 10:13:41,458 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 21 select indices, 21 select index equivalence classes, 0 disjoint index pairs (out of 210 index pairs), introduced 22 new quantified variables, introduced 232 case distinctions, treesize of input 188969 treesize of output 181171 [2025-04-30 10:13:42,162 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:13:42,163 INFO L354 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 37995 treesize of output 37972 [2025-04-30 10:13:42,470 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:13:42,472 INFO L354 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 37963 treesize of output 37964 [2025-04-30 10:13:42,710 INFO L354 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 37955 treesize of output 37951 [2025-04-30 10:13:42,944 INFO L354 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 37951 treesize of output 37935 [2025-04-30 10:13:44,091 INFO L204 Elim1Store]: Index analysis took 832 ms Killed by 15