./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/list-simple/dll2c_insert_unequal.c --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.c -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 e613e977f99c5aca5611fc283a12f5f3061588477e32776daa7b38f14322b64d --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 10:54:43,618 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 10:54:43,670 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-29 10:54:43,677 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 10:54:43,678 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 10:54:43,698 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 10:54:43,699 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 10:54:43,699 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 10:54:43,699 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-29 10:54:43,699 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-29 10:54:43,700 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 10:54:43,700 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 10:54:43,700 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 10:54:43,701 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 10:54:43,701 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 10:54:43,701 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 10:54:43,701 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-29 10:54:43,701 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 10:54:43,701 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 10:54:43,701 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 10:54:43,702 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 10:54:43,702 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-29 10:54:43,702 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 10:54:43,702 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-29 10:54:43,702 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 10:54:43,702 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-29 10:54:43,702 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 10:54:43,702 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 10:54:43,702 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 10:54:43,702 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 10:54:43,703 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 10:54:43,703 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 10:54:43,703 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 10:54:43,703 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 10:54:43,703 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 10:54:43,703 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 10:54:43,703 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 10:54:43,703 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 10:54:43,703 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 10:54:43,703 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 10:54:43,704 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-29 10:54:43,704 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-29 10:54:43,704 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 10:54:43,704 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 10:54:43,704 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 10:54:43,704 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 10:54:43,704 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 10:54:43,704 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 -> e613e977f99c5aca5611fc283a12f5f3061588477e32776daa7b38f14322b64d [2025-04-29 10:54:43,911 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 10:54:43,916 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 10:54:43,918 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 10:54:43,920 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 10:54:43,920 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 10:54:43,921 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/dll2c_insert_unequal.c [2025-04-29 10:54:45,173 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ff9bdbe9/630f8654041e4a50b7a744f7c0488c05/FLAG784a40584 [2025-04-29 10:54:45,403 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 10:54:45,404 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2c_insert_unequal.c [2025-04-29 10:54:45,406 WARN L117 ultiparseSymbolTable]: System include assert.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 10:54:45,406 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 10:54:45,413 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ff9bdbe9/630f8654041e4a50b7a744f7c0488c05/FLAG784a40584 [2025-04-29 10:54:47,274 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ff9bdbe9/630f8654041e4a50b7a744f7c0488c05 [2025-04-29 10:54:47,276 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 10:54:47,277 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 10:54:47,278 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 10:54:47,278 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 10:54:47,282 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 10:54:47,282 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 10:54:47" (1/1) ... [2025-04-29 10:54:47,283 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24a895dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:54:47, skipping insertion in model container [2025-04-29 10:54:47,283 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 10:54:47" (1/1) ... [2025-04-29 10:54:47,294 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 10:54:47,467 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.c[2369,2382] [2025-04-29 10:54:47,473 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 10:54:47,479 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 10:54:47,514 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.c[2369,2382] [2025-04-29 10:54:47,515 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 10:54:47,524 INFO L204 MainTranslator]: Completed translation [2025-04-29 10:54:47,524 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:54:47 WrapperNode [2025-04-29 10:54:47,525 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 10:54:47,525 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 10:54:47,525 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 10:54:47,525 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 10:54:47,529 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:54:47" (1/1) ... [2025-04-29 10:54:47,541 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:54:47" (1/1) ... [2025-04-29 10:54:47,562 INFO L138 Inliner]: procedures = 18, calls = 54, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 172 [2025-04-29 10:54:47,563 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 10:54:47,564 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 10:54:47,564 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 10:54:47,564 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 10:54:47,570 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:54:47" (1/1) ... [2025-04-29 10:54:47,570 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:54:47" (1/1) ... [2025-04-29 10:54:47,574 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:54:47" (1/1) ... [2025-04-29 10:54:47,596 INFO L175 MemorySlicer]: Split 38 memory accesses to 2 slices as follows [12, 26]. 68 percent of accesses are in the largest equivalence class. The 1 initializations are split as follows [1, 0]. The 18 writes are split as follows [1, 17]. [2025-04-29 10:54:47,596 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:54:47" (1/1) ... [2025-04-29 10:54:47,596 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:54:47" (1/1) ... [2025-04-29 10:54:47,602 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:54:47" (1/1) ... [2025-04-29 10:54:47,602 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:54:47" (1/1) ... [2025-04-29 10:54:47,605 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:54:47" (1/1) ... [2025-04-29 10:54:47,606 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:54:47" (1/1) ... [2025-04-29 10:54:47,606 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:54:47" (1/1) ... [2025-04-29 10:54:47,609 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 10:54:47,611 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 10:54:47,611 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 10:54:47,611 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 10:54:47,612 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:54:47" (1/1) ... [2025-04-29 10:54:47,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 10:54:47,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:54:47,637 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-29 10:54:47,642 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-29 10:54:47,657 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-04-29 10:54:47,657 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-04-29 10:54:47,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-04-29 10:54:47,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-04-29 10:54:47,657 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-04-29 10:54:47,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-04-29 10:54:47,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-04-29 10:54:47,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-29 10:54:47,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-29 10:54:47,657 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-29 10:54:47,657 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 10:54:47,657 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 10:54:47,658 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-29 10:54:47,658 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-29 10:54:47,658 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2025-04-29 10:54:47,658 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2025-04-29 10:54:47,658 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-29 10:54:47,733 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 10:54:47,734 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 10:54:47,929 INFO L? ?]: Removed 59 outVars from TransFormulas that were not future-live. [2025-04-29 10:54:47,929 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 10:54:47,936 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 10:54:47,936 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-04-29 10:54:47,937 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 10:54:47 BoogieIcfgContainer [2025-04-29 10:54:47,937 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 10:54:47,938 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 10:54:47,938 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 10:54:47,941 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 10:54:47,941 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 10:54:47" (1/3) ... [2025-04-29 10:54:47,942 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1695a71a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 10:54:47, skipping insertion in model container [2025-04-29 10:54:47,942 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:54:47" (2/3) ... [2025-04-29 10:54:47,942 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1695a71a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 10:54:47, skipping insertion in model container [2025-04-29 10:54:47,942 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 10:54:47" (3/3) ... [2025-04-29 10:54:47,943 INFO L128 eAbstractionObserver]: Analyzing ICFG dll2c_insert_unequal.c [2025-04-29 10:54:47,952 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 10:54:47,953 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dll2c_insert_unequal.c that has 2 procedures, 40 locations, 60 edges, 1 initial locations, 5 loop locations, and 1 error locations. [2025-04-29 10:54:47,983 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 10:54:47,990 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;@7ad75aa6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 10:54:47,990 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-04-29 10:54:47,993 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-29 10:54:47,998 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-29 10:54:47,998 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:54:47,998 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-29 10:54:47,999 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:54:48,002 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:54:48,002 INFO L85 PathProgramCache]: Analyzing trace with hash 962023410, now seen corresponding path program 1 times [2025-04-29 10:54:48,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:54:48,009 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697386973] [2025-04-29 10:54:48,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:54:48,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:54:48,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-29 10:54:48,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-29 10:54:48,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:54:48,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:54:48,370 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-29 10:54:48,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:54:48,371 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697386973] [2025-04-29 10:54:48,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697386973] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:54:48,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:54:48,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 10:54:48,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028118998] [2025-04-29 10:54:48,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:54:48,375 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 10:54:48,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:54:48,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 10:54:48,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 10:54:48,390 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-29 10:54:48,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:54:48,426 INFO L93 Difference]: Finished difference Result 76 states and 109 transitions. [2025-04-29 10:54:48,427 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 10:54:48,428 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-29 10:54:48,429 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:54:48,432 INFO L225 Difference]: With dead ends: 76 [2025-04-29 10:54:48,433 INFO L226 Difference]: Without dead ends: 38 [2025-04-29 10:54:48,434 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-29 10:54:48,436 INFO L437 NwaCegarLoop]: 52 mSDtfsCounter, 4 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 10:54:48,436 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 96 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 10:54:48,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-04-29 10:54:48,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 34. [2025-04-29 10:54:48,457 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-29 10:54:48,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2025-04-29 10:54:48,461 INFO L79 Accepts]: Start accepts. Automaton has 34 states and 45 transitions. Word has length 24 [2025-04-29 10:54:48,461 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:54:48,461 INFO L485 AbstractCegarLoop]: Abstraction has 34 states and 45 transitions. [2025-04-29 10:54:48,461 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-29 10:54:48,461 INFO L278 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2025-04-29 10:54:48,462 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-04-29 10:54:48,462 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:54:48,462 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-29 10:54:48,462 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 10:54:48,462 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:54:48,463 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:54:48,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1325089798, now seen corresponding path program 1 times [2025-04-29 10:54:48,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:54:48,463 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445902053] [2025-04-29 10:54:48,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:54:48,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:54:48,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-29 10:54:48,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-29 10:54:48,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:54:48,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:54:48,591 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-29 10:54:48,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:54:48,591 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445902053] [2025-04-29 10:54:48,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445902053] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:54:48,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:54:48,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 10:54:48,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493690561] [2025-04-29 10:54:48,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:54:48,592 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 10:54:48,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:54:48,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 10:54:48,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 10:54:48,593 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-29 10:54:48,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:54:48,611 INFO L93 Difference]: Finished difference Result 48 states and 65 transitions. [2025-04-29 10:54:48,612 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 10:54:48,612 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-29 10:54:48,613 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:54:48,613 INFO L225 Difference]: With dead ends: 48 [2025-04-29 10:54:48,613 INFO L226 Difference]: Without dead ends: 36 [2025-04-29 10:54:48,613 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-29 10:54:48,614 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-29 10:54:48,614 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-29 10:54:48,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-04-29 10:54:48,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2025-04-29 10:54:48,619 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-29 10:54:48,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 48 transitions. [2025-04-29 10:54:48,619 INFO L79 Accepts]: Start accepts. Automaton has 36 states and 48 transitions. Word has length 34 [2025-04-29 10:54:48,620 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:54:48,620 INFO L485 AbstractCegarLoop]: Abstraction has 36 states and 48 transitions. [2025-04-29 10:54:48,620 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-29 10:54:48,620 INFO L278 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2025-04-29 10:54:48,620 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-04-29 10:54:48,620 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:54:48,620 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-29 10:54:48,620 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-29 10:54:48,620 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:54:48,621 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:54:48,621 INFO L85 PathProgramCache]: Analyzing trace with hash 551900881, now seen corresponding path program 1 times [2025-04-29 10:54:48,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:54:48,621 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72330384] [2025-04-29 10:54:48,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:54:48,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:54:48,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-29 10:54:48,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-29 10:54:48,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:54:48,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:54:50,822 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-29 10:54:50,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:54:50,823 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72330384] [2025-04-29 10:54:50,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72330384] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:54:50,823 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1577834875] [2025-04-29 10:54:50,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:54:50,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:54:50,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:54:50,826 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-29 10:54:50,827 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-29 10:54:50,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-29 10:54:51,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-29 10:54:51,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:54:51,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:54:51,298 INFO L256 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 122 conjuncts are in the unsatisfiable core [2025-04-29 10:54:51,306 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:54:51,372 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-29 10:54:51,565 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-29 10:54:51,648 INFO L325 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-04-29 10:54:51,648 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-29 10:54:51,726 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-29 10:54:51,733 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-29 10:54:51,813 INFO L325 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-04-29 10:54:51,814 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-29 10:54:51,819 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-29 10:54:51,969 INFO L325 Elim1Store]: treesize reduction 48, result has 23.8 percent of original size [2025-04-29 10:54:51,969 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 94 treesize of output 55 [2025-04-29 10:54:51,979 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 10:54:51,982 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-29 10:54:51,989 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-29 10:54:52,209 INFO L325 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2025-04-29 10:54:52,209 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 68 treesize of output 27 [2025-04-29 10:54:52,218 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2025-04-29 10:54:52,222 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-29 10:54:52,412 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 10:54:52,420 INFO L325 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2025-04-29 10:54:52,420 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 2 case distinctions, treesize of input 76 treesize of output 53 [2025-04-29 10:54:52,433 INFO L325 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2025-04-29 10:54:52,433 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-29 10:54:52,451 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-29 10:54:52,641 INFO L325 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2025-04-29 10:54:52,641 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 4 new quantified variables, introduced 2 case distinctions, treesize of input 78 treesize of output 29 [2025-04-29 10:54:52,752 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 39 [2025-04-29 10:54:52,759 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 25 treesize of output 15 [2025-04-29 10:54:52,818 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-29 10:54:52,891 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-29 10:54:52,891 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:55:01,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1577834875] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:55:01,427 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 10:55:01,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 46 [2025-04-29 10:55:01,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464642578] [2025-04-29 10:55:01,427 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 10:55:01,428 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-04-29 10:55:01,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:55:01,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-04-29 10:55:01,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=2436, Unknown=45, NotChecked=0, Total=2652 [2025-04-29 10:55:01,431 INFO L87 Difference]: Start difference. First operand 36 states and 48 transitions. Second operand has 46 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 37 states have internal predecessors, (55), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-04-29 10:55:03,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:55:03,006 INFO L93 Difference]: Finished difference Result 77 states and 104 transitions. [2025-04-29 10:55:03,006 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-29 10:55:03,006 INFO L79 Accepts]: Start accepts. Automaton has has 46 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 37 states have internal predecessors, (55), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 35 [2025-04-29 10:55:03,006 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:55:03,007 INFO L225 Difference]: With dead ends: 77 [2025-04-29 10:55:03,007 INFO L226 Difference]: Without dead ends: 75 [2025-04-29 10:55:03,009 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1101 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=312, Invalid=4199, Unknown=45, NotChecked=0, Total=4556 [2025-04-29 10:55:03,009 INFO L437 NwaCegarLoop]: 22 mSDtfsCounter, 75 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 1012 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 1031 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1012 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-04-29 10:55:03,009 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 414 Invalid, 1031 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1012 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-04-29 10:55:03,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-04-29 10:55:03,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 55. [2025-04-29 10:55:03,016 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-29 10:55:03,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 73 transitions. [2025-04-29 10:55:03,017 INFO L79 Accepts]: Start accepts. Automaton has 55 states and 73 transitions. Word has length 35 [2025-04-29 10:55:03,017 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:55:03,017 INFO L485 AbstractCegarLoop]: Abstraction has 55 states and 73 transitions. [2025-04-29 10:55:03,017 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 37 states have internal predecessors, (55), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-04-29 10:55:03,017 INFO L278 IsEmpty]: Start isEmpty. Operand 55 states and 73 transitions. [2025-04-29 10:55:03,018 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-29 10:55:03,018 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:55:03,018 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-29 10:55:03,027 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-29 10:55:03,222 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-29 10:55:03,222 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:55:03,222 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:55:03,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1942119066, now seen corresponding path program 2 times [2025-04-29 10:55:03,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:55:03,223 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061737827] [2025-04-29 10:55:03,223 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 10:55:03,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:55:03,244 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-04-29 10:55:03,256 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-04-29 10:55:03,257 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 10:55:03,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:55:03,391 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-29 10:55:03,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:55:03,392 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061737827] [2025-04-29 10:55:03,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061737827] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:55:03,392 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019274653] [2025-04-29 10:55:03,392 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 10:55:03,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:55:03,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:55:03,394 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-29 10:55:03,395 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-29 10:55:03,471 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-04-29 10:55:03,541 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-04-29 10:55:03,542 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 10:55:03,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:55:03,544 INFO L256 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-29 10:55:03,546 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:55:03,563 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-29 10:55:03,563 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 10:55:03,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2019274653] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:55:03,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-29 10:55:03,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 6 [2025-04-29 10:55:03,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892170844] [2025-04-29 10:55:03,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:55:03,564 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 10:55:03,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:55:03,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 10:55:03,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-29 10:55:03,564 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-29 10:55:03,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:55:03,588 INFO L93 Difference]: Finished difference Result 73 states and 97 transitions. [2025-04-29 10:55:03,588 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 10:55:03,588 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-29 10:55:03,588 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:55:03,589 INFO L225 Difference]: With dead ends: 73 [2025-04-29 10:55:03,589 INFO L226 Difference]: Without dead ends: 57 [2025-04-29 10:55:03,589 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-29 10:55:03,589 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-29 10:55:03,590 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-29 10:55:03,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-04-29 10:55:03,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2025-04-29 10:55:03,598 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-29 10:55:03,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 71 transitions. [2025-04-29 10:55:03,600 INFO L79 Accepts]: Start accepts. Automaton has 55 states and 71 transitions. Word has length 36 [2025-04-29 10:55:03,600 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:55:03,600 INFO L485 AbstractCegarLoop]: Abstraction has 55 states and 71 transitions. [2025-04-29 10:55:03,601 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-29 10:55:03,601 INFO L278 IsEmpty]: Start isEmpty. Operand 55 states and 71 transitions. [2025-04-29 10:55:03,602 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-29 10:55:03,602 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:55:03,602 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-29 10:55:03,610 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-29 10:55:03,802 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-29 10:55:03,803 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:55:03,803 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:55:03,804 INFO L85 PathProgramCache]: Analyzing trace with hash -596562324, now seen corresponding path program 1 times [2025-04-29 10:55:03,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:55:03,804 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198452839] [2025-04-29 10:55:03,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:55:03,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:55:03,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-29 10:55:03,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-29 10:55:03,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:55:03,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:55:03,927 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-29 10:55:03,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:55:03,928 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198452839] [2025-04-29 10:55:03,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198452839] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:55:03,928 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1141705879] [2025-04-29 10:55:03,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:55:03,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:55:03,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:55:03,930 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-29 10:55:03,931 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-29 10:55:04,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-29 10:55:04,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-29 10:55:04,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:55:04,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:55:04,060 INFO L256 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-29 10:55:04,062 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:55:04,097 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-29 10:55:04,097 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 10:55:04,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1141705879] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:55:04,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-29 10:55:04,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2025-04-29 10:55:04,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299414370] [2025-04-29 10:55:04,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:55:04,098 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 10:55:04,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:55:04,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 10:55:04,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-29 10:55:04,098 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-29 10:55:04,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:55:04,115 INFO L93 Difference]: Finished difference Result 71 states and 91 transitions. [2025-04-29 10:55:04,116 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 10:55:04,116 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-29 10:55:04,116 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:55:04,117 INFO L225 Difference]: With dead ends: 71 [2025-04-29 10:55:04,117 INFO L226 Difference]: Without dead ends: 56 [2025-04-29 10:55:04,117 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-29 10:55:04,117 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-29 10:55:04,117 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-29 10:55:04,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-04-29 10:55:04,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2025-04-29 10:55:04,127 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-29 10:55:04,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 68 transitions. [2025-04-29 10:55:04,129 INFO L79 Accepts]: Start accepts. Automaton has 54 states and 68 transitions. Word has length 36 [2025-04-29 10:55:04,129 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:55:04,129 INFO L485 AbstractCegarLoop]: Abstraction has 54 states and 68 transitions. [2025-04-29 10:55:04,129 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-29 10:55:04,129 INFO L278 IsEmpty]: Start isEmpty. Operand 54 states and 68 transitions. [2025-04-29 10:55:04,130 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-04-29 10:55:04,131 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:55:04,132 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-29 10:55:04,139 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-29 10:55:04,332 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-29 10:55:04,333 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:55:04,334 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:55:04,334 INFO L85 PathProgramCache]: Analyzing trace with hash -601769353, now seen corresponding path program 1 times [2025-04-29 10:55:04,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:55:04,334 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533530882] [2025-04-29 10:55:04,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:55:04,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:55:04,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-29 10:55:04,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-29 10:55:04,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:55:04,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:55:04,437 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-29 10:55:04,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:55:04,438 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533530882] [2025-04-29 10:55:04,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533530882] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:55:04,438 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [540654113] [2025-04-29 10:55:04,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:55:04,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:55:04,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:55:04,440 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-29 10:55:04,442 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-29 10:55:04,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-29 10:55:04,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-29 10:55:04,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:55:04,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:55:04,570 INFO L256 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-04-29 10:55:04,572 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:55:04,595 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-29 10:55:04,596 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:55:04,658 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-29 10:55:04,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [540654113] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 10:55:04,658 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 10:55:04,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-04-29 10:55:04,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068746304] [2025-04-29 10:55:04,659 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 10:55:04,659 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-29 10:55:04,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:55:04,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-29 10:55:04,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-04-29 10:55:04,659 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-29 10:55:04,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:55:04,743 INFO L93 Difference]: Finished difference Result 67 states and 85 transitions. [2025-04-29 10:55:04,745 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 10:55:04,746 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-29 10:55:04,746 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:55:04,746 INFO L225 Difference]: With dead ends: 67 [2025-04-29 10:55:04,746 INFO L226 Difference]: Without dead ends: 54 [2025-04-29 10:55:04,746 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-29 10:55:04,747 INFO L437 NwaCegarLoop]: 38 mSDtfsCounter, 2 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 10:55:04,747 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 171 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 10:55:04,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-04-29 10:55:04,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2025-04-29 10:55:04,758 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-29 10:55:04,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 67 transitions. [2025-04-29 10:55:04,758 INFO L79 Accepts]: Start accepts. Automaton has 54 states and 67 transitions. Word has length 37 [2025-04-29 10:55:04,758 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:55:04,759 INFO L485 AbstractCegarLoop]: Abstraction has 54 states and 67 transitions. [2025-04-29 10:55:04,759 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-29 10:55:04,759 INFO L278 IsEmpty]: Start isEmpty. Operand 54 states and 67 transitions. [2025-04-29 10:55:04,759 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-04-29 10:55:04,761 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:55:04,761 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-29 10:55:04,768 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-29 10:55:04,961 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-29 10:55:04,962 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:55:04,962 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:55:04,962 INFO L85 PathProgramCache]: Analyzing trace with hash -544511051, now seen corresponding path program 1 times [2025-04-29 10:55:04,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:55:04,962 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118065067] [2025-04-29 10:55:04,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:55:04,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:55:04,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-29 10:55:04,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-29 10:55:04,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:55:04,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:55:05,164 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-29 10:55:05,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:55:05,165 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118065067] [2025-04-29 10:55:05,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118065067] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:55:05,165 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [456174906] [2025-04-29 10:55:05,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:55:05,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:55:05,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:55:05,167 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-29 10:55:05,169 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-29 10:55:05,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-29 10:55:05,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-29 10:55:05,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:55:05,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:55:05,304 INFO L256 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-29 10:55:05,307 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:55:05,372 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-29 10:55:05,395 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-29 10:55:05,395 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:55:05,432 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-29 10:55:05,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [456174906] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 10:55:05,432 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 10:55:05,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 11] total 15 [2025-04-29 10:55:05,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253971278] [2025-04-29 10:55:05,432 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 10:55:05,433 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-29 10:55:05,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:55:05,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-29 10:55:05,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2025-04-29 10:55:05,433 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-29 10:55:09,453 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-29 10:55:13,469 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-29 10:55:17,477 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-29 10:55:21,501 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-29 10:55:25,646 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-29 10:55:29,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-29 10:55:29,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:55:29,672 INFO L93 Difference]: Finished difference Result 87 states and 107 transitions. [2025-04-29 10:55:29,673 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-29 10:55:29,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-29 10:55:29,673 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:55:29,675 INFO L225 Difference]: With dead ends: 87 [2025-04-29 10:55:29,675 INFO L226 Difference]: Without dead ends: 57 [2025-04-29 10:55:29,675 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-29 10:55:29,675 INFO L437 NwaCegarLoop]: 31 mSDtfsCounter, 31 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 1 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.2s IncrementalHoareTripleChecker+Time [2025-04-29 10:55:29,675 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 351 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 205 Invalid, 6 Unknown, 0 Unchecked, 24.2s Time] [2025-04-29 10:55:29,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-04-29 10:55:29,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2025-04-29 10:55:29,682 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-29 10:55:29,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 66 transitions. [2025-04-29 10:55:29,684 INFO L79 Accepts]: Start accepts. Automaton has 57 states and 66 transitions. Word has length 37 [2025-04-29 10:55:29,684 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:55:29,684 INFO L485 AbstractCegarLoop]: Abstraction has 57 states and 66 transitions. [2025-04-29 10:55:29,684 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-29 10:55:29,684 INFO L278 IsEmpty]: Start isEmpty. Operand 57 states and 66 transitions. [2025-04-29 10:55:29,685 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-04-29 10:55:29,686 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:55:29,687 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-29 10:55:29,694 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-04-29 10:55:29,891 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-29 10:55:29,891 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:55:29,891 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:55:29,891 INFO L85 PathProgramCache]: Analyzing trace with hash 544741097, now seen corresponding path program 1 times [2025-04-29 10:55:29,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:55:29,891 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845888359] [2025-04-29 10:55:29,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:55:29,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:55:29,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-04-29 10:55:29,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-04-29 10:55:29,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:55:29,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:55:30,141 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-29 10:55:30,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:55:30,141 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845888359] [2025-04-29 10:55:30,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845888359] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:55:30,141 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [545707794] [2025-04-29 10:55:30,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:55:30,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:55:30,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:55:30,143 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-29 10:55:30,145 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-29 10:55:30,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-04-29 10:55:30,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-04-29 10:55:30,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:55:30,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:55:30,296 INFO L256 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-29 10:55:30,297 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:55:30,335 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-29 10:55:30,336 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:55:30,398 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-29 10:55:30,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [545707794] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 10:55:30,399 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 10:55:30,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2025-04-29 10:55:30,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033158050] [2025-04-29 10:55:30,399 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 10:55:30,399 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-29 10:55:30,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:55:30,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-29 10:55:30,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-04-29 10:55:30,400 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-29 10:55:30,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:55:30,516 INFO L93 Difference]: Finished difference Result 72 states and 83 transitions. [2025-04-29 10:55:30,516 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-29 10:55:30,516 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-29 10:55:30,516 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:55:30,517 INFO L225 Difference]: With dead ends: 72 [2025-04-29 10:55:30,517 INFO L226 Difference]: Without dead ends: 61 [2025-04-29 10:55:30,517 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-29 10:55:30,517 INFO L437 NwaCegarLoop]: 32 mSDtfsCounter, 31 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 10:55:30,518 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 248 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 10:55:30,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-04-29 10:55:30,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 57. [2025-04-29 10:55:30,528 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-29 10:55:30,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 65 transitions. [2025-04-29 10:55:30,529 INFO L79 Accepts]: Start accepts. Automaton has 57 states and 65 transitions. Word has length 38 [2025-04-29 10:55:30,530 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:55:30,530 INFO L485 AbstractCegarLoop]: Abstraction has 57 states and 65 transitions. [2025-04-29 10:55:30,530 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-29 10:55:30,530 INFO L278 IsEmpty]: Start isEmpty. Operand 57 states and 65 transitions. [2025-04-29 10:55:30,531 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-04-29 10:55:30,531 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:55:30,531 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:55:30,538 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-29 10:55:30,731 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-29 10:55:30,732 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:55:30,732 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:55:30,732 INFO L85 PathProgramCache]: Analyzing trace with hash 544815559, now seen corresponding path program 1 times [2025-04-29 10:55:30,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:55:30,733 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689843263] [2025-04-29 10:55:30,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:55:30,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:55:30,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-04-29 10:55:30,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-04-29 10:55:30,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:55:30,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:55:32,205 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-29 10:55:32,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:55:32,206 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689843263] [2025-04-29 10:55:32,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689843263] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:55:32,206 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [203481840] [2025-04-29 10:55:32,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:55:32,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:55:32,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:55:32,207 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-29 10:55:32,209 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-29 10:55:32,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-04-29 10:55:32,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-04-29 10:55:32,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:55:32,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:55:32,669 INFO L256 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 140 conjuncts are in the unsatisfiable core [2025-04-29 10:55:32,677 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:55:32,705 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-29 10:55:32,843 WARN L849 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_#t~ret2#1.base|) 0) (= (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)))))) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_#t~ret2#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret2#1.base|) 1)) is different from false [2025-04-29 10:55:32,844 WARN L871 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_#t~ret2#1.base|) 0) (= (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)))))) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_#t~ret2#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret2#1.base|) 1)) is different from true [2025-04-29 10:55:32,856 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-29 10:55:32,862 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) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0)) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1)) is different from false [2025-04-29 10:55:32,864 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) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0)) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1)) is different from true [2025-04-29 10:55:32,882 INFO L325 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-04-29 10:55:32,882 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2025-04-29 10:55:32,888 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 5 treesize of output 3 [2025-04-29 10:55:32,902 WARN L849 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0)) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0)))) is different from false [2025-04-29 10:55:32,904 WARN L871 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0)) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0)))) is different from true [2025-04-29 10:55:32,927 WARN L849 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0)))))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)) is different from false [2025-04-29 10:55:32,929 WARN L871 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0)))))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)) is different from true [2025-04-29 10:55:32,966 INFO L325 Elim1Store]: treesize reduction 60, result has 34.1 percent of original size [2025-04-29 10:55:32,966 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 2 case distinctions, treesize of input 67 treesize of output 46 [2025-04-29 10:55:32,984 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|))) (let ((.cse0 (select .cse1 4))) (and (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= .cse0 |c_ULTIMATE.start_dll_circular_create_#res#1.base|) (= .cse0 (select .cse1 0))) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 0) (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse2 (select |c_#valid| .cse2)))))) (= |c_ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_8| Int)) (= (select (select |c_#memory_$Pointer$#1.base| .cse0) |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_8|) |c_ULTIMATE.start_dll_circular_create_#res#1.base|))))) is different from false [2025-04-29 10:55:32,988 WARN L871 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|))) (let ((.cse0 (select .cse1 4))) (and (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (= .cse0 |c_ULTIMATE.start_dll_circular_create_#res#1.base|) (= .cse0 (select .cse1 0))) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 0) (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse2 (select |c_#valid| .cse2)))))) (= |c_ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_8| Int)) (= (select (select |c_#memory_$Pointer$#1.base| .cse0) |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_8|) |c_ULTIMATE.start_dll_circular_create_#res#1.base|))))) is different from true [2025-04-29 10:55:33,021 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse3 (select |c_#memory_$Pointer$#1.base| .cse0))) (let ((.cse1 (select .cse3 4))) (and (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_8| Int)) (= .cse0 (select (select |c_#memory_$Pointer$#1.base| .cse1) |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_8|))) (= (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~uneq~0#1| |c_ULTIMATE.start_dll_circular_insert_~data#1|) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_6| .cse1) 1) (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse2 (select |c_#valid| .cse2)))))) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.offset| 0) (or (= .cse1 .cse0) (= .cse1 (select .cse3 0))))))) is different from false [2025-04-29 10:55:33,024 WARN L871 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse3 (select |c_#memory_$Pointer$#1.base| .cse0))) (let ((.cse1 (select .cse3 4))) (and (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_8| Int)) (= .cse0 (select (select |c_#memory_$Pointer$#1.base| .cse1) |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_8|))) (= (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~uneq~0#1| |c_ULTIMATE.start_dll_circular_insert_~data#1|) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_6| .cse1) 1) (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse2 (select |c_#valid| .cse2)))))) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.offset| 0) (or (= .cse1 .cse0) (= .cse1 (select .cse3 0))))))) is different from true [2025-04-29 10:55:33,036 INFO L325 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2025-04-29 10:55:33,037 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 68 treesize of output 27 [2025-04-29 10:55:33,052 WARN L849 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (exists ((v_arrayElimIndex_6 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#0.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= (select (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimIndex_6) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))) (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1)))) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from false [2025-04-29 10:55:33,054 WARN L871 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (exists ((v_arrayElimIndex_6 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#0.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= (select (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimIndex_6) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))) (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1)))) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from true [2025-04-29 10:55:33,079 WARN L849 $PredicateComparison]: unable to prove that (and (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_node_create_~temp~0#1.offset| 0) (exists ((v_arrayElimIndex_6 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#0.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= (select (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimIndex_6) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))) (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1)))) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from false [2025-04-29 10:55:33,080 WARN L871 $PredicateComparison]: unable to prove that (and (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_node_create_~temp~0#1.offset| 0) (exists ((v_arrayElimIndex_6 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#0.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= (select (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimIndex_6) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))) (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1)))) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from true [2025-04-29 10:55:33,117 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-29 10:55:33,136 WARN L849 $PredicateComparison]: unable to prove that (and (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= |c_node_create_#in~data#1| (select (select |c_#memory_int#1| |c_node_create_#res#1.base|) 8)) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.base| |c_node_create_#res#1.base|))) (exists ((v_arrayElimIndex_6 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#0.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= (select (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimIndex_6) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))) (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1))))) is different from false [2025-04-29 10:55:33,138 WARN L871 $PredicateComparison]: unable to prove that (and (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= |c_node_create_#in~data#1| (select (select |c_#memory_int#1| |c_node_create_#res#1.base|) 8)) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.base| |c_node_create_#res#1.base|))) (exists ((v_arrayElimIndex_6 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#0.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= (select (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimIndex_6) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))) (= (select |v_#valid_BEFORE_CALL_7| .cse0) 1))))) is different from true [2025-04-29 10:55:33,173 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 10:55:33,181 INFO L325 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2025-04-29 10:55:33,181 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 2 case distinctions, treesize of input 76 treesize of output 53 [2025-04-29 10:55:33,231 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| .cse0))) (let ((.cse1 (select .cse5 4))) (and (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_8| Int)) (= .cse0 (select (select |c_#memory_$Pointer$#1.base| .cse1) |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_8|))) (= (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((v_arrayElimIndex_6 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#0.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_9| .cse2) 0) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_9| .cse3 (select |v_#valid_BEFORE_CALL_7| .cse3))) |v_#valid_BEFORE_CALL_7|) (= (select (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimIndex_6) 1) (= (select |v_#valid_BEFORE_CALL_7| .cse2) 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) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_8| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_6| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_dll_circular_insert_#t~ret6#1.base|) 0) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_6| .cse4 (select |v_#valid_BEFORE_CALL_8| .cse4))) |v_#valid_BEFORE_CALL_8|))) (or (= .cse1 .cse0) (= .cse1 (select .cse5 0))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_#t~ret6#1.base|) 8)) (= |c_ULTIMATE.start_dll_circular_insert_#t~ret6#1.offset| 0))))) is different from false [2025-04-29 10:55:33,234 WARN L871 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| .cse0))) (let ((.cse1 (select .cse5 4))) (and (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_8| Int)) (= .cse0 (select (select |c_#memory_$Pointer$#1.base| .cse1) |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_8|))) (= (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((v_arrayElimIndex_6 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#0.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_9| .cse2) 0) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_9| .cse3 (select |v_#valid_BEFORE_CALL_7| .cse3))) |v_#valid_BEFORE_CALL_7|) (= (select (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimIndex_6) 1) (= (select |v_#valid_BEFORE_CALL_7| .cse2) 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) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_8| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_6| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_dll_circular_insert_#t~ret6#1.base|) 0) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_6| .cse4 (select |v_#valid_BEFORE_CALL_8| .cse4))) |v_#valid_BEFORE_CALL_8|))) (or (= .cse1 .cse0) (= .cse1 (select .cse5 0))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_#t~ret6#1.base|) 8)) (= |c_ULTIMATE.start_dll_circular_insert_#t~ret6#1.offset| 0))))) is different from true [2025-04-29 10:55:33,290 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| .cse0))) (let ((.cse1 (select .cse5 4))) (and (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_8| Int)) (= .cse0 (select (select |c_#memory_$Pointer$#1.base| .cse1) |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_8|))) (= (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= .cse0 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 0) (exists ((v_arrayElimIndex_6 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#0.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_9| .cse2) 0) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_9| .cse3 (select |v_#valid_BEFORE_CALL_7| .cse3))) |v_#valid_BEFORE_CALL_7|) (= (select (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimIndex_6) 1) (= (select |v_#valid_BEFORE_CALL_7| .cse2) 1)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 8)) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_8| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_6| .cse1) 1) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_6| .cse4 (select |v_#valid_BEFORE_CALL_8| .cse4))) |v_#valid_BEFORE_CALL_8|))) (or (= .cse1 .cse0) (= .cse1 (select .cse5 0))))))) is different from false [2025-04-29 10:55:33,293 WARN L871 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| .cse0))) (let ((.cse1 (select .cse5 4))) (and (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_8| Int)) (= .cse0 (select (select |c_#memory_$Pointer$#1.base| .cse1) |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_8|))) (= (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= .cse0 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 0) (exists ((v_arrayElimIndex_6 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#0.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_9| .cse2) 0) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_9| .cse3 (select |v_#valid_BEFORE_CALL_7| .cse3))) |v_#valid_BEFORE_CALL_7|) (= (select (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimIndex_6) 1) (= (select |v_#valid_BEFORE_CALL_7| .cse2) 1)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 8)) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_8| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_6| .cse1) 1) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_6| .cse4 (select |v_#valid_BEFORE_CALL_8| .cse4))) |v_#valid_BEFORE_CALL_8|))) (or (= .cse1 .cse0) (= .cse1 (select .cse5 0))))))) is different from true [2025-04-29 10:55:33,356 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse6 (select |c_#memory_$Pointer$#1.base| .cse0))) (let ((.cse1 (select .cse6 4)) (.cse2 (select .cse6 0))) (and (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_8| Int)) (= .cse0 (select (select |c_#memory_$Pointer$#1.base| .cse1) |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_8|))) (= (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= .cse2 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 0) (exists ((v_arrayElimIndex_6 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#0.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_9| .cse3) 0) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_9| .cse4 (select |v_#valid_BEFORE_CALL_7| .cse4))) |v_#valid_BEFORE_CALL_7|) (= (select (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimIndex_6) 1) (= (select |v_#valid_BEFORE_CALL_7| .cse3) 1)))) (= |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| 0) (= .cse0 |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 8)) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_8| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_6| .cse1) 1) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_6| .cse5 (select |v_#valid_BEFORE_CALL_8| .cse5))) |v_#valid_BEFORE_CALL_8|))) (or (= .cse1 .cse0) (= .cse1 .cse2)))))) is different from false [2025-04-29 10:55:33,362 WARN L871 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse6 (select |c_#memory_$Pointer$#1.base| .cse0))) (let ((.cse1 (select .cse6 4)) (.cse2 (select .cse6 0))) (and (exists ((|v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_8| Int)) (= .cse0 (select (select |c_#memory_$Pointer$#1.base| .cse1) |v_ULTIMATE.start_dll_circular_create_~last~0#1.offset_8|))) (= (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= .cse2 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 0) (exists ((v_arrayElimIndex_6 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#0.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_9| .cse3) 0) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_9| .cse4 (select |v_#valid_BEFORE_CALL_7| .cse4))) |v_#valid_BEFORE_CALL_7|) (= (select (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimIndex_6) 1) (= (select |v_#valid_BEFORE_CALL_7| .cse3) 1)))) (= |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| 0) (= .cse0 |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 8)) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_8| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_6| .cse1) 1) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_6| .cse5 (select |v_#valid_BEFORE_CALL_8| .cse5))) |v_#valid_BEFORE_CALL_8|))) (or (= .cse1 .cse0) (= .cse1 .cse2)))))) is different from true [2025-04-29 10:55:33,435 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 10:55:33,438 WARN L195 Elim1Store]: Array PQE input equivalent to false [2025-04-29 10:55:33,448 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-29 10:55:33,453 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 10:55:33,456 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 10:55:33,457 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 37 treesize of output 34 [2025-04-29 10:55:33,483 INFO L325 Elim1Store]: treesize reduction 65, result has 9.7 percent of original size [2025-04-29 10:55:33,484 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 178 treesize of output 94 [2025-04-29 10:55:33,512 INFO L325 Elim1Store]: treesize reduction 143, result has 5.9 percent of original size [2025-04-29 10:55:33,512 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 186 treesize of output 106 [2025-04-29 10:55:33,540 INFO L325 Elim1Store]: treesize reduction 64, result has 33.3 percent of original size [2025-04-29 10:55:33,541 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 41 treesize of output 38 [2025-04-29 10:55:33,545 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 52 treesize of output 27 [2025-04-29 10:55:33,549 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-29 10:55:33,584 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 9 treesize of output 7 [2025-04-29 10:55:33,608 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse6 (select |c_#memory_$Pointer$#1.base| .cse0))) (let ((.cse1 (select .cse6 4)) (.cse2 (select .cse6 0))) (and (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_8| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_6| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_8| .cse2) 0) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_6| .cse3 (select |v_#valid_BEFORE_CALL_8| .cse3))) |v_#valid_BEFORE_CALL_8|))) (or (= .cse1 .cse0) (and (not (= .cse1 .cse2)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 0) 0)) (= .cse2 .cse0)) (= (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| .cse2) 8)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((v_arrayElimIndex_6 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#0.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_9| .cse4) 0) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_9| .cse5 (select |v_#valid_BEFORE_CALL_7| .cse5))) |v_#valid_BEFORE_CALL_7|) (= (select (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimIndex_6) 1) (= (select |v_#valid_BEFORE_CALL_7| .cse4) 1)))))))) is different from false [2025-04-29 10:55:33,611 WARN L871 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse6 (select |c_#memory_$Pointer$#1.base| .cse0))) (let ((.cse1 (select .cse6 4)) (.cse2 (select .cse6 0))) (and (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_8| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_6| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_6| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_8| .cse2) 0) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_6| .cse3 (select |v_#valid_BEFORE_CALL_8| .cse3))) |v_#valid_BEFORE_CALL_8|))) (or (= .cse1 .cse0) (and (not (= .cse1 .cse2)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 0) 0)) (= .cse2 .cse0)) (= (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| .cse2) 8)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((v_arrayElimIndex_6 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#0.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (select |v_#valid_BEFORE_CALL_9| .cse4) 0) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_9| .cse5 (select |v_#valid_BEFORE_CALL_7| .cse5))) |v_#valid_BEFORE_CALL_7|) (= (select (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimIndex_6) 1) (= (select |v_#valid_BEFORE_CALL_7| .cse4) 1)))))))) is different from true [2025-04-29 10:55:33,637 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:55:33,637 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 148 treesize of output 96 [2025-04-29 10:55:33,729 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|))) (let ((.cse0 (select .cse4 0)) (.cse1 (select .cse4 4))) (and (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_8| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_6| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_6| .cse2 (select |v_#valid_BEFORE_CALL_8| .cse2))) |v_#valid_BEFORE_CALL_8|))) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (or (exists ((|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int)) (and (= (select (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (not (= |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| |c_ULTIMATE.start_main_~#s~0#1.base|)))) (and (exists ((|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int)) (= (select (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0)) (exists ((v_arrayElimIndex_6 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int))) (and (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_9| .cse3 (select |v_#valid_BEFORE_CALL_7| .cse3))) |v_#valid_BEFORE_CALL_7|) (= (select |v_#valid_BEFORE_CALL_7| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimIndex_6) 1) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| .cse0) 8)) (or (and (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) 0) (not (= .cse1 .cse0))) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse0) (= .cse1 |c_ULTIMATE.start_main_~ptr~0#1.base|))))) is different from false [2025-04-29 10:55:33,732 WARN L871 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|))) (let ((.cse0 (select .cse4 0)) (.cse1 (select .cse4 4))) (and (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_8| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_6| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_6| .cse2 (select |v_#valid_BEFORE_CALL_8| .cse2))) |v_#valid_BEFORE_CALL_8|))) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (or (exists ((|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int)) (and (= (select (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (not (= |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| |c_ULTIMATE.start_main_~#s~0#1.base|)))) (and (exists ((|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int)) (= (select (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0)) (exists ((v_arrayElimIndex_6 Int) (|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_9| (Array Int Int))) (and (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_9| .cse3 (select |v_#valid_BEFORE_CALL_7| .cse3))) |v_#valid_BEFORE_CALL_7|) (= (select |v_#valid_BEFORE_CALL_7| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimIndex_6) 1) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| .cse0) 8)) (or (and (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) 0) (not (= .cse1 .cse0))) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse0) (= .cse1 |c_ULTIMATE.start_main_~ptr~0#1.base|))))) is different from true [2025-04-29 10:55:33,801 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 72 treesize of output 40 [2025-04-29 10:55:33,809 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 27 treesize of output 19 [2025-04-29 10:55:33,828 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:55:33,828 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-29 10:55:33,935 WARN L849 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~ptr~0#1.base|) 8)) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimCell_49 Int) (|v_ULTIMATE.start_main_~ptr~0#1.base_22| Int)) (and (= (select |v_#valid_BEFORE_CALL_8| |v_ULTIMATE.start_main_~ptr~0#1.base_22|) 1) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_49) 1) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |v_#valid_BEFORE_CALL_8| .cse0))) |v_#valid_BEFORE_CALL_8|) (= 0 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~ptr~0#1.base_22|))))) is different from false [2025-04-29 10:55:33,937 WARN L871 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~ptr~0#1.base|) 8)) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimCell_49 Int) (|v_ULTIMATE.start_main_~ptr~0#1.base_22| Int)) (and (= (select |v_#valid_BEFORE_CALL_8| |v_ULTIMATE.start_main_~ptr~0#1.base_22|) 1) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_6| v_arrayElimCell_49) 1) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |v_#valid_BEFORE_CALL_8| .cse0))) |v_#valid_BEFORE_CALL_8|) (= 0 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~ptr~0#1.base_22|))))) is different from true [2025-04-29 10:55:33,960 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-29 10:55:33,964 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-29 10:55:33,964 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:55:34,053 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:55:34,053 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 70 treesize of output 71 [2025-04-29 10:55:34,065 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:55:34,065 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 268 treesize of output 271 [2025-04-29 10:55:34,080 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 126 treesize of output 120 [2025-04-29 10:55:34,092 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 242 treesize of output 230 [2025-04-29 10:55:34,714 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse8 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse17 (= .cse8 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|)) (.cse12 (= .cse8 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|)) (.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|))) (.cse0 (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse9 (+ |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 4))) (let ((.cse1 (or .cse17 (and (or (forall ((v_ArrVal_1559 (Array Int Int)) (v_ArrVal_1558 (Array Int Int)) (v_ArrVal_1557 (Array Int Int)) (v_ArrVal_1564 (Array Int Int)) (v_ArrVal_1561 (Array Int Int)) (v_arrayElimCell_55 Int)) (let ((.cse31 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1561))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store .cse31 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1557) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1564) (select (select (store (store .cse7 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1559) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1558) .cse8) .cse0)) (+ 8 v_arrayElimCell_55))) (not (= v_ArrVal_1557 (store (store (select .cse31 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse9 (select v_ArrVal_1557 .cse9)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1557 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|))))))) .cse12) (forall ((v_ArrVal_1557 (Array Int Int)) (v_ArrVal_1561 (Array Int Int)) (v_arrayElimCell_55 Int)) (let ((.cse33 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1561))) (or (forall ((v_ArrVal_1559 (Array Int Int)) (v_ArrVal_1558 (Array Int Int)) (v_ArrVal_1564 (Array Int Int)) (v_arrayElimCell_58 Int)) (let ((.cse32 (select (store (store .cse33 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1557) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1564) (select (select (store (store .cse7 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1559) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1558) .cse8) .cse0)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse32 (+ 8 v_arrayElimCell_58))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse32 (+ 8 v_arrayElimCell_55)))))) (not (= v_ArrVal_1557 (store (store (select .cse33 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse9 (select v_ArrVal_1557 .cse9)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1557 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)))))))))) (.cse2 (forall ((v_ArrVal_1557 (Array Int Int)) (v_ArrVal_1561 (Array Int Int)) (v_arrayElimCell_55 Int)) (let ((.cse29 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1561))) (or (not (= v_ArrVal_1557 (store (store (select .cse29 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse9 (select v_ArrVal_1557 .cse9)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1557 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)))) (forall ((v_ArrVal_1559 (Array Int Int)) (v_ArrVal_1558 (Array Int Int)) (v_ArrVal_1564 (Array Int Int)) (v_arrayElimCell_58 Int) (v_arrayElimCell_57 Int)) (let ((.cse30 (select (store (store .cse29 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1557) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1564) (select (select (store (store .cse7 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1559) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1558) .cse8) .cse0)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse30 (+ 8 v_arrayElimCell_58))) (= |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_57)))))))))) (.cse3 (or (forall ((v_ArrVal_1559 (Array Int Int)) (v_ArrVal_1558 (Array Int Int)) (v_ArrVal_1557 (Array Int Int)) (v_ArrVal_1564 (Array Int Int)) (v_arrayElimCell_57 Int) (v_ArrVal_1561 (Array Int Int)) (v_arrayElimCell_55 Int)) (let ((.cse28 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1561))) (let ((.cse27 (select (store (store .cse28 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1557) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1564) (select (select (store (store .cse7 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1559) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1558) .cse8) .cse0)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse27 (+ 8 v_arrayElimCell_55))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse27 (+ 8 v_arrayElimCell_57))) (not (= v_ArrVal_1557 (store (store (select .cse28 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse9 (select v_ArrVal_1557 .cse9)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1557 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)))))))) .cse12)) (.cse10 (not .cse17)) (.cse20 (not .cse12)) (.cse5 (+ |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 8))) (and (or (= |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| .cse0) (and .cse1 .cse2 .cse3)) (forall ((v_ArrVal_1557 (Array Int Int)) (v_ArrVal_1561 (Array Int Int))) (let ((.cse6 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1561))) (or (forall ((v_ArrVal_1559 (Array Int Int)) (v_ArrVal_1558 (Array Int Int)) (v_ArrVal_1564 (Array Int Int)) (v_arrayElimCell_58 Int) (v_arrayElimCell_57 Int)) (let ((.cse4 (select (store (store .cse6 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1557) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1564) (select (select (store (store .cse7 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1559) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1558) .cse8) .cse0)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse4 (+ 8 v_arrayElimCell_58))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse4 (+ 8 v_arrayElimCell_57))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse4 .cse5))))) (not (= v_ArrVal_1557 (store (store (select .cse6 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse9 (select v_ArrVal_1557 .cse9)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1557 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|))))))) (or (= .cse8 |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) (and .cse1 (or .cse10 (let ((.cse11 (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|))) (and (or (forall ((v_ArrVal_1559 (Array Int Int)) (v_ArrVal_1558 (Array Int Int)) (v_ArrVal_1557 (Array Int Int)) (v_ArrVal_1564 (Array Int Int)) (v_arrayElimCell_57 Int) (v_ArrVal_1561 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1561) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1557) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1564) (select (select (store (store .cse7 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1559) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1558) .cse8) .cse0)) (+ 8 v_arrayElimCell_57))) (not (= (store (store .cse11 .cse9 (select v_ArrVal_1557 .cse9)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1557 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_1557)))) .cse12) (forall ((v_ArrVal_1557 (Array Int Int)) (v_ArrVal_1561 (Array Int Int))) (or (forall ((v_ArrVal_1559 (Array Int Int)) (v_ArrVal_1558 (Array Int Int)) (v_ArrVal_1564 (Array Int Int)) (v_arrayElimCell_57 Int)) (let ((.cse13 (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1561) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1557) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1564) (select (select (store (store .cse7 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1559) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1558) .cse8) .cse0)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse13 (+ 8 v_arrayElimCell_57))) (forall ((v_arrayElimCell_58 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse13 (+ 8 v_arrayElimCell_58))))))) (not (= (store (store .cse11 .cse9 (select v_ArrVal_1557 .cse9)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1557 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_1557))))))) .cse2 .cse3)) (or (and (or (forall ((v_ArrVal_1559 (Array Int Int)) (v_ArrVal_1558 (Array Int Int)) (v_ArrVal_1557 (Array Int Int)) (v_ArrVal_1564 (Array Int Int)) (v_ArrVal_1561 (Array Int Int))) (let ((.cse14 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1561))) (or (not (= v_ArrVal_1557 (store (store (select .cse14 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse9 (select v_ArrVal_1557 .cse9)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1557 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store .cse14 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1557) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1564) (select (select (store (store .cse7 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1559) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1558) .cse8) .cse0)) .cse5))))) .cse12) (forall ((v_ArrVal_1557 (Array Int Int)) (v_ArrVal_1561 (Array Int Int))) (let ((.cse15 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1561))) (or (not (= v_ArrVal_1557 (store (store (select .cse15 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse9 (select v_ArrVal_1557 .cse9)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1557 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)))) (forall ((v_ArrVal_1559 (Array Int Int)) (v_ArrVal_1558 (Array Int Int)) (v_ArrVal_1564 (Array Int Int)) (v_arrayElimCell_58 Int)) (let ((.cse16 (select (store (store .cse15 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1557) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1564) (select (select (store (store .cse7 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1559) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1558) .cse8) .cse0)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse16 (+ 8 v_arrayElimCell_58))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse16 .cse5))))))))) .cse17) (or (forall ((v_ArrVal_1559 (Array Int Int)) (v_ArrVal_1558 (Array Int Int)) (v_ArrVal_1557 (Array Int Int)) (v_ArrVal_1564 (Array Int Int)) (v_arrayElimCell_58 Int) (v_arrayElimCell_57 Int) (v_ArrVal_1561 (Array Int Int))) (let ((.cse19 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1561))) (let ((.cse18 (select (store (store .cse19 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1557) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1564) (select (select (store (store .cse7 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1559) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1558) .cse8) .cse0)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse18 (+ 8 v_arrayElimCell_58))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse18 (+ 8 v_arrayElimCell_57))) (not (= v_ArrVal_1557 (store (store (select .cse19 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse9 (select v_ArrVal_1557 .cse9)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1557 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)))))))) .cse20) (or (and (forall ((v_ArrVal_1557 (Array Int Int)) (v_ArrVal_1561 (Array Int Int))) (let ((.cse22 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1561))) (or (forall ((v_ArrVal_1559 (Array Int Int)) (v_ArrVal_1558 (Array Int Int)) (v_ArrVal_1564 (Array Int Int)) (v_arrayElimCell_57 Int)) (let ((.cse21 (select (store (store .cse22 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1557) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1564) (select (select (store (store .cse7 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1559) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1558) .cse8) .cse0)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse21 (+ 8 v_arrayElimCell_57))) (forall ((v_arrayElimCell_58 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse21 (+ 8 v_arrayElimCell_58))))))) (not (= v_ArrVal_1557 (store (store (select .cse22 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse9 (select v_ArrVal_1557 .cse9)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1557 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|))))))) (or (forall ((v_ArrVal_1559 (Array Int Int)) (v_ArrVal_1558 (Array Int Int)) (v_ArrVal_1557 (Array Int Int)) (v_ArrVal_1564 (Array Int Int)) (v_arrayElimCell_57 Int) (v_ArrVal_1561 (Array Int Int))) (let ((.cse23 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1561))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store .cse23 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1557) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1564) (select (select (store (store .cse7 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1559) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1558) .cse8) .cse0)) (+ 8 v_arrayElimCell_57))) (not (= v_ArrVal_1557 (store (store (select .cse23 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse9 (select v_ArrVal_1557 .cse9)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1557 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|))))))) .cse12)) .cse10) (or (forall ((v_ArrVal_1559 (Array Int Int)) (v_ArrVal_1558 (Array Int Int)) (v_ArrVal_1557 (Array Int Int)) (v_ArrVal_1564 (Array Int Int)) (v_arrayElimCell_58 Int) (v_ArrVal_1561 (Array Int Int))) (let ((.cse24 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1561))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store .cse24 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1557) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1564) (select (select (store (store .cse7 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1559) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1558) .cse8) .cse0)) (+ 8 v_arrayElimCell_58))) (not (= v_ArrVal_1557 (store (store (select .cse24 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse9 (select v_ArrVal_1557 .cse9)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1557 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|))))))) .cse20) (or (forall ((v_ArrVal_1559 (Array Int Int)) (v_ArrVal_1558 (Array Int Int)) (v_ArrVal_1557 (Array Int Int)) (v_ArrVal_1564 (Array Int Int)) (v_arrayElimCell_57 Int) (v_ArrVal_1561 (Array Int Int))) (let ((.cse26 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1561))) (let ((.cse25 (select (store (store .cse26 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1557) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1564) (select (select (store (store .cse7 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1559) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1558) .cse8) .cse0)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse25 (+ 8 v_arrayElimCell_57))) (not (= v_ArrVal_1557 (store (store (select .cse26 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse9 (select v_ArrVal_1557 .cse9)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1557 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse25 .cse5)))))) .cse12))))) is different from false [2025-04-29 10:55:35,381 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse35 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|))) (let ((.cse6 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (select .cse35 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|))) (let ((.cse9 (= .cse6 .cse4)) (.cse5 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store .cse35 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|))) (.cse7 (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse8 (+ |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 4)) (.cse0 (= .cse6 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|))) (let ((.cse2 (+ |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 8)) (.cse13 (not .cse0)) (.cse22 (or .cse0 (and (or .cse9 (forall ((v_ArrVal_1559 (Array Int Int)) (v_ArrVal_1558 (Array Int Int)) (v_ArrVal_1557 (Array Int Int)) (v_ArrVal_1564 (Array Int Int)) (v_ArrVal_1561 (Array Int Int)) (v_arrayElimCell_55 Int)) (let ((.cse32 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1561))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store .cse32 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1557) .cse4 v_ArrVal_1564) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1559) .cse4 v_ArrVal_1558) .cse6) .cse7)) (+ 8 v_arrayElimCell_55))) (not (= v_ArrVal_1557 (store (store (select .cse32 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse8 (select v_ArrVal_1557 .cse8)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1557 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)))))))) (forall ((v_ArrVal_1557 (Array Int Int)) (v_ArrVal_1561 (Array Int Int)) (v_arrayElimCell_55 Int)) (let ((.cse34 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1561))) (or (forall ((v_ArrVal_1559 (Array Int Int)) (v_ArrVal_1558 (Array Int Int)) (v_ArrVal_1564 (Array Int Int)) (v_arrayElimCell_58 Int)) (let ((.cse33 (select (store (store .cse34 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1557) .cse4 v_ArrVal_1564) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1559) .cse4 v_ArrVal_1558) .cse6) .cse7)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse33 (+ 8 v_arrayElimCell_55))) (= (select .cse33 (+ 8 v_arrayElimCell_58)) |c_ULTIMATE.start_main_~uneq~0#1|)))) (not (= v_ArrVal_1557 (store (store (select .cse34 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse8 (select v_ArrVal_1557 .cse8)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1557 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)))))))))) (.cse23 (or .cse9 (forall ((v_ArrVal_1559 (Array Int Int)) (v_ArrVal_1558 (Array Int Int)) (v_ArrVal_1557 (Array Int Int)) (v_ArrVal_1564 (Array Int Int)) (v_arrayElimCell_57 Int) (v_ArrVal_1561 (Array Int Int)) (v_arrayElimCell_55 Int)) (let ((.cse31 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1561))) (let ((.cse30 (select (store (store .cse31 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1557) .cse4 v_ArrVal_1564) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1559) .cse4 v_ArrVal_1558) .cse6) .cse7)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse30 (+ 8 v_arrayElimCell_55))) (not (= v_ArrVal_1557 (store (store (select .cse31 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse8 (select v_ArrVal_1557 .cse8)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1557 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse30 (+ 8 v_arrayElimCell_57))))))))) (.cse24 (forall ((v_ArrVal_1557 (Array Int Int)) (v_ArrVal_1561 (Array Int Int)) (v_arrayElimCell_55 Int)) (let ((.cse29 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1561))) (or (forall ((v_ArrVal_1559 (Array Int Int)) (v_ArrVal_1558 (Array Int Int)) (v_ArrVal_1564 (Array Int Int)) (v_arrayElimCell_58 Int) (v_arrayElimCell_57 Int)) (let ((.cse28 (select (store (store .cse29 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1557) .cse4 v_ArrVal_1564) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1559) .cse4 v_ArrVal_1558) .cse6) .cse7)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse28 (+ 8 v_arrayElimCell_55))) (= (select .cse28 (+ 8 v_arrayElimCell_58)) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse28 (+ 8 v_arrayElimCell_57)))))) (not (= v_ArrVal_1557 (store (store (select .cse29 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse8 (select v_ArrVal_1557 .cse8)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1557 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)))))))) (.cse19 (not .cse9))) (and (or .cse0 (and (forall ((v_ArrVal_1557 (Array Int Int)) (v_ArrVal_1561 (Array Int Int))) (let ((.cse3 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1561))) (or (forall ((v_ArrVal_1559 (Array Int Int)) (v_ArrVal_1558 (Array Int Int)) (v_ArrVal_1564 (Array Int Int)) (v_arrayElimCell_58 Int)) (let ((.cse1 (select (store (store .cse3 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1557) .cse4 v_ArrVal_1564) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1559) .cse4 v_ArrVal_1558) .cse6) .cse7)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse1 .cse2)) (= (select .cse1 (+ 8 v_arrayElimCell_58)) |c_ULTIMATE.start_main_~uneq~0#1|)))) (not (= v_ArrVal_1557 (store (store (select .cse3 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse8 (select v_ArrVal_1557 .cse8)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1557 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|))))))) (or .cse9 (forall ((v_ArrVal_1559 (Array Int Int)) (v_ArrVal_1558 (Array Int Int)) (v_ArrVal_1557 (Array Int Int)) (v_ArrVal_1564 (Array Int Int)) (v_ArrVal_1561 (Array Int Int))) (let ((.cse10 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1561))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store .cse10 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1557) .cse4 v_ArrVal_1564) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1559) .cse4 v_ArrVal_1558) .cse6) .cse7)) .cse2)) (not (= v_ArrVal_1557 (store (store (select .cse10 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse8 (select v_ArrVal_1557 .cse8)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1557 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)))))))))) (or .cse9 (forall ((v_ArrVal_1559 (Array Int Int)) (v_ArrVal_1558 (Array Int Int)) (v_ArrVal_1557 (Array Int Int)) (v_ArrVal_1564 (Array Int Int)) (v_arrayElimCell_57 Int) (v_ArrVal_1561 (Array Int Int))) (let ((.cse12 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1561))) (let ((.cse11 (select (store (store .cse12 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1557) .cse4 v_ArrVal_1564) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1559) .cse4 v_ArrVal_1558) .cse6) .cse7)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse11 .cse2)) (not (= v_ArrVal_1557 (store (store (select .cse12 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse8 (select v_ArrVal_1557 .cse8)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1557 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse11 (+ 8 v_arrayElimCell_57)))))))) (or .cse13 (and (forall ((v_ArrVal_1557 (Array Int Int)) (v_ArrVal_1561 (Array Int Int))) (let ((.cse15 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1561))) (or (forall ((v_ArrVal_1559 (Array Int Int)) (v_ArrVal_1558 (Array Int Int)) (v_ArrVal_1564 (Array Int Int)) (v_arrayElimCell_57 Int)) (let ((.cse14 (select (store (store .cse15 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1557) .cse4 v_ArrVal_1564) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1559) .cse4 v_ArrVal_1558) .cse6) .cse7)))) (or (forall ((v_arrayElimCell_58 Int)) (= (select .cse14 (+ 8 v_arrayElimCell_58)) |c_ULTIMATE.start_main_~uneq~0#1|)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse14 (+ 8 v_arrayElimCell_57)))))) (not (= v_ArrVal_1557 (store (store (select .cse15 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse8 (select v_ArrVal_1557 .cse8)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1557 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|))))))) (or .cse9 (forall ((v_ArrVal_1559 (Array Int Int)) (v_ArrVal_1558 (Array Int Int)) (v_ArrVal_1557 (Array Int Int)) (v_ArrVal_1564 (Array Int Int)) (v_arrayElimCell_57 Int) (v_ArrVal_1561 (Array Int Int))) (let ((.cse16 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1561))) (or (not (= v_ArrVal_1557 (store (store (select .cse16 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse8 (select v_ArrVal_1557 .cse8)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1557 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store .cse16 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1557) .cse4 v_ArrVal_1564) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1559) .cse4 v_ArrVal_1558) .cse6) .cse7)) (+ 8 v_arrayElimCell_57))))))))) (forall ((v_ArrVal_1557 (Array Int Int)) (v_ArrVal_1561 (Array Int Int))) (let ((.cse18 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1561))) (or (forall ((v_ArrVal_1559 (Array Int Int)) (v_ArrVal_1558 (Array Int Int)) (v_ArrVal_1564 (Array Int Int)) (v_arrayElimCell_58 Int) (v_arrayElimCell_57 Int)) (let ((.cse17 (select (store (store .cse18 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1557) .cse4 v_ArrVal_1564) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1559) .cse4 v_ArrVal_1558) .cse6) .cse7)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse17 .cse2)) (= (select .cse17 (+ 8 v_arrayElimCell_58)) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse17 (+ 8 v_arrayElimCell_57)))))) (not (= v_ArrVal_1557 (store (store (select .cse18 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse8 (select v_ArrVal_1557 .cse8)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1557 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|))))))) (or .cse19 (forall ((v_ArrVal_1559 (Array Int Int)) (v_ArrVal_1558 (Array Int Int)) (v_ArrVal_1557 (Array Int Int)) (v_ArrVal_1564 (Array Int Int)) (v_arrayElimCell_58 Int) (v_arrayElimCell_57 Int) (v_ArrVal_1561 (Array Int Int))) (let ((.cse20 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1561))) (let ((.cse21 (select (store (store .cse20 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1557) .cse4 v_ArrVal_1564) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1559) .cse4 v_ArrVal_1558) .cse6) .cse7)))) (or (not (= v_ArrVal_1557 (store (store (select .cse20 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse8 (select v_ArrVal_1557 .cse8)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1557 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)))) (= (select .cse21 (+ 8 v_arrayElimCell_58)) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse21 (+ 8 v_arrayElimCell_57)))))))) (or (= .cse6 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) (and .cse22 .cse23 .cse24 (or (let ((.cse25 (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|))) (and (or .cse9 (forall ((v_ArrVal_1559 (Array Int Int)) (v_ArrVal_1558 (Array Int Int)) (v_ArrVal_1557 (Array Int Int)) (v_ArrVal_1564 (Array Int Int)) (v_arrayElimCell_57 Int) (v_ArrVal_1561 (Array Int Int))) (or (not (= (store (store .cse25 .cse8 (select v_ArrVal_1557 .cse8)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1557 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_1557)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1561) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1557) .cse4 v_ArrVal_1564) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1559) .cse4 v_ArrVal_1558) .cse6) .cse7)) (+ 8 v_arrayElimCell_57)))))) (forall ((v_ArrVal_1557 (Array Int Int)) (v_ArrVal_1561 (Array Int Int))) (or (not (= (store (store .cse25 .cse8 (select v_ArrVal_1557 .cse8)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1557 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_1557)) (forall ((v_ArrVal_1559 (Array Int Int)) (v_ArrVal_1558 (Array Int Int)) (v_ArrVal_1564 (Array Int Int)) (v_arrayElimCell_57 Int)) (let ((.cse26 (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1561) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1557) .cse4 v_ArrVal_1564) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1559) .cse4 v_ArrVal_1558) .cse6) .cse7)))) (or (forall ((v_arrayElimCell_58 Int)) (= (select .cse26 (+ 8 v_arrayElimCell_58)) |c_ULTIMATE.start_main_~uneq~0#1|)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse26 (+ 8 v_arrayElimCell_57)))))))))) .cse13))) (or (and .cse22 .cse23 .cse24) (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| .cse7)) (or .cse19 (forall ((v_ArrVal_1559 (Array Int Int)) (v_ArrVal_1558 (Array Int Int)) (v_ArrVal_1557 (Array Int Int)) (v_ArrVal_1564 (Array Int Int)) (v_arrayElimCell_58 Int) (v_ArrVal_1561 (Array Int Int))) (let ((.cse27 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1561))) (or (not (= v_ArrVal_1557 (store (store (select .cse27 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse8 (select v_ArrVal_1557 .cse8)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1557 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)))) (= (select (select (store (store .cse27 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1557) .cse4 v_ArrVal_1564) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1559) .cse4 v_ArrVal_1558) .cse6) .cse7)) (+ 8 v_arrayElimCell_58)) |c_ULTIMATE.start_main_~uneq~0#1|)))))))))) is different from false [2025-04-29 10:55:39,701 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse7 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse37 (select |c_#memory_$Pointer$#1.base| .cse7)) (.cse21 (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse5 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select .cse37 .cse21))) (let ((.cse8 (= .cse5 .cse3)) (.cse2 (+ |c_ULTIMATE.start_dll_circular_insert_#t~ret6#1.offset| 4)) (.cse4 (store |c_#memory_$Pointer$#1.base| .cse7 (store .cse37 .cse21 |c_ULTIMATE.start_dll_circular_insert_#t~ret6#1.base|))) (.cse6 (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse17 (= .cse5 |c_ULTIMATE.start_dll_circular_insert_#t~ret6#1.base|))) (let ((.cse18 (or (and (forall ((v_ArrVal_1557 (Array Int Int)) (v_ArrVal_1561 (Array Int Int)) (v_arrayElimCell_55 Int)) (let ((.cse34 (store |c_#memory_int#1| .cse7 v_ArrVal_1561))) (or (not (= v_ArrVal_1557 (store (store (select .cse34 |c_ULTIMATE.start_dll_circular_insert_#t~ret6#1.base|) .cse2 (select v_ArrVal_1557 .cse2)) |c_ULTIMATE.start_dll_circular_insert_#t~ret6#1.offset| (select v_ArrVal_1557 |c_ULTIMATE.start_dll_circular_insert_#t~ret6#1.offset|)))) (forall ((v_ArrVal_1559 (Array Int Int)) (v_ArrVal_1558 (Array Int Int)) (v_ArrVal_1564 (Array Int Int)) (v_arrayElimCell_58 Int)) (let ((.cse35 (select (store (store .cse34 |c_ULTIMATE.start_dll_circular_insert_#t~ret6#1.base| v_ArrVal_1557) .cse3 v_ArrVal_1564) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_circular_insert_#t~ret6#1.base| v_ArrVal_1559) .cse3 v_ArrVal_1558) .cse5) .cse6)))) (or (= (select .cse35 (+ 8 v_arrayElimCell_55)) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse35 (+ 8 v_arrayElimCell_58))))))))) (or .cse8 (forall ((v_ArrVal_1559 (Array Int Int)) (v_ArrVal_1558 (Array Int Int)) (v_ArrVal_1557 (Array Int Int)) (v_ArrVal_1564 (Array Int Int)) (v_ArrVal_1561 (Array Int Int)) (v_arrayElimCell_55 Int)) (let ((.cse36 (store |c_#memory_int#1| .cse7 v_ArrVal_1561))) (or (not (= v_ArrVal_1557 (store (store (select .cse36 |c_ULTIMATE.start_dll_circular_insert_#t~ret6#1.base|) .cse2 (select v_ArrVal_1557 .cse2)) |c_ULTIMATE.start_dll_circular_insert_#t~ret6#1.offset| (select v_ArrVal_1557 |c_ULTIMATE.start_dll_circular_insert_#t~ret6#1.offset|)))) (= (select (select (store (store .cse36 |c_ULTIMATE.start_dll_circular_insert_#t~ret6#1.base| v_ArrVal_1557) .cse3 v_ArrVal_1564) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_circular_insert_#t~ret6#1.base| v_ArrVal_1559) .cse3 v_ArrVal_1558) .cse5) .cse6)) (+ 8 v_arrayElimCell_55)) |c_ULTIMATE.start_main_~uneq~0#1|)))))) .cse17)) (.cse0 (not .cse17)) (.cse19 (or .cse8 (forall ((v_ArrVal_1559 (Array Int Int)) (v_ArrVal_1558 (Array Int Int)) (v_ArrVal_1557 (Array Int Int)) (v_ArrVal_1564 (Array Int Int)) (v_arrayElimCell_57 Int) (v_ArrVal_1561 (Array Int Int)) (v_arrayElimCell_55 Int)) (let ((.cse32 (store |c_#memory_int#1| .cse7 v_ArrVal_1561))) (let ((.cse33 (select (store (store .cse32 |c_ULTIMATE.start_dll_circular_insert_#t~ret6#1.base| v_ArrVal_1557) .cse3 v_ArrVal_1564) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_circular_insert_#t~ret6#1.base| v_ArrVal_1559) .cse3 v_ArrVal_1558) .cse5) .cse6)))) (or (not (= v_ArrVal_1557 (store (store (select .cse32 |c_ULTIMATE.start_dll_circular_insert_#t~ret6#1.base|) .cse2 (select v_ArrVal_1557 .cse2)) |c_ULTIMATE.start_dll_circular_insert_#t~ret6#1.offset| (select v_ArrVal_1557 |c_ULTIMATE.start_dll_circular_insert_#t~ret6#1.offset|)))) (= (select .cse33 (+ 8 v_arrayElimCell_55)) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse33 (+ 8 v_arrayElimCell_57))))))))) (.cse20 (forall ((v_ArrVal_1557 (Array Int Int)) (v_ArrVal_1561 (Array Int Int)) (v_arrayElimCell_55 Int)) (let ((.cse31 (store |c_#memory_int#1| .cse7 v_ArrVal_1561))) (or (forall ((v_ArrVal_1559 (Array Int Int)) (v_ArrVal_1558 (Array Int Int)) (v_ArrVal_1564 (Array Int Int)) (v_arrayElimCell_58 Int) (v_arrayElimCell_57 Int)) (let ((.cse30 (select (store (store .cse31 |c_ULTIMATE.start_dll_circular_insert_#t~ret6#1.base| v_ArrVal_1557) .cse3 v_ArrVal_1564) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_circular_insert_#t~ret6#1.base| v_ArrVal_1559) .cse3 v_ArrVal_1558) .cse5) .cse6)))) (or (= (select .cse30 (+ 8 v_arrayElimCell_55)) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse30 (+ 8 v_arrayElimCell_57))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse30 (+ 8 v_arrayElimCell_58)))))) (not (= v_ArrVal_1557 (store (store (select .cse31 |c_ULTIMATE.start_dll_circular_insert_#t~ret6#1.base|) .cse2 (select v_ArrVal_1557 .cse2)) |c_ULTIMATE.start_dll_circular_insert_#t~ret6#1.offset| (select v_ArrVal_1557 |c_ULTIMATE.start_dll_circular_insert_#t~ret6#1.offset|)))))))) (.cse24 (not .cse8)) (.cse13 (+ |c_ULTIMATE.start_dll_circular_insert_#t~ret6#1.offset| 8))) (and (or .cse0 (and (or (forall ((v_ArrVal_1559 (Array Int Int)) (v_ArrVal_1558 (Array Int Int)) (v_ArrVal_1557 (Array Int Int)) (v_ArrVal_1564 (Array Int Int)) (v_arrayElimCell_57 Int) (v_ArrVal_1561 (Array Int Int))) (let ((.cse1 (store |c_#memory_int#1| .cse7 v_ArrVal_1561))) (or (not (= v_ArrVal_1557 (store (store (select .cse1 |c_ULTIMATE.start_dll_circular_insert_#t~ret6#1.base|) .cse2 (select v_ArrVal_1557 .cse2)) |c_ULTIMATE.start_dll_circular_insert_#t~ret6#1.offset| (select v_ArrVal_1557 |c_ULTIMATE.start_dll_circular_insert_#t~ret6#1.offset|)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store .cse1 |c_ULTIMATE.start_dll_circular_insert_#t~ret6#1.base| v_ArrVal_1557) .cse3 v_ArrVal_1564) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_circular_insert_#t~ret6#1.base| v_ArrVal_1559) .cse3 v_ArrVal_1558) .cse5) .cse6)) (+ 8 v_arrayElimCell_57)))))) .cse8) (forall ((v_ArrVal_1557 (Array Int Int)) (v_ArrVal_1561 (Array Int Int))) (let ((.cse9 (store |c_#memory_int#1| .cse7 v_ArrVal_1561))) (or (not (= v_ArrVal_1557 (store (store (select .cse9 |c_ULTIMATE.start_dll_circular_insert_#t~ret6#1.base|) .cse2 (select v_ArrVal_1557 .cse2)) |c_ULTIMATE.start_dll_circular_insert_#t~ret6#1.offset| (select v_ArrVal_1557 |c_ULTIMATE.start_dll_circular_insert_#t~ret6#1.offset|)))) (forall ((v_ArrVal_1559 (Array Int Int)) (v_ArrVal_1558 (Array Int Int)) (v_ArrVal_1564 (Array Int Int)) (v_arrayElimCell_57 Int)) (let ((.cse10 (select (store (store .cse9 |c_ULTIMATE.start_dll_circular_insert_#t~ret6#1.base| v_ArrVal_1557) .cse3 v_ArrVal_1564) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_circular_insert_#t~ret6#1.base| v_ArrVal_1559) .cse3 v_ArrVal_1558) .cse5) .cse6)))) (or (forall ((v_arrayElimCell_58 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse10 (+ 8 v_arrayElimCell_58)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse10 (+ 8 v_arrayElimCell_57))))))))))) (forall ((v_ArrVal_1557 (Array Int Int)) (v_ArrVal_1561 (Array Int Int))) (let ((.cse11 (store |c_#memory_int#1| .cse7 v_ArrVal_1561))) (or (not (= v_ArrVal_1557 (store (store (select .cse11 |c_ULTIMATE.start_dll_circular_insert_#t~ret6#1.base|) .cse2 (select v_ArrVal_1557 .cse2)) |c_ULTIMATE.start_dll_circular_insert_#t~ret6#1.offset| (select v_ArrVal_1557 |c_ULTIMATE.start_dll_circular_insert_#t~ret6#1.offset|)))) (forall ((v_ArrVal_1559 (Array Int Int)) (v_ArrVal_1558 (Array Int Int)) (v_ArrVal_1564 (Array Int Int)) (v_arrayElimCell_58 Int) (v_arrayElimCell_57 Int)) (let ((.cse12 (select (store (store .cse11 |c_ULTIMATE.start_dll_circular_insert_#t~ret6#1.base| v_ArrVal_1557) .cse3 v_ArrVal_1564) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_circular_insert_#t~ret6#1.base| v_ArrVal_1559) .cse3 v_ArrVal_1558) .cse5) .cse6)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse12 .cse13)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse12 (+ 8 v_arrayElimCell_57))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse12 (+ 8 v_arrayElimCell_58))))))))) (or (and (forall ((v_ArrVal_1557 (Array Int Int)) (v_ArrVal_1561 (Array Int Int))) (let ((.cse14 (store |c_#memory_int#1| .cse7 v_ArrVal_1561))) (or (not (= v_ArrVal_1557 (store (store (select .cse14 |c_ULTIMATE.start_dll_circular_insert_#t~ret6#1.base|) .cse2 (select v_ArrVal_1557 .cse2)) |c_ULTIMATE.start_dll_circular_insert_#t~ret6#1.offset| (select v_ArrVal_1557 |c_ULTIMATE.start_dll_circular_insert_#t~ret6#1.offset|)))) (forall ((v_ArrVal_1559 (Array Int Int)) (v_ArrVal_1558 (Array Int Int)) (v_ArrVal_1564 (Array Int Int)) (v_arrayElimCell_58 Int)) (let ((.cse15 (select (store (store .cse14 |c_ULTIMATE.start_dll_circular_insert_#t~ret6#1.base| v_ArrVal_1557) .cse3 v_ArrVal_1564) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_circular_insert_#t~ret6#1.base| v_ArrVal_1559) .cse3 v_ArrVal_1558) .cse5) .cse6)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse15 .cse13)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse15 (+ 8 v_arrayElimCell_58))))))))) (or (forall ((v_ArrVal_1559 (Array Int Int)) (v_ArrVal_1558 (Array Int Int)) (v_ArrVal_1557 (Array Int Int)) (v_ArrVal_1564 (Array Int Int)) (v_ArrVal_1561 (Array Int Int))) (let ((.cse16 (store |c_#memory_int#1| .cse7 v_ArrVal_1561))) (or (not (= v_ArrVal_1557 (store (store (select .cse16 |c_ULTIMATE.start_dll_circular_insert_#t~ret6#1.base|) .cse2 (select v_ArrVal_1557 .cse2)) |c_ULTIMATE.start_dll_circular_insert_#t~ret6#1.offset| (select v_ArrVal_1557 |c_ULTIMATE.start_dll_circular_insert_#t~ret6#1.offset|)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store .cse16 |c_ULTIMATE.start_dll_circular_insert_#t~ret6#1.base| v_ArrVal_1557) .cse3 v_ArrVal_1564) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_circular_insert_#t~ret6#1.base| v_ArrVal_1559) .cse3 v_ArrVal_1558) .cse5) .cse6)) .cse13))))) .cse8)) .cse17) (or (and .cse18 .cse19 .cse20) (= .cse21 .cse6)) (or (= .cse5 .cse7) (and .cse18 (or (let ((.cse22 (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_insert_#t~ret6#1.base|))) (and (forall ((v_ArrVal_1557 (Array Int Int)) (v_ArrVal_1561 (Array Int Int))) (or (not (= v_ArrVal_1557 (store (store .cse22 .cse2 (select v_ArrVal_1557 .cse2)) |c_ULTIMATE.start_dll_circular_insert_#t~ret6#1.offset| (select v_ArrVal_1557 |c_ULTIMATE.start_dll_circular_insert_#t~ret6#1.offset|)))) (forall ((v_ArrVal_1559 (Array Int Int)) (v_ArrVal_1558 (Array Int Int)) (v_ArrVal_1564 (Array Int Int)) (v_arrayElimCell_57 Int)) (let ((.cse23 (select (store (store (store |c_#memory_int#1| .cse7 v_ArrVal_1561) |c_ULTIMATE.start_dll_circular_insert_#t~ret6#1.base| v_ArrVal_1557) .cse3 v_ArrVal_1564) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_circular_insert_#t~ret6#1.base| v_ArrVal_1559) .cse3 v_ArrVal_1558) .cse5) .cse6)))) (or (forall ((v_arrayElimCell_58 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse23 (+ 8 v_arrayElimCell_58)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse23 (+ 8 v_arrayElimCell_57)))))))) (or .cse8 (forall ((v_ArrVal_1559 (Array Int Int)) (v_ArrVal_1558 (Array Int Int)) (v_ArrVal_1557 (Array Int Int)) (v_ArrVal_1564 (Array Int Int)) (v_arrayElimCell_57 Int) (v_ArrVal_1561 (Array Int Int))) (or (not (= v_ArrVal_1557 (store (store .cse22 .cse2 (select v_ArrVal_1557 .cse2)) |c_ULTIMATE.start_dll_circular_insert_#t~ret6#1.offset| (select v_ArrVal_1557 |c_ULTIMATE.start_dll_circular_insert_#t~ret6#1.offset|)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store (store |c_#memory_int#1| .cse7 v_ArrVal_1561) |c_ULTIMATE.start_dll_circular_insert_#t~ret6#1.base| v_ArrVal_1557) .cse3 v_ArrVal_1564) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_circular_insert_#t~ret6#1.base| v_ArrVal_1559) .cse3 v_ArrVal_1558) .cse5) .cse6)) (+ 8 v_arrayElimCell_57)))))))) .cse0) .cse19 .cse20)) (or .cse24 (forall ((v_ArrVal_1559 (Array Int Int)) (v_ArrVal_1558 (Array Int Int)) (v_ArrVal_1557 (Array Int Int)) (v_ArrVal_1564 (Array Int Int)) (v_arrayElimCell_58 Int) (v_arrayElimCell_57 Int) (v_ArrVal_1561 (Array Int Int))) (let ((.cse25 (store |c_#memory_int#1| .cse7 v_ArrVal_1561))) (let ((.cse26 (select (store (store .cse25 |c_ULTIMATE.start_dll_circular_insert_#t~ret6#1.base| v_ArrVal_1557) .cse3 v_ArrVal_1564) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_circular_insert_#t~ret6#1.base| v_ArrVal_1559) .cse3 v_ArrVal_1558) .cse5) .cse6)))) (or (not (= v_ArrVal_1557 (store (store (select .cse25 |c_ULTIMATE.start_dll_circular_insert_#t~ret6#1.base|) .cse2 (select v_ArrVal_1557 .cse2)) |c_ULTIMATE.start_dll_circular_insert_#t~ret6#1.offset| (select v_ArrVal_1557 |c_ULTIMATE.start_dll_circular_insert_#t~ret6#1.offset|)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse26 (+ 8 v_arrayElimCell_57))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse26 (+ 8 v_arrayElimCell_58)))))))) (or (forall ((v_ArrVal_1559 (Array Int Int)) (v_ArrVal_1558 (Array Int Int)) (v_ArrVal_1557 (Array Int Int)) (v_ArrVal_1564 (Array Int Int)) (v_arrayElimCell_58 Int) (v_ArrVal_1561 (Array Int Int))) (let ((.cse27 (store |c_#memory_int#1| .cse7 v_ArrVal_1561))) (or (not (= v_ArrVal_1557 (store (store (select .cse27 |c_ULTIMATE.start_dll_circular_insert_#t~ret6#1.base|) .cse2 (select v_ArrVal_1557 .cse2)) |c_ULTIMATE.start_dll_circular_insert_#t~ret6#1.offset| (select v_ArrVal_1557 |c_ULTIMATE.start_dll_circular_insert_#t~ret6#1.offset|)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store .cse27 |c_ULTIMATE.start_dll_circular_insert_#t~ret6#1.base| v_ArrVal_1557) .cse3 v_ArrVal_1564) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_circular_insert_#t~ret6#1.base| v_ArrVal_1559) .cse3 v_ArrVal_1558) .cse5) .cse6)) (+ 8 v_arrayElimCell_58)))))) .cse24) (or .cse8 (forall ((v_ArrVal_1559 (Array Int Int)) (v_ArrVal_1558 (Array Int Int)) (v_ArrVal_1557 (Array Int Int)) (v_ArrVal_1564 (Array Int Int)) (v_arrayElimCell_57 Int) (v_ArrVal_1561 (Array Int Int))) (let ((.cse28 (store |c_#memory_int#1| .cse7 v_ArrVal_1561))) (let ((.cse29 (select (store (store .cse28 |c_ULTIMATE.start_dll_circular_insert_#t~ret6#1.base| v_ArrVal_1557) .cse3 v_ArrVal_1564) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_circular_insert_#t~ret6#1.base| v_ArrVal_1559) .cse3 v_ArrVal_1558) .cse5) .cse6)))) (or (not (= v_ArrVal_1557 (store (store (select .cse28 |c_ULTIMATE.start_dll_circular_insert_#t~ret6#1.base|) .cse2 (select v_ArrVal_1557 .cse2)) |c_ULTIMATE.start_dll_circular_insert_#t~ret6#1.offset| (select v_ArrVal_1557 |c_ULTIMATE.start_dll_circular_insert_#t~ret6#1.offset|)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse29 .cse13)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse29 (+ 8 v_arrayElimCell_57)))))))))))))) is different from false Killed by 15