./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/sll2c_insert_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e8d55036 Calling Ultimate with: /usr/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.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-simple/sll2c_insert_unequal.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b7b415e0519ab150e9247d3d9d0133f92cfd07c34f9918f9ebd19cf8109bf4e7 --- Real Ultimate output --- This is Ultimate 0.2.2-?-e8d5503-m [2023-02-15 22:28:02,541 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 22:28:02,542 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 22:28:02,578 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 22:28:02,579 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 22:28:02,581 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 22:28:02,582 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 22:28:02,584 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 22:28:02,586 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 22:28:02,589 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 22:28:02,590 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 22:28:02,591 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 22:28:02,591 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 22:28:02,593 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 22:28:02,594 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 22:28:02,595 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 22:28:02,596 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 22:28:02,597 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 22:28:02,598 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 22:28:02,600 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 22:28:02,601 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 22:28:02,602 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 22:28:02,603 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 22:28:02,603 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 22:28:02,609 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 22:28:02,610 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 22:28:02,611 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 22:28:02,611 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 22:28:02,612 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 22:28:02,613 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 22:28:02,613 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 22:28:02,614 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 22:28:02,614 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 22:28:02,615 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 22:28:02,616 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 22:28:02,617 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 22:28:02,617 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 22:28:02,617 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 22:28:02,617 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 22:28:02,618 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 22:28:02,619 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 22:28:02,620 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-15 22:28:02,639 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 22:28:02,641 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 22:28:02,641 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 22:28:02,641 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 22:28:02,641 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 22:28:02,641 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 22:28:02,642 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 22:28:02,642 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 22:28:02,642 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 22:28:02,642 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 22:28:02,642 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 22:28:02,643 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-15 22:28:02,643 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 22:28:02,643 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 22:28:02,643 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 22:28:02,643 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-15 22:28:02,643 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-15 22:28:02,643 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-15 22:28:02,643 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 22:28:02,644 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-15 22:28:02,644 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 22:28:02,644 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 22:28:02,644 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 22:28:02,644 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 22:28:02,644 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 22:28:02,644 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 22:28:02,645 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 22:28:02,645 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 22:28:02,645 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 22:28:02,646 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 22:28:02,646 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 22:28:02,646 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 22:28:02,646 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 22:28:02,646 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 22:28:02,646 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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.graphml 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> b7b415e0519ab150e9247d3d9d0133f92cfd07c34f9918f9ebd19cf8109bf4e7 [2023-02-15 22:28:02,856 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 22:28:02,880 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 22:28:02,882 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 22:28:02,883 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 22:28:02,883 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 22:28:02,884 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2c_insert_unequal.i [2023-02-15 22:28:03,936 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 22:28:04,172 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 22:28:04,175 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_insert_unequal.i [2023-02-15 22:28:04,185 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/764a95ef0/d7dfd719aaa6410aa13b2176a6a8e4cb/FLAG8e0995b37 [2023-02-15 22:28:04,197 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/764a95ef0/d7dfd719aaa6410aa13b2176a6a8e4cb [2023-02-15 22:28:04,199 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 22:28:04,200 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 22:28:04,201 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 22:28:04,201 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 22:28:04,203 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 22:28:04,204 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:28:04" (1/1) ... [2023-02-15 22:28:04,204 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61b03e2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:28:04, skipping insertion in model container [2023-02-15 22:28:04,205 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:28:04" (1/1) ... [2023-02-15 22:28:04,209 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 22:28:04,240 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 22:28:04,439 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_insert_unequal.i[24872,24885] [2023-02-15 22:28:04,442 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 22:28:04,451 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 22:28:04,504 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_insert_unequal.i[24872,24885] [2023-02-15 22:28:04,505 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 22:28:04,525 INFO L208 MainTranslator]: Completed translation [2023-02-15 22:28:04,525 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:28:04 WrapperNode [2023-02-15 22:28:04,525 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 22:28:04,526 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 22:28:04,527 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 22:28:04,527 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 22:28:04,531 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:28:04" (1/1) ... [2023-02-15 22:28:04,543 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:28:04" (1/1) ... [2023-02-15 22:28:04,573 INFO L138 Inliner]: procedures = 127, calls = 48, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 178 [2023-02-15 22:28:04,573 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 22:28:04,574 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 22:28:04,574 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 22:28:04,574 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 22:28:04,582 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:28:04" (1/1) ... [2023-02-15 22:28:04,582 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:28:04" (1/1) ... [2023-02-15 22:28:04,585 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:28:04" (1/1) ... [2023-02-15 22:28:04,585 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:28:04" (1/1) ... [2023-02-15 22:28:04,591 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:28:04" (1/1) ... [2023-02-15 22:28:04,593 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:28:04" (1/1) ... [2023-02-15 22:28:04,595 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:28:04" (1/1) ... [2023-02-15 22:28:04,596 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:28:04" (1/1) ... [2023-02-15 22:28:04,598 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 22:28:04,598 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 22:28:04,598 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 22:28:04,599 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 22:28:04,599 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:28:04" (1/1) ... [2023-02-15 22:28:04,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 22:28:04,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:28:04,621 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-15 22:28:04,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-15 22:28:04,647 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-15 22:28:04,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-15 22:28:04,648 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-02-15 22:28:04,648 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-02-15 22:28:04,648 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-15 22:28:04,648 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 22:28:04,648 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-15 22:28:04,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-15 22:28:04,648 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-15 22:28:04,648 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-15 22:28:04,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-02-15 22:28:04,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-15 22:28:04,649 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 22:28:04,649 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 22:28:04,727 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 22:28:04,729 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 22:28:05,045 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 22:28:05,050 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 22:28:05,051 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2023-02-15 22:28:05,053 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:28:05 BoogieIcfgContainer [2023-02-15 22:28:05,053 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 22:28:05,056 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 22:28:05,056 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 22:28:05,058 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 22:28:05,059 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 10:28:04" (1/3) ... [2023-02-15 22:28:05,059 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7299b5af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:28:05, skipping insertion in model container [2023-02-15 22:28:05,059 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:28:04" (2/3) ... [2023-02-15 22:28:05,060 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7299b5af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:28:05, skipping insertion in model container [2023-02-15 22:28:05,060 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:28:05" (3/3) ... [2023-02-15 22:28:05,083 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_insert_unequal.i [2023-02-15 22:28:05,097 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 22:28:05,098 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 62 error locations. [2023-02-15 22:28:05,158 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 22:28:05,162 INFO L357 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, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@4f2c5bfe, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 22:28:05,162 INFO L358 AbstractCegarLoop]: Starting to check reachability of 62 error locations. [2023-02-15 22:28:05,165 INFO L276 IsEmpty]: Start isEmpty. Operand has 141 states, 74 states have (on average 2.081081081081081) internal successors, (154), 136 states have internal predecessors, (154), 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) [2023-02-15 22:28:05,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-15 22:28:05,170 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:28:05,170 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-15 22:28:05,170 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-02-15 22:28:05,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:28:05,174 INFO L85 PathProgramCache]: Analyzing trace with hash 896568277, now seen corresponding path program 1 times [2023-02-15 22:28:05,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:28:05,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039087684] [2023-02-15 22:28:05,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:28:05,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:28:05,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:05,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:28:05,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:28:05,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039087684] [2023-02-15 22:28:05,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039087684] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:28:05,393 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:28:05,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 22:28:05,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424936910] [2023-02-15 22:28:05,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:28:05,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 22:28:05,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:28:05,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 22:28:05,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 22:28:05,434 INFO L87 Difference]: Start difference. First operand has 141 states, 74 states have (on average 2.081081081081081) internal successors, (154), 136 states have internal predecessors, (154), 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, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:28:05,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:28:05,565 INFO L93 Difference]: Finished difference Result 139 states and 152 transitions. [2023-02-15 22:28:05,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 22:28:05,568 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-02-15 22:28:05,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:28:05,575 INFO L225 Difference]: With dead ends: 139 [2023-02-15 22:28:05,575 INFO L226 Difference]: Without dead ends: 136 [2023-02-15 22:28:05,576 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 22:28:05,578 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 8 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:28:05,579 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 225 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:28:05,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2023-02-15 22:28:05,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2023-02-15 22:28:05,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 72 states have (on average 1.9722222222222223) internal successors, (142), 131 states have internal predecessors, (142), 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) [2023-02-15 22:28:05,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 148 transitions. [2023-02-15 22:28:05,606 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 148 transitions. Word has length 6 [2023-02-15 22:28:05,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:28:05,606 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 148 transitions. [2023-02-15 22:28:05,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:28:05,607 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 148 transitions. [2023-02-15 22:28:05,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-15 22:28:05,607 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:28:05,607 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-15 22:28:05,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-15 22:28:05,608 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-02-15 22:28:05,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:28:05,608 INFO L85 PathProgramCache]: Analyzing trace with hash 896568278, now seen corresponding path program 1 times [2023-02-15 22:28:05,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:28:05,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014195236] [2023-02-15 22:28:05,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:28:05,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:28:05,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:05,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:28:05,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:28:05,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014195236] [2023-02-15 22:28:05,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014195236] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:28:05,667 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:28:05,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 22:28:05,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360182355] [2023-02-15 22:28:05,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:28:05,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 22:28:05,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:28:05,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 22:28:05,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 22:28:05,670 INFO L87 Difference]: Start difference. First operand 136 states and 148 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:28:05,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:28:05,733 INFO L93 Difference]: Finished difference Result 134 states and 146 transitions. [2023-02-15 22:28:05,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 22:28:05,733 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-02-15 22:28:05,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:28:05,734 INFO L225 Difference]: With dead ends: 134 [2023-02-15 22:28:05,734 INFO L226 Difference]: Without dead ends: 134 [2023-02-15 22:28:05,734 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 22:28:05,735 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 4 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:28:05,736 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 227 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:28:05,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2023-02-15 22:28:05,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2023-02-15 22:28:05,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 72 states have (on average 1.9444444444444444) internal successors, (140), 129 states have internal predecessors, (140), 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) [2023-02-15 22:28:05,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 146 transitions. [2023-02-15 22:28:05,742 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 146 transitions. Word has length 6 [2023-02-15 22:28:05,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:28:05,742 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 146 transitions. [2023-02-15 22:28:05,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:28:05,743 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 146 transitions. [2023-02-15 22:28:05,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-15 22:28:05,743 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:28:05,743 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:28:05,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-15 22:28:05,744 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-02-15 22:28:05,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:28:05,744 INFO L85 PathProgramCache]: Analyzing trace with hash 24922967, now seen corresponding path program 1 times [2023-02-15 22:28:05,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:28:05,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149337618] [2023-02-15 22:28:05,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:28:05,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:28:05,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:05,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:28:05,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:05,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:28:05,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:28:05,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149337618] [2023-02-15 22:28:05,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149337618] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:28:05,809 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:28:05,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 22:28:05,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581335769] [2023-02-15 22:28:05,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:28:05,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 22:28:05,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:28:05,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 22:28:05,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 22:28:05,811 INFO L87 Difference]: Start difference. First operand 134 states and 146 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 22:28:05,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:28:05,896 INFO L93 Difference]: Finished difference Result 141 states and 154 transitions. [2023-02-15 22:28:05,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 22:28:05,897 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2023-02-15 22:28:05,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:28:05,898 INFO L225 Difference]: With dead ends: 141 [2023-02-15 22:28:05,898 INFO L226 Difference]: Without dead ends: 141 [2023-02-15 22:28:05,898 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 22:28:05,899 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 5 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:28:05,899 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 338 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:28:05,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2023-02-15 22:28:05,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 135. [2023-02-15 22:28:05,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 73 states have (on average 1.9315068493150684) internal successors, (141), 130 states have internal predecessors, (141), 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) [2023-02-15 22:28:05,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 147 transitions. [2023-02-15 22:28:05,911 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 147 transitions. Word has length 13 [2023-02-15 22:28:05,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:28:05,912 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 147 transitions. [2023-02-15 22:28:05,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 22:28:05,912 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 147 transitions. [2023-02-15 22:28:05,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-15 22:28:05,913 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:28:05,913 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:28:05,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-15 22:28:05,913 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-02-15 22:28:05,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:28:05,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1284022556, now seen corresponding path program 1 times [2023-02-15 22:28:05,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:28:05,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775887564] [2023-02-15 22:28:05,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:28:05,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:28:05,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:05,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:28:05,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:06,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 22:28:06,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:06,054 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 22:28:06,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:28:06,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775887564] [2023-02-15 22:28:06,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775887564] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:28:06,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:28:06,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 22:28:06,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161366903] [2023-02-15 22:28:06,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:28:06,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 22:28:06,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:28:06,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 22:28:06,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-15 22:28:06,057 INFO L87 Difference]: Start difference. First operand 135 states and 147 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 22:28:06,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:28:06,264 INFO L93 Difference]: Finished difference Result 135 states and 148 transitions. [2023-02-15 22:28:06,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 22:28:06,265 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2023-02-15 22:28:06,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:28:06,267 INFO L225 Difference]: With dead ends: 135 [2023-02-15 22:28:06,267 INFO L226 Difference]: Without dead ends: 135 [2023-02-15 22:28:06,267 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-02-15 22:28:06,268 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 13 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 22:28:06,268 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 488 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 22:28:06,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2023-02-15 22:28:06,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 134. [2023-02-15 22:28:06,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 73 states have (on average 1.917808219178082) internal successors, (140), 129 states have internal predecessors, (140), 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) [2023-02-15 22:28:06,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 146 transitions. [2023-02-15 22:28:06,272 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 146 transitions. Word has length 22 [2023-02-15 22:28:06,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:28:06,273 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 146 transitions. [2023-02-15 22:28:06,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 22:28:06,273 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 146 transitions. [2023-02-15 22:28:06,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-15 22:28:06,274 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:28:06,274 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:28:06,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-15 22:28:06,274 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-02-15 22:28:06,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:28:06,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1284022557, now seen corresponding path program 1 times [2023-02-15 22:28:06,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:28:06,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996176894] [2023-02-15 22:28:06,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:28:06,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:28:06,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:06,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:28:06,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:06,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 22:28:06,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:06,488 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 22:28:06,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:28:06,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996176894] [2023-02-15 22:28:06,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996176894] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:28:06,488 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:28:06,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 22:28:06,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098676808] [2023-02-15 22:28:06,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:28:06,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 22:28:06,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:28:06,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 22:28:06,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-15 22:28:06,493 INFO L87 Difference]: Start difference. First operand 134 states and 146 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 22:28:06,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:28:06,676 INFO L93 Difference]: Finished difference Result 134 states and 147 transitions. [2023-02-15 22:28:06,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 22:28:06,677 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2023-02-15 22:28:06,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:28:06,678 INFO L225 Difference]: With dead ends: 134 [2023-02-15 22:28:06,678 INFO L226 Difference]: Without dead ends: 134 [2023-02-15 22:28:06,678 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-02-15 22:28:06,679 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 11 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 22:28:06,679 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 512 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 22:28:06,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2023-02-15 22:28:06,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 133. [2023-02-15 22:28:06,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 73 states have (on average 1.904109589041096) internal successors, (139), 128 states have internal predecessors, (139), 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) [2023-02-15 22:28:06,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 145 transitions. [2023-02-15 22:28:06,683 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 145 transitions. Word has length 22 [2023-02-15 22:28:06,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:28:06,683 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 145 transitions. [2023-02-15 22:28:06,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 22:28:06,684 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 145 transitions. [2023-02-15 22:28:06,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-15 22:28:06,684 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:28:06,684 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:28:06,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-15 22:28:06,685 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-02-15 22:28:06,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:28:06,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1337216453, now seen corresponding path program 1 times [2023-02-15 22:28:06,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:28:06,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227648579] [2023-02-15 22:28:06,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:28:06,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:28:06,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:06,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:28:06,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:06,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 22:28:06,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:06,864 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-15 22:28:06,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:28:06,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227648579] [2023-02-15 22:28:06,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227648579] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:28:06,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1864261428] [2023-02-15 22:28:06,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:28:06,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:28:06,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:28:06,868 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) [2023-02-15 22:28:06,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-15 22:28:06,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:06,952 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-15 22:28:06,959 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:28:06,989 INFO L350 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 [2023-02-15 22:28:07,033 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_256 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_256))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2023-02-15 22:28:07,079 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 22:28:07,080 INFO L350 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 [2023-02-15 22:28:07,094 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2023-02-15 22:28:07,095 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:28:07,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1864261428] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:28:07,164 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:28:07,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2023-02-15 22:28:07,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708247937] [2023-02-15 22:28:07,165 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:28:07,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-15 22:28:07,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:28:07,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-15 22:28:07,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=87, Unknown=1, NotChecked=18, Total=132 [2023-02-15 22:28:07,167 INFO L87 Difference]: Start difference. First operand 133 states and 145 transitions. Second operand has 11 states, 10 states have (on average 3.0) internal successors, (30), 8 states have internal predecessors, (30), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 22:28:07,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:28:07,395 INFO L93 Difference]: Finished difference Result 150 states and 163 transitions. [2023-02-15 22:28:07,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 22:28:07,395 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 8 states have internal predecessors, (30), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2023-02-15 22:28:07,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:28:07,396 INFO L225 Difference]: With dead ends: 150 [2023-02-15 22:28:07,396 INFO L226 Difference]: Without dead ends: 150 [2023-02-15 22:28:07,396 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=121, Unknown=1, NotChecked=22, Total=182 [2023-02-15 22:28:07,397 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 123 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 137 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 22:28:07,397 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 393 Invalid, 491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 351 Invalid, 0 Unknown, 137 Unchecked, 0.2s Time] [2023-02-15 22:28:07,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2023-02-15 22:28:07,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 132. [2023-02-15 22:28:07,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 73 states have (on average 1.8904109589041096) internal successors, (138), 127 states have internal predecessors, (138), 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) [2023-02-15 22:28:07,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 144 transitions. [2023-02-15 22:28:07,400 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 144 transitions. Word has length 25 [2023-02-15 22:28:07,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:28:07,401 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 144 transitions. [2023-02-15 22:28:07,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 8 states have internal predecessors, (30), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 22:28:07,401 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 144 transitions. [2023-02-15 22:28:07,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-15 22:28:07,401 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:28:07,401 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:28:07,407 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-02-15 22:28:07,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-02-15 22:28:07,607 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-02-15 22:28:07,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:28:07,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1337216454, now seen corresponding path program 1 times [2023-02-15 22:28:07,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:28:07,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267175272] [2023-02-15 22:28:07,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:28:07,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:28:07,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:07,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:28:07,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:07,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 22:28:07,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:07,868 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-15 22:28:07,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:28:07,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267175272] [2023-02-15 22:28:07,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267175272] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:28:07,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [994701234] [2023-02-15 22:28:07,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:28:07,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:28:07,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:28:07,870 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) [2023-02-15 22:28:07,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-15 22:28:07,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:07,982 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 31 conjunts are in the unsatisfiable core [2023-02-15 22:28:07,984 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:28:07,997 INFO L350 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 [2023-02-15 22:28:08,001 INFO L350 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 [2023-02-15 22:28:08,129 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_362 Int)) (= |c_#length| (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_362))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2023-02-15 22:28:08,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:28:08,172 INFO L350 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 12 treesize of output 14 [2023-02-15 22:28:08,178 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 22:28:08,178 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-15 22:28:08,204 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2023-02-15 22:28:08,204 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:28:08,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [994701234] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:28:08,314 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:28:08,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2023-02-15 22:28:08,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837234738] [2023-02-15 22:28:08,315 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:28:08,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-02-15 22:28:08,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:28:08,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-02-15 22:28:08,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=232, Unknown=1, NotChecked=30, Total=306 [2023-02-15 22:28:08,316 INFO L87 Difference]: Start difference. First operand 132 states and 144 transitions. Second operand has 16 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 12 states have internal predecessors, (40), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-15 22:28:08,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:28:08,810 INFO L93 Difference]: Finished difference Result 132 states and 145 transitions. [2023-02-15 22:28:08,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 22:28:08,813 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 12 states have internal predecessors, (40), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 25 [2023-02-15 22:28:08,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:28:08,813 INFO L225 Difference]: With dead ends: 132 [2023-02-15 22:28:08,814 INFO L226 Difference]: Without dead ends: 132 [2023-02-15 22:28:08,814 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=69, Invalid=354, Unknown=1, NotChecked=38, Total=462 [2023-02-15 22:28:08,814 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 252 mSDsluCounter, 704 mSDsCounter, 0 mSdLazyCounter, 883 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 790 SdHoareTripleChecker+Invalid, 1024 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 137 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-15 22:28:08,815 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 790 Invalid, 1024 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 883 Invalid, 0 Unknown, 137 Unchecked, 0.4s Time] [2023-02-15 22:28:08,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2023-02-15 22:28:08,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 131. [2023-02-15 22:28:08,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 73 states have (on average 1.8767123287671232) internal successors, (137), 126 states have internal predecessors, (137), 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) [2023-02-15 22:28:08,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 143 transitions. [2023-02-15 22:28:08,818 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 143 transitions. Word has length 25 [2023-02-15 22:28:08,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:28:08,818 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 143 transitions. [2023-02-15 22:28:08,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 12 states have internal predecessors, (40), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-15 22:28:08,818 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 143 transitions. [2023-02-15 22:28:08,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-15 22:28:08,819 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:28:08,819 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:28:08,833 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-15 22:28:09,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-02-15 22:28:09,025 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-02-15 22:28:09,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:28:09,025 INFO L85 PathProgramCache]: Analyzing trace with hash -148939745, now seen corresponding path program 1 times [2023-02-15 22:28:09,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:28:09,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561892901] [2023-02-15 22:28:09,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:28:09,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:28:09,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:09,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:28:09,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:09,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 22:28:09,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:09,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 22:28:09,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:09,337 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-15 22:28:09,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:28:09,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561892901] [2023-02-15 22:28:09,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561892901] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:28:09,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1121099548] [2023-02-15 22:28:09,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:28:09,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:28:09,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:28:09,340 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) [2023-02-15 22:28:09,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-15 22:28:09,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:09,459 INFO L263 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 31 conjunts are in the unsatisfiable core [2023-02-15 22:28:09,463 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:28:09,466 INFO L350 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 [2023-02-15 22:28:09,475 INFO L350 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 [2023-02-15 22:28:09,484 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_521 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| v_ArrVal_521))) is different from true [2023-02-15 22:28:09,493 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_521 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| v_ArrVal_521))) is different from true [2023-02-15 22:28:09,508 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 22:28:09,509 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2023-02-15 22:28:09,550 INFO L350 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 [2023-02-15 22:28:09,558 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_522 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_522))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) is different from true [2023-02-15 22:28:09,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:28:09,585 INFO L350 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 16 treesize of output 18 [2023-02-15 22:28:09,624 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) is different from true [2023-02-15 22:28:09,640 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:28:09,641 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2023-02-15 22:28:09,647 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 18 not checked. [2023-02-15 22:28:09,647 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:28:09,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1121099548] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:28:09,786 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:28:09,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12] total 17 [2023-02-15 22:28:09,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449366922] [2023-02-15 22:28:09,786 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:28:09,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-15 22:28:09,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:28:09,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-15 22:28:09,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=221, Unknown=4, NotChecked=132, Total=420 [2023-02-15 22:28:09,787 INFO L87 Difference]: Start difference. First operand 131 states and 143 transitions. Second operand has 18 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 15 states have internal predecessors, (50), 3 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2023-02-15 22:28:10,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:28:10,001 INFO L93 Difference]: Finished difference Result 140 states and 153 transitions. [2023-02-15 22:28:10,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 22:28:10,002 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 15 states have internal predecessors, (50), 3 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) Word has length 37 [2023-02-15 22:28:10,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:28:10,003 INFO L225 Difference]: With dead ends: 140 [2023-02-15 22:28:10,003 INFO L226 Difference]: Without dead ends: 140 [2023-02-15 22:28:10,003 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 44 SyntacticMatches, 6 SemanticMatches, 22 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=304, Unknown=4, NotChecked=156, Total=552 [2023-02-15 22:28:10,003 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 555 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 555 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 590 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:28:10,003 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [555 Valid, 252 Invalid, 913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 308 Invalid, 0 Unknown, 590 Unchecked, 0.1s Time] [2023-02-15 22:28:10,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2023-02-15 22:28:10,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 122. [2023-02-15 22:28:10,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 73 states have (on average 1.7534246575342465) internal successors, (128), 117 states have internal predecessors, (128), 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) [2023-02-15 22:28:10,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 134 transitions. [2023-02-15 22:28:10,006 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 134 transitions. Word has length 37 [2023-02-15 22:28:10,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:28:10,006 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 134 transitions. [2023-02-15 22:28:10,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 15 states have internal predecessors, (50), 3 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2023-02-15 22:28:10,006 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 134 transitions. [2023-02-15 22:28:10,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-15 22:28:10,007 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:28:10,007 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:28:10,027 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-15 22:28:10,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:28:10,215 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-02-15 22:28:10,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:28:10,216 INFO L85 PathProgramCache]: Analyzing trace with hash -148939744, now seen corresponding path program 1 times [2023-02-15 22:28:10,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:28:10,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716444653] [2023-02-15 22:28:10,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:28:10,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:28:10,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:10,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:28:10,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:10,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 22:28:10,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:10,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 22:28:10,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:10,736 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 22:28:10,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:28:10,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716444653] [2023-02-15 22:28:10,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716444653] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:28:10,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1345254017] [2023-02-15 22:28:10,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:28:10,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:28:10,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:28:10,738 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) [2023-02-15 22:28:10,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-15 22:28:10,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:10,865 INFO L263 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 26 conjunts are in the unsatisfiable core [2023-02-15 22:28:10,874 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:28:10,881 INFO L350 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 [2023-02-15 22:28:10,899 INFO L350 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 [2023-02-15 22:28:10,912 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_683 Int)) (= |c_#length| (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_683))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) is different from true [2023-02-15 22:28:10,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:28:10,938 INFO L350 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 12 treesize of output 14 [2023-02-15 22:28:10,952 INFO L350 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 [2023-02-15 22:28:10,959 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_684 Int)) (= |c_#length| (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_684))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) is different from true [2023-02-15 22:28:10,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:28:10,982 INFO L350 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 12 treesize of output 14 [2023-02-15 22:28:11,026 INFO L350 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 [2023-02-15 22:28:11,031 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_685 Int)) (= |c_#length| (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_685))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) is different from true [2023-02-15 22:28:11,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:28:11,053 INFO L350 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 12 treesize of output 14 [2023-02-15 22:28:11,085 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 18 not checked. [2023-02-15 22:28:11,086 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:28:11,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1345254017] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:28:11,161 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:28:11,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 19 [2023-02-15 22:28:11,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010138439] [2023-02-15 22:28:11,162 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:28:11,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-02-15 22:28:11,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:28:11,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-02-15 22:28:11,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=287, Unknown=3, NotChecked=108, Total=462 [2023-02-15 22:28:11,163 INFO L87 Difference]: Start difference. First operand 122 states and 134 transitions. Second operand has 20 states, 17 states have (on average 3.588235294117647) internal successors, (61), 18 states have internal predecessors, (61), 4 states have call successors, (6), 2 states have call predecessors, (6), 6 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-15 22:28:11,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:28:11,458 INFO L93 Difference]: Finished difference Result 131 states and 144 transitions. [2023-02-15 22:28:11,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 22:28:11,459 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 3.588235294117647) internal successors, (61), 18 states have internal predecessors, (61), 4 states have call successors, (6), 2 states have call predecessors, (6), 6 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 37 [2023-02-15 22:28:11,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:28:11,460 INFO L225 Difference]: With dead ends: 131 [2023-02-15 22:28:11,460 INFO L226 Difference]: Without dead ends: 131 [2023-02-15 22:28:11,460 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=110, Invalid=451, Unknown=3, NotChecked=138, Total=702 [2023-02-15 22:28:11,460 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 486 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 486 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 411 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 22:28:11,460 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [486 Valid, 174 Invalid, 716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 291 Invalid, 0 Unknown, 411 Unchecked, 0.2s Time] [2023-02-15 22:28:11,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2023-02-15 22:28:11,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 113. [2023-02-15 22:28:11,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 73 states have (on average 1.63013698630137) internal successors, (119), 108 states have internal predecessors, (119), 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) [2023-02-15 22:28:11,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 125 transitions. [2023-02-15 22:28:11,462 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 125 transitions. Word has length 37 [2023-02-15 22:28:11,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:28:11,463 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 125 transitions. [2023-02-15 22:28:11,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 3.588235294117647) internal successors, (61), 18 states have internal predecessors, (61), 4 states have call successors, (6), 2 states have call predecessors, (6), 6 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-15 22:28:11,463 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 125 transitions. [2023-02-15 22:28:11,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-02-15 22:28:11,463 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:28:11,463 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:28:11,471 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-15 22:28:11,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:28:11,668 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-02-15 22:28:11,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:28:11,669 INFO L85 PathProgramCache]: Analyzing trace with hash -362722266, now seen corresponding path program 1 times [2023-02-15 22:28:11,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:28:11,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699313892] [2023-02-15 22:28:11,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:28:11,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:28:11,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:11,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:28:11,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:11,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 22:28:11,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:11,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 22:28:11,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:12,165 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-15 22:28:12,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:28:12,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699313892] [2023-02-15 22:28:12,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699313892] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:28:12,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [816423277] [2023-02-15 22:28:12,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:28:12,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:28:12,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:28:12,183 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) [2023-02-15 22:28:12,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-15 22:28:12,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:12,296 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 41 conjunts are in the unsatisfiable core [2023-02-15 22:28:12,300 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:28:12,324 INFO L350 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 [2023-02-15 22:28:12,466 INFO L350 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 9 treesize of output 5 [2023-02-15 22:28:12,540 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1)) (exists ((v_ArrVal_846 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_846))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) is different from true [2023-02-15 22:28:12,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:28:12,558 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-02-15 22:28:12,566 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2023-02-15 22:28:12,566 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 [2023-02-15 22:28:12,601 INFO L350 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 17 treesize of output 9 [2023-02-15 22:28:12,610 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2023-02-15 22:28:12,610 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:28:12,646 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_node_create_~temp~0#1.base_29| Int) (v_ArrVal_851 (Array Int Int))) (or (not (< |v_node_create_~temp~0#1.base_29| |c_#StackHeapBarrier|)) (= (select (store |c_#valid| |v_node_create_~temp~0#1.base_29| 1) (select (select (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_29| v_ArrVal_851) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) 1))) is different from false [2023-02-15 22:28:12,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [816423277] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:28:12,646 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:28:12,647 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 27 [2023-02-15 22:28:12,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613424921] [2023-02-15 22:28:12,647 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:28:12,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-02-15 22:28:12,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:28:12,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-02-15 22:28:12,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=623, Unknown=3, NotChecked=102, Total=812 [2023-02-15 22:28:12,648 INFO L87 Difference]: Start difference. First operand 113 states and 125 transitions. Second operand has 28 states, 25 states have (on average 2.16) internal successors, (54), 24 states have internal predecessors, (54), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-15 22:28:13,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:28:13,384 INFO L93 Difference]: Finished difference Result 222 states and 246 transitions. [2023-02-15 22:28:13,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-02-15 22:28:13,384 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 25 states have (on average 2.16) internal successors, (54), 24 states have internal predecessors, (54), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 40 [2023-02-15 22:28:13,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:28:13,385 INFO L225 Difference]: With dead ends: 222 [2023-02-15 22:28:13,385 INFO L226 Difference]: Without dead ends: 222 [2023-02-15 22:28:13,386 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 37 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=219, Invalid=1190, Unknown=5, NotChecked=146, Total=1560 [2023-02-15 22:28:13,386 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 1230 mSDsluCounter, 640 mSDsCounter, 0 mSdLazyCounter, 891 mSolverCounterSat, 20 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1230 SdHoareTripleChecker+Valid, 703 SdHoareTripleChecker+Invalid, 1061 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 891 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 147 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-15 22:28:13,386 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1230 Valid, 703 Invalid, 1061 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 891 Invalid, 3 Unknown, 147 Unchecked, 0.4s Time] [2023-02-15 22:28:13,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2023-02-15 22:28:13,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 115. [2023-02-15 22:28:13,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 75 states have (on average 1.64) internal successors, (123), 110 states have internal predecessors, (123), 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) [2023-02-15 22:28:13,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 129 transitions. [2023-02-15 22:28:13,389 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 129 transitions. Word has length 40 [2023-02-15 22:28:13,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:28:13,389 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 129 transitions. [2023-02-15 22:28:13,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 25 states have (on average 2.16) internal successors, (54), 24 states have internal predecessors, (54), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-15 22:28:13,389 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 129 transitions. [2023-02-15 22:28:13,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-02-15 22:28:13,390 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:28:13,390 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:28:13,397 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-02-15 22:28:13,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-02-15 22:28:13,591 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-02-15 22:28:13,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:28:13,591 INFO L85 PathProgramCache]: Analyzing trace with hash -362722265, now seen corresponding path program 1 times [2023-02-15 22:28:13,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:28:13,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327661239] [2023-02-15 22:28:13,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:28:13,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:28:13,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:13,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:28:13,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:13,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 22:28:13,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:13,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 22:28:13,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:14,207 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 22:28:14,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:28:14,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327661239] [2023-02-15 22:28:14,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327661239] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:28:14,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1092231170] [2023-02-15 22:28:14,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:28:14,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:28:14,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:28:14,209 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) [2023-02-15 22:28:14,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-15 22:28:14,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:14,329 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 64 conjunts are in the unsatisfiable core [2023-02-15 22:28:14,331 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:28:14,360 INFO L350 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 [2023-02-15 22:28:14,364 INFO L350 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 [2023-02-15 22:28:14,661 INFO L350 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 [2023-02-15 22:28:14,664 INFO L350 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 [2023-02-15 22:28:14,776 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_1012 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_1012))) (exists ((v_ArrVal_1011 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1011))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_1008 Int)) (= |c_#length| (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_1008))))) is different from true [2023-02-15 22:28:14,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:28:14,807 INFO L350 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 21 treesize of output 21 [2023-02-15 22:28:14,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:28:14,811 INFO L350 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 25 treesize of output 25 [2023-02-15 22:28:14,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:28:14,815 INFO L350 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 16 treesize of output 18 [2023-02-15 22:28:14,822 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-02-15 22:28:14,823 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-02-15 22:28:14,860 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2023-02-15 22:28:14,863 INFO L350 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 17 treesize of output 9 [2023-02-15 22:28:14,874 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2023-02-15 22:28:14,875 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:28:15,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1092231170] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:28:15,563 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:28:15,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 30 [2023-02-15 22:28:15,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745514652] [2023-02-15 22:28:15,563 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:28:15,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-02-15 22:28:15,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:28:15,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-02-15 22:28:15,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=1020, Unknown=2, NotChecked=64, Total=1190 [2023-02-15 22:28:15,565 INFO L87 Difference]: Start difference. First operand 115 states and 129 transitions. Second operand has 31 states, 28 states have (on average 2.107142857142857) internal successors, (59), 27 states have internal predecessors, (59), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-15 22:28:16,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:28:16,824 INFO L93 Difference]: Finished difference Result 204 states and 226 transitions. [2023-02-15 22:28:16,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-02-15 22:28:16,824 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 28 states have (on average 2.107142857142857) internal successors, (59), 27 states have internal predecessors, (59), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 40 [2023-02-15 22:28:16,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:28:16,825 INFO L225 Difference]: With dead ends: 204 [2023-02-15 22:28:16,825 INFO L226 Difference]: Without dead ends: 204 [2023-02-15 22:28:16,826 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 439 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=264, Invalid=2087, Unknown=5, NotChecked=94, Total=2450 [2023-02-15 22:28:16,826 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 973 mSDsluCounter, 1014 mSDsCounter, 0 mSdLazyCounter, 1405 mSolverCounterSat, 9 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 973 SdHoareTripleChecker+Valid, 1082 SdHoareTripleChecker+Invalid, 1639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1405 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 222 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-15 22:28:16,826 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [973 Valid, 1082 Invalid, 1639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1405 Invalid, 3 Unknown, 222 Unchecked, 0.7s Time] [2023-02-15 22:28:16,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2023-02-15 22:28:16,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 115. [2023-02-15 22:28:16,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 75 states have (on average 1.6266666666666667) internal successors, (122), 110 states have internal predecessors, (122), 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) [2023-02-15 22:28:16,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 128 transitions. [2023-02-15 22:28:16,829 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 128 transitions. Word has length 40 [2023-02-15 22:28:16,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:28:16,829 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 128 transitions. [2023-02-15 22:28:16,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 28 states have (on average 2.107142857142857) internal successors, (59), 27 states have internal predecessors, (59), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-15 22:28:16,829 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 128 transitions. [2023-02-15 22:28:16,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-02-15 22:28:16,829 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:28:16,829 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:28:16,836 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-02-15 22:28:17,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:28:17,036 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-02-15 22:28:17,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:28:17,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1640510023, now seen corresponding path program 1 times [2023-02-15 22:28:17,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:28:17,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654333107] [2023-02-15 22:28:17,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:28:17,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:28:17,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:17,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:28:17,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:17,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 22:28:17,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:17,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 22:28:17,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:17,102 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-02-15 22:28:17,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:28:17,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654333107] [2023-02-15 22:28:17,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654333107] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:28:17,103 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:28:17,103 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 22:28:17,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374686639] [2023-02-15 22:28:17,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:28:17,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 22:28:17,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:28:17,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 22:28:17,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 22:28:17,104 INFO L87 Difference]: Start difference. First operand 115 states and 128 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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) [2023-02-15 22:28:17,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:28:17,167 INFO L93 Difference]: Finished difference Result 177 states and 196 transitions. [2023-02-15 22:28:17,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 22:28:17,168 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 41 [2023-02-15 22:28:17,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:28:17,169 INFO L225 Difference]: With dead ends: 177 [2023-02-15 22:28:17,169 INFO L226 Difference]: Without dead ends: 177 [2023-02-15 22:28:17,169 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 22:28:17,170 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 85 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:28:17,170 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 273 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:28:17,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2023-02-15 22:28:17,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 116. [2023-02-15 22:28:17,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 76 states have (on average 1.618421052631579) internal successors, (123), 111 states have internal predecessors, (123), 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) [2023-02-15 22:28:17,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 129 transitions. [2023-02-15 22:28:17,172 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 129 transitions. Word has length 41 [2023-02-15 22:28:17,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:28:17,173 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 129 transitions. [2023-02-15 22:28:17,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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) [2023-02-15 22:28:17,173 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 129 transitions. [2023-02-15 22:28:17,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-15 22:28:17,176 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:28:17,176 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:28:17,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-02-15 22:28:17,176 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-02-15 22:28:17,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:28:17,177 INFO L85 PathProgramCache]: Analyzing trace with hash 277382184, now seen corresponding path program 1 times [2023-02-15 22:28:17,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:28:17,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445962430] [2023-02-15 22:28:17,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:28:17,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:28:17,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:17,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:28:17,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:17,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 22:28:17,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:17,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 22:28:17,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:17,270 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-02-15 22:28:17,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:28:17,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445962430] [2023-02-15 22:28:17,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445962430] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:28:17,270 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:28:17,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 22:28:17,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24081467] [2023-02-15 22:28:17,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:28:17,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 22:28:17,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:28:17,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 22:28:17,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-15 22:28:17,275 INFO L87 Difference]: Start difference. First operand 116 states and 129 transitions. Second operand has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 22:28:17,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:28:17,444 INFO L93 Difference]: Finished difference Result 131 states and 145 transitions. [2023-02-15 22:28:17,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 22:28:17,444 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 43 [2023-02-15 22:28:17,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:28:17,445 INFO L225 Difference]: With dead ends: 131 [2023-02-15 22:28:17,445 INFO L226 Difference]: Without dead ends: 131 [2023-02-15 22:28:17,445 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-02-15 22:28:17,445 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 90 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 22:28:17,445 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 337 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 22:28:17,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2023-02-15 22:28:17,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 113. [2023-02-15 22:28:17,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 76 states have (on average 1.5789473684210527) internal successors, (120), 108 states have internal predecessors, (120), 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) [2023-02-15 22:28:17,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 126 transitions. [2023-02-15 22:28:17,447 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 126 transitions. Word has length 43 [2023-02-15 22:28:17,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:28:17,447 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 126 transitions. [2023-02-15 22:28:17,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 22:28:17,448 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 126 transitions. [2023-02-15 22:28:17,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-15 22:28:17,448 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:28:17,448 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:28:17,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-02-15 22:28:17,448 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-02-15 22:28:17,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:28:17,450 INFO L85 PathProgramCache]: Analyzing trace with hash 277382185, now seen corresponding path program 1 times [2023-02-15 22:28:17,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:28:17,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286753153] [2023-02-15 22:28:17,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:28:17,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:28:17,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:17,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:28:17,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:17,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 22:28:17,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:17,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 22:28:17,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:17,651 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-02-15 22:28:17,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:28:17,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286753153] [2023-02-15 22:28:17,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286753153] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:28:17,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [665494831] [2023-02-15 22:28:17,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:28:17,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:28:17,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:28:17,664 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) [2023-02-15 22:28:17,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-02-15 22:28:17,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:17,796 INFO L263 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-15 22:28:17,799 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:28:17,827 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-02-15 22:28:17,827 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:28:17,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [665494831] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:28:17,827 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 22:28:17,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2023-02-15 22:28:17,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207533275] [2023-02-15 22:28:17,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:28:17,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 22:28:17,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:28:17,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 22:28:17,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-15 22:28:17,829 INFO L87 Difference]: Start difference. First operand 113 states and 126 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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) [2023-02-15 22:28:17,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:28:17,841 INFO L93 Difference]: Finished difference Result 112 states and 124 transitions. [2023-02-15 22:28:17,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 22:28:17,842 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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 43 [2023-02-15 22:28:17,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:28:17,842 INFO L225 Difference]: With dead ends: 112 [2023-02-15 22:28:17,843 INFO L226 Difference]: Without dead ends: 112 [2023-02-15 22:28:17,843 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-02-15 22:28:17,843 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 104 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 22:28:17,844 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 234 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 22:28:17,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2023-02-15 22:28:17,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2023-02-15 22:28:17,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 75 states have (on average 1.5733333333333333) internal successors, (118), 107 states have internal predecessors, (118), 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) [2023-02-15 22:28:17,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 124 transitions. [2023-02-15 22:28:17,846 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 124 transitions. Word has length 43 [2023-02-15 22:28:17,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:28:17,846 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 124 transitions. [2023-02-15 22:28:17,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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) [2023-02-15 22:28:17,846 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 124 transitions. [2023-02-15 22:28:17,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-15 22:28:17,847 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:28:17,847 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:28:17,863 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-02-15 22:28:18,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:28:18,053 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-02-15 22:28:18,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:28:18,054 INFO L85 PathProgramCache]: Analyzing trace with hash 278707084, now seen corresponding path program 1 times [2023-02-15 22:28:18,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:28:18,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13044559] [2023-02-15 22:28:18,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:28:18,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:28:18,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:18,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:28:18,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:18,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 22:28:18,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:18,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 22:28:18,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:18,205 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-02-15 22:28:18,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:28:18,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13044559] [2023-02-15 22:28:18,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13044559] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:28:18,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1383475550] [2023-02-15 22:28:18,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:28:18,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:28:18,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:28:18,223 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 22:28:18,225 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-02-15 22:28:18,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:18,395 INFO L263 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-15 22:28:18,399 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:28:18,440 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-02-15 22:28:18,440 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:28:18,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1383475550] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:28:18,440 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 22:28:18,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2023-02-15 22:28:18,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169876278] [2023-02-15 22:28:18,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:28:18,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 22:28:18,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:28:18,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 22:28:18,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-02-15 22:28:18,442 INFO L87 Difference]: Start difference. First operand 112 states and 124 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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) [2023-02-15 22:28:18,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:28:18,460 INFO L93 Difference]: Finished difference Result 109 states and 120 transitions. [2023-02-15 22:28:18,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 22:28:18,460 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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 43 [2023-02-15 22:28:18,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:28:18,461 INFO L225 Difference]: With dead ends: 109 [2023-02-15 22:28:18,461 INFO L226 Difference]: Without dead ends: 109 [2023-02-15 22:28:18,462 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-02-15 22:28:18,462 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 187 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 22:28:18,463 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 169 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 22:28:18,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2023-02-15 22:28:18,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2023-02-15 22:28:18,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 74 states have (on average 1.5405405405405406) internal successors, (114), 104 states have internal predecessors, (114), 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) [2023-02-15 22:28:18,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 120 transitions. [2023-02-15 22:28:18,466 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 120 transitions. Word has length 43 [2023-02-15 22:28:18,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:28:18,466 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 120 transitions. [2023-02-15 22:28:18,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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) [2023-02-15 22:28:18,466 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 120 transitions. [2023-02-15 22:28:18,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-02-15 22:28:18,468 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:28:18,468 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:28:18,487 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-02-15 22:28:18,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-02-15 22:28:18,675 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-02-15 22:28:18,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:28:18,675 INFO L85 PathProgramCache]: Analyzing trace with hash 49983393, now seen corresponding path program 1 times [2023-02-15 22:28:18,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:28:18,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908029153] [2023-02-15 22:28:18,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:28:18,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:28:18,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:18,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:28:18,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:18,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 22:28:18,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:18,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 22:28:18,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:18,757 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-02-15 22:28:18,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:28:18,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908029153] [2023-02-15 22:28:18,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908029153] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:28:18,757 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:28:18,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 22:28:18,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117622509] [2023-02-15 22:28:18,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:28:18,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 22:28:18,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:28:18,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 22:28:18,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 22:28:18,759 INFO L87 Difference]: Start difference. First operand 109 states and 120 transitions. Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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) [2023-02-15 22:28:18,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:28:18,853 INFO L93 Difference]: Finished difference Result 126 states and 138 transitions. [2023-02-15 22:28:18,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 22:28:18,854 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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 44 [2023-02-15 22:28:18,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:28:18,854 INFO L225 Difference]: With dead ends: 126 [2023-02-15 22:28:18,855 INFO L226 Difference]: Without dead ends: 126 [2023-02-15 22:28:18,855 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-15 22:28:18,855 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 84 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:28:18,855 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 225 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:28:18,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2023-02-15 22:28:18,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 108. [2023-02-15 22:28:18,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 74 states have (on average 1.527027027027027) internal successors, (113), 103 states have internal predecessors, (113), 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) [2023-02-15 22:28:18,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 119 transitions. [2023-02-15 22:28:18,859 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 119 transitions. Word has length 44 [2023-02-15 22:28:18,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:28:18,859 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 119 transitions. [2023-02-15 22:28:18,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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) [2023-02-15 22:28:18,859 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 119 transitions. [2023-02-15 22:28:18,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-02-15 22:28:18,860 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:28:18,860 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:28:18,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-02-15 22:28:18,861 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-02-15 22:28:18,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:28:18,861 INFO L85 PathProgramCache]: Analyzing trace with hash 49983394, now seen corresponding path program 1 times [2023-02-15 22:28:18,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:28:18,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816199529] [2023-02-15 22:28:18,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:28:18,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:28:18,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:18,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:28:18,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:18,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 22:28:18,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:18,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 22:28:18,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:18,961 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-02-15 22:28:18,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:28:18,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816199529] [2023-02-15 22:28:18,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816199529] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:28:18,961 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:28:18,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 22:28:18,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822452614] [2023-02-15 22:28:18,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:28:18,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 22:28:18,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:28:18,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 22:28:18,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 22:28:18,963 INFO L87 Difference]: Start difference. First operand 108 states and 119 transitions. Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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) [2023-02-15 22:28:19,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:28:19,063 INFO L93 Difference]: Finished difference Result 107 states and 118 transitions. [2023-02-15 22:28:19,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 22:28:19,063 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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 44 [2023-02-15 22:28:19,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:28:19,064 INFO L225 Difference]: With dead ends: 107 [2023-02-15 22:28:19,064 INFO L226 Difference]: Without dead ends: 107 [2023-02-15 22:28:19,064 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-15 22:28:19,064 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 87 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:28:19,065 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 218 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:28:19,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2023-02-15 22:28:19,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2023-02-15 22:28:19,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 74 states have (on average 1.5135135135135136) internal successors, (112), 102 states have internal predecessors, (112), 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) [2023-02-15 22:28:19,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 118 transitions. [2023-02-15 22:28:19,067 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 118 transitions. Word has length 44 [2023-02-15 22:28:19,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:28:19,067 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 118 transitions. [2023-02-15 22:28:19,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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) [2023-02-15 22:28:19,067 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 118 transitions. [2023-02-15 22:28:19,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-02-15 22:28:19,068 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:28:19,068 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:28:19,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-02-15 22:28:19,068 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-02-15 22:28:19,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:28:19,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1549485211, now seen corresponding path program 1 times [2023-02-15 22:28:19,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:28:19,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645067653] [2023-02-15 22:28:19,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:28:19,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:28:19,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:19,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:28:19,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:19,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 22:28:19,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:19,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 22:28:19,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:19,216 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-02-15 22:28:19,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:28:19,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645067653] [2023-02-15 22:28:19,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645067653] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:28:19,217 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:28:19,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 22:28:19,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070989976] [2023-02-15 22:28:19,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:28:19,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 22:28:19,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:28:19,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 22:28:19,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-15 22:28:19,218 INFO L87 Difference]: Start difference. First operand 107 states and 118 transitions. Second operand has 7 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 22:28:19,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:28:19,367 INFO L93 Difference]: Finished difference Result 104 states and 115 transitions. [2023-02-15 22:28:19,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 22:28:19,367 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 45 [2023-02-15 22:28:19,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:28:19,368 INFO L225 Difference]: With dead ends: 104 [2023-02-15 22:28:19,368 INFO L226 Difference]: Without dead ends: 104 [2023-02-15 22:28:19,368 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-02-15 22:28:19,368 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 84 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:28:19,369 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 340 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:28:19,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2023-02-15 22:28:19,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2023-02-15 22:28:19,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 74 states have (on average 1.472972972972973) internal successors, (109), 99 states have internal predecessors, (109), 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) [2023-02-15 22:28:19,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 115 transitions. [2023-02-15 22:28:19,371 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 115 transitions. Word has length 45 [2023-02-15 22:28:19,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:28:19,372 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 115 transitions. [2023-02-15 22:28:19,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 22:28:19,372 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 115 transitions. [2023-02-15 22:28:19,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-02-15 22:28:19,373 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:28:19,373 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:28:19,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-02-15 22:28:19,373 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-02-15 22:28:19,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:28:19,374 INFO L85 PathProgramCache]: Analyzing trace with hash 2108722015, now seen corresponding path program 1 times [2023-02-15 22:28:19,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:28:19,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891831141] [2023-02-15 22:28:19,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:28:19,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:28:19,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:19,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:28:19,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:19,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 22:28:19,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:19,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 22:28:19,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:19,993 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 19 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 22:28:19,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:28:19,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891831141] [2023-02-15 22:28:19,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891831141] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:28:19,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2110639468] [2023-02-15 22:28:19,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:28:19,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:28:19,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:28:19,996 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 22:28:20,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-02-15 22:28:20,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:20,184 INFO L263 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 64 conjunts are in the unsatisfiable core [2023-02-15 22:28:20,189 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:28:20,194 INFO L350 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 [2023-02-15 22:28:20,234 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2007 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| v_ArrVal_2007))) is different from true [2023-02-15 22:28:20,240 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2007 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| v_ArrVal_2007))) is different from true [2023-02-15 22:28:20,250 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 22:28:20,250 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2023-02-15 22:28:20,343 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 22:28:20,344 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2023-02-15 22:28:20,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:28:20,703 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-02-15 22:28:20,724 INFO L321 Elim1Store]: treesize reduction 60, result has 31.0 percent of original size [2023-02-15 22:28:20,725 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 41 [2023-02-15 22:28:20,877 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2023-02-15 22:28:20,880 INFO L350 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 29 treesize of output 32 [2023-02-15 22:28:20,983 INFO L321 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2023-02-15 22:28:20,983 INFO L350 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 45 [2023-02-15 22:28:20,990 INFO L350 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 14 treesize of output 10 [2023-02-15 22:28:21,049 INFO L350 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 17 treesize of output 9 [2023-02-15 22:28:21,135 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 12 not checked. [2023-02-15 22:28:21,135 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:28:25,234 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2014 (Array Int Int)) (|ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| Int)) (= (select |c_#valid| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|) |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2014) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) 1)) is different from false [2023-02-15 22:28:27,257 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2014 (Array Int Int)) (|ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| Int)) (= (select |c_#valid| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|) |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2014) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) 1)) is different from false [2023-02-15 22:28:29,276 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2014 (Array Int Int)) (|ULTIMATE.start_sll_circular_insert_#t~mem10#1.base| Int) (|ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| Int)) (= (select |c_#valid| (select (select (store (store |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_#t~mem10#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_#t~mem10#1.base|) |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2014) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) 1)) is different from false [2023-02-15 22:28:29,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2110639468] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:28:29,454 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:28:29,454 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 25] total 47 [2023-02-15 22:28:29,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889128064] [2023-02-15 22:28:29,454 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:28:29,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2023-02-15 22:28:29,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:28:29,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2023-02-15 22:28:29,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=2159, Unknown=37, NotChecked=490, Total=2862 [2023-02-15 22:28:29,455 INFO L87 Difference]: Start difference. First operand 104 states and 115 transitions. Second operand has 48 states, 44 states have (on average 1.9318181818181819) internal successors, (85), 40 states have internal predecessors, (85), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-15 22:28:31,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:28:31,905 INFO L93 Difference]: Finished difference Result 188 states and 206 transitions. [2023-02-15 22:28:31,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-02-15 22:28:31,906 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 44 states have (on average 1.9318181818181819) internal successors, (85), 40 states have internal predecessors, (85), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 49 [2023-02-15 22:28:31,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:28:31,907 INFO L225 Difference]: With dead ends: 188 [2023-02-15 22:28:31,907 INFO L226 Difference]: Without dead ends: 188 [2023-02-15 22:28:31,908 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 75 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1082 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=670, Invalid=4423, Unknown=39, NotChecked=720, Total=5852 [2023-02-15 22:28:31,908 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 2000 mSDsluCounter, 1716 mSDsCounter, 0 mSdLazyCounter, 2510 mSolverCounterSat, 72 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2000 SdHoareTripleChecker+Valid, 1799 SdHoareTripleChecker+Invalid, 2952 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 2510 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 368 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-02-15 22:28:31,908 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2000 Valid, 1799 Invalid, 2952 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 2510 Invalid, 2 Unknown, 368 Unchecked, 1.2s Time] [2023-02-15 22:28:31,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2023-02-15 22:28:31,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 102. [2023-02-15 22:28:31,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 75 states have (on average 1.44) internal successors, (108), 97 states have internal predecessors, (108), 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) [2023-02-15 22:28:31,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 114 transitions. [2023-02-15 22:28:31,910 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 114 transitions. Word has length 49 [2023-02-15 22:28:31,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:28:31,910 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 114 transitions. [2023-02-15 22:28:31,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 44 states have (on average 1.9318181818181819) internal successors, (85), 40 states have internal predecessors, (85), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-15 22:28:31,911 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 114 transitions. [2023-02-15 22:28:31,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-02-15 22:28:31,911 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:28:31,911 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:28:31,921 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-02-15 22:28:32,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:28:32,119 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-02-15 22:28:32,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:28:32,119 INFO L85 PathProgramCache]: Analyzing trace with hash 2108722016, now seen corresponding path program 1 times [2023-02-15 22:28:32,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:28:32,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004082654] [2023-02-15 22:28:32,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:28:32,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:28:32,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:33,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:28:33,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:33,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 22:28:33,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:33,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 22:28:33,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:33,850 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 22:28:33,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:28:33,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004082654] [2023-02-15 22:28:33,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004082654] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:28:33,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1477692716] [2023-02-15 22:28:33,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:28:33,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:28:33,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:28:33,852 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 22:28:33,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-02-15 22:28:34,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:34,056 INFO L263 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 107 conjunts are in the unsatisfiable core [2023-02-15 22:28:34,059 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:28:34,062 INFO L350 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 [2023-02-15 22:28:34,104 INFO L350 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 [2023-02-15 22:28:34,141 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2199 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| v_ArrVal_2199))) is different from true [2023-02-15 22:28:34,150 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2199 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| v_ArrVal_2199))) is different from true [2023-02-15 22:28:34,165 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 22:28:34,165 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2023-02-15 22:28:34,267 INFO L350 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 [2023-02-15 22:28:34,273 INFO L350 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 [2023-02-15 22:28:34,383 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 22:28:34,383 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2023-02-15 22:28:34,728 INFO L350 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 [2023-02-15 22:28:34,731 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 22:28:34,735 INFO L350 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 [2023-02-15 22:28:34,739 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 22:28:34,740 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 22:28:35,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:28:35,062 INFO L350 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 14 treesize of output 16 [2023-02-15 22:28:35,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:28:35,069 INFO L350 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 25 treesize of output 25 [2023-02-15 22:28:35,078 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2023-02-15 22:28:35,079 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 [2023-02-15 22:28:35,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:28:35,093 INFO L321 Elim1Store]: treesize reduction 17, result has 32.0 percent of original size [2023-02-15 22:28:35,093 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 18 [2023-02-15 22:28:35,294 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2023-02-15 22:28:35,295 INFO L350 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 29 treesize of output 32 [2023-02-15 22:28:35,303 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-02-15 22:28:35,303 INFO L350 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 19 treesize of output 18 [2023-02-15 22:28:35,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:28:35,437 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2023-02-15 22:28:35,437 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 62 [2023-02-15 22:28:35,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:28:35,453 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2023-02-15 22:28:35,453 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 62 treesize of output 71 [2023-02-15 22:28:35,479 INFO L350 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 [2023-02-15 22:28:35,516 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 22:28:35,667 INFO L350 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 69 treesize of output 45 [2023-02-15 22:28:35,671 INFO L350 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 [2023-02-15 22:28:35,806 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 12 not checked. [2023-02-15 22:28:35,806 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:28:35,959 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2212 (Array Int Int)) (v_ArrVal_2211 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2211) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2212) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (forall ((v_ArrVal_2211 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2211) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) is different from false [2023-02-15 22:28:36,191 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|))) (and (forall ((v_ArrVal_2212 (Array Int Int)) (v_ArrVal_2211 (Array Int Int)) (|ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| Int)) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store .cse0 |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2211) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|) |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2212) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (forall ((v_ArrVal_2211 (Array Int Int)) (|ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| Int)) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store .cse0 |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2211) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))) is different from false [2023-02-15 22:28:36,498 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2212 (Array Int Int)) (v_ArrVal_2211 (Array Int Int)) (|ULTIMATE.start_sll_circular_insert_#t~mem10#1.base| Int) (|ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| Int)) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_insert_#t~mem10#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_insert_#t~mem10#1.base|) |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset|)) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_2211) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_#t~mem10#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_#t~mem10#1.base|) |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|)) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_2212) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (forall ((v_ArrVal_2211 (Array Int Int)) (|ULTIMATE.start_sll_circular_insert_#t~mem10#1.base| Int) (|ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| Int)) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_insert_#t~mem10#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_insert_#t~mem10#1.base|) |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset|)) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_2211) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) is different from false [2023-02-15 22:28:36,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1477692716] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:28:36,845 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:28:36,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 25] total 54 [2023-02-15 22:28:36,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346535372] [2023-02-15 22:28:36,845 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:28:36,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2023-02-15 22:28:36,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:28:36,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2023-02-15 22:28:36,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=3191, Unknown=40, NotChecked=590, Total=4032 [2023-02-15 22:28:36,847 INFO L87 Difference]: Start difference. First operand 102 states and 114 transitions. Second operand has 55 states, 50 states have (on average 1.7) internal successors, (85), 46 states have internal predecessors, (85), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 22:28:42,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:28:42,598 INFO L93 Difference]: Finished difference Result 394 states and 437 transitions. [2023-02-15 22:28:42,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2023-02-15 22:28:42,598 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 50 states have (on average 1.7) internal successors, (85), 46 states have internal predecessors, (85), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 49 [2023-02-15 22:28:42,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:28:42,600 INFO L225 Difference]: With dead ends: 394 [2023-02-15 22:28:42,600 INFO L226 Difference]: Without dead ends: 394 [2023-02-15 22:28:42,602 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 104 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 2228 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=1120, Invalid=8958, Unknown=42, NotChecked=1010, Total=11130 [2023-02-15 22:28:42,602 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 2215 mSDsluCounter, 2054 mSDsCounter, 0 mSdLazyCounter, 3530 mSolverCounterSat, 92 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2215 SdHoareTripleChecker+Valid, 2127 SdHoareTripleChecker+Invalid, 4182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 3530 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 558 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2023-02-15 22:28:42,603 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2215 Valid, 2127 Invalid, 4182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 3530 Invalid, 2 Unknown, 558 Unchecked, 1.9s Time] [2023-02-15 22:28:42,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2023-02-15 22:28:42,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 109. [2023-02-15 22:28:42,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 82 states have (on average 1.4146341463414633) internal successors, (116), 104 states have internal predecessors, (116), 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) [2023-02-15 22:28:42,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 122 transitions. [2023-02-15 22:28:42,606 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 122 transitions. Word has length 49 [2023-02-15 22:28:42,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:28:42,606 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 122 transitions. [2023-02-15 22:28:42,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 50 states have (on average 1.7) internal successors, (85), 46 states have internal predecessors, (85), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 22:28:42,606 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 122 transitions. [2023-02-15 22:28:42,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-02-15 22:28:42,607 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:28:42,607 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:28:42,620 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-02-15 22:28:42,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:28:42,812 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-02-15 22:28:42,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:28:42,813 INFO L85 PathProgramCache]: Analyzing trace with hash 776998409, now seen corresponding path program 1 times [2023-02-15 22:28:42,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:28:42,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102087026] [2023-02-15 22:28:42,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:28:42,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:28:42,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:42,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:28:42,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:42,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 22:28:42,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:42,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 22:28:42,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:42,974 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-02-15 22:28:42,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:28:42,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102087026] [2023-02-15 22:28:42,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102087026] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:28:42,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1339038638] [2023-02-15 22:28:42,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:28:42,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:28:42,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:28:42,990 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 22:28:42,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-02-15 22:28:43,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:43,178 INFO L263 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 21 conjunts are in the unsatisfiable core [2023-02-15 22:28:43,179 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:28:43,205 INFO L350 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 [2023-02-15 22:28:43,206 INFO L350 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 [2023-02-15 22:28:43,209 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-02-15 22:28:43,209 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:28:43,297 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-02-15 22:28:43,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1339038638] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:28:43,297 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 22:28:43,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 11 [2023-02-15 22:28:43,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379445152] [2023-02-15 22:28:43,298 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 22:28:43,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-15 22:28:43,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:28:43,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-15 22:28:43,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2023-02-15 22:28:43,299 INFO L87 Difference]: Start difference. First operand 109 states and 122 transitions. Second operand has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 10 states have internal predecessors, (40), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 22:28:43,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:28:43,434 INFO L93 Difference]: Finished difference Result 96 states and 107 transitions. [2023-02-15 22:28:43,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 22:28:43,434 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 10 states have internal predecessors, (40), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 50 [2023-02-15 22:28:43,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:28:43,435 INFO L225 Difference]: With dead ends: 96 [2023-02-15 22:28:43,435 INFO L226 Difference]: Without dead ends: 96 [2023-02-15 22:28:43,435 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 101 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2023-02-15 22:28:43,435 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 10 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:28:43,436 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 599 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:28:43,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2023-02-15 22:28:43,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2023-02-15 22:28:43,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 71 states have (on average 1.4225352112676057) internal successors, (101), 91 states have internal predecessors, (101), 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) [2023-02-15 22:28:43,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 107 transitions. [2023-02-15 22:28:43,437 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 107 transitions. Word has length 50 [2023-02-15 22:28:43,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:28:43,438 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 107 transitions. [2023-02-15 22:28:43,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 10 states have internal predecessors, (40), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 22:28:43,438 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 107 transitions. [2023-02-15 22:28:43,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-02-15 22:28:43,438 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:28:43,438 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:28:43,461 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-02-15 22:28:43,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2023-02-15 22:28:43,646 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-02-15 22:28:43,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:28:43,647 INFO L85 PathProgramCache]: Analyzing trace with hash -742704791, now seen corresponding path program 1 times [2023-02-15 22:28:43,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:28:43,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153320609] [2023-02-15 22:28:43,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:28:43,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:28:43,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:44,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:28:44,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:44,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 22:28:44,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:45,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 22:28:45,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:45,451 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 22:28:45,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:28:45,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153320609] [2023-02-15 22:28:45,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153320609] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:28:45,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [963348791] [2023-02-15 22:28:45,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:28:45,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:28:45,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:28:45,453 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 22:28:45,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-02-15 22:28:45,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:45,649 INFO L263 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 132 conjunts are in the unsatisfiable core [2023-02-15 22:28:45,652 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:28:45,656 INFO L350 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 [2023-02-15 22:28:45,701 INFO L350 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 [2023-02-15 22:28:45,822 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 22:28:45,822 INFO L350 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 [2023-02-15 22:28:45,943 INFO L350 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 11 treesize of output 7 [2023-02-15 22:28:45,985 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 22:28:46,085 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-02-15 22:28:46,085 INFO L350 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 16 treesize of output 18 [2023-02-15 22:28:46,206 INFO L350 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 19 treesize of output 18 [2023-02-15 22:28:46,346 INFO L350 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 14 treesize of output 16 [2023-02-15 22:28:46,523 INFO L350 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 29 treesize of output 17 [2023-02-15 22:28:46,525 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 22:28:46,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:28:46,797 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-02-15 22:28:46,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:28:46,806 INFO L350 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 37 treesize of output 28 [2023-02-15 22:28:46,818 INFO L321 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-02-15 22:28:46,819 INFO L350 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 20 treesize of output 23 [2023-02-15 22:28:46,824 INFO L350 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 [2023-02-15 22:28:46,834 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-02-15 22:28:46,834 INFO L350 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 1 case distinctions, treesize of input 15 treesize of output 15 [2023-02-15 22:28:47,273 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:28:47,274 INFO L350 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 71 treesize of output 64 [2023-02-15 22:28:47,279 INFO L350 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 35 treesize of output 30 [2023-02-15 22:28:47,283 INFO L350 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 18 treesize of output 20 [2023-02-15 22:28:47,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:28:47,354 INFO L350 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 34 treesize of output 32 [2023-02-15 22:28:47,358 INFO L350 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 18 treesize of output 20 [2023-02-15 22:28:47,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:28:47,362 INFO L350 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 14 treesize of output 16 [2023-02-15 22:28:47,433 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-02-15 22:28:47,437 INFO L350 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 15 treesize of output 7 [2023-02-15 22:28:47,533 INFO L350 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 [2023-02-15 22:28:47,577 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 22:28:47,577 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:28:47,727 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2585 (Array Int Int)) (v_ArrVal_2584 (Array Int Int)) (v_ArrVal_2583 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2584) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2583) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2585) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2023-02-15 22:28:47,736 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2582 Int) (v_ArrVal_2579 (Array Int Int)) (v_ArrVal_2585 (Array Int Int)) (v_ArrVal_2584 (Array Int Int)) (v_ArrVal_2583 (Array Int Int)) (v_ArrVal_2581 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| v_ArrVal_2582)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2584) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_2579) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2583) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_2581) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2585) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2023-02-15 22:28:49,782 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2582 Int) (v_ArrVal_2579 (Array Int Int)) (v_ArrVal_2585 (Array Int Int)) (v_ArrVal_2584 (Array Int Int)) (v_ArrVal_2583 (Array Int Int)) (v_ArrVal_2581 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| v_ArrVal_2582)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2584) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_2579) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2583) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_2581) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2585) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2023-02-15 22:28:49,793 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2582 Int) (v_ArrVal_2579 (Array Int Int)) (v_ArrVal_2585 (Array Int Int)) (v_ArrVal_2584 (Array Int Int)) (v_ArrVal_2583 (Array Int Int)) (v_ArrVal_2581 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.offset| v_ArrVal_2582)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2584) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.base| v_ArrVal_2579) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2583) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.base| v_ArrVal_2581) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2585) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2023-02-15 22:28:49,801 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2582 Int) (v_ArrVal_2579 (Array Int Int)) (v_ArrVal_2585 (Array Int Int)) (v_ArrVal_2584 (Array Int Int)) (v_ArrVal_2583 (Array Int Int)) (v_ArrVal_2581 (Array Int Int))) (= (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (select (select (store (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|) v_ArrVal_2582)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2584) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2579) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2583) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2581) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2585) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2023-02-15 22:28:49,808 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2582 Int) (v_ArrVal_2579 (Array Int Int)) (v_ArrVal_2585 (Array Int Int)) (v_ArrVal_2584 (Array Int Int)) (v_ArrVal_2583 (Array Int Int)) (v_ArrVal_2581 (Array Int Int))) (= (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (select (select (store (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|) v_ArrVal_2582)) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_2584) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2579) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_2583) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2581) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_2585) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2023-02-15 22:28:49,862 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2582 Int) (v_ArrVal_2579 (Array Int Int)) (v_ArrVal_2597 (Array Int Int)) (v_ArrVal_2596 (Array Int Int)) (v_ArrVal_2585 (Array Int Int)) (v_ArrVal_2595 (Array Int Int)) (v_ArrVal_2584 (Array Int Int)) (v_ArrVal_2583 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_24| Int) (v_ArrVal_2581 (Array Int Int))) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_24|))) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_24| |c_#StackHeapBarrier|)) (= (let ((.cse3 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_24| v_ArrVal_2596))) (let ((.cse2 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_24| v_ArrVal_2597)) (.cse1 (select (select .cse3 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (select (select (store (let ((.cse0 (store |c_#memory_int| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_24| v_ArrVal_2595))) (store .cse0 .cse1 (store (select .cse0 .cse1) (select (select .cse2 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|) v_ArrVal_2582))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_24| v_ArrVal_2584) (select (select (store (store .cse3 .cse1 v_ArrVal_2579) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_24| v_ArrVal_2583) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store .cse2 .cse1 v_ArrVal_2581) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_24| v_ArrVal_2585) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) |c_ULTIMATE.start_main_~data~0#1|))) is different from false [2023-02-15 22:28:49,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [963348791] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:28:49,863 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:28:49,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 32] total 60 [2023-02-15 22:28:49,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512779309] [2023-02-15 22:28:49,863 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:28:49,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2023-02-15 22:28:49,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:28:49,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2023-02-15 22:28:49,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=3704, Unknown=7, NotChecked=896, Total=4830 [2023-02-15 22:28:49,866 INFO L87 Difference]: Start difference. First operand 96 states and 107 transitions. Second operand has 60 states, 56 states have (on average 1.5) internal successors, (84), 51 states have internal predecessors, (84), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 22:28:54,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:28:54,302 INFO L93 Difference]: Finished difference Result 218 states and 243 transitions. [2023-02-15 22:28:54,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2023-02-15 22:28:54,302 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 56 states have (on average 1.5) internal successors, (84), 51 states have internal predecessors, (84), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 51 [2023-02-15 22:28:54,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:28:54,304 INFO L225 Difference]: With dead ends: 218 [2023-02-15 22:28:54,304 INFO L226 Difference]: Without dead ends: 218 [2023-02-15 22:28:54,307 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 30 SyntacticMatches, 5 SemanticMatches, 107 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 2219 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=1004, Invalid=9319, Unknown=7, NotChecked=1442, Total=11772 [2023-02-15 22:28:54,311 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 1188 mSDsluCounter, 1627 mSDsCounter, 0 mSdLazyCounter, 2814 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1188 SdHoareTripleChecker+Valid, 1674 SdHoareTripleChecker+Invalid, 2919 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 2814 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-02-15 22:28:54,311 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1188 Valid, 1674 Invalid, 2919 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 2814 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-02-15 22:28:54,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2023-02-15 22:28:54,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 101. [2023-02-15 22:28:54,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 76 states have (on average 1.394736842105263) internal successors, (106), 96 states have internal predecessors, (106), 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) [2023-02-15 22:28:54,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 112 transitions. [2023-02-15 22:28:54,326 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 112 transitions. Word has length 51 [2023-02-15 22:28:54,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:28:54,326 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 112 transitions. [2023-02-15 22:28:54,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 56 states have (on average 1.5) internal successors, (84), 51 states have internal predecessors, (84), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 22:28:54,327 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 112 transitions. [2023-02-15 22:28:54,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-02-15 22:28:54,329 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:28:54,329 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:28:54,335 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-02-15 22:28:54,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2023-02-15 22:28:54,535 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-02-15 22:28:54,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:28:54,536 INFO L85 PathProgramCache]: Analyzing trace with hash -613243961, now seen corresponding path program 1 times [2023-02-15 22:28:54,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:28:54,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477284916] [2023-02-15 22:28:54,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:28:54,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:28:54,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:54,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:28:54,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:54,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 22:28:54,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:54,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 22:28:54,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:54,900 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 22:28:54,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:28:54,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477284916] [2023-02-15 22:28:54,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477284916] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:28:54,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2134732768] [2023-02-15 22:28:54,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:28:54,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:28:54,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:28:54,925 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 22:28:54,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-02-15 22:28:55,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:55,135 INFO L263 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 26 conjunts are in the unsatisfiable core [2023-02-15 22:28:55,146 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:28:55,165 INFO L350 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 12 treesize of output 14 [2023-02-15 22:28:55,179 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_2777 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_2777))) (not (= 0 |node_create_~temp~0#1.base|)))) is different from true [2023-02-15 22:28:55,194 INFO L350 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 12 treesize of output 14 [2023-02-15 22:28:55,219 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_2778 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_2778))) (not (= 0 |node_create_~temp~0#1.base|)))) is different from true [2023-02-15 22:28:55,236 INFO L350 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 12 treesize of output 14 [2023-02-15 22:28:55,253 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_2779 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_2779))) (not (= 0 |node_create_~temp~0#1.base|)))) is different from true [2023-02-15 22:28:55,266 INFO L350 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 12 treesize of output 14 [2023-02-15 22:28:55,278 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 22:28:55,294 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 22:28:55,294 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-15 22:28:55,305 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 18 not checked. [2023-02-15 22:28:55,305 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:28:55,621 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-02-15 22:28:55,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2134732768] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:28:55,622 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 22:28:55,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 8, 7] total 30 [2023-02-15 22:28:55,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718444197] [2023-02-15 22:28:55,622 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 22:28:55,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-02-15 22:28:55,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:28:55,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-02-15 22:28:55,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=623, Unknown=3, NotChecked=156, Total=870 [2023-02-15 22:28:55,623 INFO L87 Difference]: Start difference. First operand 101 states and 112 transitions. Second operand has 30 states, 29 states have (on average 3.6551724137931036) internal successors, (106), 27 states have internal predecessors, (106), 4 states have call successors, (9), 3 states have call predecessors, (9), 7 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2023-02-15 22:28:56,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:28:56,150 INFO L93 Difference]: Finished difference Result 96 states and 106 transitions. [2023-02-15 22:28:56,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-02-15 22:28:56,151 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 3.6551724137931036) internal successors, (106), 27 states have internal predecessors, (106), 4 states have call successors, (9), 3 states have call predecessors, (9), 7 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) Word has length 53 [2023-02-15 22:28:56,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:28:56,151 INFO L225 Difference]: With dead ends: 96 [2023-02-15 22:28:56,151 INFO L226 Difference]: Without dead ends: 96 [2023-02-15 22:28:56,152 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 88 SyntacticMatches, 10 SemanticMatches, 45 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=334, Invalid=1567, Unknown=3, NotChecked=258, Total=2162 [2023-02-15 22:28:56,152 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 734 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 598 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 734 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 598 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 288 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 22:28:56,153 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [734 Valid, 522 Invalid, 934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 598 Invalid, 0 Unknown, 288 Unchecked, 0.3s Time] [2023-02-15 22:28:56,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2023-02-15 22:28:56,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 92. [2023-02-15 22:28:56,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 67 states have (on average 1.4179104477611941) internal successors, (95), 87 states have internal predecessors, (95), 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) [2023-02-15 22:28:56,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 101 transitions. [2023-02-15 22:28:56,154 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 101 transitions. Word has length 53 [2023-02-15 22:28:56,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:28:56,154 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 101 transitions. [2023-02-15 22:28:56,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 3.6551724137931036) internal successors, (106), 27 states have internal predecessors, (106), 4 states have call successors, (9), 3 states have call predecessors, (9), 7 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2023-02-15 22:28:56,154 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 101 transitions. [2023-02-15 22:28:56,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-02-15 22:28:56,155 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:28:56,155 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:28:56,162 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-02-15 22:28:56,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2023-02-15 22:28:56,361 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-02-15 22:28:56,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:28:56,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1524453912, now seen corresponding path program 1 times [2023-02-15 22:28:56,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:28:56,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926842415] [2023-02-15 22:28:56,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:28:56,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:28:56,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:56,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:28:56,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:57,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 22:28:57,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:57,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 22:28:57,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:57,230 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 19 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 22:28:57,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:28:57,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926842415] [2023-02-15 22:28:57,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926842415] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:28:57,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [323793838] [2023-02-15 22:28:57,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:28:57,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:28:57,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:28:57,233 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 22:28:57,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-02-15 22:28:57,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:57,442 INFO L263 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 108 conjunts are in the unsatisfiable core [2023-02-15 22:28:57,445 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:28:57,450 INFO L350 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 [2023-02-15 22:28:57,492 INFO L350 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 [2023-02-15 22:28:57,578 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 22:28:57,578 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-15 22:28:57,646 INFO L350 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 [2023-02-15 22:28:57,823 INFO L350 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 [2023-02-15 22:28:57,920 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 22:28:57,920 INFO L350 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 19 treesize of output 26 [2023-02-15 22:28:57,923 INFO L350 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 12 treesize of output 8 [2023-02-15 22:28:58,070 INFO L350 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 18 treesize of output 10 [2023-02-15 22:28:58,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:28:58,327 INFO L350 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 24 [2023-02-15 22:28:58,337 INFO L321 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2023-02-15 22:28:58,338 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2023-02-15 22:28:58,343 INFO L350 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 6 treesize of output 5 [2023-02-15 22:28:58,632 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2023-02-15 22:28:58,632 INFO L350 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 59 treesize of output 41 [2023-02-15 22:28:58,642 INFO L350 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 26 treesize of output 28 [2023-02-15 22:28:58,711 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2023-02-15 22:28:58,711 INFO L350 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 3 case distinctions, treesize of input 108 treesize of output 89 [2023-02-15 22:28:58,724 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:28:58,725 INFO L350 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 73 treesize of output 72 [2023-02-15 22:28:58,787 INFO L350 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 62 treesize of output 46 [2023-02-15 22:28:58,944 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-15 22:28:58,944 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 30 [2023-02-15 22:28:59,043 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 8 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:28:59,044 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:28:59,076 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2981 (Array Int Int)) (v_ArrVal_2980 (Array Int Int))) (= (select |c_#valid| (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2980))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2981) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) 1)) is different from false [2023-02-15 22:28:59,084 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2978 (Array Int Int)) (v_ArrVal_2981 (Array Int Int)) (v_ArrVal_2980 (Array Int Int))) (= (select |c_#valid| (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2980))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_2978) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2981) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) 1)) is different from false [2023-02-15 22:28:59,117 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2978 (Array Int Int)) (v_ArrVal_2981 (Array Int Int)) (v_ArrVal_2980 (Array Int Int))) (= (select |c_#valid| (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2980))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_2978) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2981) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) 1)) is different from false [2023-02-15 22:28:59,139 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2978 (Array Int Int)) (v_ArrVal_2981 (Array Int Int)) (v_ArrVal_2980 (Array Int Int))) (= (select |c_#valid| (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2980))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.base| v_ArrVal_2978) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2981) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) 1)) is different from false [2023-02-15 22:28:59,147 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2978 (Array Int Int)) (v_ArrVal_2981 (Array Int Int)) (v_ArrVal_2980 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| .cse1 (store (select |c_#memory_$Pointer$.base| .cse1) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2980))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_2978) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2981) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) 1)) is different from false [2023-02-15 22:28:59,408 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:28:59,409 INFO L350 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 1558 treesize of output 1497 [2023-02-15 22:28:59,435 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:28:59,436 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1486 treesize of output 1458 [2023-02-15 22:28:59,447 INFO L350 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 1450 treesize of output 1442 [2023-02-15 22:28:59,455 INFO L350 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 1442 treesize of output 1426 [2023-02-15 22:29:08,029 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse30 (= |c_ULTIMATE.start_main_~#s~0#1.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) (.cse204 (store |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base| 1)) (.cse21 (store |c_#valid| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| 1)) (.cse228 (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse486 (not .cse228)) (.cse78 (forall ((v_arrayElimCell_122 Int) (v_arrayElimCell_121 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int))) (let ((.cse1005 (select v_ArrVal_2990 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse1005)) (= (select .cse21 (select (let ((.cse1006 (store (let ((.cse1007 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2990))) (store .cse1007 .cse1005 (store (select .cse1007 .cse1005) v_arrayElimCell_121 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|))) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse1006 (select (select .cse1006 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_122)) 1))))) (.cse51 (forall ((v_arrayElimCell_121 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_118 Int)) (let ((.cse1002 (select v_ArrVal_2990 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse1002) (= (select .cse21 (select (let ((.cse1003 (store (let ((.cse1004 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2990))) (store .cse1004 .cse1002 (store (select .cse1004 .cse1002) v_arrayElimCell_121 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|))) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse1003 (select (select .cse1003 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_118)) 1))))) (.cse83 (forall ((v_arrayElimCell_122 Int) (v_arrayElimCell_121 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_118 Int)) (let ((.cse998 (let ((.cse999 (store (let ((.cse1000 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2990)) (.cse1001 (select v_ArrVal_2990 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (store .cse1000 .cse1001 (store (select .cse1000 .cse1001) v_arrayElimCell_121 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|))) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse999 (select (select .cse999 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse21 (select .cse998 v_arrayElimCell_118)) 1) (= (select .cse21 (select .cse998 v_arrayElimCell_122)) 1))))) (.cse59 (forall ((v_arrayElimCell_120 Int) (v_arrayElimCell_121 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_118 Int)) (let ((.cse994 (select v_ArrVal_2990 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse995 (let ((.cse996 (store (let ((.cse997 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2990))) (store .cse997 .cse994 (store (select .cse997 .cse994) v_arrayElimCell_121 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|))) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse996 (select (select .cse996 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse994) (= (select .cse21 (select .cse995 v_arrayElimCell_118)) 1) (= (select .cse21 (select .cse995 v_arrayElimCell_120)) 1)))))) (.cse31 (forall ((v_arrayElimCell_120 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_118 Int)) (let ((.cse991 (select v_ArrVal_2990 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse990 (let ((.cse992 (store (let ((.cse993 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2990))) (store .cse993 .cse991 (store (select .cse993 .cse991) v_arrayElimCell_120 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|))) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse992 (select (select .cse992 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse21 (select .cse990 v_arrayElimCell_118)) 1) (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse991) (= (select .cse21 (select .cse990 v_arrayElimCell_120)) 1)))))) (.cse95 (forall ((v_arrayElimCell_120 Int) (v_arrayElimCell_122 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_118 Int)) (let ((.cse986 (let ((.cse987 (store (let ((.cse988 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2990)) (.cse989 (select v_ArrVal_2990 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (store .cse988 .cse989 (store (select .cse988 .cse989) v_arrayElimCell_120 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|))) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse987 (select (select .cse987 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse21 (select .cse986 v_arrayElimCell_118)) 1) (= (select .cse21 (select .cse986 v_arrayElimCell_122)) 1))))) (.cse623 (forall ((v_arrayElimCell_120 Int) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_119 Int)) (let ((.cse985 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2990))) (let ((.cse983 (select (select .cse985 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse983) (forall ((v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int))) (let ((.cse984 (select (store (store .cse985 .cse983 (store (select .cse985 .cse983) v_arrayElimCell_119 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2980) (select v_ArrVal_2980 |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (or (= (select .cse204 (select .cse984 v_arrayElimCell_123)) 1) (= (select .cse204 (select .cse984 v_arrayElimCell_120)) 1))))))))) (.cse119 (forall ((v_arrayElimCell_120 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_118 Int)) (let ((.cse982 (select v_ArrVal_2990 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= (select .cse21 (select (let ((.cse980 (store (let ((.cse981 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2990))) (store .cse981 .cse982 (store (select .cse981 .cse982) v_arrayElimCell_120 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|))) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse980 (select (select .cse980 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_118)) 1) (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse982))))) (.cse42 (forall ((v_arrayElimCell_120 Int) (v_arrayElimCell_122 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int))) (let ((.cse977 (select v_ArrVal_2990 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse977)) (= (select .cse21 (select (let ((.cse978 (store (let ((.cse979 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2990))) (store .cse979 .cse977 (store (select .cse979 .cse977) v_arrayElimCell_120 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|))) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse978 (select (select .cse978 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_122)) 1))))) (.cse37 (not (= 0 (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|)))) (.cse73 (not (< |c_ULTIMATE.start_main_~#s~0#1.base| |c_#StackHeapBarrier|))) (.cse180 (not .cse30)) (.cse28 (not (< |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |c_#StackHeapBarrier|))) (.cse29 (not (= 0 (select |c_#valid| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|))))) (let ((.cse47 (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| Int) (v_arrayElimCell_120 Int) (v_arrayElimCell_121 Int) (v_arrayElimCell_119 Int) (v_arrayElimCell_118 Int)) (or (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|))) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| |c_#StackHeapBarrier|)) (forall ((v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int))) (let ((.cse974 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2990))) (let ((.cse972 (select (select .cse974 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse975 (select .cse974 .cse972))) (let ((.cse971 (let ((.cse976 (store (store .cse974 .cse972 (store .cse975 v_arrayElimCell_119 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse976 (select (select .cse976 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (.cse970 (store |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| 1))) (or (= (select .cse970 (select .cse971 v_arrayElimCell_123)) 1) (= (select .cse970 (select .cse971 v_arrayElimCell_118)) 1) (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse972) (= (select .cse970 (select .cse971 v_arrayElimCell_120)) 1) (= (select .cse970 (select (let ((.cse973 (store (store .cse974 .cse972 (store .cse975 v_arrayElimCell_121 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse973 (select (select .cse973 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_123)) 1)))))))))) (.cse49 (or (forall ((v_arrayElimCell_120 Int) (v_arrayElimCell_121 Int) (v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_119 Int) (v_arrayElimCell_118 Int)) (let ((.cse967 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2990)) (.cse963 (select v_ArrVal_2990 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse968 (select .cse967 .cse963))) (let ((.cse964 (let ((.cse969 (store (store .cse967 .cse963 (store .cse968 v_arrayElimCell_121 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse969 (select (select .cse969 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (.cse965 (let ((.cse966 (store (store .cse967 .cse963 (store .cse968 v_arrayElimCell_119 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse966 (select (select .cse966 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse963) (= (select .cse21 (select .cse964 v_arrayElimCell_118)) 1) (= (select .cse21 (select .cse964 v_arrayElimCell_120)) 1) (= (select .cse21 (select .cse965 v_arrayElimCell_120)) 1) (= (select .cse21 (select .cse964 v_arrayElimCell_123)) 1) (= (select .cse21 (select .cse965 v_arrayElimCell_123)) 1)))))) .cse28 .cse29)) (.cse103 (forall ((v_arrayElimCell_120 Int) (v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_119 Int)) (let ((.cse959 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2990))) (let ((.cse960 (select (select .cse959 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse961 (select .cse959 .cse960)) (.cse962 (select v_ArrVal_2980 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (select .cse204 (select (select (store (store .cse959 .cse960 (store .cse961 v_arrayElimCell_119 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2980) .cse962) v_arrayElimCell_123)) 1) (= (select .cse204 (select (select (store (store .cse959 .cse960 (store .cse961 v_arrayElimCell_120 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2980) .cse962) v_arrayElimCell_123)) 1))))))) (.cse65 (forall ((v_arrayElimCell_120 Int) (v_arrayElimCell_121 Int) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_119 Int) (v_arrayElimCell_118 Int)) (let ((.cse952 (select v_ArrVal_2990 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse952) (forall ((v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int))) (let ((.cse956 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2990))) (let ((.cse957 (select .cse956 .cse952))) (let ((.cse954 (let ((.cse958 (store (store .cse956 .cse952 (store .cse957 v_arrayElimCell_119 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse958 (select (select .cse958 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (.cse953 (let ((.cse955 (store (store .cse956 .cse952 (store .cse957 v_arrayElimCell_121 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse955 (select (select .cse955 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse21 (select .cse953 v_arrayElimCell_118)) 1) (= (select .cse21 (select .cse953 v_arrayElimCell_120)) 1) (= (select .cse21 (select .cse954 v_arrayElimCell_120)) 1) (= (select .cse21 (select .cse954 v_arrayElimCell_118)) 1) (= (select .cse21 (select .cse953 v_arrayElimCell_123)) 1)))))))))) (.cse66 (forall ((v_arrayElimCell_120 Int) (v_arrayElimCell_121 Int) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_119 Int) (v_arrayElimCell_118 Int)) (let ((.cse946 (select v_ArrVal_2990 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse946) (forall ((v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int))) (let ((.cse949 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2990))) (let ((.cse950 (select .cse949 .cse946))) (let ((.cse947 (let ((.cse951 (store (store .cse949 .cse946 (store .cse950 v_arrayElimCell_121 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse951 (select (select .cse951 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse21 (select .cse947 v_arrayElimCell_118)) 1) (= (select .cse21 (select .cse947 v_arrayElimCell_120)) 1) (= (select .cse21 (select (let ((.cse948 (store (store .cse949 .cse946 (store .cse950 v_arrayElimCell_119 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse948 (select (select .cse948 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_118)) 1) (= (select .cse21 (select .cse947 v_arrayElimCell_123)) 1)))))))))) (.cse67 (forall ((v_arrayElimCell_120 Int) (v_arrayElimCell_121 Int) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_119 Int) (v_arrayElimCell_118 Int)) (let ((.cse940 (select v_ArrVal_2990 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse940) (forall ((v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int))) (let ((.cse943 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2990))) (let ((.cse944 (select .cse943 .cse940))) (let ((.cse941 (let ((.cse945 (store (store .cse943 .cse940 (store .cse944 v_arrayElimCell_121 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse945 (select (select .cse945 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse21 (select .cse941 v_arrayElimCell_118)) 1) (= (select .cse21 (select .cse941 v_arrayElimCell_120)) 1) (= (select .cse21 (select (let ((.cse942 (store (store .cse943 .cse940 (store .cse944 v_arrayElimCell_119 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse942 (select (select .cse942 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_120)) 1) (= (select .cse21 (select .cse941 v_arrayElimCell_123)) 1)))))))))) (.cse33 (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| Int) (v_arrayElimCell_120 Int) (v_arrayElimCell_119 Int) (v_arrayElimCell_118 Int)) (or (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|))) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int))) (let ((.cse937 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2990))) (let ((.cse935 (select (select .cse937 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse938 (select .cse937 .cse935))) (let ((.cse934 (let ((.cse939 (store (store .cse937 .cse935 (store .cse938 v_arrayElimCell_119 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse939 (select (select .cse939 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (.cse933 (store |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| 1))) (or (= (select .cse933 (select .cse934 v_arrayElimCell_118)) 1) (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse935) (= (select .cse933 (select .cse934 v_arrayElimCell_120)) 1) (= (select .cse933 (select (let ((.cse936 (store (store .cse937 .cse935 (store .cse938 v_arrayElimCell_120 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse936 (select (select .cse936 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_118)) 1)))))))))) (.cse18 (forall ((v_arrayElimCell_120 Int) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_118 Int)) (let ((.cse929 (select v_ArrVal_2990 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse929) (forall ((v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int))) (let ((.cse930 (let ((.cse931 (store (let ((.cse932 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2990))) (store .cse932 .cse929 (store (select .cse932 .cse929) v_arrayElimCell_120 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|))) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse931 (select (select .cse931 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse21 (select .cse930 v_arrayElimCell_118)) 1) (= (select .cse21 (select .cse930 v_arrayElimCell_123)) 1) (= (select .cse21 (select .cse930 v_arrayElimCell_120)) 1)))))))) (.cse19 (or .cse180 (forall ((v_arrayElimCell_120 Int) (v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int))) (let ((.cse925 (select v_ArrVal_2990 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse926 (let ((.cse927 (store (let ((.cse928 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2990))) (store .cse928 .cse925 (store (select .cse928 .cse925) v_arrayElimCell_120 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|))) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse927 (select (select .cse927 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse925) (= (select .cse21 (select .cse926 v_arrayElimCell_123)) 1) (= (select .cse21 (select .cse926 v_arrayElimCell_120)) 1))))))) (.cse27 (or .cse180 (forall ((v_arrayElimCell_120 Int) (v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int))) (let ((.cse922 (select v_ArrVal_2990 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse922) (= (select .cse21 (select (let ((.cse923 (store (let ((.cse924 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2990))) (store .cse924 .cse922 (store (select .cse924 .cse922) v_arrayElimCell_120 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|))) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse923 (select (select .cse923 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_123)) 1)))))) (.cse107 (forall ((v_arrayElimCell_120 Int) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_119 Int) (v_arrayElimCell_118 Int)) (let ((.cse916 (select v_ArrVal_2990 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse916) (forall ((v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int))) (let ((.cse919 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2990))) (let ((.cse920 (select .cse919 .cse916))) (let ((.cse917 (let ((.cse921 (store (store .cse919 .cse916 (store .cse920 v_arrayElimCell_120 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse921 (select (select .cse921 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse21 (select .cse917 v_arrayElimCell_123)) 1) (= (select .cse21 (select .cse917 v_arrayElimCell_120)) 1) (= (select .cse21 (select (let ((.cse918 (store (store .cse919 .cse916 (store .cse920 v_arrayElimCell_119 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse918 (select (select .cse918 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_118)) 1)))))))))) (.cse34 (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| Int) (v_arrayElimCell_120 Int) (v_arrayElimCell_119 Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|))) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_2990 (Array Int Int))) (let ((.cse912 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2990))) (let ((.cse913 (select (select .cse912 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (forall ((v_arrayElimCell_122 Int) (v_ArrVal_2980 (Array Int Int))) (let ((.cse914 (select .cse912 .cse913))) (let ((.cse909 (store |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| 1)) (.cse910 (let ((.cse915 (store (store .cse912 .cse913 (store .cse914 v_arrayElimCell_120 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse915 (select (select .cse915 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (forall ((v_arrayElimCell_123 Int)) (= (select .cse909 (select .cse910 v_arrayElimCell_123)) 1)) (= (select .cse909 (select (let ((.cse911 (store (store .cse912 .cse913 (store .cse914 v_arrayElimCell_119 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse911 (select (select .cse911 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_122)) 1) (= (select .cse909 (select .cse910 v_arrayElimCell_122)) 1))))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse913))))))))) (.cse52 (or (forall ((v_arrayElimCell_121 Int) (v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_119 Int)) (let ((.cse906 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2990))) (let ((.cse905 (select (select .cse906 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse907 (select .cse906 .cse905)) (.cse908 (select v_ArrVal_2980 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse905) (= (select .cse204 (select (select (store (store .cse906 .cse905 (store .cse907 v_arrayElimCell_119 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2980) .cse908) v_arrayElimCell_123)) 1) (= (select .cse204 (select (select (store (store .cse906 .cse905 (store .cse907 v_arrayElimCell_121 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2980) .cse908) v_arrayElimCell_123)) 1)))))) .cse37 .cse73)) (.cse53 (or .cse28 .cse29 (forall ((v_arrayElimCell_122 Int) (v_arrayElimCell_121 Int) (v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_119 Int)) (let ((.cse901 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2990)) (.cse902 (select v_ArrVal_2990 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse903 (select .cse901 .cse902))) (let ((.cse899 (let ((.cse904 (store (store .cse901 .cse902 (store .cse903 v_arrayElimCell_121 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse904 (select (select .cse904 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse21 (select .cse899 v_arrayElimCell_123)) 1) (= (select .cse21 (select (let ((.cse900 (store (store .cse901 .cse902 (store .cse903 v_arrayElimCell_119 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse900 (select (select .cse900 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_122)) 1) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse902)) (= (select .cse21 (select .cse899 v_arrayElimCell_122)) 1)))))))) (.cse174 (or .cse30 .cse28 .cse42 .cse29)) (.cse56 (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| Int) (v_arrayElimCell_121 Int) (v_arrayElimCell_119 Int) (v_arrayElimCell_118 Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|))) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| |c_#StackHeapBarrier|)) (forall ((v_arrayElimCell_122 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int))) (let ((.cse895 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2990))) (let ((.cse896 (select (select .cse895 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse897 (select .cse895 .cse896))) (let ((.cse892 (let ((.cse898 (store (store .cse895 .cse896 (store .cse897 v_arrayElimCell_119 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse898 (select (select .cse898 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (.cse891 (store |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| 1)) (.cse893 (let ((.cse894 (store (store .cse895 .cse896 (store .cse897 v_arrayElimCell_121 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse894 (select (select .cse894 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse891 (select .cse892 v_arrayElimCell_118)) 1) (= (select .cse891 (select .cse892 v_arrayElimCell_122)) 1) (= (select .cse891 (select .cse893 v_arrayElimCell_118)) 1) (= (select .cse891 (select .cse893 v_arrayElimCell_122)) 1)))))))))) (.cse57 (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| Int) (v_arrayElimCell_121 Int) (v_arrayElimCell_119 Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|))) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| |c_#StackHeapBarrier|)) (forall ((v_arrayElimCell_122 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int))) (let ((.cse887 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2990))) (let ((.cse888 (select (select .cse887 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse885 (store |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| 1)) (.cse889 (select .cse887 .cse888))) (or (= (select .cse885 (select (let ((.cse886 (store (store .cse887 .cse888 (store .cse889 v_arrayElimCell_119 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse886 (select (select .cse886 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_122)) 1) (= (select .cse885 (select (let ((.cse890 (store (store .cse887 .cse888 (store .cse889 v_arrayElimCell_121 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse890 (select (select .cse890 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_122)) 1) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse888)))))))))) (.cse58 (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| Int) (v_arrayElimCell_120 Int) (v_arrayElimCell_121 Int) (v_arrayElimCell_119 Int) (v_arrayElimCell_118 Int)) (or (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|))) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_2990 (Array Int Int))) (let ((.cse882 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2990))) (let ((.cse878 (select (select .cse882 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse878) (forall ((v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int))) (let ((.cse883 (select .cse882 .cse878))) (let ((.cse880 (let ((.cse884 (store (store .cse882 .cse878 (store .cse883 v_arrayElimCell_119 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse884 (select (select .cse884 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (.cse879 (store |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| 1))) (or (= (select .cse879 (select .cse880 v_arrayElimCell_123)) 1) (= (select .cse879 (select .cse880 v_arrayElimCell_118)) 1) (= (select .cse879 (select .cse880 v_arrayElimCell_120)) 1) (= (select .cse879 (select (let ((.cse881 (store (store .cse882 .cse878 (store .cse883 v_arrayElimCell_121 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse881 (select (select .cse881 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_118)) 1)))))))))))) (.cse60 (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| Int) (v_arrayElimCell_121 Int) (v_arrayElimCell_119 Int) (v_arrayElimCell_118 Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|))) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_2990 (Array Int Int))) (let ((.cse874 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2990))) (let ((.cse875 (select (select .cse874 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (forall ((v_ArrVal_2980 (Array Int Int))) (let ((.cse872 (store |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| 1)) (.cse876 (select .cse874 .cse875))) (or (= (select .cse872 (select (let ((.cse873 (store (store .cse874 .cse875 (store .cse876 v_arrayElimCell_119 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse873 (select (select .cse873 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_118)) 1) (= (select .cse872 (select (let ((.cse877 (store (store .cse874 .cse875 (store .cse876 v_arrayElimCell_121 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse877 (select (select .cse877 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_118)) 1)))) (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse875)))))))) (.cse96 (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| Int) (v_arrayElimCell_120 Int) (v_arrayElimCell_119 Int) (v_arrayElimCell_118 Int)) (or (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|))) (forall ((v_ArrVal_2990 (Array Int Int))) (let ((.cse868 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2990))) (let ((.cse869 (select (select .cse868 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (forall ((v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int))) (let ((.cse870 (select .cse868 .cse869))) (let ((.cse866 (let ((.cse871 (store (store .cse868 .cse869 (store .cse870 v_arrayElimCell_119 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse871 (select (select .cse871 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (.cse865 (store |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| 1))) (or (= (select .cse865 (select .cse866 v_arrayElimCell_123)) 1) (= (select .cse865 (select .cse866 v_arrayElimCell_118)) 1) (= (select .cse865 (select (let ((.cse867 (store (store .cse868 .cse869 (store .cse870 v_arrayElimCell_120 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse867 (select (select .cse867 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_120)) 1))))) (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse869))))) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| |c_#StackHeapBarrier|))))) (.cse61 (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| Int) (v_arrayElimCell_120 Int) (v_arrayElimCell_121 Int) (v_arrayElimCell_119 Int) (v_arrayElimCell_118 Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|))) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_2990 (Array Int Int))) (let ((.cse861 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2990))) (let ((.cse862 (select (select .cse861 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (forall ((v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int))) (let ((.cse863 (select .cse861 .cse862))) (let ((.cse858 (let ((.cse864 (store (store .cse861 .cse862 (store .cse863 v_arrayElimCell_119 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse864 (select (select .cse864 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (.cse857 (store |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| 1)) (.cse859 (let ((.cse860 (store (store .cse861 .cse862 (store .cse863 v_arrayElimCell_121 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse860 (select (select .cse860 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse857 (select .cse858 v_arrayElimCell_123)) 1) (= (select .cse857 (select .cse858 v_arrayElimCell_118)) 1) (= (select .cse857 (select .cse859 v_arrayElimCell_120)) 1) (= (select .cse857 (select .cse858 v_arrayElimCell_120)) 1) (= (select .cse857 (select .cse859 v_arrayElimCell_123)) 1) (= (select .cse857 (select .cse859 v_arrayElimCell_118)) 1))))) (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse862)))))))) (.cse63 (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| Int) (v_arrayElimCell_120 Int) (v_arrayElimCell_121 Int) (v_arrayElimCell_119 Int) (v_arrayElimCell_118 Int)) (or (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|))) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_2990 (Array Int Int))) (let ((.cse853 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2990))) (let ((.cse854 (select (select .cse853 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (forall ((v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int))) (let ((.cse855 (select .cse853 .cse854))) (let ((.cse850 (let ((.cse856 (store (store .cse853 .cse854 (store .cse855 v_arrayElimCell_119 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse856 (select (select .cse856 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (.cse849 (store |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| 1)) (.cse851 (let ((.cse852 (store (store .cse853 .cse854 (store .cse855 v_arrayElimCell_121 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse852 (select (select .cse852 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse849 (select .cse850 v_arrayElimCell_123)) 1) (= (select .cse849 (select .cse850 v_arrayElimCell_118)) 1) (= (select .cse849 (select .cse851 v_arrayElimCell_120)) 1) (= (select .cse849 (select .cse850 v_arrayElimCell_120)) 1) (= (select .cse849 (select .cse851 v_arrayElimCell_118)) 1))))) (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse854)))))))) (.cse62 (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| Int) (v_arrayElimCell_119 Int) (v_arrayElimCell_118 Int)) (or (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|))) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| |c_#StackHeapBarrier|)) (forall ((v_arrayElimCell_122 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int))) (let ((.cse844 (store |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| 1)) (.cse845 (let ((.cse846 (store (let ((.cse847 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2990))) (let ((.cse848 (select (select .cse847 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (store .cse847 .cse848 (store (select .cse847 .cse848) v_arrayElimCell_119 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse846 (select (select .cse846 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse844 (select .cse845 v_arrayElimCell_118)) 1) (= (select .cse844 (select .cse845 v_arrayElimCell_122)) 1))))))) (.cse68 (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| Int) (v_arrayElimCell_121 Int) (v_arrayElimCell_119 Int)) (or (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|) (forall ((v_ArrVal_2990 (Array Int Int))) (let ((.cse840 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2990))) (let ((.cse841 (select (select .cse840 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (forall ((v_arrayElimCell_122 Int) (v_ArrVal_2980 (Array Int Int))) (let ((.cse838 (store |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| 1)) (.cse842 (select .cse840 .cse841))) (or (= (select .cse838 (select (let ((.cse839 (store (store .cse840 .cse841 (store .cse842 v_arrayElimCell_119 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse839 (select (select .cse839 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_122)) 1) (forall ((v_arrayElimCell_123 Int)) (= (select .cse838 (select (let ((.cse843 (store (store .cse840 .cse841 (store .cse842 v_arrayElimCell_121 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse843 (select (select .cse843 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_123)) 1))))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse841)))))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|))) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| |c_#StackHeapBarrier|))))) (.cse208 (or .cse30 .cse28 .cse29 .cse119)) (.cse74 (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| Int) (v_arrayElimCell_121 Int) (v_arrayElimCell_119 Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|))) (forall ((v_ArrVal_2990 (Array Int Int))) (let ((.cse833 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2990))) (let ((.cse834 (select (select .cse833 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (forall ((v_arrayElimCell_122 Int) (v_ArrVal_2980 (Array Int Int))) (let ((.cse835 (select .cse833 .cse834))) (let ((.cse831 (store |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| 1)) (.cse836 (let ((.cse837 (store (store .cse833 .cse834 (store .cse835 v_arrayElimCell_121 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse837 (select (select .cse837 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse831 (select (let ((.cse832 (store (store .cse833 .cse834 (store .cse835 v_arrayElimCell_119 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse832 (select (select .cse832 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_122)) 1) (forall ((v_arrayElimCell_123 Int)) (= (select .cse831 (select .cse836 v_arrayElimCell_123)) 1)) (= (select .cse831 (select .cse836 v_arrayElimCell_122)) 1))))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse834)))))) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| |c_#StackHeapBarrier|))))) (.cse99 (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| Int) (v_arrayElimCell_120 Int) (v_arrayElimCell_119 Int) (v_arrayElimCell_118 Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|))) (forall ((v_ArrVal_2990 (Array Int Int))) (let ((.cse827 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2990))) (let ((.cse828 (select (select .cse827 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (forall ((v_ArrVal_2980 (Array Int Int))) (let ((.cse825 (store |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| 1)) (.cse829 (select .cse827 .cse828))) (or (= (select .cse825 (select (let ((.cse826 (store (store .cse827 .cse828 (store .cse829 v_arrayElimCell_119 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse826 (select (select .cse826 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_118)) 1) (= (select .cse825 (select (let ((.cse830 (store (store .cse827 .cse828 (store .cse829 v_arrayElimCell_120 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse830 (select (select .cse830 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_120)) 1)))) (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse828))))) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| |c_#StackHeapBarrier|))))) (.cse100 (or .cse28 (forall ((v_arrayElimCell_120 Int) (v_arrayElimCell_122 Int) (v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_119 Int)) (let ((.cse821 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2990)) (.cse822 (select v_ArrVal_2990 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse823 (select .cse821 .cse822))) (let ((.cse819 (let ((.cse824 (store (store .cse821 .cse822 (store .cse823 v_arrayElimCell_120 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse824 (select (select .cse824 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse21 (select .cse819 v_arrayElimCell_123)) 1) (= (select .cse21 (select (let ((.cse820 (store (store .cse821 .cse822 (store .cse823 v_arrayElimCell_119 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse820 (select (select .cse820 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_122)) 1) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse822)) (= (select .cse21 (select .cse819 v_arrayElimCell_122)) 1)))))) .cse29)) (.cse69 (forall ((v_arrayElimCell_120 Int) (v_arrayElimCell_121 Int) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_119 Int) (v_arrayElimCell_118 Int)) (let ((.cse812 (select v_ArrVal_2990 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse812) (forall ((v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int))) (let ((.cse816 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2990))) (let ((.cse817 (select .cse816 .cse812))) (let ((.cse813 (let ((.cse818 (store (store .cse816 .cse812 (store .cse817 v_arrayElimCell_121 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse818 (select (select .cse818 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (.cse814 (let ((.cse815 (store (store .cse816 .cse812 (store .cse817 v_arrayElimCell_119 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse815 (select (select .cse815 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse21 (select .cse813 v_arrayElimCell_118)) 1) (= (select .cse21 (select .cse813 v_arrayElimCell_120)) 1) (= (select .cse21 (select .cse814 v_arrayElimCell_118)) 1) (= (select .cse21 (select .cse813 v_arrayElimCell_123)) 1) (= (select .cse21 (select .cse814 v_arrayElimCell_123)) 1)))))))))) (.cse70 (forall ((v_arrayElimCell_120 Int) (v_arrayElimCell_121 Int) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_119 Int) (v_arrayElimCell_118 Int)) (let ((.cse809 (select v_ArrVal_2990 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (forall ((v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int))) (let ((.cse808 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2990))) (let ((.cse810 (select .cse808 .cse809))) (let ((.cse806 (let ((.cse811 (store (store .cse808 .cse809 (store .cse810 v_arrayElimCell_121 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse811 (select (select .cse811 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse21 (select .cse806 v_arrayElimCell_118)) 1) (= (select .cse21 (select .cse806 v_arrayElimCell_120)) 1) (= (select .cse21 (select .cse806 v_arrayElimCell_123)) 1) (= (select .cse21 (select (let ((.cse807 (store (store .cse808 .cse809 (store .cse810 v_arrayElimCell_119 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse807 (select (select .cse807 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_123)) 1)))))) (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse809))))) (.cse101 (or (forall ((v_arrayElimCell_120 Int) (v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_119 Int) (v_arrayElimCell_118 Int)) (let ((.cse803 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2990)) (.cse801 (select v_ArrVal_2990 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse804 (select .cse803 .cse801))) (let ((.cse800 (let ((.cse805 (store (store .cse803 .cse801 (store .cse804 v_arrayElimCell_120 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse805 (select (select .cse805 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse21 (select .cse800 v_arrayElimCell_118)) 1) (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse801) (= (select .cse21 (select .cse800 v_arrayElimCell_120)) 1) (= (select .cse21 (select (let ((.cse802 (store (store .cse803 .cse801 (store .cse804 v_arrayElimCell_119 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse802 (select (select .cse802 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_123)) 1)))))) .cse28 .cse29)) (.cse102 (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| Int) (v_arrayElimCell_120 Int) (v_arrayElimCell_119 Int)) (or (forall ((v_ArrVal_2990 (Array Int Int))) (let ((.cse796 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2990))) (let ((.cse797 (select (select .cse796 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (forall ((v_arrayElimCell_122 Int) (v_ArrVal_2980 (Array Int Int))) (let ((.cse794 (store |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| 1)) (.cse798 (select .cse796 .cse797))) (or (= (select .cse794 (select (let ((.cse795 (store (store .cse796 .cse797 (store .cse798 v_arrayElimCell_119 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse795 (select (select .cse795 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_122)) 1) (= (select .cse794 (select (let ((.cse799 (store (store .cse796 .cse797 (store .cse798 v_arrayElimCell_120 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse799 (select (select .cse799 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_122)) 1)))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse797)))))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|))) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| |c_#StackHeapBarrier|))))) (.cse77 (forall ((v_arrayElimCell_122 Int) (v_arrayElimCell_121 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_119 Int)) (let ((.cse790 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2990)) (.cse791 (select v_ArrVal_2990 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse792 (select .cse790 .cse791))) (or (= (select .cse21 (select (let ((.cse789 (store (store .cse790 .cse791 (store .cse792 v_arrayElimCell_119 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse789 (select (select .cse789 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_122)) 1) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse791)) (= (select .cse21 (select (let ((.cse793 (store (store .cse790 .cse791 (store .cse792 v_arrayElimCell_121 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse793 (select (select .cse793 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_122)) 1)))))) (.cse76 (forall ((v_arrayElimCell_121 Int) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_119 Int)) (let ((.cse783 (select v_ArrVal_2990 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse783)) (forall ((v_arrayElimCell_122 Int) (v_ArrVal_2980 (Array Int Int))) (let ((.cse786 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2990))) (let ((.cse787 (select .cse786 .cse783))) (let ((.cse784 (let ((.cse788 (store (store .cse786 .cse783 (store .cse787 v_arrayElimCell_121 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse788 (select (select .cse788 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (forall ((v_arrayElimCell_123 Int)) (= (select .cse21 (select .cse784 v_arrayElimCell_123)) 1)) (= (select .cse21 (select (let ((.cse785 (store (store .cse786 .cse783 (store .cse787 v_arrayElimCell_119 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse785 (select (select .cse785 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_122)) 1) (= (select .cse21 (select .cse784 v_arrayElimCell_122)) 1)))))))))) (.cse79 (forall ((v_arrayElimCell_121 Int) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_119 Int)) (let ((.cse780 (select v_ArrVal_2990 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (forall ((v_arrayElimCell_122 Int) (v_ArrVal_2980 (Array Int Int))) (let ((.cse779 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2990))) (let ((.cse781 (select .cse779 .cse780))) (let ((.cse777 (let ((.cse782 (store (store .cse779 .cse780 (store .cse781 v_arrayElimCell_121 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse782 (select (select .cse782 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (forall ((v_arrayElimCell_123 Int)) (or (= (select .cse21 (select .cse777 v_arrayElimCell_123)) 1) (= (select .cse21 (select (let ((.cse778 (store (store .cse779 .cse780 (store .cse781 v_arrayElimCell_119 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse778 (select (select .cse778 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_123)) 1))) (= (select .cse21 (select .cse777 v_arrayElimCell_122)) 1)))))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse780)))))) (.cse80 (forall ((v_arrayElimCell_121 Int) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_119 Int)) (let ((.cse770 (select v_ArrVal_2990 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse770)) (forall ((v_arrayElimCell_122 Int) (v_ArrVal_2980 (Array Int Int))) (let ((.cse774 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2990))) (let ((.cse775 (select .cse774 .cse770))) (let ((.cse772 (let ((.cse776 (store (store .cse774 .cse770 (store .cse775 v_arrayElimCell_119 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse776 (select (select .cse776 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (.cse771 (let ((.cse773 (store (store .cse774 .cse770 (store .cse775 v_arrayElimCell_121 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse773 (select (select .cse773 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (forall ((v_arrayElimCell_123 Int)) (or (= (select .cse21 (select .cse771 v_arrayElimCell_123)) 1) (= (select .cse21 (select .cse772 v_arrayElimCell_123)) 1))) (= (select .cse21 (select .cse772 v_arrayElimCell_122)) 1) (= (select .cse21 (select .cse771 v_arrayElimCell_122)) 1)))))))))) (.cse86 (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| Int) (v_arrayElimCell_120 Int) (v_arrayElimCell_121 Int) (v_arrayElimCell_119 Int) (v_arrayElimCell_118 Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|))) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_2990 (Array Int Int))) (let ((.cse767 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2990))) (let ((.cse762 (select (select .cse767 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse762) (forall ((v_ArrVal_2980 (Array Int Int))) (let ((.cse768 (select .cse767 .cse762))) (let ((.cse764 (let ((.cse769 (store (store .cse767 .cse762 (store .cse768 v_arrayElimCell_119 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse769 (select (select .cse769 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (.cse763 (store |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| 1)) (.cse765 (let ((.cse766 (store (store .cse767 .cse762 (store .cse768 v_arrayElimCell_121 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse766 (select (select .cse766 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse763 (select .cse764 v_arrayElimCell_118)) 1) (= (select .cse763 (select .cse765 v_arrayElimCell_120)) 1) (= (select .cse763 (select .cse764 v_arrayElimCell_120)) 1) (= (select .cse763 (select .cse765 v_arrayElimCell_118)) 1)))))))))))) (.cse87 (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| Int) (v_arrayElimCell_121 Int) (v_arrayElimCell_119 Int) (v_arrayElimCell_118 Int)) (or (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|))) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| |c_#StackHeapBarrier|)) (forall ((v_arrayElimCell_122 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int))) (let ((.cse758 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2990))) (let ((.cse759 (select (select .cse758 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse760 (select .cse758 .cse759))) (let ((.cse756 (let ((.cse761 (store (store .cse758 .cse759 (store .cse760 v_arrayElimCell_119 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse761 (select (select .cse761 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (.cse755 (store |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| 1))) (or (= (select .cse755 (select .cse756 v_arrayElimCell_118)) 1) (= (select .cse755 (select .cse756 v_arrayElimCell_122)) 1) (= (select .cse755 (select (let ((.cse757 (store (store .cse758 .cse759 (store .cse760 v_arrayElimCell_121 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse757 (select (select .cse757 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_122)) 1)))))))))) (.cse85 (forall ((v_arrayElimCell_121 Int) (v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_119 Int)) (let ((.cse751 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2990))) (let ((.cse752 (select (select .cse751 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse753 (select .cse751 .cse752)) (.cse754 (select v_ArrVal_2980 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (select .cse204 (select (select (store (store .cse751 .cse752 (store .cse753 v_arrayElimCell_119 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2980) .cse754) v_arrayElimCell_123)) 1) (= (select .cse204 (select (select (store (store .cse751 .cse752 (store .cse753 v_arrayElimCell_121 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2980) .cse754) v_arrayElimCell_123)) 1))))))) (.cse90 (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| Int) (v_arrayElimCell_120 Int) (v_arrayElimCell_121 Int) (v_arrayElimCell_119 Int) (v_arrayElimCell_118 Int)) (or (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|))) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int))) (let ((.cse748 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2990))) (let ((.cse746 (select (select .cse748 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse749 (select .cse748 .cse746))) (let ((.cse745 (let ((.cse750 (store (store .cse748 .cse746 (store .cse749 v_arrayElimCell_119 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse750 (select (select .cse750 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (.cse744 (store |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| 1))) (or (= (select .cse744 (select .cse745 v_arrayElimCell_118)) 1) (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse746) (= (select .cse744 (select .cse745 v_arrayElimCell_120)) 1) (= (select .cse744 (select (let ((.cse747 (store (store .cse748 .cse746 (store .cse749 v_arrayElimCell_121 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse747 (select (select .cse747 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_118)) 1)))))))))) (.cse108 (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| Int) (v_arrayElimCell_120 Int) (v_arrayElimCell_119 Int) (v_arrayElimCell_118 Int)) (or (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|))) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| |c_#StackHeapBarrier|)) (forall ((v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int))) (let ((.cse741 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2990))) (let ((.cse739 (select (select .cse741 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse742 (select .cse741 .cse739))) (let ((.cse737 (let ((.cse743 (store (store .cse741 .cse739 (store .cse742 v_arrayElimCell_119 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse743 (select (select .cse743 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (.cse736 (store |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| 1)) (.cse738 (let ((.cse740 (store (store .cse741 .cse739 (store .cse742 v_arrayElimCell_120 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse740 (select (select .cse740 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse736 (select .cse737 v_arrayElimCell_123)) 1) (= (select .cse736 (select .cse737 v_arrayElimCell_118)) 1) (= (select .cse736 (select .cse738 v_arrayElimCell_123)) 1) (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse739) (= (select .cse736 (select .cse737 v_arrayElimCell_120)) 1) (= (select .cse736 (select .cse738 v_arrayElimCell_118)) 1)))))))))) (.cse91 (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| Int) (v_arrayElimCell_120 Int) (v_arrayElimCell_119 Int) (v_arrayElimCell_118 Int)) (or (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|))) (forall ((v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int))) (let ((.cse735 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2990))) (let ((.cse733 (select (select .cse735 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse731 (store |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| 1)) (.cse732 (let ((.cse734 (store (store .cse735 .cse733 (store (select .cse735 .cse733) v_arrayElimCell_119 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse734 (select (select .cse734 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse731 (select .cse732 v_arrayElimCell_118)) 1) (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse733) (= (select .cse731 (select .cse732 v_arrayElimCell_120)) 1)))))) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| |c_#StackHeapBarrier|))))) (.cse116 (forall ((v_arrayElimCell_120 Int) (v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_119 Int)) (let ((.cse728 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2990))) (let ((.cse726 (select (select .cse728 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse729 (select .cse728 .cse726)) (.cse730 (select v_ArrVal_2980 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse727 (select (store (store .cse728 .cse726 (store .cse729 v_arrayElimCell_119 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2980) .cse730))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse726) (= (select .cse204 (select .cse727 v_arrayElimCell_123)) 1) (= (select .cse204 (select .cse727 v_arrayElimCell_120)) 1) (= (select .cse204 (select (select (store (store .cse728 .cse726 (store .cse729 v_arrayElimCell_120 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2980) .cse730) v_arrayElimCell_123)) 1)))))))) (.cse109 (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| Int) (v_arrayElimCell_120 Int) (v_arrayElimCell_119 Int)) (or (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|))) (forall ((v_ArrVal_2990 (Array Int Int))) (let ((.cse722 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2990))) (let ((.cse723 (select (select .cse722 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (forall ((v_arrayElimCell_122 Int) (v_ArrVal_2980 (Array Int Int))) (let ((.cse724 (select .cse722 .cse723))) (let ((.cse719 (store |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| 1)) (.cse720 (let ((.cse725 (store (store .cse722 .cse723 (store .cse724 v_arrayElimCell_119 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse725 (select (select .cse725 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (forall ((v_arrayElimCell_123 Int)) (or (= (select .cse719 (select .cse720 v_arrayElimCell_123)) 1) (= (select .cse719 (select (let ((.cse721 (store (store .cse722 .cse723 (store .cse724 v_arrayElimCell_120 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse721 (select (select .cse721 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_123)) 1))) (= (select .cse719 (select .cse720 v_arrayElimCell_122)) 1))))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse723)))))) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| |c_#StackHeapBarrier|))))) (.cse92 (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| Int) (v_arrayElimCell_121 Int) (v_arrayElimCell_119 Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|))) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_2990 (Array Int Int))) (let ((.cse715 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2990))) (let ((.cse716 (select (select .cse715 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (forall ((v_arrayElimCell_122 Int) (v_ArrVal_2980 (Array Int Int))) (let ((.cse717 (select .cse715 .cse716))) (let ((.cse712 (let ((.cse718 (store (store .cse715 .cse716 (store .cse717 v_arrayElimCell_119 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse718 (select (select .cse718 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (.cse711 (store |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| 1)) (.cse713 (let ((.cse714 (store (store .cse715 .cse716 (store .cse717 v_arrayElimCell_121 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse714 (select (select .cse714 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse711 (select .cse712 v_arrayElimCell_122)) 1) (= (select .cse711 (select .cse713 v_arrayElimCell_122)) 1) (forall ((v_arrayElimCell_123 Int)) (or (= (select .cse711 (select .cse712 v_arrayElimCell_123)) 1) (= (select .cse711 (select .cse713 v_arrayElimCell_123)) 1))))))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse716))))))))) (.cse111 (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| Int) (v_arrayElimCell_120 Int) (v_arrayElimCell_119 Int) (v_arrayElimCell_118 Int)) (or (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|))) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| |c_#StackHeapBarrier|)) (forall ((v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int))) (let ((.cse707 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2990))) (let ((.cse708 (select (select .cse707 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse709 (select .cse707 .cse708))) (let ((.cse704 (store |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| 1)) (.cse705 (let ((.cse710 (store (store .cse707 .cse708 (store .cse709 v_arrayElimCell_119 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse710 (select (select .cse710 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse704 (select .cse705 v_arrayElimCell_123)) 1) (= (select .cse704 (select .cse705 v_arrayElimCell_118)) 1) (= (select .cse704 (select (let ((.cse706 (store (store .cse707 .cse708 (store .cse709 v_arrayElimCell_120 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse706 (select (select .cse706 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_123)) 1) (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse708) (= (select .cse704 (select .cse705 v_arrayElimCell_120)) 1)))))))))) (.cse113 (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| Int) (v_arrayElimCell_120 Int) (v_arrayElimCell_119 Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|))) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| |c_#StackHeapBarrier|)) (forall ((v_arrayElimCell_122 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int))) (let ((.cse700 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2990))) (let ((.cse701 (select (select .cse700 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse698 (store |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| 1)) (.cse702 (select .cse700 .cse701))) (or (= (select .cse698 (select (let ((.cse699 (store (store .cse700 .cse701 (store .cse702 v_arrayElimCell_119 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse699 (select (select .cse699 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_122)) 1) (= (select .cse698 (select (let ((.cse703 (store (store .cse700 .cse701 (store .cse702 v_arrayElimCell_120 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse703 (select (select .cse703 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_122)) 1) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse701)))))))))) (.cse114 (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| Int) (v_arrayElimCell_120 Int) (v_arrayElimCell_119 Int) (v_arrayElimCell_118 Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|))) (forall ((v_ArrVal_2990 (Array Int Int))) (let ((.cse694 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2990))) (let ((.cse695 (select (select .cse694 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (forall ((v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int))) (let ((.cse696 (select .cse694 .cse695))) (let ((.cse692 (let ((.cse697 (store (store .cse694 .cse695 (store .cse696 v_arrayElimCell_119 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse697 (select (select .cse697 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (.cse691 (store |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| 1))) (or (= (select .cse691 (select .cse692 v_arrayElimCell_123)) 1) (= (select .cse691 (select .cse692 v_arrayElimCell_118)) 1) (= (select .cse691 (select (let ((.cse693 (store (store .cse694 .cse695 (store .cse696 v_arrayElimCell_120 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse693 (select (select .cse693 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_120)) 1))))) (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse695))))) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| |c_#StackHeapBarrier|))))) (.cse48 (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| Int) (v_arrayElimCell_121 Int) (v_arrayElimCell_119 Int)) (or (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|))) (forall ((v_ArrVal_2990 (Array Int Int))) (let ((.cse687 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2990))) (let ((.cse688 (select (select .cse687 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (forall ((v_arrayElimCell_122 Int) (v_ArrVal_2980 (Array Int Int))) (let ((.cse689 (select .cse687 .cse688))) (let ((.cse685 (let ((.cse690 (store (store .cse687 .cse688 (store .cse689 v_arrayElimCell_119 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse690 (select (select .cse690 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (.cse684 (store |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| 1))) (or (= (select .cse684 (select .cse685 v_arrayElimCell_122)) 1) (forall ((v_arrayElimCell_123 Int)) (or (= (select .cse684 (select .cse685 v_arrayElimCell_123)) 1) (= (select .cse684 (select (let ((.cse686 (store (store .cse687 .cse688 (store .cse689 v_arrayElimCell_121 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse686 (select (select .cse686 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_123)) 1))))))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse688)))))) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| |c_#StackHeapBarrier|))))) (.cse38 (and .cse623 (forall ((v_arrayElimCell_120 Int) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_119 Int)) (let ((.cse681 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2990))) (let ((.cse680 (select (select .cse681 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse680) (forall ((v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int))) (let ((.cse682 (select .cse681 .cse680)) (.cse683 (select v_ArrVal_2980 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (select .cse204 (select (select (store (store .cse681 .cse680 (store .cse682 v_arrayElimCell_119 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2980) .cse683) v_arrayElimCell_123)) 1) (= (select .cse204 (select (select (store (store .cse681 .cse680 (store .cse682 v_arrayElimCell_120 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2980) .cse683) v_arrayElimCell_120)) 1)))))))))) (.cse50 (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| Int) (v_arrayElimCell_120 Int) (v_arrayElimCell_121 Int) (v_arrayElimCell_119 Int) (v_arrayElimCell_118 Int)) (or (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|))) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| |c_#StackHeapBarrier|)) (forall ((v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int))) (let ((.cse677 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2990))) (let ((.cse674 (select (select .cse677 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse678 (select .cse677 .cse674))) (let ((.cse673 (let ((.cse679 (store (store .cse677 .cse674 (store .cse678 v_arrayElimCell_119 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse679 (select (select .cse679 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (.cse672 (store |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| 1)) (.cse675 (let ((.cse676 (store (store .cse677 .cse674 (store .cse678 v_arrayElimCell_121 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse676 (select (select .cse676 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse672 (select .cse673 v_arrayElimCell_123)) 1) (= (select .cse672 (select .cse673 v_arrayElimCell_118)) 1) (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse674) (= (select .cse672 (select .cse673 v_arrayElimCell_120)) 1) (= (select .cse672 (select .cse675 v_arrayElimCell_123)) 1) (= (select .cse672 (select .cse675 v_arrayElimCell_118)) 1)))))))))) (.cse121 (or .cse30 .cse95 .cse28 .cse29)) (.cse117 (forall ((v_arrayElimCell_120 Int) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_119 Int) (v_arrayElimCell_118 Int)) (let ((.cse668 (select v_ArrVal_2990 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (forall ((v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int))) (let ((.cse667 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2990))) (let ((.cse669 (select .cse667 .cse668))) (let ((.cse670 (let ((.cse671 (store (store .cse667 .cse668 (store .cse669 v_arrayElimCell_119 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse671 (select (select .cse671 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse21 (select (let ((.cse666 (store (store .cse667 .cse668 (store .cse669 v_arrayElimCell_120 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse666 (select (select .cse666 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_120)) 1) (= (select .cse21 (select .cse670 v_arrayElimCell_118)) 1) (= (select .cse21 (select .cse670 v_arrayElimCell_123)) 1)))))) (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse668))))) (.cse118 (forall ((v_arrayElimCell_120 Int) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_119 Int) (v_arrayElimCell_118 Int)) (let ((.cse660 (select v_ArrVal_2990 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse660) (forall ((v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int))) (let ((.cse663 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2990))) (let ((.cse664 (select .cse663 .cse660))) (let ((.cse661 (let ((.cse665 (store (store .cse663 .cse660 (store .cse664 v_arrayElimCell_120 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse665 (select (select .cse665 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse21 (select .cse661 v_arrayElimCell_118)) 1) (= (select .cse21 (select .cse661 v_arrayElimCell_120)) 1) (= (select .cse21 (select (let ((.cse662 (store (store .cse663 .cse660 (store .cse664 v_arrayElimCell_119 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse662 (select (select .cse662 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_123)) 1)))))))))) (.cse71 (forall ((v_arrayElimCell_120 Int) (v_arrayElimCell_121 Int) (v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_119 Int)) (let ((.cse657 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2990))) (let ((.cse655 (select (select .cse657 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse658 (select .cse657 .cse655)) (.cse659 (select v_ArrVal_2980 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse656 (select (store (store .cse657 .cse655 (store .cse658 v_arrayElimCell_119 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2980) .cse659))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse655) (= (select .cse204 (select .cse656 v_arrayElimCell_123)) 1) (= (select .cse204 (select .cse656 v_arrayElimCell_120)) 1) (= (select .cse204 (select (select (store (store .cse657 .cse655 (store .cse658 v_arrayElimCell_121 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2980) .cse659) v_arrayElimCell_123)) 1)))))))) (.cse72 (forall ((v_arrayElimCell_120 Int) (v_arrayElimCell_121 Int) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_119 Int)) (let ((.cse651 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2990))) (let ((.cse652 (select (select .cse651 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (forall ((v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int))) (let ((.cse653 (select .cse651 .cse652)) (.cse654 (select v_ArrVal_2980 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse649 (select (store (store .cse651 .cse652 (store .cse653 v_arrayElimCell_119 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2980) .cse654)) (.cse650 (select (store (store .cse651 .cse652 (store .cse653 v_arrayElimCell_121 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2980) .cse654))) (or (= (select .cse204 (select .cse649 v_arrayElimCell_123)) 1) (= (select .cse204 (select .cse649 v_arrayElimCell_120)) 1) (= (select .cse204 (select .cse650 v_arrayElimCell_123)) 1) (= (select .cse204 (select .cse650 v_arrayElimCell_120)) 1))))) (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse652)))))) (.cse39 (or .cse37 .cse73 (forall ((v_arrayElimCell_120 Int) (v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_119 Int)) (let ((.cse646 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2990))) (let ((.cse645 (select (select .cse646 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse647 (select .cse646 .cse645)) (.cse648 (select v_ArrVal_2980 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse645) (= (select .cse204 (select (select (store (store .cse646 .cse645 (store .cse647 v_arrayElimCell_119 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2980) .cse648) v_arrayElimCell_123)) 1) (= (select .cse204 (select (select (store (store .cse646 .cse645 (store .cse647 v_arrayElimCell_120 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2980) .cse648) v_arrayElimCell_123)) 1)))))))) (.cse40 (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| Int) (v_arrayElimCell_120 Int) (v_arrayElimCell_119 Int) (v_arrayElimCell_118 Int)) (or (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|) (forall ((v_ArrVal_2990 (Array Int Int))) (let ((.cse641 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2990))) (let ((.cse642 (select (select .cse641 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (forall ((v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int))) (let ((.cse643 (select .cse641 .cse642))) (let ((.cse639 (let ((.cse644 (store (store .cse641 .cse642 (store .cse643 v_arrayElimCell_119 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse644 (select (select .cse644 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (.cse638 (store |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| 1))) (or (= (select .cse638 (select .cse639 v_arrayElimCell_123)) 1) (= (select .cse638 (select .cse639 v_arrayElimCell_118)) 1) (= (select .cse638 (select .cse639 v_arrayElimCell_120)) 1) (= (select .cse638 (select (let ((.cse640 (store (store .cse641 .cse642 (store .cse643 v_arrayElimCell_120 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse640 (select (select .cse640 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_118)) 1))))) (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse642))))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|))) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| |c_#StackHeapBarrier|))))) (.cse54 (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| Int) (v_arrayElimCell_119 Int) (v_arrayElimCell_118 Int)) (or (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|))) (forall ((v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int))) (let ((.cse636 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2990))) (let ((.cse637 (select (select .cse636 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= (select (store |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| 1) (select (let ((.cse635 (store (store .cse636 .cse637 (store (select .cse636 .cse637) v_arrayElimCell_119 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse635 (select (select .cse635 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_118)) 1) (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse637))))) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| |c_#StackHeapBarrier|))))) (.cse55 (forall ((v_arrayElimCell_122 Int) (v_arrayElimCell_121 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_119 Int) (v_arrayElimCell_118 Int)) (let ((.cse631 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2990)) (.cse632 (select v_ArrVal_2990 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse633 (select .cse631 .cse632))) (let ((.cse629 (let ((.cse634 (store (store .cse631 .cse632 (store .cse633 v_arrayElimCell_121 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse634 (select (select .cse634 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse21 (select .cse629 v_arrayElimCell_118)) 1) (= (select .cse21 (select (let ((.cse630 (store (store .cse631 .cse632 (store .cse633 v_arrayElimCell_119 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse630 (select (select .cse630 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_122)) 1) (= (select .cse21 (select .cse629 v_arrayElimCell_122)) 1))))))) (.cse89 (and .cse623 (forall ((v_arrayElimCell_120 Int) (v_arrayElimCell_121 Int) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_119 Int)) (let ((.cse626 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2990))) (let ((.cse624 (select (select .cse626 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse624) (forall ((v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int))) (let ((.cse627 (select .cse626 .cse624)) (.cse628 (select v_ArrVal_2980 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse625 (select (store (store .cse626 .cse624 (store .cse627 v_arrayElimCell_119 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2980) .cse628))) (or (= (select .cse204 (select .cse625 v_arrayElimCell_123)) 1) (= (select .cse204 (select .cse625 v_arrayElimCell_120)) 1) (= (select .cse204 (select (select (store (store .cse626 .cse624 (store .cse627 v_arrayElimCell_121 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2980) .cse628) v_arrayElimCell_120)) 1))))))))))) (.cse120 (forall ((v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_119 Int)) (let ((.cse622 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2990))) (let ((.cse621 (select (select .cse622 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse621) (= (select .cse204 (select (select (store (store .cse622 .cse621 (store (select .cse622 .cse621) v_arrayElimCell_119 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2980) (select v_ArrVal_2980 |c_ULTIMATE.start_main_~#s~0#1.offset|)) v_arrayElimCell_123)) 1)))))) (.cse209 (or .cse30 .cse28 .cse31 .cse29)) (.cse98 (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| Int) (v_arrayElimCell_120 Int) (v_arrayElimCell_119 Int) (v_arrayElimCell_118 Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|))) (forall ((v_arrayElimCell_122 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int))) (let ((.cse617 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2990))) (let ((.cse618 (select (select .cse617 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse619 (select .cse617 .cse618))) (let ((.cse614 (let ((.cse620 (store (store .cse617 .cse618 (store .cse619 v_arrayElimCell_119 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse620 (select (select .cse620 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (.cse613 (store |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| 1)) (.cse615 (let ((.cse616 (store (store .cse617 .cse618 (store .cse619 v_arrayElimCell_120 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse616 (select (select .cse616 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse613 (select .cse614 v_arrayElimCell_118)) 1) (= (select .cse613 (select .cse614 v_arrayElimCell_122)) 1) (= (select .cse613 (select .cse615 v_arrayElimCell_122)) 1) (= (select .cse613 (select .cse615 v_arrayElimCell_118)) 1))))))) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| |c_#StackHeapBarrier|))))) (.cse75 (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| Int) (v_arrayElimCell_121 Int) (v_arrayElimCell_119 Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|))) (forall ((v_ArrVal_2990 (Array Int Int))) (let ((.cse609 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2990))) (let ((.cse610 (select (select .cse609 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (forall ((v_arrayElimCell_122 Int) (v_ArrVal_2980 (Array Int Int))) (let ((.cse607 (store |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| 1)) (.cse611 (select .cse609 .cse610))) (or (= (select .cse607 (select (let ((.cse608 (store (store .cse609 .cse610 (store .cse611 v_arrayElimCell_119 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse608 (select (select .cse608 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_122)) 1) (= (select .cse607 (select (let ((.cse612 (store (store .cse609 .cse610 (store .cse611 v_arrayElimCell_121 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse612 (select (select .cse612 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_122)) 1)))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse610)))))) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| |c_#StackHeapBarrier|))))) (.cse82 (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| Int) (v_arrayElimCell_119 Int)) (or (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|))) (forall ((v_arrayElimCell_122 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int))) (let ((.cse605 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2990))) (let ((.cse606 (select (select .cse605 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= (select (store |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| 1) (select (let ((.cse604 (store (store .cse605 .cse606 (store (select .cse605 .cse606) v_arrayElimCell_119 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse604 (select (select .cse604 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_122)) 1) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse606)))))) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| |c_#StackHeapBarrier|))))) (.cse105 (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| Int) (v_arrayElimCell_120 Int) (v_arrayElimCell_119 Int) (v_arrayElimCell_118 Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|))) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|) (forall ((v_ArrVal_2990 (Array Int Int))) (let ((.cse601 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2990))) (let ((.cse598 (select (select .cse601 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse598) (forall ((v_ArrVal_2980 (Array Int Int))) (let ((.cse599 (store |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| 1)) (.cse602 (select .cse601 .cse598))) (or (= (select .cse599 (select (let ((.cse600 (store (store .cse601 .cse598 (store .cse602 v_arrayElimCell_119 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse600 (select (select .cse600 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_118)) 1) (= (select .cse599 (select (let ((.cse603 (store (store .cse601 .cse598 (store .cse602 v_arrayElimCell_120 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse603 (select (select .cse603 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_118)) 1)))))))) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| |c_#StackHeapBarrier|))))) (.cse97 (forall ((v_arrayElimCell_120 Int) (v_arrayElimCell_122 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_119 Int) (v_arrayElimCell_118 Int)) (let ((.cse594 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2990)) (.cse595 (select v_ArrVal_2990 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse596 (select .cse594 .cse595))) (let ((.cse592 (let ((.cse597 (store (store .cse594 .cse595 (store .cse596 v_arrayElimCell_120 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse597 (select (select .cse597 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse21 (select .cse592 v_arrayElimCell_118)) 1) (= (select .cse21 (select (let ((.cse593 (store (store .cse594 .cse595 (store .cse596 v_arrayElimCell_119 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse593 (select (select .cse593 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_122)) 1) (= (select .cse21 (select .cse592 v_arrayElimCell_122)) 1))))))) (.cse106 (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| Int) (v_arrayElimCell_120 Int) (v_arrayElimCell_119 Int)) (or (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|))) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_2990 (Array Int Int))) (let ((.cse588 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2990))) (let ((.cse589 (select (select .cse588 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (forall ((v_arrayElimCell_122 Int) (v_ArrVal_2980 (Array Int Int))) (let ((.cse586 (store |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| 1)) (.cse590 (select .cse588 .cse589))) (or (forall ((v_arrayElimCell_123 Int)) (= (select .cse586 (select (let ((.cse587 (store (store .cse588 .cse589 (store .cse590 v_arrayElimCell_120 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse587 (select (select .cse587 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_123)) 1)) (= (select .cse586 (select (let ((.cse591 (store (store .cse588 .cse589 (store .cse590 v_arrayElimCell_119 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse591 (select (select .cse591 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_122)) 1)))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse589))))))))) (.cse110 (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| Int) (v_arrayElimCell_120 Int) (v_arrayElimCell_119 Int)) (or (forall ((v_ArrVal_2990 (Array Int Int))) (let ((.cse582 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2990))) (let ((.cse583 (select (select .cse582 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (forall ((v_arrayElimCell_122 Int) (v_ArrVal_2980 (Array Int Int))) (let ((.cse584 (select .cse582 .cse583))) (let ((.cse579 (let ((.cse585 (store (store .cse582 .cse583 (store .cse584 v_arrayElimCell_119 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse585 (select (select .cse585 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (.cse578 (store |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| 1)) (.cse580 (let ((.cse581 (store (store .cse582 .cse583 (store .cse584 v_arrayElimCell_120 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse581 (select (select .cse581 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (forall ((v_arrayElimCell_123 Int)) (or (= (select .cse578 (select .cse579 v_arrayElimCell_123)) 1) (= (select .cse578 (select .cse580 v_arrayElimCell_123)) 1))) (= (select .cse578 (select .cse579 v_arrayElimCell_122)) 1) (= (select .cse578 (select .cse580 v_arrayElimCell_122)) 1))))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse583)))))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|))) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| |c_#StackHeapBarrier|))))) (.cse112 (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| Int) (v_arrayElimCell_120 Int) (v_arrayElimCell_119 Int) (v_arrayElimCell_118 Int)) (or (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|))) (forall ((v_arrayElimCell_122 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int))) (let ((.cse574 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2990))) (let ((.cse575 (select (select .cse574 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse576 (select .cse574 .cse575))) (let ((.cse572 (let ((.cse577 (store (store .cse574 .cse575 (store .cse576 v_arrayElimCell_119 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse577 (select (select .cse577 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (.cse571 (store |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| 1))) (or (= (select .cse571 (select .cse572 v_arrayElimCell_118)) 1) (= (select .cse571 (select .cse572 v_arrayElimCell_122)) 1) (= (select .cse571 (select (let ((.cse573 (store (store .cse574 .cse575 (store .cse576 v_arrayElimCell_120 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse573 (select (select .cse573 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_122)) 1))))))) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| |c_#StackHeapBarrier|))))) (.cse93 (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| Int) (v_arrayElimCell_120 Int) (v_arrayElimCell_119 Int) (v_arrayElimCell_118 Int)) (or (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|))) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_2990 (Array Int Int))) (let ((.cse569 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2990))) (let ((.cse570 (select (select .cse569 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (forall ((v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int))) (let ((.cse566 (store |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| 1)) (.cse567 (let ((.cse568 (store (store .cse569 .cse570 (store (select .cse569 .cse570) v_arrayElimCell_119 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse568 (select (select .cse568 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse566 (select .cse567 v_arrayElimCell_123)) 1) (= (select .cse566 (select .cse567 v_arrayElimCell_118)) 1) (= (select .cse566 (select .cse567 v_arrayElimCell_120)) 1)))) (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse570)))))))) (.cse88 (forall ((v_arrayElimCell_120 Int) (v_arrayElimCell_121 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_119 Int) (v_arrayElimCell_118 Int)) (let ((.cse563 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2990)) (.cse560 (select v_ArrVal_2990 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse564 (select .cse563 .cse560))) (let ((.cse561 (let ((.cse565 (store (store .cse563 .cse560 (store .cse564 v_arrayElimCell_121 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse565 (select (select .cse565 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse560) (= (select .cse21 (select .cse561 v_arrayElimCell_118)) 1) (= (select .cse21 (select .cse561 v_arrayElimCell_120)) 1) (= (select .cse21 (select (let ((.cse562 (store (store .cse563 .cse560 (store .cse564 v_arrayElimCell_119 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse562 (select (select .cse562 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_120)) 1))))))) (.cse41 (forall ((v_arrayElimCell_120 Int) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_119 Int)) (let ((.cse557 (select v_ArrVal_2990 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (forall ((v_arrayElimCell_122 Int) (v_ArrVal_2980 (Array Int Int))) (let ((.cse556 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2990))) (let ((.cse558 (select .cse556 .cse557))) (let ((.cse554 (let ((.cse559 (store (store .cse556 .cse557 (store .cse558 v_arrayElimCell_120 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse559 (select (select .cse559 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (forall ((v_arrayElimCell_123 Int)) (= (select .cse21 (select .cse554 v_arrayElimCell_123)) 1)) (= (select .cse21 (select (let ((.cse555 (store (store .cse556 .cse557 (store .cse558 v_arrayElimCell_119 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse555 (select (select .cse555 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_122)) 1) (= (select .cse21 (select .cse554 v_arrayElimCell_122)) 1)))))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse557)))))) (.cse43 (forall ((v_arrayElimCell_120 Int) (v_arrayElimCell_122 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_119 Int)) (let ((.cse550 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2990)) (.cse551 (select v_ArrVal_2990 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse552 (select .cse550 .cse551))) (or (= (select .cse21 (select (let ((.cse549 (store (store .cse550 .cse551 (store .cse552 v_arrayElimCell_119 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse549 (select (select .cse549 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_122)) 1) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse551)) (= (select .cse21 (select (let ((.cse553 (store (store .cse550 .cse551 (store .cse552 v_arrayElimCell_120 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse553 (select (select .cse553 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_122)) 1)))))) (.cse44 (forall ((v_arrayElimCell_120 Int) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_119 Int)) (let ((.cse546 (select v_ArrVal_2990 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (forall ((v_arrayElimCell_122 Int) (v_ArrVal_2980 (Array Int Int))) (let ((.cse545 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2990))) (let ((.cse547 (select .cse545 .cse546))) (let ((.cse543 (let ((.cse548 (store (store .cse545 .cse546 (store .cse547 v_arrayElimCell_120 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse548 (select (select .cse548 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse21 (select .cse543 v_arrayElimCell_122)) 1) (forall ((v_arrayElimCell_123 Int)) (or (= (select .cse21 (select .cse543 v_arrayElimCell_123)) 1) (= (select .cse21 (select (let ((.cse544 (store (store .cse545 .cse546 (store .cse547 v_arrayElimCell_119 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse544 (select (select .cse544 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_123)) 1)))))))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse546)))))) (.cse153 (or .cse30 .cse42)) (.cse45 (forall ((v_arrayElimCell_120 Int) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_119 Int)) (let ((.cse540 (select v_ArrVal_2990 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (forall ((v_arrayElimCell_122 Int) (v_ArrVal_2980 (Array Int Int))) (let ((.cse539 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2990))) (let ((.cse541 (select .cse539 .cse540))) (let ((.cse537 (let ((.cse542 (store (store .cse539 .cse540 (store .cse541 v_arrayElimCell_120 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse542 (select (select .cse542 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (.cse536 (let ((.cse538 (store (store .cse539 .cse540 (store .cse541 v_arrayElimCell_119 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse538 (select (select .cse538 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse21 (select .cse536 v_arrayElimCell_122)) 1) (= (select .cse21 (select .cse537 v_arrayElimCell_122)) 1) (forall ((v_arrayElimCell_123 Int)) (or (= (select .cse21 (select .cse537 v_arrayElimCell_123)) 1) (= (select .cse21 (select .cse536 v_arrayElimCell_123)) 1)))))))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse540)))))) (.cse46 (forall ((v_arrayElimCell_120 Int) (v_ArrVal_2990 (Array Int Int))) (let ((.cse535 (select v_ArrVal_2990 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (forall ((v_arrayElimCell_122 Int) (v_ArrVal_2980 (Array Int Int))) (let ((.cse532 (let ((.cse533 (store (let ((.cse534 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2990))) (store .cse534 .cse535 (store (select .cse534 .cse535) v_arrayElimCell_120 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|))) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse533 (select (select .cse533 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (forall ((v_arrayElimCell_123 Int)) (= (select .cse21 (select .cse532 v_arrayElimCell_123)) 1)) (= (select .cse21 (select .cse532 v_arrayElimCell_122)) 1)))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse535)))))) (.cse115 (forall ((v_arrayElimCell_120 Int) (v_ArrVal_2990 (Array Int Int))) (let ((.cse531 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2990))) (let ((.cse529 (select (select .cse531 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse529) (forall ((v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int))) (let ((.cse530 (select (store (store .cse531 .cse529 (store (select .cse531 .cse529) v_arrayElimCell_120 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2980) (select v_ArrVal_2980 |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (or (= (select .cse204 (select .cse530 v_arrayElimCell_123)) 1) (= (select .cse204 (select .cse530 v_arrayElimCell_120)) 1))))))))) (.cse211 (or .cse30 .cse28 .cse59 .cse29)) (.cse234 (or .cse30 .cse28 .cse29 .cse83)) (.cse128 (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| Int) (v_arrayElimCell_118 Int)) (or (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|))) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| |c_#StackHeapBarrier|)) (forall ((v_arrayElimCell_122 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int))) (let ((.cse524 (store |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| 1)) (.cse525 (let ((.cse526 (store (let ((.cse527 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2990))) (let ((.cse528 (select (select .cse527 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (store .cse527 .cse528 (store (select .cse527 .cse528) v_arrayElimCell_118 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse526 (select (select .cse526 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse524 (select .cse525 v_arrayElimCell_118)) 1) (= (select .cse524 (select .cse525 v_arrayElimCell_122)) 1))))))) (.cse64 (forall ((v_arrayElimCell_120 Int) (v_arrayElimCell_121 Int) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_118 Int)) (let ((.cse520 (select v_ArrVal_2990 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse520) (forall ((v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int))) (let ((.cse521 (let ((.cse522 (store (let ((.cse523 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2990))) (store .cse523 .cse520 (store (select .cse523 .cse520) v_arrayElimCell_121 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|))) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse522 (select (select .cse522 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse21 (select .cse521 v_arrayElimCell_118)) 1) (= (select .cse21 (select .cse521 v_arrayElimCell_120)) 1) (= (select .cse21 (select .cse521 v_arrayElimCell_123)) 1)))))))) (.cse212 (or (forall ((v_arrayElimCell_120 Int) (v_arrayElimCell_121 Int) (v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int))) (let ((.cse516 (select v_ArrVal_2990 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse517 (let ((.cse518 (store (let ((.cse519 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2990))) (store .cse519 .cse516 (store (select .cse519 .cse516) v_arrayElimCell_121 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|))) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse518 (select (select .cse518 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse516) (= (select .cse21 (select .cse517 v_arrayElimCell_120)) 1) (= (select .cse21 (select .cse517 v_arrayElimCell_123)) 1))))) .cse180)) (.cse219 (or .cse180 (forall ((v_arrayElimCell_121 Int) (v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int))) (let ((.cse513 (select v_ArrVal_2990 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse513) (= (select .cse21 (select (let ((.cse514 (store (let ((.cse515 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2990))) (store .cse515 .cse513 (store (select .cse515 .cse513) v_arrayElimCell_121 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|))) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse514 (select (select .cse514 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_123)) 1)))))) (.cse235 (or .cse51 .cse30 .cse28 .cse29)) (.cse201 (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| Int) (v_arrayElimCell_120 Int) (v_arrayElimCell_118 Int)) (or (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|))) (forall ((v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int))) (let ((.cse512 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2990))) (let ((.cse508 (select (select .cse512 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse509 (store |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| 1)) (.cse510 (let ((.cse511 (store (store .cse512 .cse508 (store (select .cse512 .cse508) v_arrayElimCell_118 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse511 (select (select .cse511 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse508) (= (select .cse509 (select .cse510 v_arrayElimCell_120)) 1) (= (select .cse509 (select .cse510 v_arrayElimCell_118)) 1)))))) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| |c_#StackHeapBarrier|))))) (.cse226 (or .cse30 .cse78)) (.cse81 (forall ((v_arrayElimCell_121 Int) (v_ArrVal_2990 (Array Int Int))) (let ((.cse507 (select v_ArrVal_2990 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (forall ((v_arrayElimCell_122 Int) (v_ArrVal_2980 (Array Int Int))) (let ((.cse504 (let ((.cse505 (store (let ((.cse506 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2990))) (store .cse506 .cse507 (store (select .cse506 .cse507) v_arrayElimCell_121 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|))) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse505 (select (select .cse505 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (forall ((v_arrayElimCell_123 Int)) (= (select .cse21 (select .cse504 v_arrayElimCell_123)) 1)) (= (select .cse21 (select .cse504 v_arrayElimCell_122)) 1)))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse507)))))) (.cse202 (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| Int) (v_arrayElimCell_120 Int) (v_arrayElimCell_118 Int)) (or (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|))) (forall ((v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int))) (let ((.cse503 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2990))) (let ((.cse501 (select (select .cse503 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse499 (store |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| 1)) (.cse500 (let ((.cse502 (store (store .cse503 .cse501 (store (select .cse503 .cse501) v_arrayElimCell_118 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse502 (select (select .cse502 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse499 (select .cse500 v_arrayElimCell_123)) 1) (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse501) (= (select .cse499 (select .cse500 v_arrayElimCell_120)) 1) (= (select .cse499 (select .cse500 v_arrayElimCell_118)) 1)))))) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| |c_#StackHeapBarrier|))))) (.cse237 (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| Int) (v_arrayElimCell_118 Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|))) (forall ((v_ArrVal_2990 (Array Int Int))) (let ((.cse497 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2990))) (let ((.cse498 (select (select .cse497 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (forall ((v_ArrVal_2980 (Array Int Int))) (= (select (store |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| 1) (select (let ((.cse496 (store (store .cse497 .cse498 (store (select .cse497 .cse498) v_arrayElimCell_118 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse496 (select (select .cse496 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_118)) 1)) (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse498))))) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| |c_#StackHeapBarrier|))))) (.cse236 (or .cse30 .cse28 .cse78 .cse29)) (.cse84 (forall ((v_arrayElimCell_121 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int))) (let ((.cse494 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2990))) (let ((.cse495 (select (select .cse494 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (forall ((v_arrayElimCell_123 Int)) (= (select .cse204 (select (select (store (store .cse494 .cse495 (store (select .cse494 .cse495) v_arrayElimCell_121 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2980) (select v_ArrVal_2980 |c_ULTIMATE.start_main_~#s~0#1.offset|)) v_arrayElimCell_123)) 1)) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse495))))))) (.cse227 (or (forall ((v_arrayElimCell_121 Int) (v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int))) (= (select .cse204 (select (select (store (let ((.cse492 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2990))) (let ((.cse493 (select (select .cse492 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (store .cse492 .cse493 (store (select .cse492 .cse493) v_arrayElimCell_121 |c_ULTIMATE.start_main_~#s~0#1.base|)))) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2980) (select v_ArrVal_2980 |c_ULTIMATE.start_main_~#s~0#1.offset|)) v_arrayElimCell_123)) 1)) .cse486)) (.cse94 (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse393 (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| Int) (v_arrayElimCell_118 Int)) (or (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|))) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|) (forall ((v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int))) (let ((.cse491 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2990))) (let ((.cse489 (select (select .cse491 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse489) (= (select (store |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| 1) (select (let ((.cse490 (store (store .cse491 .cse489 (store (select .cse491 .cse489) v_arrayElimCell_118 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse490 (select (select .cse490 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_118)) 1))))) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| |c_#StackHeapBarrier|))))) (.cse210 (or .cse486 (forall ((v_arrayElimCell_120 Int) (v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int))) (= (select .cse204 (select (select (store (let ((.cse487 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2990))) (let ((.cse488 (select (select .cse487 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (store .cse487 .cse488 (store (select .cse487 .cse488) v_arrayElimCell_120 |c_ULTIMATE.start_main_~#s~0#1.base|)))) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2980) (select v_ArrVal_2980 |c_ULTIMATE.start_main_~#s~0#1.offset|)) v_arrayElimCell_123)) 1)))) (.cse104 (forall ((v_arrayElimCell_120 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int))) (let ((.cse484 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2990))) (let ((.cse485 (select (select .cse484 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (forall ((v_arrayElimCell_123 Int)) (= (select .cse204 (select (select (store (store .cse484 .cse485 (store (select .cse484 .cse485) v_arrayElimCell_120 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2980) (select v_ArrVal_2980 |c_ULTIMATE.start_main_~#s~0#1.offset|)) v_arrayElimCell_123)) 1)) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse485))))))) (.cse387 (forall ((v_arrayElimCell_120 Int) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_118 Int)) (let ((.cse483 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2990))) (let ((.cse481 (select (select .cse483 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse481) (forall ((v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int))) (let ((.cse482 (select (store (store .cse483 .cse481 (store (select .cse483 .cse481) v_arrayElimCell_118 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2980) (select v_ArrVal_2980 |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (or (= (select .cse204 (select .cse482 v_arrayElimCell_120)) 1) (= (select .cse204 (select .cse482 v_arrayElimCell_123)) 1))))))))) (.cse416 (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| Int) (v_arrayElimCell_120 Int) (v_arrayElimCell_118 Int)) (or (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|))) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_2990 (Array Int Int))) (let ((.cse479 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2990))) (let ((.cse480 (select (select .cse479 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (forall ((v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int))) (let ((.cse476 (store |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| 1)) (.cse477 (let ((.cse478 (store (store .cse479 .cse480 (store (select .cse479 .cse480) v_arrayElimCell_118 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse478 (select (select .cse478 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse476 (select .cse477 v_arrayElimCell_123)) 1) (= (select .cse476 (select .cse477 v_arrayElimCell_120)) 1) (= (select .cse476 (select .cse477 v_arrayElimCell_118)) 1)))) (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse480)))))))) (.cse417 (or (forall ((v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_118 Int)) (let ((.cse475 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2990))) (let ((.cse474 (select (select .cse475 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse474) (= (select .cse204 (select (select (store (store .cse475 .cse474 (store (select .cse475 .cse474) v_arrayElimCell_118 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2980) (select v_ArrVal_2980 |c_ULTIMATE.start_main_~#s~0#1.offset|)) v_arrayElimCell_123)) 1))))) .cse228 .cse37 .cse73)) (.cse435 (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| Int) (v_arrayElimCell_118 Int)) (or (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|))) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| |c_#StackHeapBarrier|)) (forall ((v_arrayElimCell_122 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int))) (let ((.cse472 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2990))) (let ((.cse473 (select (select .cse472 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= (select (store |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| 1) (select (let ((.cse471 (store (store .cse472 .cse473 (store (select .cse472 .cse473) v_arrayElimCell_118 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse471 (select (select .cse471 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_122)) 1) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse473)))))))))) (and (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| Int) (v_arrayElimCell_120 Int) (v_arrayElimCell_118 Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|))) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_2990 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2990))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (forall ((v_arrayElimCell_122 Int) (v_ArrVal_2980 (Array Int Int))) (let ((.cse0 (store |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| 1)) (.cse4 (select .cse2 .cse3))) (or (= (select .cse0 (select (let ((.cse1 (store (store .cse2 .cse3 (store .cse4 v_arrayElimCell_120 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_122)) 1) (= (select .cse0 (select (let ((.cse5 (store (store .cse2 .cse3 (store .cse4 v_arrayElimCell_118 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_122)) 1)))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse3)))))))) (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| Int) (v_arrayElimCell_120 Int) (v_arrayElimCell_118 Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|))) (forall ((v_ArrVal_2990 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2990))) (let ((.cse9 (select (select .cse8 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (forall ((v_ArrVal_2980 (Array Int Int))) (let ((.cse6 (store |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| 1)) (.cse10 (select .cse8 .cse9))) (or (= (select .cse6 (select (let ((.cse7 (store (store .cse8 .cse9 (store .cse10 v_arrayElimCell_120 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse7 (select (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_120)) 1) (= (select .cse6 (select (let ((.cse11 (store (store .cse8 .cse9 (store .cse10 v_arrayElimCell_118 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse11 (select (select .cse11 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_118)) 1)))) (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse9))))) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| Int) (v_arrayElimCell_120 Int) (v_arrayElimCell_118 Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|))) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| |c_#StackHeapBarrier|)) (forall ((v_arrayElimCell_122 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int))) (let ((.cse14 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2990))) (let ((.cse15 (select (select .cse14 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse12 (store |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| 1)) (.cse16 (select .cse14 .cse15))) (or (= (select .cse12 (select (let ((.cse13 (store (store .cse14 .cse15 (store .cse16 v_arrayElimCell_120 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse13 (select (select .cse13 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_122)) 1) (= (select .cse12 (select (let ((.cse17 (store (store .cse14 .cse15 (store .cse16 v_arrayElimCell_118 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse17 (select (select .cse17 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_122)) 1) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse15))))))))) (or (and .cse18 .cse19 (forall ((v_arrayElimCell_120 Int) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_118 Int)) (let ((.cse20 (select v_ArrVal_2990 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse20) (forall ((v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int))) (let ((.cse24 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2990))) (let ((.cse25 (select .cse24 .cse20))) (let ((.cse22 (let ((.cse26 (store (store .cse24 .cse20 (store .cse25 v_arrayElimCell_120 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse26 (select (select .cse26 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse21 (select .cse22 v_arrayElimCell_123)) 1) (= (select .cse21 (select .cse22 v_arrayElimCell_120)) 1) (= (select .cse21 (select (let ((.cse23 (store (store .cse24 .cse20 (store .cse25 v_arrayElimCell_118 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse23 (select (select .cse23 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_118)) 1))))))))) .cse27) .cse28 .cse29) (or .cse30 (let ((.cse36 (<= |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse35 (or .cse36 .cse37 .cse120)) (.cse32 (<= |c_#StackHeapBarrier| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|))) (and (or .cse31 .cse29 .cse32) .cse33 .cse34 .cse35 (or .cse36 .cse37 .cse38) .cse39 .cse40 (or .cse28 .cse29 (and .cse41 .cse42 .cse43 .cse44 .cse45 .cse46)) (or (and .cse47 .cse48 .cse49 .cse50 .cse35 (or .cse51 .cse29 .cse32) .cse52 .cse53 .cse54 (or .cse55 .cse29 .cse32) .cse56 .cse57 .cse58 (or .cse59 .cse29 .cse32) .cse60 .cse61 .cse62 .cse63 (or .cse28 .cse29 (and .cse64 .cse65 .cse66 .cse67)) .cse68 (or .cse28 (and .cse69 .cse70) .cse29) (or .cse37 (and .cse71 .cse72) .cse73) .cse74 .cse75 (or .cse28 (and .cse76 .cse77 .cse78 .cse79 .cse80 .cse81) .cse29) .cse82 (or .cse78 .cse29 .cse32) (or .cse29 .cse83 .cse32) (or .cse37 (and .cse84 .cse85) .cse73) .cse86 .cse87 (or .cse88 .cse29 .cse32) (or .cse36 .cse37 .cse89) .cse90 .cse91 .cse92 .cse93) .cse94) .cse54 (or .cse95 .cse29 .cse32) .cse96 (or .cse97 .cse29 .cse32) .cse62 .cse98 .cse99 .cse100 .cse82 (or .cse42 .cse29 .cse32) .cse101 .cse102 (or .cse37 (and .cse103 .cse104) .cse73) .cse105 .cse106 (or (and .cse18 .cse107) .cse28 .cse29) .cse108 .cse91 .cse109 .cse110 .cse111 .cse112 .cse113 .cse93 .cse114 (or .cse37 (and .cse115 .cse116) .cse73) (or .cse28 .cse29 (and .cse117 .cse118)) (or .cse29 .cse119 .cse32))))) .cse121 (or (forall ((v_arrayElimCell_120 Int) (v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_118 Int)) (let ((.cse125 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2990)) (.cse123 (select v_ArrVal_2990 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse126 (select .cse125 .cse123))) (let ((.cse122 (let ((.cse127 (store (store .cse125 .cse123 (store .cse126 v_arrayElimCell_120 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse127 (select (select .cse127 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse21 (select .cse122 v_arrayElimCell_118)) 1) (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse123) (= (select .cse21 (select (let ((.cse124 (store (store .cse125 .cse123 (store .cse126 v_arrayElimCell_118 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse124 (select (select .cse124 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_123)) 1) (= (select .cse21 (select .cse122 v_arrayElimCell_120)) 1)))))) .cse28 .cse29) .cse128 (or .cse28 .cse29 (and (forall ((v_arrayElimCell_120 Int) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_118 Int)) (let ((.cse132 (select v_ArrVal_2990 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (forall ((v_arrayElimCell_122 Int) (v_ArrVal_2980 (Array Int Int))) (let ((.cse131 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2990))) (let ((.cse133 (select .cse131 .cse132))) (let ((.cse129 (let ((.cse134 (store (store .cse131 .cse132 (store .cse133 v_arrayElimCell_120 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse134 (select (select .cse134 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (forall ((v_arrayElimCell_123 Int)) (or (= (select .cse21 (select .cse129 v_arrayElimCell_123)) 1) (= (select .cse21 (select (let ((.cse130 (store (store .cse131 .cse132 (store .cse133 v_arrayElimCell_118 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse130 (select (select .cse130 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_123)) 1))) (= (select .cse21 (select .cse129 v_arrayElimCell_122)) 1)))))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse132))))) (forall ((v_arrayElimCell_120 Int) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_118 Int)) (let ((.cse137 (select v_ArrVal_2990 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (forall ((v_arrayElimCell_122 Int) (v_ArrVal_2980 (Array Int Int))) (let ((.cse136 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2990))) (let ((.cse138 (select .cse136 .cse137))) (let ((.cse139 (let ((.cse140 (store (store .cse136 .cse137 (store .cse138 v_arrayElimCell_120 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse140 (select (select .cse140 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse21 (select (let ((.cse135 (store (store .cse136 .cse137 (store .cse138 v_arrayElimCell_118 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse135 (select (select .cse135 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_122)) 1) (forall ((v_arrayElimCell_123 Int)) (= (select .cse21 (select .cse139 v_arrayElimCell_123)) 1)) (= (select .cse21 (select .cse139 v_arrayElimCell_122)) 1)))))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse137))))) (or .cse30 (forall ((v_arrayElimCell_120 Int) (v_arrayElimCell_122 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_118 Int)) (let ((.cse142 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2990)) (.cse143 (select v_ArrVal_2990 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse144 (select .cse142 .cse143))) (or (= (select .cse21 (select (let ((.cse141 (store (store .cse142 .cse143 (store .cse144 v_arrayElimCell_118 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse141 (select (select .cse141 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_122)) 1) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse143)) (= (select .cse21 (select (let ((.cse145 (store (store .cse142 .cse143 (store .cse144 v_arrayElimCell_120 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse145 (select (select .cse145 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_122)) 1)))))) (forall ((v_arrayElimCell_120 Int) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_118 Int)) (let ((.cse150 (select v_ArrVal_2990 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (forall ((v_arrayElimCell_122 Int) (v_ArrVal_2980 (Array Int Int))) (let ((.cse149 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2990))) (let ((.cse151 (select .cse149 .cse150))) (let ((.cse146 (let ((.cse152 (store (store .cse149 .cse150 (store .cse151 v_arrayElimCell_118 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse152 (select (select .cse152 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (.cse147 (let ((.cse148 (store (store .cse149 .cse150 (store .cse151 v_arrayElimCell_120 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse148 (select (select .cse148 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse21 (select .cse146 v_arrayElimCell_122)) 1) (forall ((v_arrayElimCell_123 Int)) (or (= (select .cse21 (select .cse147 v_arrayElimCell_123)) 1) (= (select .cse21 (select .cse146 v_arrayElimCell_123)) 1))) (= (select .cse21 (select .cse147 v_arrayElimCell_122)) 1)))))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse150))))) .cse153 .cse46)) (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| Int) (v_arrayElimCell_120 Int) (v_arrayElimCell_118 Int)) (or (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|))) (forall ((v_ArrVal_2990 (Array Int Int))) (let ((.cse157 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2990))) (let ((.cse158 (select (select .cse157 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (forall ((v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int))) (let ((.cse159 (select .cse157 .cse158))) (let ((.cse154 (store |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| 1)) (.cse155 (let ((.cse160 (store (store .cse157 .cse158 (store .cse159 v_arrayElimCell_118 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse160 (select (select .cse160 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse154 (select .cse155 v_arrayElimCell_123)) 1) (= (select .cse154 (select (let ((.cse156 (store (store .cse157 .cse158 (store .cse159 v_arrayElimCell_120 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse156 (select (select .cse156 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_120)) 1) (= (select .cse154 (select .cse155 v_arrayElimCell_118)) 1))))) (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse158))))) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| Int) (v_arrayElimCell_120 Int) (v_arrayElimCell_118 Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|))) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_2990 (Array Int Int))) (let ((.cse164 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2990))) (let ((.cse165 (select (select .cse164 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (forall ((v_arrayElimCell_122 Int) (v_ArrVal_2980 (Array Int Int))) (let ((.cse166 (select .cse164 .cse165))) (let ((.cse162 (let ((.cse167 (store (store .cse164 .cse165 (store .cse166 v_arrayElimCell_120 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse167 (select (select .cse167 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (.cse161 (store |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| 1))) (or (forall ((v_arrayElimCell_123 Int)) (= (select .cse161 (select .cse162 v_arrayElimCell_123)) 1)) (= (select .cse161 (select .cse162 v_arrayElimCell_122)) 1) (= (select .cse161 (select (let ((.cse163 (store (store .cse164 .cse165 (store .cse166 v_arrayElimCell_118 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse163 (select (select .cse163 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_122)) 1))))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse165)))))))) (or .cse30 .cse28 (forall ((v_arrayElimCell_120 Int) (v_arrayElimCell_122 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_118 Int)) (let ((.cse170 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2990)) (.cse171 (select v_ArrVal_2990 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse172 (select .cse170 .cse171))) (let ((.cse168 (let ((.cse173 (store (store .cse170 .cse171 (store .cse172 v_arrayElimCell_120 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse173 (select (select .cse173 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse21 (select .cse168 v_arrayElimCell_118)) 1) (= (select .cse21 (select (let ((.cse169 (store (store .cse170 .cse171 (store .cse172 v_arrayElimCell_118 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse169 (select (select .cse169 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_122)) 1) (= (select .cse21 (select .cse168 v_arrayElimCell_122)) 1)))))) .cse29) .cse174 (or (and (or (forall ((v_arrayElimCell_120 Int) (v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_118 Int)) (let ((.cse177 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2990)) (.cse175 (select v_ArrVal_2990 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse178 (select .cse177 .cse175))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse175) (= (select .cse21 (select (let ((.cse176 (store (store .cse177 .cse175 (store .cse178 v_arrayElimCell_118 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse176 (select (select .cse176 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_123)) 1) (= (select .cse21 (select (let ((.cse179 (store (store .cse177 .cse175 (store .cse178 v_arrayElimCell_120 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse179 (select (select .cse179 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_120)) 1))))) .cse180) (forall ((v_arrayElimCell_120 Int) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_118 Int)) (let ((.cse181 (select v_ArrVal_2990 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse181) (forall ((v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int))) (let ((.cse184 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2990))) (let ((.cse185 (select .cse184 .cse181))) (let ((.cse182 (let ((.cse186 (store (store .cse184 .cse181 (store .cse185 v_arrayElimCell_118 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse186 (select (select .cse186 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse21 (select .cse182 v_arrayElimCell_123)) 1) (= (select .cse21 (select (let ((.cse183 (store (store .cse184 .cse181 (store .cse185 v_arrayElimCell_120 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse183 (select (select .cse183 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_120)) 1) (= (select .cse21 (select .cse182 v_arrayElimCell_118)) 1))))))))) (forall ((v_arrayElimCell_120 Int) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_118 Int)) (let ((.cse187 (select v_ArrVal_2990 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse187) (forall ((v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int))) (let ((.cse190 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2990))) (let ((.cse191 (select .cse190 .cse187))) (let ((.cse188 (let ((.cse192 (store (store .cse190 .cse187 (store .cse191 v_arrayElimCell_120 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse192 (select (select .cse192 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse21 (select .cse188 v_arrayElimCell_118)) 1) (= (select .cse21 (select (let ((.cse189 (store (store .cse190 .cse187 (store .cse191 v_arrayElimCell_118 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse189 (select (select .cse189 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_123)) 1) (= (select .cse21 (select .cse188 v_arrayElimCell_120)) 1)))))))))) .cse28 .cse29) (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| Int) (v_arrayElimCell_120 Int) (v_arrayElimCell_118 Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|))) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| |c_#StackHeapBarrier|)) (forall ((v_arrayElimCell_122 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int))) (let ((.cse197 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2990))) (let ((.cse198 (select (select .cse197 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse199 (select .cse197 .cse198))) (let ((.cse194 (let ((.cse200 (store (store .cse197 .cse198 (store .cse199 v_arrayElimCell_120 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse200 (select (select .cse200 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (.cse193 (store |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| 1)) (.cse195 (let ((.cse196 (store (store .cse197 .cse198 (store .cse199 v_arrayElimCell_118 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse196 (select (select .cse196 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse193 (select .cse194 v_arrayElimCell_122)) 1) (= (select .cse193 (select .cse194 v_arrayElimCell_118)) 1) (= (select .cse193 (select .cse195 v_arrayElimCell_118)) 1) (= (select .cse193 (select .cse195 v_arrayElimCell_122)) 1))))))))) .cse201 .cse202 (or .cse37 (forall ((v_arrayElimCell_120 Int) (v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_118 Int)) (let ((.cse205 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2990))) (let ((.cse203 (select (select .cse205 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse206 (select .cse205 .cse203)) (.cse207 (select v_ArrVal_2980 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse203) (= (select .cse204 (select (select (store (store .cse205 .cse203 (store .cse206 v_arrayElimCell_118 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2980) .cse207) v_arrayElimCell_123)) 1) (= (select .cse204 (select (select (store (store .cse205 .cse203 (store .cse206 v_arrayElimCell_120 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2980) .cse207) v_arrayElimCell_123)) 1)))))) .cse73) .cse208 .cse209 (or .cse94 (and .cse47 .cse49 (or .cse37 .cse73 (and .cse103 .cse210 .cse104)) .cse211 (or .cse28 .cse29 (and .cse64 .cse212 (or (forall ((v_arrayElimCell_120 Int) (v_arrayElimCell_121 Int) (v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_119 Int)) (let ((.cse216 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2990)) (.cse213 (select v_ArrVal_2990 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse217 (select .cse216 .cse213))) (let ((.cse214 (let ((.cse218 (store (store .cse216 .cse213 (store .cse217 v_arrayElimCell_121 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse218 (select (select .cse218 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse213) (= (select .cse21 (select .cse214 v_arrayElimCell_120)) 1) (= (select .cse21 (select (let ((.cse215 (store (store .cse216 .cse213 (store .cse217 v_arrayElimCell_119 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse215 (select (select .cse215 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_120)) 1) (= (select .cse21 (select .cse214 v_arrayElimCell_123)) 1)))))) .cse180) .cse65 .cse66 .cse67 .cse219)) .cse33 (or (and .cse18 .cse19 .cse27 .cse107) .cse28 .cse29) .cse34 .cse52 .cse53 .cse174 .cse56 .cse57 .cse58 .cse60 .cse96 .cse61 .cse63 .cse62 .cse68 .cse208 .cse74 .cse99 .cse100 (or .cse28 (and .cse69 .cse70 (or (forall ((v_arrayElimCell_120 Int) (v_arrayElimCell_121 Int) (v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_119 Int)) (let ((.cse223 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2990)) (.cse220 (select v_ArrVal_2990 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse224 (select .cse223 .cse220))) (let ((.cse221 (let ((.cse225 (store (store .cse223 .cse220 (store .cse224 v_arrayElimCell_121 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse225 (select (select .cse225 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse220) (= (select .cse21 (select .cse221 v_arrayElimCell_120)) 1) (= (select .cse21 (select .cse221 v_arrayElimCell_123)) 1) (= (select .cse21 (select (let ((.cse222 (store (store .cse223 .cse220 (store .cse224 v_arrayElimCell_119 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse222 (select (select .cse222 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_123)) 1)))))) .cse180)) .cse29) .cse101 .cse102 (or .cse28 .cse29 (and (or .cse30 .cse77) .cse76 .cse226 .cse79 .cse80 .cse81)) .cse86 .cse87 (or .cse37 .cse73 (and .cse84 .cse227 .cse85)) .cse90 .cse108 .cse91 (or .cse37 (and .cse115 (or .cse228 .cse116)) .cse73) .cse109 .cse92 .cse111 .cse113 .cse114 .cse48 (or .cse228 .cse37 .cse38 .cse73) .cse50 .cse121 (or .cse28 .cse29 (and (or (forall ((v_arrayElimCell_120 Int) (v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_119 Int)) (let ((.cse231 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2990)) (.cse229 (select v_ArrVal_2990 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse232 (select .cse231 .cse229))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse229) (= (select .cse21 (select (let ((.cse230 (store (store .cse231 .cse229 (store .cse232 v_arrayElimCell_120 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse230 (select (select .cse230 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_120)) 1) (= (select .cse21 (select (let ((.cse233 (store (store .cse231 .cse229 (store .cse232 v_arrayElimCell_119 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse233 (select (select .cse233 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_123)) 1))))) .cse180) .cse117 .cse118)) .cse234 (or (and (or .cse228 .cse71) .cse72) .cse37 .cse73) .cse39 .cse40 .cse54 (or .cse55 .cse30 .cse28 .cse29) (or .cse228 .cse37 .cse73 .cse89) (or .cse228 .cse37 .cse73 .cse120) .cse235 .cse209 .cse98 .cse75 .cse82 .cse105 (or .cse97 .cse30 .cse28 .cse29) .cse106 .cse236 .cse110 .cse112 .cse93 (or .cse88 .cse30 .cse28 .cse29) (or .cse28 .cse29 (and .cse41 (or .cse30 .cse43) .cse44 .cse153 .cse45 .cse46)))) .cse237 (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| Int) (v_arrayElimCell_120 Int) (v_arrayElimCell_118 Int)) (or (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|))) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| |c_#StackHeapBarrier|)) (forall ((v_arrayElimCell_122 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int))) (let ((.cse240 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2990))) (let ((.cse241 (select (select .cse240 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse242 (select .cse240 .cse241))) (let ((.cse238 (store |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| 1)) (.cse243 (let ((.cse244 (store (store .cse240 .cse241 (store .cse242 v_arrayElimCell_118 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse244 (select (select .cse244 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse238 (select (let ((.cse239 (store (store .cse240 .cse241 (store .cse242 v_arrayElimCell_120 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse239 (select (select .cse239 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_122)) 1) (= (select .cse238 (select .cse243 v_arrayElimCell_118)) 1) (= (select .cse238 (select .cse243 v_arrayElimCell_122)) 1))))))))) (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| Int) (v_arrayElimCell_120 Int) (v_arrayElimCell_118 Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|))) (forall ((v_ArrVal_2990 (Array Int Int))) (let ((.cse248 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2990))) (let ((.cse249 (select (select .cse248 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (forall ((v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int))) (let ((.cse250 (select .cse248 .cse249))) (let ((.cse245 (store |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| 1)) (.cse246 (let ((.cse251 (store (store .cse248 .cse249 (store .cse250 v_arrayElimCell_118 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse251 (select (select .cse251 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse245 (select .cse246 v_arrayElimCell_123)) 1) (= (select .cse245 (select (let ((.cse247 (store (store .cse248 .cse249 (store .cse250 v_arrayElimCell_120 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse247 (select (select .cse247 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_120)) 1) (= (select .cse245 (select .cse246 v_arrayElimCell_118)) 1))))) (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse249))))) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| |c_#StackHeapBarrier|)))) (or .cse37 .cse73 (and (or (forall ((v_arrayElimCell_120 Int) (v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_118 Int)) (let ((.cse254 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2990))) (let ((.cse252 (select (select .cse254 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse255 (select .cse254 .cse252)) (.cse256 (select v_ArrVal_2980 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse253 (select (store (store .cse254 .cse252 (store .cse255 v_arrayElimCell_118 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2980) .cse256))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse252) (= (select .cse204 (select .cse253 v_arrayElimCell_120)) 1) (= (select .cse204 (select .cse253 v_arrayElimCell_123)) 1) (= (select .cse204 (select (select (store (store .cse254 .cse252 (store .cse255 v_arrayElimCell_120 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2980) .cse256) v_arrayElimCell_123)) 1))))))) .cse228) .cse115)) (or (and (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| Int) (v_arrayElimCell_121 Int) (v_arrayElimCell_118 Int)) (or (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|))) (forall ((v_ArrVal_2990 (Array Int Int))) (let ((.cse260 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2990))) (let ((.cse261 (select (select .cse260 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (forall ((v_arrayElimCell_122 Int) (v_ArrVal_2980 (Array Int Int))) (let ((.cse262 (select .cse260 .cse261))) (let ((.cse257 (store |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| 1)) (.cse258 (let ((.cse263 (store (store .cse260 .cse261 (store .cse262 v_arrayElimCell_118 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse263 (select (select .cse263 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (forall ((v_arrayElimCell_123 Int)) (or (= (select .cse257 (select .cse258 v_arrayElimCell_123)) 1) (= (select .cse257 (select (let ((.cse259 (store (store .cse260 .cse261 (store .cse262 v_arrayElimCell_121 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse259 (select (select .cse259 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_123)) 1))) (= (select .cse257 (select .cse258 v_arrayElimCell_122)) 1))))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse261)))))) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| Int) (v_arrayElimCell_121 Int) (v_arrayElimCell_118 Int)) (or (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|))) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_2990 (Array Int Int))) (let ((.cse266 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2990))) (let ((.cse267 (select (select .cse266 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (forall ((v_arrayElimCell_122 Int) (v_ArrVal_2980 (Array Int Int))) (let ((.cse264 (store |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| 1)) (.cse268 (select .cse266 .cse267))) (or (= (select .cse264 (select (let ((.cse265 (store (store .cse266 .cse267 (store .cse268 v_arrayElimCell_118 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse265 (select (select .cse265 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_122)) 1) (forall ((v_arrayElimCell_123 Int)) (= (select .cse264 (select (let ((.cse269 (store (store .cse266 .cse267 (store .cse268 v_arrayElimCell_121 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse269 (select (select .cse269 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_123)) 1))))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse267)))))))) (or .cse30 (forall ((v_arrayElimCell_122 Int) (v_arrayElimCell_121 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_118 Int)) (let ((.cse272 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2990)) (.cse273 (select v_ArrVal_2990 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse274 (select .cse272 .cse273))) (let ((.cse270 (let ((.cse275 (store (store .cse272 .cse273 (store .cse274 v_arrayElimCell_121 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse275 (select (select .cse275 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse21 (select .cse270 v_arrayElimCell_118)) 1) (= (select .cse21 (select (let ((.cse271 (store (store .cse272 .cse273 (store .cse274 v_arrayElimCell_118 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse271 (select (select .cse271 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_122)) 1) (= (select .cse21 (select .cse270 v_arrayElimCell_122)) 1)))))) .cse28 .cse29) .cse211 (or (and (forall ((v_arrayElimCell_120 Int) (v_arrayElimCell_121 Int) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_118 Int)) (let ((.cse276 (select v_ArrVal_2990 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse276) (forall ((v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int))) (let ((.cse278 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2990))) (let ((.cse279 (select .cse278 .cse276))) (let ((.cse280 (let ((.cse281 (store (store .cse278 .cse276 (store .cse279 v_arrayElimCell_118 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse281 (select (select .cse281 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse21 (select (let ((.cse277 (store (store .cse278 .cse276 (store .cse279 v_arrayElimCell_121 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse277 (select (select .cse277 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_120)) 1) (= (select .cse21 (select .cse280 v_arrayElimCell_123)) 1) (= (select .cse21 (select .cse280 v_arrayElimCell_118)) 1))))))))) (forall ((v_arrayElimCell_120 Int) (v_arrayElimCell_121 Int) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_118 Int)) (let ((.cse282 (select v_ArrVal_2990 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse282) (forall ((v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int))) (let ((.cse285 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2990))) (let ((.cse286 (select .cse285 .cse282))) (let ((.cse283 (let ((.cse287 (store (store .cse285 .cse282 (store .cse286 v_arrayElimCell_121 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse287 (select (select .cse287 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse21 (select .cse283 v_arrayElimCell_118)) 1) (= (select .cse21 (select .cse283 v_arrayElimCell_120)) 1) (= (select .cse21 (select (let ((.cse284 (store (store .cse285 .cse282 (store .cse286 v_arrayElimCell_118 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse284 (select (select .cse284 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_123)) 1) (= (select .cse21 (select .cse283 v_arrayElimCell_123)) 1))))))))) (or .cse180 (forall ((v_arrayElimCell_120 Int) (v_arrayElimCell_121 Int) (v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_118 Int)) (let ((.cse291 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2990)) (.cse288 (select v_ArrVal_2990 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse292 (select .cse291 .cse288))) (let ((.cse289 (let ((.cse293 (store (store .cse291 .cse288 (store .cse292 v_arrayElimCell_121 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse293 (select (select .cse293 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse288) (= (select .cse21 (select .cse289 v_arrayElimCell_120)) 1) (= (select .cse21 (select (let ((.cse290 (store (store .cse291 .cse288 (store .cse292 v_arrayElimCell_118 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse290 (select (select .cse290 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_123)) 1) (= (select .cse21 (select .cse289 v_arrayElimCell_123)) 1)))))))) .cse28 .cse29) (or .cse37 .cse73 (and (forall ((v_arrayElimCell_120 Int) (v_arrayElimCell_121 Int) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_118 Int)) (let ((.cse297 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2990))) (let ((.cse294 (select (select .cse297 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse294) (forall ((v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int))) (let ((.cse298 (select .cse297 .cse294)) (.cse299 (select v_ArrVal_2980 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse295 (select (store (store .cse297 .cse294 (store .cse298 v_arrayElimCell_121 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2980) .cse299)) (.cse296 (select (store (store .cse297 .cse294 (store .cse298 v_arrayElimCell_118 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2980) .cse299))) (or (= (select .cse204 (select .cse295 v_arrayElimCell_123)) 1) (= (select .cse204 (select .cse295 v_arrayElimCell_120)) 1) (= (select .cse204 (select .cse296 v_arrayElimCell_120)) 1) (= (select .cse204 (select .cse296 v_arrayElimCell_123)) 1))))))))) (or .cse228 (forall ((v_arrayElimCell_120 Int) (v_arrayElimCell_121 Int) (v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_118 Int)) (let ((.cse301 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2990))) (let ((.cse300 (select (select .cse301 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse302 (select .cse301 .cse300)) (.cse303 (select v_ArrVal_2980 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse304 (select (store (store .cse301 .cse300 (store .cse302 v_arrayElimCell_118 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2980) .cse303))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse300) (= (select .cse204 (select (select (store (store .cse301 .cse300 (store .cse302 v_arrayElimCell_121 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2980) .cse303) v_arrayElimCell_123)) 1) (= (select .cse204 (select .cse304 v_arrayElimCell_120)) 1) (= (select .cse204 (select .cse304 v_arrayElimCell_123)) 1)))))))))) .cse234 .cse128 (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| Int) (v_arrayElimCell_121 Int) (v_arrayElimCell_118 Int)) (or (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|))) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| |c_#StackHeapBarrier|)) (forall ((v_arrayElimCell_122 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int))) (let ((.cse308 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2990))) (let ((.cse309 (select (select .cse308 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse310 (select .cse308 .cse309))) (let ((.cse306 (let ((.cse311 (store (store .cse308 .cse309 (store .cse310 v_arrayElimCell_118 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse311 (select (select .cse311 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (.cse305 (store |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| 1))) (or (= (select .cse305 (select .cse306 v_arrayElimCell_118)) 1) (= (select .cse305 (select .cse306 v_arrayElimCell_122)) 1) (= (select .cse305 (select (let ((.cse307 (store (store .cse308 .cse309 (store .cse310 v_arrayElimCell_121 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse307 (select (select .cse307 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_122)) 1))))))))) (or .cse28 .cse29 (and (or .cse180 (forall ((v_arrayElimCell_120 Int) (v_arrayElimCell_121 Int) (v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_118 Int)) (let ((.cse313 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2990)) (.cse314 (select v_ArrVal_2990 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse315 (select .cse313 .cse314))) (let ((.cse316 (let ((.cse317 (store (store .cse313 .cse314 (store .cse315 v_arrayElimCell_121 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse317 (select (select .cse317 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse21 (select (let ((.cse312 (store (store .cse313 .cse314 (store .cse315 v_arrayElimCell_118 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse312 (select (select .cse312 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_120)) 1) (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse314) (= (select .cse21 (select .cse316 v_arrayElimCell_120)) 1) (= (select .cse21 (select .cse316 v_arrayElimCell_123)) 1))))))) .cse64 (forall ((v_arrayElimCell_120 Int) (v_arrayElimCell_121 Int) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_118 Int)) (let ((.cse318 (select v_ArrVal_2990 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse318) (forall ((v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int))) (let ((.cse321 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2990))) (let ((.cse322 (select .cse321 .cse318))) (let ((.cse319 (let ((.cse323 (store (store .cse321 .cse318 (store .cse322 v_arrayElimCell_121 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse323 (select (select .cse323 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse21 (select .cse319 v_arrayElimCell_120)) 1) (= (select .cse21 (select .cse319 v_arrayElimCell_123)) 1) (= (select .cse21 (select (let ((.cse320 (store (store .cse321 .cse318 (store .cse322 v_arrayElimCell_118 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse320 (select (select .cse320 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_118)) 1))))))))) (forall ((v_arrayElimCell_120 Int) (v_arrayElimCell_121 Int) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_118 Int)) (let ((.cse324 (select v_ArrVal_2990 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse324) (forall ((v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int))) (let ((.cse326 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2990))) (let ((.cse327 (select .cse326 .cse324))) (let ((.cse328 (let ((.cse329 (store (store .cse326 .cse324 (store .cse327 v_arrayElimCell_121 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse329 (select (select .cse329 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse21 (select (let ((.cse325 (store (store .cse326 .cse324 (store .cse327 v_arrayElimCell_118 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse325 (select (select .cse325 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_120)) 1) (= (select .cse21 (select .cse328 v_arrayElimCell_118)) 1) (= (select .cse21 (select .cse328 v_arrayElimCell_120)) 1) (= (select .cse21 (select .cse328 v_arrayElimCell_123)) 1))))))))) .cse212 .cse219)) (or .cse28 (forall ((v_arrayElimCell_120 Int) (v_arrayElimCell_121 Int) (v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_118 Int)) (let ((.cse334 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2990)) (.cse331 (select v_ArrVal_2990 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse335 (select .cse334 .cse331))) (let ((.cse330 (let ((.cse336 (store (store .cse334 .cse331 (store .cse335 v_arrayElimCell_118 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse336 (select (select .cse336 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (.cse332 (let ((.cse333 (store (store .cse334 .cse331 (store .cse335 v_arrayElimCell_121 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse333 (select (select .cse333 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse21 (select .cse330 v_arrayElimCell_120)) 1) (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse331) (= (select .cse21 (select .cse332 v_arrayElimCell_118)) 1) (= (select .cse21 (select .cse332 v_arrayElimCell_120)) 1) (= (select .cse21 (select .cse330 v_arrayElimCell_123)) 1) (= (select .cse21 (select .cse332 v_arrayElimCell_123)) 1)))))) .cse29) (or .cse30 (forall ((v_arrayElimCell_120 Int) (v_arrayElimCell_121 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_118 Int)) (let ((.cse338 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2990)) (.cse339 (select v_ArrVal_2990 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse340 (select .cse338 .cse339))) (let ((.cse341 (let ((.cse342 (store (store .cse338 .cse339 (store .cse340 v_arrayElimCell_121 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse342 (select (select .cse342 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse21 (select (let ((.cse337 (store (store .cse338 .cse339 (store .cse340 v_arrayElimCell_118 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse337 (select (select .cse337 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_120)) 1) (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse339) (= (select .cse21 (select .cse341 v_arrayElimCell_118)) 1) (= (select .cse21 (select .cse341 v_arrayElimCell_120)) 1)))))) .cse28 .cse29) (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| Int) (v_arrayElimCell_120 Int) (v_arrayElimCell_118 Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|))) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_2990 (Array Int Int))) (let ((.cse346 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2990))) (let ((.cse347 (select (select .cse346 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (forall ((v_ArrVal_2980 (Array Int Int))) (let ((.cse343 (store |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| 1)) (.cse344 (let ((.cse345 (store (store .cse346 .cse347 (store (select .cse346 .cse347) v_arrayElimCell_118 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse345 (select (select .cse345 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse343 (select .cse344 v_arrayElimCell_120)) 1) (= (select .cse343 (select .cse344 v_arrayElimCell_118)) 1)))) (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse347))))))) (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| Int) (v_arrayElimCell_121 Int) (v_arrayElimCell_118 Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|))) (forall ((v_ArrVal_2990 (Array Int Int))) (let ((.cse350 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2990))) (let ((.cse351 (select (select .cse350 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (forall ((v_arrayElimCell_122 Int) (v_ArrVal_2980 (Array Int Int))) (let ((.cse348 (store |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| 1)) (.cse352 (select .cse350 .cse351))) (or (= (select .cse348 (select (let ((.cse349 (store (store .cse350 .cse351 (store .cse352 v_arrayElimCell_118 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse349 (select (select .cse349 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_122)) 1) (= (select .cse348 (select (let ((.cse353 (store (store .cse350 .cse351 (store .cse352 v_arrayElimCell_121 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse353 (select (select .cse353 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_122)) 1)))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse351)))))) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| |c_#StackHeapBarrier|)))) .cse235 .cse201 (or (and (forall ((v_arrayElimCell_121 Int) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_118 Int)) (let ((.cse354 (select v_ArrVal_2990 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse354)) (forall ((v_arrayElimCell_122 Int) (v_ArrVal_2980 (Array Int Int))) (let ((.cse357 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2990))) (let ((.cse358 (select .cse357 .cse354))) (let ((.cse355 (let ((.cse359 (store (store .cse357 .cse354 (store .cse358 v_arrayElimCell_121 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse359 (select (select .cse359 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (forall ((v_arrayElimCell_123 Int)) (= (select .cse21 (select .cse355 v_arrayElimCell_123)) 1)) (= (select .cse21 (select (let ((.cse356 (store (store .cse357 .cse354 (store .cse358 v_arrayElimCell_118 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse356 (select (select .cse356 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_122)) 1) (= (select .cse21 (select .cse355 v_arrayElimCell_122)) 1))))))))) (forall ((v_arrayElimCell_121 Int) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_118 Int)) (let ((.cse362 (select v_ArrVal_2990 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (forall ((v_arrayElimCell_122 Int) (v_ArrVal_2980 (Array Int Int))) (let ((.cse361 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2990))) (let ((.cse363 (select .cse361 .cse362))) (let ((.cse364 (let ((.cse365 (store (store .cse361 .cse362 (store .cse363 v_arrayElimCell_121 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse365 (select (select .cse365 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (forall ((v_arrayElimCell_123 Int)) (or (= (select .cse21 (select (let ((.cse360 (store (store .cse361 .cse362 (store .cse363 v_arrayElimCell_118 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse360 (select (select .cse360 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_123)) 1) (= (select .cse21 (select .cse364 v_arrayElimCell_123)) 1))) (= (select .cse21 (select .cse364 v_arrayElimCell_122)) 1)))))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse362))))) .cse226 (or .cse30 (forall ((v_arrayElimCell_122 Int) (v_arrayElimCell_121 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_118 Int)) (let ((.cse367 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2990)) (.cse368 (select v_ArrVal_2990 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse369 (select .cse367 .cse368))) (or (= (select .cse21 (select (let ((.cse366 (store (store .cse367 .cse368 (store .cse369 v_arrayElimCell_118 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse366 (select (select .cse366 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_122)) 1) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse368)) (= (select .cse21 (select (let ((.cse370 (store (store .cse367 .cse368 (store .cse369 v_arrayElimCell_121 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse370 (select (select .cse370 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_122)) 1)))))) (forall ((v_arrayElimCell_121 Int) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_118 Int)) (let ((.cse375 (select v_ArrVal_2990 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (forall ((v_arrayElimCell_122 Int) (v_ArrVal_2980 (Array Int Int))) (let ((.cse374 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2990))) (let ((.cse376 (select .cse374 .cse375))) (let ((.cse371 (let ((.cse377 (store (store .cse374 .cse375 (store .cse376 v_arrayElimCell_118 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse377 (select (select .cse377 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (.cse372 (let ((.cse373 (store (store .cse374 .cse375 (store .cse376 v_arrayElimCell_121 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse373 (select (select .cse373 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (forall ((v_arrayElimCell_123 Int)) (or (= (select .cse21 (select .cse371 v_arrayElimCell_123)) 1) (= (select .cse21 (select .cse372 v_arrayElimCell_123)) 1))) (= (select .cse21 (select .cse371 v_arrayElimCell_122)) 1) (= (select .cse21 (select .cse372 v_arrayElimCell_122)) 1)))))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse375))))) .cse81) .cse28 .cse29) .cse202 (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| Int) (v_arrayElimCell_120 Int) (v_arrayElimCell_118 Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|))) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_2990 (Array Int Int))) (let ((.cse381 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2990))) (let ((.cse382 (select (select .cse381 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (forall ((v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int))) (let ((.cse378 (store |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| 1)) (.cse379 (let ((.cse380 (store (store .cse381 .cse382 (store (select .cse381 .cse382) v_arrayElimCell_118 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse380 (select (select .cse380 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse378 (select .cse379 v_arrayElimCell_123)) 1) (= (select .cse378 (select .cse379 v_arrayElimCell_120)) 1) (= (select .cse378 (select .cse379 v_arrayElimCell_118)) 1)))) (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse382))))))) (or (forall ((v_arrayElimCell_121 Int) (v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_118 Int)) (let ((.cse384 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2990))) (let ((.cse383 (select (select .cse384 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse385 (select .cse384 .cse383)) (.cse386 (select v_ArrVal_2980 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse383) (= (select .cse204 (select (select (store (store .cse384 .cse383 (store .cse385 v_arrayElimCell_121 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2980) .cse386) v_arrayElimCell_123)) 1) (= (select .cse204 (select (select (store (store .cse384 .cse383 (store .cse385 v_arrayElimCell_118 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2980) .cse386) v_arrayElimCell_123)) 1)))))) .cse37 .cse73) .cse237 (or (and .cse387 (forall ((v_arrayElimCell_120 Int) (v_arrayElimCell_121 Int) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_118 Int)) (let ((.cse389 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2990))) (let ((.cse388 (select (select .cse389 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse388) (forall ((v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int))) (let ((.cse390 (select .cse389 .cse388)) (.cse391 (select v_ArrVal_2980 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse392 (select (store (store .cse389 .cse388 (store .cse390 v_arrayElimCell_118 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2980) .cse391))) (or (= (select .cse204 (select (select (store (store .cse389 .cse388 (store .cse390 v_arrayElimCell_121 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2980) .cse391) v_arrayElimCell_120)) 1) (= (select .cse204 (select .cse392 v_arrayElimCell_120)) 1) (= (select .cse204 (select .cse392 v_arrayElimCell_123)) 1)))))))))) .cse228 .cse37 .cse73) .cse393 (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| Int) (v_arrayElimCell_121 Int) (v_arrayElimCell_118 Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|))) (forall ((v_arrayElimCell_122 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int))) (let ((.cse398 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2990))) (let ((.cse399 (select (select .cse398 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse400 (select .cse398 .cse399))) (let ((.cse395 (let ((.cse401 (store (store .cse398 .cse399 (store .cse400 v_arrayElimCell_118 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse401 (select (select .cse401 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (.cse394 (store |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| 1)) (.cse396 (let ((.cse397 (store (store .cse398 .cse399 (store .cse400 v_arrayElimCell_121 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse397 (select (select .cse397 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse394 (select .cse395 v_arrayElimCell_118)) 1) (= (select .cse394 (select .cse395 v_arrayElimCell_122)) 1) (= (select .cse394 (select .cse396 v_arrayElimCell_118)) 1) (= (select .cse394 (select .cse396 v_arrayElimCell_122)) 1))))))) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| |c_#StackHeapBarrier|)))) (or (forall ((v_arrayElimCell_122 Int) (v_arrayElimCell_121 Int) (v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_118 Int)) (let ((.cse403 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2990)) (.cse404 (select v_ArrVal_2990 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse405 (select .cse403 .cse404))) (let ((.cse406 (let ((.cse407 (store (store .cse403 .cse404 (store .cse405 v_arrayElimCell_121 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse407 (select (select .cse407 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse21 (select (let ((.cse402 (store (store .cse403 .cse404 (store .cse405 v_arrayElimCell_118 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse402 (select (select .cse402 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_122)) 1) (= (select .cse21 (select .cse406 v_arrayElimCell_123)) 1) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse404)) (= (select .cse21 (select .cse406 v_arrayElimCell_122)) 1)))))) .cse28 .cse29) (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| Int) (v_arrayElimCell_121 Int) (v_arrayElimCell_118 Int)) (or (forall ((v_ArrVal_2990 (Array Int Int))) (let ((.cse412 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2990))) (let ((.cse413 (select (select .cse412 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (forall ((v_arrayElimCell_122 Int) (v_ArrVal_2980 (Array Int Int))) (let ((.cse414 (select .cse412 .cse413))) (let ((.cse409 (let ((.cse415 (store (store .cse412 .cse413 (store .cse414 v_arrayElimCell_118 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse415 (select (select .cse415 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (.cse408 (store |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| 1)) (.cse410 (let ((.cse411 (store (store .cse412 .cse413 (store .cse414 v_arrayElimCell_121 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse411 (select (select .cse411 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (forall ((v_arrayElimCell_123 Int)) (or (= (select .cse408 (select .cse409 v_arrayElimCell_123)) 1) (= (select .cse408 (select .cse410 v_arrayElimCell_123)) 1))) (= (select .cse408 (select .cse409 v_arrayElimCell_122)) 1) (= (select .cse408 (select .cse410 v_arrayElimCell_122)) 1))))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse413)))))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|))) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| |c_#StackHeapBarrier|)))) .cse236 .cse416 .cse417 (or .cse37 (and .cse84 .cse227 (forall ((v_arrayElimCell_121 Int) (v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_118 Int)) (let ((.cse418 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2990))) (let ((.cse419 (select (select .cse418 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse420 (select .cse418 .cse419)) (.cse421 (select v_ArrVal_2980 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (select .cse204 (select (select (store (store .cse418 .cse419 (store .cse420 v_arrayElimCell_121 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2980) .cse421) v_arrayElimCell_123)) 1) (= (select .cse204 (select (select (store (store .cse418 .cse419 (store .cse420 v_arrayElimCell_118 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2980) .cse421) v_arrayElimCell_123)) 1))))))) .cse73) (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| Int) (v_arrayElimCell_121 Int) (v_arrayElimCell_118 Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|))) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_2990 (Array Int Int))) (let ((.cse424 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2990))) (let ((.cse425 (select (select .cse424 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (forall ((v_arrayElimCell_122 Int) (v_ArrVal_2980 (Array Int Int))) (let ((.cse426 (select .cse424 .cse425))) (let ((.cse422 (store |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| 1)) (.cse427 (let ((.cse428 (store (store .cse424 .cse425 (store .cse426 v_arrayElimCell_121 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse428 (select (select .cse428 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse422 (select (let ((.cse423 (store (store .cse424 .cse425 (store .cse426 v_arrayElimCell_118 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse423 (select (select .cse423 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_122)) 1) (forall ((v_arrayElimCell_123 Int)) (= (select .cse422 (select .cse427 v_arrayElimCell_123)) 1)) (= (select .cse422 (select .cse427 v_arrayElimCell_122)) 1))))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse425)))))))) (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| Int) (v_arrayElimCell_121 Int) (v_arrayElimCell_118 Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|))) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|) (forall ((v_arrayElimCell_122 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int))) (let ((.cse431 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2990))) (let ((.cse432 (select (select .cse431 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse429 (store |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| 1)) (.cse433 (select .cse431 .cse432))) (or (= (select .cse429 (select (let ((.cse430 (store (store .cse431 .cse432 (store .cse433 v_arrayElimCell_118 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse430 (select (select .cse430 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_122)) 1) (= (select .cse429 (select (let ((.cse434 (store (store .cse431 .cse432 (store .cse433 v_arrayElimCell_121 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse434 (select (select .cse434 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_122)) 1) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse432))))))) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| |c_#StackHeapBarrier|)))) .cse435) .cse94) .cse393 (or .cse28 (forall ((v_arrayElimCell_120 Int) (v_arrayElimCell_122 Int) (v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_118 Int)) (let ((.cse438 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2990)) (.cse439 (select v_ArrVal_2990 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse440 (select .cse438 .cse439))) (let ((.cse436 (let ((.cse441 (store (store .cse438 .cse439 (store .cse440 v_arrayElimCell_120 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse441 (select (select .cse441 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse21 (select .cse436 v_arrayElimCell_123)) 1) (= (select .cse21 (select (let ((.cse437 (store (store .cse438 .cse439 (store .cse440 v_arrayElimCell_118 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse437 (select (select .cse437 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_122)) 1) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse439)) (= (select .cse21 (select .cse436 v_arrayElimCell_122)) 1)))))) .cse29) (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| Int) (v_arrayElimCell_120 Int) (v_arrayElimCell_118 Int)) (or (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|))) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_2990 (Array Int Int))) (let ((.cse444 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2990))) (let ((.cse445 (select (select .cse444 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (forall ((v_arrayElimCell_122 Int) (v_ArrVal_2980 (Array Int Int))) (let ((.cse442 (store |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| 1)) (.cse446 (select .cse444 .cse445))) (or (forall ((v_arrayElimCell_123 Int)) (= (select .cse442 (select (let ((.cse443 (store (store .cse444 .cse445 (store .cse446 v_arrayElimCell_120 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse443 (select (select .cse443 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_123)) 1)) (= (select .cse442 (select (let ((.cse447 (store (store .cse444 .cse445 (store .cse446 v_arrayElimCell_118 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse447 (select (select .cse447 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_122)) 1)))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse445)))))))) (or .cse37 .cse73 (and .cse210 .cse104 (forall ((v_arrayElimCell_120 Int) (v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_118 Int)) (let ((.cse448 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2990))) (let ((.cse449 (select (select .cse448 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse450 (select .cse448 .cse449)) (.cse451 (select v_ArrVal_2980 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (select .cse204 (select (select (store (store .cse448 .cse449 (store .cse450 v_arrayElimCell_118 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2980) .cse451) v_arrayElimCell_123)) 1) (= (select .cse204 (select (select (store (store .cse448 .cse449 (store .cse450 v_arrayElimCell_120 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2980) .cse451) v_arrayElimCell_123)) 1)))))))) (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| Int) (v_arrayElimCell_120 Int) (v_arrayElimCell_118 Int)) (or (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|))) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_2990 (Array Int Int))) (let ((.cse455 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2990))) (let ((.cse456 (select (select .cse455 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (forall ((v_arrayElimCell_122 Int) (v_ArrVal_2980 (Array Int Int))) (let ((.cse457 (select .cse455 .cse456))) (let ((.cse453 (let ((.cse458 (store (store .cse455 .cse456 (store .cse457 v_arrayElimCell_118 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse458 (select (select .cse458 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (.cse452 (store |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| 1))) (or (= (select .cse452 (select .cse453 v_arrayElimCell_122)) 1) (forall ((v_arrayElimCell_123 Int)) (or (= (select .cse452 (select .cse453 v_arrayElimCell_123)) 1) (= (select .cse452 (select (let ((.cse454 (store (store .cse455 .cse456 (store .cse457 v_arrayElimCell_120 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse454 (select (select .cse454 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_123)) 1))))))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse456)))))))) (or .cse228 .cse37 .cse73 (and (forall ((v_arrayElimCell_120 Int) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_118 Int)) (let ((.cse460 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2990))) (let ((.cse459 (select (select .cse460 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse459) (forall ((v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int))) (let ((.cse461 (select .cse460 .cse459)) (.cse462 (select v_ArrVal_2980 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (select .cse204 (select (select (store (store .cse460 .cse459 (store .cse461 v_arrayElimCell_118 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2980) .cse462) v_arrayElimCell_123)) 1) (= (select .cse204 (select (select (store (store .cse460 .cse459 (store .cse461 v_arrayElimCell_120 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2980) .cse462) v_arrayElimCell_120)) 1)))))))) .cse387)) .cse416 .cse417 (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| Int) (v_arrayElimCell_120 Int) (v_arrayElimCell_118 Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|))) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_2990 (Array Int Int))) (let ((.cse467 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2990))) (let ((.cse468 (select (select .cse467 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (forall ((v_arrayElimCell_122 Int) (v_ArrVal_2980 (Array Int Int))) (let ((.cse469 (select .cse467 .cse468))) (let ((.cse465 (let ((.cse470 (store (store .cse467 .cse468 (store .cse469 v_arrayElimCell_118 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse470 (select (select .cse470 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (.cse463 (store |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| 1)) (.cse464 (let ((.cse466 (store (store .cse467 .cse468 (store .cse469 v_arrayElimCell_120 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse466 (select (select .cse466 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse463 (select .cse464 v_arrayElimCell_122)) 1) (= (select .cse463 (select .cse465 v_arrayElimCell_122)) 1) (forall ((v_arrayElimCell_123 Int)) (or (= (select .cse463 (select .cse465 v_arrayElimCell_123)) 1) (= (select .cse463 (select .cse464 v_arrayElimCell_123)) 1))))))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse468)))))))) .cse435)))) is different from false [2023-02-15 22:29:10,302 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse30 (= |c_ULTIMATE.start_main_~#s~0#1.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) (.cse204 (store |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base| 1)) (.cse21 (store |c_#valid| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| 1)) (.cse228 (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse486 (not .cse228)) (.cse78 (forall ((v_arrayElimCell_122 Int) (v_arrayElimCell_121 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int))) (let ((.cse1005 (select v_ArrVal_2990 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse1005)) (= (select .cse21 (select (let ((.cse1006 (store (let ((.cse1007 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2990))) (store .cse1007 .cse1005 (store (select .cse1007 .cse1005) v_arrayElimCell_121 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|))) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse1006 (select (select .cse1006 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_122)) 1))))) (.cse51 (forall ((v_arrayElimCell_121 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_118 Int)) (let ((.cse1002 (select v_ArrVal_2990 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse1002) (= (select .cse21 (select (let ((.cse1003 (store (let ((.cse1004 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2990))) (store .cse1004 .cse1002 (store (select .cse1004 .cse1002) v_arrayElimCell_121 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|))) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse1003 (select (select .cse1003 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_118)) 1))))) (.cse83 (forall ((v_arrayElimCell_122 Int) (v_arrayElimCell_121 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_118 Int)) (let ((.cse998 (let ((.cse999 (store (let ((.cse1000 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2990)) (.cse1001 (select v_ArrVal_2990 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (store .cse1000 .cse1001 (store (select .cse1000 .cse1001) v_arrayElimCell_121 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|))) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse999 (select (select .cse999 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse21 (select .cse998 v_arrayElimCell_118)) 1) (= (select .cse21 (select .cse998 v_arrayElimCell_122)) 1))))) (.cse59 (forall ((v_arrayElimCell_120 Int) (v_arrayElimCell_121 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_118 Int)) (let ((.cse994 (select v_ArrVal_2990 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse995 (let ((.cse996 (store (let ((.cse997 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2990))) (store .cse997 .cse994 (store (select .cse997 .cse994) v_arrayElimCell_121 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|))) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse996 (select (select .cse996 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse994) (= (select .cse21 (select .cse995 v_arrayElimCell_118)) 1) (= (select .cse21 (select .cse995 v_arrayElimCell_120)) 1)))))) (.cse31 (forall ((v_arrayElimCell_120 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_118 Int)) (let ((.cse991 (select v_ArrVal_2990 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse990 (let ((.cse992 (store (let ((.cse993 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2990))) (store .cse993 .cse991 (store (select .cse993 .cse991) v_arrayElimCell_120 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|))) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse992 (select (select .cse992 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse21 (select .cse990 v_arrayElimCell_118)) 1) (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse991) (= (select .cse21 (select .cse990 v_arrayElimCell_120)) 1)))))) (.cse95 (forall ((v_arrayElimCell_120 Int) (v_arrayElimCell_122 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_118 Int)) (let ((.cse986 (let ((.cse987 (store (let ((.cse988 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2990)) (.cse989 (select v_ArrVal_2990 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (store .cse988 .cse989 (store (select .cse988 .cse989) v_arrayElimCell_120 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|))) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse987 (select (select .cse987 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse21 (select .cse986 v_arrayElimCell_118)) 1) (= (select .cse21 (select .cse986 v_arrayElimCell_122)) 1))))) (.cse623 (forall ((v_arrayElimCell_120 Int) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_119 Int)) (let ((.cse985 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2990))) (let ((.cse983 (select (select .cse985 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse983) (forall ((v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int))) (let ((.cse984 (select (store (store .cse985 .cse983 (store (select .cse985 .cse983) v_arrayElimCell_119 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2980) (select v_ArrVal_2980 |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (or (= (select .cse204 (select .cse984 v_arrayElimCell_123)) 1) (= (select .cse204 (select .cse984 v_arrayElimCell_120)) 1))))))))) (.cse119 (forall ((v_arrayElimCell_120 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_118 Int)) (let ((.cse982 (select v_ArrVal_2990 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= (select .cse21 (select (let ((.cse980 (store (let ((.cse981 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2990))) (store .cse981 .cse982 (store (select .cse981 .cse982) v_arrayElimCell_120 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|))) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse980 (select (select .cse980 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_118)) 1) (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse982))))) (.cse42 (forall ((v_arrayElimCell_120 Int) (v_arrayElimCell_122 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int))) (let ((.cse977 (select v_ArrVal_2990 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse977)) (= (select .cse21 (select (let ((.cse978 (store (let ((.cse979 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2990))) (store .cse979 .cse977 (store (select .cse979 .cse977) v_arrayElimCell_120 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|))) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse978 (select (select .cse978 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_122)) 1))))) (.cse37 (not (= 0 (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|)))) (.cse73 (not (< |c_ULTIMATE.start_main_~#s~0#1.base| |c_#StackHeapBarrier|))) (.cse180 (not .cse30)) (.cse28 (not (< |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |c_#StackHeapBarrier|))) (.cse29 (not (= 0 (select |c_#valid| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|))))) (let ((.cse47 (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| Int) (v_arrayElimCell_120 Int) (v_arrayElimCell_121 Int) (v_arrayElimCell_119 Int) (v_arrayElimCell_118 Int)) (or (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|))) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| |c_#StackHeapBarrier|)) (forall ((v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int))) (let ((.cse974 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2990))) (let ((.cse972 (select (select .cse974 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse975 (select .cse974 .cse972))) (let ((.cse971 (let ((.cse976 (store (store .cse974 .cse972 (store .cse975 v_arrayElimCell_119 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse976 (select (select .cse976 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (.cse970 (store |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| 1))) (or (= (select .cse970 (select .cse971 v_arrayElimCell_123)) 1) (= (select .cse970 (select .cse971 v_arrayElimCell_118)) 1) (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse972) (= (select .cse970 (select .cse971 v_arrayElimCell_120)) 1) (= (select .cse970 (select (let ((.cse973 (store (store .cse974 .cse972 (store .cse975 v_arrayElimCell_121 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse973 (select (select .cse973 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_123)) 1)))))))))) (.cse49 (or (forall ((v_arrayElimCell_120 Int) (v_arrayElimCell_121 Int) (v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_119 Int) (v_arrayElimCell_118 Int)) (let ((.cse967 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2990)) (.cse963 (select v_ArrVal_2990 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse968 (select .cse967 .cse963))) (let ((.cse964 (let ((.cse969 (store (store .cse967 .cse963 (store .cse968 v_arrayElimCell_121 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse969 (select (select .cse969 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (.cse965 (let ((.cse966 (store (store .cse967 .cse963 (store .cse968 v_arrayElimCell_119 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse966 (select (select .cse966 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse963) (= (select .cse21 (select .cse964 v_arrayElimCell_118)) 1) (= (select .cse21 (select .cse964 v_arrayElimCell_120)) 1) (= (select .cse21 (select .cse965 v_arrayElimCell_120)) 1) (= (select .cse21 (select .cse964 v_arrayElimCell_123)) 1) (= (select .cse21 (select .cse965 v_arrayElimCell_123)) 1)))))) .cse28 .cse29)) (.cse103 (forall ((v_arrayElimCell_120 Int) (v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_119 Int)) (let ((.cse959 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2990))) (let ((.cse960 (select (select .cse959 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse961 (select .cse959 .cse960)) (.cse962 (select v_ArrVal_2980 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (select .cse204 (select (select (store (store .cse959 .cse960 (store .cse961 v_arrayElimCell_119 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2980) .cse962) v_arrayElimCell_123)) 1) (= (select .cse204 (select (select (store (store .cse959 .cse960 (store .cse961 v_arrayElimCell_120 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2980) .cse962) v_arrayElimCell_123)) 1))))))) (.cse65 (forall ((v_arrayElimCell_120 Int) (v_arrayElimCell_121 Int) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_119 Int) (v_arrayElimCell_118 Int)) (let ((.cse952 (select v_ArrVal_2990 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse952) (forall ((v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int))) (let ((.cse956 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2990))) (let ((.cse957 (select .cse956 .cse952))) (let ((.cse954 (let ((.cse958 (store (store .cse956 .cse952 (store .cse957 v_arrayElimCell_119 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse958 (select (select .cse958 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (.cse953 (let ((.cse955 (store (store .cse956 .cse952 (store .cse957 v_arrayElimCell_121 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse955 (select (select .cse955 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse21 (select .cse953 v_arrayElimCell_118)) 1) (= (select .cse21 (select .cse953 v_arrayElimCell_120)) 1) (= (select .cse21 (select .cse954 v_arrayElimCell_120)) 1) (= (select .cse21 (select .cse954 v_arrayElimCell_118)) 1) (= (select .cse21 (select .cse953 v_arrayElimCell_123)) 1)))))))))) (.cse66 (forall ((v_arrayElimCell_120 Int) (v_arrayElimCell_121 Int) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_119 Int) (v_arrayElimCell_118 Int)) (let ((.cse946 (select v_ArrVal_2990 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse946) (forall ((v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int))) (let ((.cse949 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2990))) (let ((.cse950 (select .cse949 .cse946))) (let ((.cse947 (let ((.cse951 (store (store .cse949 .cse946 (store .cse950 v_arrayElimCell_121 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse951 (select (select .cse951 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse21 (select .cse947 v_arrayElimCell_118)) 1) (= (select .cse21 (select .cse947 v_arrayElimCell_120)) 1) (= (select .cse21 (select (let ((.cse948 (store (store .cse949 .cse946 (store .cse950 v_arrayElimCell_119 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse948 (select (select .cse948 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_118)) 1) (= (select .cse21 (select .cse947 v_arrayElimCell_123)) 1)))))))))) (.cse67 (forall ((v_arrayElimCell_120 Int) (v_arrayElimCell_121 Int) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_119 Int) (v_arrayElimCell_118 Int)) (let ((.cse940 (select v_ArrVal_2990 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse940) (forall ((v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int))) (let ((.cse943 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2990))) (let ((.cse944 (select .cse943 .cse940))) (let ((.cse941 (let ((.cse945 (store (store .cse943 .cse940 (store .cse944 v_arrayElimCell_121 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse945 (select (select .cse945 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse21 (select .cse941 v_arrayElimCell_118)) 1) (= (select .cse21 (select .cse941 v_arrayElimCell_120)) 1) (= (select .cse21 (select (let ((.cse942 (store (store .cse943 .cse940 (store .cse944 v_arrayElimCell_119 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse942 (select (select .cse942 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_120)) 1) (= (select .cse21 (select .cse941 v_arrayElimCell_123)) 1)))))))))) (.cse33 (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| Int) (v_arrayElimCell_120 Int) (v_arrayElimCell_119 Int) (v_arrayElimCell_118 Int)) (or (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|))) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int))) (let ((.cse937 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2990))) (let ((.cse935 (select (select .cse937 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse938 (select .cse937 .cse935))) (let ((.cse934 (let ((.cse939 (store (store .cse937 .cse935 (store .cse938 v_arrayElimCell_119 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse939 (select (select .cse939 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (.cse933 (store |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| 1))) (or (= (select .cse933 (select .cse934 v_arrayElimCell_118)) 1) (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse935) (= (select .cse933 (select .cse934 v_arrayElimCell_120)) 1) (= (select .cse933 (select (let ((.cse936 (store (store .cse937 .cse935 (store .cse938 v_arrayElimCell_120 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse936 (select (select .cse936 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_118)) 1)))))))))) (.cse18 (forall ((v_arrayElimCell_120 Int) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_118 Int)) (let ((.cse929 (select v_ArrVal_2990 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse929) (forall ((v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int))) (let ((.cse930 (let ((.cse931 (store (let ((.cse932 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2990))) (store .cse932 .cse929 (store (select .cse932 .cse929) v_arrayElimCell_120 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|))) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse931 (select (select .cse931 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse21 (select .cse930 v_arrayElimCell_118)) 1) (= (select .cse21 (select .cse930 v_arrayElimCell_123)) 1) (= (select .cse21 (select .cse930 v_arrayElimCell_120)) 1)))))))) (.cse19 (or .cse180 (forall ((v_arrayElimCell_120 Int) (v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int))) (let ((.cse925 (select v_ArrVal_2990 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse926 (let ((.cse927 (store (let ((.cse928 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2990))) (store .cse928 .cse925 (store (select .cse928 .cse925) v_arrayElimCell_120 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|))) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse927 (select (select .cse927 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse925) (= (select .cse21 (select .cse926 v_arrayElimCell_123)) 1) (= (select .cse21 (select .cse926 v_arrayElimCell_120)) 1))))))) (.cse27 (or .cse180 (forall ((v_arrayElimCell_120 Int) (v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int))) (let ((.cse922 (select v_ArrVal_2990 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse922) (= (select .cse21 (select (let ((.cse923 (store (let ((.cse924 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2990))) (store .cse924 .cse922 (store (select .cse924 .cse922) v_arrayElimCell_120 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|))) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse923 (select (select .cse923 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_123)) 1)))))) (.cse107 (forall ((v_arrayElimCell_120 Int) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_119 Int) (v_arrayElimCell_118 Int)) (let ((.cse916 (select v_ArrVal_2990 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse916) (forall ((v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int))) (let ((.cse919 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2990))) (let ((.cse920 (select .cse919 .cse916))) (let ((.cse917 (let ((.cse921 (store (store .cse919 .cse916 (store .cse920 v_arrayElimCell_120 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse921 (select (select .cse921 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse21 (select .cse917 v_arrayElimCell_123)) 1) (= (select .cse21 (select .cse917 v_arrayElimCell_120)) 1) (= (select .cse21 (select (let ((.cse918 (store (store .cse919 .cse916 (store .cse920 v_arrayElimCell_119 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse918 (select (select .cse918 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_118)) 1)))))))))) (.cse34 (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| Int) (v_arrayElimCell_120 Int) (v_arrayElimCell_119 Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|))) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_2990 (Array Int Int))) (let ((.cse912 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2990))) (let ((.cse913 (select (select .cse912 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (forall ((v_arrayElimCell_122 Int) (v_ArrVal_2980 (Array Int Int))) (let ((.cse914 (select .cse912 .cse913))) (let ((.cse909 (store |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| 1)) (.cse910 (let ((.cse915 (store (store .cse912 .cse913 (store .cse914 v_arrayElimCell_120 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse915 (select (select .cse915 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (forall ((v_arrayElimCell_123 Int)) (= (select .cse909 (select .cse910 v_arrayElimCell_123)) 1)) (= (select .cse909 (select (let ((.cse911 (store (store .cse912 .cse913 (store .cse914 v_arrayElimCell_119 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse911 (select (select .cse911 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_122)) 1) (= (select .cse909 (select .cse910 v_arrayElimCell_122)) 1))))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse913))))))))) (.cse52 (or (forall ((v_arrayElimCell_121 Int) (v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_119 Int)) (let ((.cse906 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2990))) (let ((.cse905 (select (select .cse906 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse907 (select .cse906 .cse905)) (.cse908 (select v_ArrVal_2980 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse905) (= (select .cse204 (select (select (store (store .cse906 .cse905 (store .cse907 v_arrayElimCell_119 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2980) .cse908) v_arrayElimCell_123)) 1) (= (select .cse204 (select (select (store (store .cse906 .cse905 (store .cse907 v_arrayElimCell_121 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2980) .cse908) v_arrayElimCell_123)) 1)))))) .cse37 .cse73)) (.cse53 (or .cse28 .cse29 (forall ((v_arrayElimCell_122 Int) (v_arrayElimCell_121 Int) (v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_119 Int)) (let ((.cse901 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2990)) (.cse902 (select v_ArrVal_2990 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse903 (select .cse901 .cse902))) (let ((.cse899 (let ((.cse904 (store (store .cse901 .cse902 (store .cse903 v_arrayElimCell_121 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse904 (select (select .cse904 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse21 (select .cse899 v_arrayElimCell_123)) 1) (= (select .cse21 (select (let ((.cse900 (store (store .cse901 .cse902 (store .cse903 v_arrayElimCell_119 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse900 (select (select .cse900 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_122)) 1) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse902)) (= (select .cse21 (select .cse899 v_arrayElimCell_122)) 1)))))))) (.cse174 (or .cse30 .cse28 .cse42 .cse29)) (.cse56 (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| Int) (v_arrayElimCell_121 Int) (v_arrayElimCell_119 Int) (v_arrayElimCell_118 Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|))) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| |c_#StackHeapBarrier|)) (forall ((v_arrayElimCell_122 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int))) (let ((.cse895 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2990))) (let ((.cse896 (select (select .cse895 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse897 (select .cse895 .cse896))) (let ((.cse892 (let ((.cse898 (store (store .cse895 .cse896 (store .cse897 v_arrayElimCell_119 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse898 (select (select .cse898 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (.cse891 (store |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| 1)) (.cse893 (let ((.cse894 (store (store .cse895 .cse896 (store .cse897 v_arrayElimCell_121 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse894 (select (select .cse894 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse891 (select .cse892 v_arrayElimCell_118)) 1) (= (select .cse891 (select .cse892 v_arrayElimCell_122)) 1) (= (select .cse891 (select .cse893 v_arrayElimCell_118)) 1) (= (select .cse891 (select .cse893 v_arrayElimCell_122)) 1)))))))))) (.cse57 (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| Int) (v_arrayElimCell_121 Int) (v_arrayElimCell_119 Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|))) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| |c_#StackHeapBarrier|)) (forall ((v_arrayElimCell_122 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int))) (let ((.cse887 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2990))) (let ((.cse888 (select (select .cse887 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse885 (store |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| 1)) (.cse889 (select .cse887 .cse888))) (or (= (select .cse885 (select (let ((.cse886 (store (store .cse887 .cse888 (store .cse889 v_arrayElimCell_119 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse886 (select (select .cse886 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_122)) 1) (= (select .cse885 (select (let ((.cse890 (store (store .cse887 .cse888 (store .cse889 v_arrayElimCell_121 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse890 (select (select .cse890 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_122)) 1) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse888)))))))))) (.cse58 (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| Int) (v_arrayElimCell_120 Int) (v_arrayElimCell_121 Int) (v_arrayElimCell_119 Int) (v_arrayElimCell_118 Int)) (or (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|))) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_2990 (Array Int Int))) (let ((.cse882 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2990))) (let ((.cse878 (select (select .cse882 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse878) (forall ((v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int))) (let ((.cse883 (select .cse882 .cse878))) (let ((.cse880 (let ((.cse884 (store (store .cse882 .cse878 (store .cse883 v_arrayElimCell_119 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse884 (select (select .cse884 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (.cse879 (store |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| 1))) (or (= (select .cse879 (select .cse880 v_arrayElimCell_123)) 1) (= (select .cse879 (select .cse880 v_arrayElimCell_118)) 1) (= (select .cse879 (select .cse880 v_arrayElimCell_120)) 1) (= (select .cse879 (select (let ((.cse881 (store (store .cse882 .cse878 (store .cse883 v_arrayElimCell_121 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse881 (select (select .cse881 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_118)) 1)))))))))))) (.cse60 (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| Int) (v_arrayElimCell_121 Int) (v_arrayElimCell_119 Int) (v_arrayElimCell_118 Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|))) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_2990 (Array Int Int))) (let ((.cse874 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2990))) (let ((.cse875 (select (select .cse874 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (forall ((v_ArrVal_2980 (Array Int Int))) (let ((.cse872 (store |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| 1)) (.cse876 (select .cse874 .cse875))) (or (= (select .cse872 (select (let ((.cse873 (store (store .cse874 .cse875 (store .cse876 v_arrayElimCell_119 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse873 (select (select .cse873 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_118)) 1) (= (select .cse872 (select (let ((.cse877 (store (store .cse874 .cse875 (store .cse876 v_arrayElimCell_121 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse877 (select (select .cse877 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_118)) 1)))) (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse875)))))))) (.cse96 (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| Int) (v_arrayElimCell_120 Int) (v_arrayElimCell_119 Int) (v_arrayElimCell_118 Int)) (or (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|))) (forall ((v_ArrVal_2990 (Array Int Int))) (let ((.cse868 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2990))) (let ((.cse869 (select (select .cse868 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (forall ((v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int))) (let ((.cse870 (select .cse868 .cse869))) (let ((.cse866 (let ((.cse871 (store (store .cse868 .cse869 (store .cse870 v_arrayElimCell_119 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse871 (select (select .cse871 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (.cse865 (store |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| 1))) (or (= (select .cse865 (select .cse866 v_arrayElimCell_123)) 1) (= (select .cse865 (select .cse866 v_arrayElimCell_118)) 1) (= (select .cse865 (select (let ((.cse867 (store (store .cse868 .cse869 (store .cse870 v_arrayElimCell_120 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse867 (select (select .cse867 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_120)) 1))))) (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse869))))) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| |c_#StackHeapBarrier|))))) (.cse61 (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| Int) (v_arrayElimCell_120 Int) (v_arrayElimCell_121 Int) (v_arrayElimCell_119 Int) (v_arrayElimCell_118 Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|))) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_2990 (Array Int Int))) (let ((.cse861 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2990))) (let ((.cse862 (select (select .cse861 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (forall ((v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int))) (let ((.cse863 (select .cse861 .cse862))) (let ((.cse858 (let ((.cse864 (store (store .cse861 .cse862 (store .cse863 v_arrayElimCell_119 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse864 (select (select .cse864 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (.cse857 (store |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| 1)) (.cse859 (let ((.cse860 (store (store .cse861 .cse862 (store .cse863 v_arrayElimCell_121 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse860 (select (select .cse860 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse857 (select .cse858 v_arrayElimCell_123)) 1) (= (select .cse857 (select .cse858 v_arrayElimCell_118)) 1) (= (select .cse857 (select .cse859 v_arrayElimCell_120)) 1) (= (select .cse857 (select .cse858 v_arrayElimCell_120)) 1) (= (select .cse857 (select .cse859 v_arrayElimCell_123)) 1) (= (select .cse857 (select .cse859 v_arrayElimCell_118)) 1))))) (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse862)))))))) (.cse63 (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| Int) (v_arrayElimCell_120 Int) (v_arrayElimCell_121 Int) (v_arrayElimCell_119 Int) (v_arrayElimCell_118 Int)) (or (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|))) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_2990 (Array Int Int))) (let ((.cse853 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2990))) (let ((.cse854 (select (select .cse853 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (forall ((v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int))) (let ((.cse855 (select .cse853 .cse854))) (let ((.cse850 (let ((.cse856 (store (store .cse853 .cse854 (store .cse855 v_arrayElimCell_119 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse856 (select (select .cse856 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (.cse849 (store |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| 1)) (.cse851 (let ((.cse852 (store (store .cse853 .cse854 (store .cse855 v_arrayElimCell_121 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse852 (select (select .cse852 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse849 (select .cse850 v_arrayElimCell_123)) 1) (= (select .cse849 (select .cse850 v_arrayElimCell_118)) 1) (= (select .cse849 (select .cse851 v_arrayElimCell_120)) 1) (= (select .cse849 (select .cse850 v_arrayElimCell_120)) 1) (= (select .cse849 (select .cse851 v_arrayElimCell_118)) 1))))) (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse854)))))))) (.cse62 (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| Int) (v_arrayElimCell_119 Int) (v_arrayElimCell_118 Int)) (or (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|))) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| |c_#StackHeapBarrier|)) (forall ((v_arrayElimCell_122 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int))) (let ((.cse844 (store |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| 1)) (.cse845 (let ((.cse846 (store (let ((.cse847 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2990))) (let ((.cse848 (select (select .cse847 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (store .cse847 .cse848 (store (select .cse847 .cse848) v_arrayElimCell_119 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse846 (select (select .cse846 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse844 (select .cse845 v_arrayElimCell_118)) 1) (= (select .cse844 (select .cse845 v_arrayElimCell_122)) 1))))))) (.cse68 (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| Int) (v_arrayElimCell_121 Int) (v_arrayElimCell_119 Int)) (or (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|) (forall ((v_ArrVal_2990 (Array Int Int))) (let ((.cse840 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2990))) (let ((.cse841 (select (select .cse840 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (forall ((v_arrayElimCell_122 Int) (v_ArrVal_2980 (Array Int Int))) (let ((.cse838 (store |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| 1)) (.cse842 (select .cse840 .cse841))) (or (= (select .cse838 (select (let ((.cse839 (store (store .cse840 .cse841 (store .cse842 v_arrayElimCell_119 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse839 (select (select .cse839 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_122)) 1) (forall ((v_arrayElimCell_123 Int)) (= (select .cse838 (select (let ((.cse843 (store (store .cse840 .cse841 (store .cse842 v_arrayElimCell_121 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse843 (select (select .cse843 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_123)) 1))))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse841)))))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|))) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| |c_#StackHeapBarrier|))))) (.cse208 (or .cse30 .cse28 .cse29 .cse119)) (.cse74 (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| Int) (v_arrayElimCell_121 Int) (v_arrayElimCell_119 Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|))) (forall ((v_ArrVal_2990 (Array Int Int))) (let ((.cse833 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2990))) (let ((.cse834 (select (select .cse833 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (forall ((v_arrayElimCell_122 Int) (v_ArrVal_2980 (Array Int Int))) (let ((.cse835 (select .cse833 .cse834))) (let ((.cse831 (store |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| 1)) (.cse836 (let ((.cse837 (store (store .cse833 .cse834 (store .cse835 v_arrayElimCell_121 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse837 (select (select .cse837 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse831 (select (let ((.cse832 (store (store .cse833 .cse834 (store .cse835 v_arrayElimCell_119 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse832 (select (select .cse832 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_122)) 1) (forall ((v_arrayElimCell_123 Int)) (= (select .cse831 (select .cse836 v_arrayElimCell_123)) 1)) (= (select .cse831 (select .cse836 v_arrayElimCell_122)) 1))))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse834)))))) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| |c_#StackHeapBarrier|))))) (.cse99 (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| Int) (v_arrayElimCell_120 Int) (v_arrayElimCell_119 Int) (v_arrayElimCell_118 Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|))) (forall ((v_ArrVal_2990 (Array Int Int))) (let ((.cse827 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2990))) (let ((.cse828 (select (select .cse827 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (forall ((v_ArrVal_2980 (Array Int Int))) (let ((.cse825 (store |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| 1)) (.cse829 (select .cse827 .cse828))) (or (= (select .cse825 (select (let ((.cse826 (store (store .cse827 .cse828 (store .cse829 v_arrayElimCell_119 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse826 (select (select .cse826 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_118)) 1) (= (select .cse825 (select (let ((.cse830 (store (store .cse827 .cse828 (store .cse829 v_arrayElimCell_120 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse830 (select (select .cse830 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_120)) 1)))) (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse828))))) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| |c_#StackHeapBarrier|))))) (.cse100 (or .cse28 (forall ((v_arrayElimCell_120 Int) (v_arrayElimCell_122 Int) (v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_119 Int)) (let ((.cse821 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2990)) (.cse822 (select v_ArrVal_2990 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse823 (select .cse821 .cse822))) (let ((.cse819 (let ((.cse824 (store (store .cse821 .cse822 (store .cse823 v_arrayElimCell_120 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse824 (select (select .cse824 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse21 (select .cse819 v_arrayElimCell_123)) 1) (= (select .cse21 (select (let ((.cse820 (store (store .cse821 .cse822 (store .cse823 v_arrayElimCell_119 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse820 (select (select .cse820 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_122)) 1) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse822)) (= (select .cse21 (select .cse819 v_arrayElimCell_122)) 1)))))) .cse29)) (.cse69 (forall ((v_arrayElimCell_120 Int) (v_arrayElimCell_121 Int) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_119 Int) (v_arrayElimCell_118 Int)) (let ((.cse812 (select v_ArrVal_2990 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse812) (forall ((v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int))) (let ((.cse816 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2990))) (let ((.cse817 (select .cse816 .cse812))) (let ((.cse813 (let ((.cse818 (store (store .cse816 .cse812 (store .cse817 v_arrayElimCell_121 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse818 (select (select .cse818 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (.cse814 (let ((.cse815 (store (store .cse816 .cse812 (store .cse817 v_arrayElimCell_119 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse815 (select (select .cse815 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse21 (select .cse813 v_arrayElimCell_118)) 1) (= (select .cse21 (select .cse813 v_arrayElimCell_120)) 1) (= (select .cse21 (select .cse814 v_arrayElimCell_118)) 1) (= (select .cse21 (select .cse813 v_arrayElimCell_123)) 1) (= (select .cse21 (select .cse814 v_arrayElimCell_123)) 1)))))))))) (.cse70 (forall ((v_arrayElimCell_120 Int) (v_arrayElimCell_121 Int) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_119 Int) (v_arrayElimCell_118 Int)) (let ((.cse809 (select v_ArrVal_2990 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (forall ((v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int))) (let ((.cse808 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2990))) (let ((.cse810 (select .cse808 .cse809))) (let ((.cse806 (let ((.cse811 (store (store .cse808 .cse809 (store .cse810 v_arrayElimCell_121 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse811 (select (select .cse811 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse21 (select .cse806 v_arrayElimCell_118)) 1) (= (select .cse21 (select .cse806 v_arrayElimCell_120)) 1) (= (select .cse21 (select .cse806 v_arrayElimCell_123)) 1) (= (select .cse21 (select (let ((.cse807 (store (store .cse808 .cse809 (store .cse810 v_arrayElimCell_119 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse807 (select (select .cse807 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_123)) 1)))))) (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse809))))) (.cse101 (or (forall ((v_arrayElimCell_120 Int) (v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_119 Int) (v_arrayElimCell_118 Int)) (let ((.cse803 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2990)) (.cse801 (select v_ArrVal_2990 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse804 (select .cse803 .cse801))) (let ((.cse800 (let ((.cse805 (store (store .cse803 .cse801 (store .cse804 v_arrayElimCell_120 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse805 (select (select .cse805 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse21 (select .cse800 v_arrayElimCell_118)) 1) (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse801) (= (select .cse21 (select .cse800 v_arrayElimCell_120)) 1) (= (select .cse21 (select (let ((.cse802 (store (store .cse803 .cse801 (store .cse804 v_arrayElimCell_119 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse802 (select (select .cse802 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_123)) 1)))))) .cse28 .cse29)) (.cse102 (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| Int) (v_arrayElimCell_120 Int) (v_arrayElimCell_119 Int)) (or (forall ((v_ArrVal_2990 (Array Int Int))) (let ((.cse796 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2990))) (let ((.cse797 (select (select .cse796 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (forall ((v_arrayElimCell_122 Int) (v_ArrVal_2980 (Array Int Int))) (let ((.cse794 (store |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| 1)) (.cse798 (select .cse796 .cse797))) (or (= (select .cse794 (select (let ((.cse795 (store (store .cse796 .cse797 (store .cse798 v_arrayElimCell_119 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse795 (select (select .cse795 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_122)) 1) (= (select .cse794 (select (let ((.cse799 (store (store .cse796 .cse797 (store .cse798 v_arrayElimCell_120 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse799 (select (select .cse799 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_122)) 1)))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse797)))))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|))) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| |c_#StackHeapBarrier|))))) (.cse77 (forall ((v_arrayElimCell_122 Int) (v_arrayElimCell_121 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_119 Int)) (let ((.cse790 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2990)) (.cse791 (select v_ArrVal_2990 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse792 (select .cse790 .cse791))) (or (= (select .cse21 (select (let ((.cse789 (store (store .cse790 .cse791 (store .cse792 v_arrayElimCell_119 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse789 (select (select .cse789 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_122)) 1) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse791)) (= (select .cse21 (select (let ((.cse793 (store (store .cse790 .cse791 (store .cse792 v_arrayElimCell_121 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse793 (select (select .cse793 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_122)) 1)))))) (.cse76 (forall ((v_arrayElimCell_121 Int) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_119 Int)) (let ((.cse783 (select v_ArrVal_2990 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse783)) (forall ((v_arrayElimCell_122 Int) (v_ArrVal_2980 (Array Int Int))) (let ((.cse786 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2990))) (let ((.cse787 (select .cse786 .cse783))) (let ((.cse784 (let ((.cse788 (store (store .cse786 .cse783 (store .cse787 v_arrayElimCell_121 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse788 (select (select .cse788 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (forall ((v_arrayElimCell_123 Int)) (= (select .cse21 (select .cse784 v_arrayElimCell_123)) 1)) (= (select .cse21 (select (let ((.cse785 (store (store .cse786 .cse783 (store .cse787 v_arrayElimCell_119 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse785 (select (select .cse785 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_122)) 1) (= (select .cse21 (select .cse784 v_arrayElimCell_122)) 1)))))))))) (.cse79 (forall ((v_arrayElimCell_121 Int) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_119 Int)) (let ((.cse780 (select v_ArrVal_2990 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (forall ((v_arrayElimCell_122 Int) (v_ArrVal_2980 (Array Int Int))) (let ((.cse779 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2990))) (let ((.cse781 (select .cse779 .cse780))) (let ((.cse777 (let ((.cse782 (store (store .cse779 .cse780 (store .cse781 v_arrayElimCell_121 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse782 (select (select .cse782 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (forall ((v_arrayElimCell_123 Int)) (or (= (select .cse21 (select .cse777 v_arrayElimCell_123)) 1) (= (select .cse21 (select (let ((.cse778 (store (store .cse779 .cse780 (store .cse781 v_arrayElimCell_119 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse778 (select (select .cse778 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_123)) 1))) (= (select .cse21 (select .cse777 v_arrayElimCell_122)) 1)))))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse780)))))) (.cse80 (forall ((v_arrayElimCell_121 Int) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_119 Int)) (let ((.cse770 (select v_ArrVal_2990 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse770)) (forall ((v_arrayElimCell_122 Int) (v_ArrVal_2980 (Array Int Int))) (let ((.cse774 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2990))) (let ((.cse775 (select .cse774 .cse770))) (let ((.cse772 (let ((.cse776 (store (store .cse774 .cse770 (store .cse775 v_arrayElimCell_119 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse776 (select (select .cse776 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (.cse771 (let ((.cse773 (store (store .cse774 .cse770 (store .cse775 v_arrayElimCell_121 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse773 (select (select .cse773 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (forall ((v_arrayElimCell_123 Int)) (or (= (select .cse21 (select .cse771 v_arrayElimCell_123)) 1) (= (select .cse21 (select .cse772 v_arrayElimCell_123)) 1))) (= (select .cse21 (select .cse772 v_arrayElimCell_122)) 1) (= (select .cse21 (select .cse771 v_arrayElimCell_122)) 1)))))))))) (.cse86 (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| Int) (v_arrayElimCell_120 Int) (v_arrayElimCell_121 Int) (v_arrayElimCell_119 Int) (v_arrayElimCell_118 Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|))) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_2990 (Array Int Int))) (let ((.cse767 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2990))) (let ((.cse762 (select (select .cse767 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse762) (forall ((v_ArrVal_2980 (Array Int Int))) (let ((.cse768 (select .cse767 .cse762))) (let ((.cse764 (let ((.cse769 (store (store .cse767 .cse762 (store .cse768 v_arrayElimCell_119 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse769 (select (select .cse769 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (.cse763 (store |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| 1)) (.cse765 (let ((.cse766 (store (store .cse767 .cse762 (store .cse768 v_arrayElimCell_121 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse766 (select (select .cse766 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse763 (select .cse764 v_arrayElimCell_118)) 1) (= (select .cse763 (select .cse765 v_arrayElimCell_120)) 1) (= (select .cse763 (select .cse764 v_arrayElimCell_120)) 1) (= (select .cse763 (select .cse765 v_arrayElimCell_118)) 1)))))))))))) (.cse87 (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| Int) (v_arrayElimCell_121 Int) (v_arrayElimCell_119 Int) (v_arrayElimCell_118 Int)) (or (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|))) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| |c_#StackHeapBarrier|)) (forall ((v_arrayElimCell_122 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int))) (let ((.cse758 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2990))) (let ((.cse759 (select (select .cse758 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse760 (select .cse758 .cse759))) (let ((.cse756 (let ((.cse761 (store (store .cse758 .cse759 (store .cse760 v_arrayElimCell_119 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse761 (select (select .cse761 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (.cse755 (store |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| 1))) (or (= (select .cse755 (select .cse756 v_arrayElimCell_118)) 1) (= (select .cse755 (select .cse756 v_arrayElimCell_122)) 1) (= (select .cse755 (select (let ((.cse757 (store (store .cse758 .cse759 (store .cse760 v_arrayElimCell_121 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse757 (select (select .cse757 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_122)) 1)))))))))) (.cse85 (forall ((v_arrayElimCell_121 Int) (v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_119 Int)) (let ((.cse751 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2990))) (let ((.cse752 (select (select .cse751 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse753 (select .cse751 .cse752)) (.cse754 (select v_ArrVal_2980 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (select .cse204 (select (select (store (store .cse751 .cse752 (store .cse753 v_arrayElimCell_119 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2980) .cse754) v_arrayElimCell_123)) 1) (= (select .cse204 (select (select (store (store .cse751 .cse752 (store .cse753 v_arrayElimCell_121 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2980) .cse754) v_arrayElimCell_123)) 1))))))) (.cse90 (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| Int) (v_arrayElimCell_120 Int) (v_arrayElimCell_121 Int) (v_arrayElimCell_119 Int) (v_arrayElimCell_118 Int)) (or (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|))) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int))) (let ((.cse748 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2990))) (let ((.cse746 (select (select .cse748 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse749 (select .cse748 .cse746))) (let ((.cse745 (let ((.cse750 (store (store .cse748 .cse746 (store .cse749 v_arrayElimCell_119 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse750 (select (select .cse750 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (.cse744 (store |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| 1))) (or (= (select .cse744 (select .cse745 v_arrayElimCell_118)) 1) (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse746) (= (select .cse744 (select .cse745 v_arrayElimCell_120)) 1) (= (select .cse744 (select (let ((.cse747 (store (store .cse748 .cse746 (store .cse749 v_arrayElimCell_121 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse747 (select (select .cse747 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_118)) 1)))))))))) (.cse108 (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| Int) (v_arrayElimCell_120 Int) (v_arrayElimCell_119 Int) (v_arrayElimCell_118 Int)) (or (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|))) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| |c_#StackHeapBarrier|)) (forall ((v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int))) (let ((.cse741 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2990))) (let ((.cse739 (select (select .cse741 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse742 (select .cse741 .cse739))) (let ((.cse737 (let ((.cse743 (store (store .cse741 .cse739 (store .cse742 v_arrayElimCell_119 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse743 (select (select .cse743 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (.cse736 (store |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| 1)) (.cse738 (let ((.cse740 (store (store .cse741 .cse739 (store .cse742 v_arrayElimCell_120 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse740 (select (select .cse740 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse736 (select .cse737 v_arrayElimCell_123)) 1) (= (select .cse736 (select .cse737 v_arrayElimCell_118)) 1) (= (select .cse736 (select .cse738 v_arrayElimCell_123)) 1) (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse739) (= (select .cse736 (select .cse737 v_arrayElimCell_120)) 1) (= (select .cse736 (select .cse738 v_arrayElimCell_118)) 1)))))))))) (.cse91 (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| Int) (v_arrayElimCell_120 Int) (v_arrayElimCell_119 Int) (v_arrayElimCell_118 Int)) (or (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|))) (forall ((v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int))) (let ((.cse735 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2990))) (let ((.cse733 (select (select .cse735 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse731 (store |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| 1)) (.cse732 (let ((.cse734 (store (store .cse735 .cse733 (store (select .cse735 .cse733) v_arrayElimCell_119 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse734 (select (select .cse734 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse731 (select .cse732 v_arrayElimCell_118)) 1) (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse733) (= (select .cse731 (select .cse732 v_arrayElimCell_120)) 1)))))) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| |c_#StackHeapBarrier|))))) (.cse116 (forall ((v_arrayElimCell_120 Int) (v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_119 Int)) (let ((.cse728 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2990))) (let ((.cse726 (select (select .cse728 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse729 (select .cse728 .cse726)) (.cse730 (select v_ArrVal_2980 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse727 (select (store (store .cse728 .cse726 (store .cse729 v_arrayElimCell_119 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2980) .cse730))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse726) (= (select .cse204 (select .cse727 v_arrayElimCell_123)) 1) (= (select .cse204 (select .cse727 v_arrayElimCell_120)) 1) (= (select .cse204 (select (select (store (store .cse728 .cse726 (store .cse729 v_arrayElimCell_120 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2980) .cse730) v_arrayElimCell_123)) 1)))))))) (.cse109 (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| Int) (v_arrayElimCell_120 Int) (v_arrayElimCell_119 Int)) (or (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|))) (forall ((v_ArrVal_2990 (Array Int Int))) (let ((.cse722 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2990))) (let ((.cse723 (select (select .cse722 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (forall ((v_arrayElimCell_122 Int) (v_ArrVal_2980 (Array Int Int))) (let ((.cse724 (select .cse722 .cse723))) (let ((.cse719 (store |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| 1)) (.cse720 (let ((.cse725 (store (store .cse722 .cse723 (store .cse724 v_arrayElimCell_119 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse725 (select (select .cse725 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (forall ((v_arrayElimCell_123 Int)) (or (= (select .cse719 (select .cse720 v_arrayElimCell_123)) 1) (= (select .cse719 (select (let ((.cse721 (store (store .cse722 .cse723 (store .cse724 v_arrayElimCell_120 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse721 (select (select .cse721 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_123)) 1))) (= (select .cse719 (select .cse720 v_arrayElimCell_122)) 1))))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse723)))))) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| |c_#StackHeapBarrier|))))) (.cse92 (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| Int) (v_arrayElimCell_121 Int) (v_arrayElimCell_119 Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|))) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_2990 (Array Int Int))) (let ((.cse715 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2990))) (let ((.cse716 (select (select .cse715 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (forall ((v_arrayElimCell_122 Int) (v_ArrVal_2980 (Array Int Int))) (let ((.cse717 (select .cse715 .cse716))) (let ((.cse712 (let ((.cse718 (store (store .cse715 .cse716 (store .cse717 v_arrayElimCell_119 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse718 (select (select .cse718 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (.cse711 (store |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| 1)) (.cse713 (let ((.cse714 (store (store .cse715 .cse716 (store .cse717 v_arrayElimCell_121 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse714 (select (select .cse714 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse711 (select .cse712 v_arrayElimCell_122)) 1) (= (select .cse711 (select .cse713 v_arrayElimCell_122)) 1) (forall ((v_arrayElimCell_123 Int)) (or (= (select .cse711 (select .cse712 v_arrayElimCell_123)) 1) (= (select .cse711 (select .cse713 v_arrayElimCell_123)) 1))))))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse716))))))))) (.cse111 (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| Int) (v_arrayElimCell_120 Int) (v_arrayElimCell_119 Int) (v_arrayElimCell_118 Int)) (or (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|))) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| |c_#StackHeapBarrier|)) (forall ((v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int))) (let ((.cse707 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2990))) (let ((.cse708 (select (select .cse707 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse709 (select .cse707 .cse708))) (let ((.cse704 (store |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| 1)) (.cse705 (let ((.cse710 (store (store .cse707 .cse708 (store .cse709 v_arrayElimCell_119 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse710 (select (select .cse710 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse704 (select .cse705 v_arrayElimCell_123)) 1) (= (select .cse704 (select .cse705 v_arrayElimCell_118)) 1) (= (select .cse704 (select (let ((.cse706 (store (store .cse707 .cse708 (store .cse709 v_arrayElimCell_120 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse706 (select (select .cse706 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_123)) 1) (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse708) (= (select .cse704 (select .cse705 v_arrayElimCell_120)) 1)))))))))) (.cse113 (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| Int) (v_arrayElimCell_120 Int) (v_arrayElimCell_119 Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|))) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| |c_#StackHeapBarrier|)) (forall ((v_arrayElimCell_122 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int))) (let ((.cse700 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2990))) (let ((.cse701 (select (select .cse700 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse698 (store |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| 1)) (.cse702 (select .cse700 .cse701))) (or (= (select .cse698 (select (let ((.cse699 (store (store .cse700 .cse701 (store .cse702 v_arrayElimCell_119 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse699 (select (select .cse699 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_122)) 1) (= (select .cse698 (select (let ((.cse703 (store (store .cse700 .cse701 (store .cse702 v_arrayElimCell_120 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse703 (select (select .cse703 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_122)) 1) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse701)))))))))) (.cse114 (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| Int) (v_arrayElimCell_120 Int) (v_arrayElimCell_119 Int) (v_arrayElimCell_118 Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|))) (forall ((v_ArrVal_2990 (Array Int Int))) (let ((.cse694 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2990))) (let ((.cse695 (select (select .cse694 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (forall ((v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int))) (let ((.cse696 (select .cse694 .cse695))) (let ((.cse692 (let ((.cse697 (store (store .cse694 .cse695 (store .cse696 v_arrayElimCell_119 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse697 (select (select .cse697 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (.cse691 (store |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| 1))) (or (= (select .cse691 (select .cse692 v_arrayElimCell_123)) 1) (= (select .cse691 (select .cse692 v_arrayElimCell_118)) 1) (= (select .cse691 (select (let ((.cse693 (store (store .cse694 .cse695 (store .cse696 v_arrayElimCell_120 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse693 (select (select .cse693 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_120)) 1))))) (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse695))))) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| |c_#StackHeapBarrier|))))) (.cse48 (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| Int) (v_arrayElimCell_121 Int) (v_arrayElimCell_119 Int)) (or (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|))) (forall ((v_ArrVal_2990 (Array Int Int))) (let ((.cse687 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2990))) (let ((.cse688 (select (select .cse687 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (forall ((v_arrayElimCell_122 Int) (v_ArrVal_2980 (Array Int Int))) (let ((.cse689 (select .cse687 .cse688))) (let ((.cse685 (let ((.cse690 (store (store .cse687 .cse688 (store .cse689 v_arrayElimCell_119 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse690 (select (select .cse690 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (.cse684 (store |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| 1))) (or (= (select .cse684 (select .cse685 v_arrayElimCell_122)) 1) (forall ((v_arrayElimCell_123 Int)) (or (= (select .cse684 (select .cse685 v_arrayElimCell_123)) 1) (= (select .cse684 (select (let ((.cse686 (store (store .cse687 .cse688 (store .cse689 v_arrayElimCell_121 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse686 (select (select .cse686 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_123)) 1))))))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse688)))))) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| |c_#StackHeapBarrier|))))) (.cse38 (and .cse623 (forall ((v_arrayElimCell_120 Int) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_119 Int)) (let ((.cse681 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2990))) (let ((.cse680 (select (select .cse681 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse680) (forall ((v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int))) (let ((.cse682 (select .cse681 .cse680)) (.cse683 (select v_ArrVal_2980 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (select .cse204 (select (select (store (store .cse681 .cse680 (store .cse682 v_arrayElimCell_119 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2980) .cse683) v_arrayElimCell_123)) 1) (= (select .cse204 (select (select (store (store .cse681 .cse680 (store .cse682 v_arrayElimCell_120 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2980) .cse683) v_arrayElimCell_120)) 1)))))))))) (.cse50 (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| Int) (v_arrayElimCell_120 Int) (v_arrayElimCell_121 Int) (v_arrayElimCell_119 Int) (v_arrayElimCell_118 Int)) (or (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|))) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| |c_#StackHeapBarrier|)) (forall ((v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int))) (let ((.cse677 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2990))) (let ((.cse674 (select (select .cse677 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse678 (select .cse677 .cse674))) (let ((.cse673 (let ((.cse679 (store (store .cse677 .cse674 (store .cse678 v_arrayElimCell_119 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse679 (select (select .cse679 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (.cse672 (store |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| 1)) (.cse675 (let ((.cse676 (store (store .cse677 .cse674 (store .cse678 v_arrayElimCell_121 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse676 (select (select .cse676 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse672 (select .cse673 v_arrayElimCell_123)) 1) (= (select .cse672 (select .cse673 v_arrayElimCell_118)) 1) (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse674) (= (select .cse672 (select .cse673 v_arrayElimCell_120)) 1) (= (select .cse672 (select .cse675 v_arrayElimCell_123)) 1) (= (select .cse672 (select .cse675 v_arrayElimCell_118)) 1)))))))))) (.cse121 (or .cse30 .cse95 .cse28 .cse29)) (.cse117 (forall ((v_arrayElimCell_120 Int) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_119 Int) (v_arrayElimCell_118 Int)) (let ((.cse668 (select v_ArrVal_2990 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (forall ((v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int))) (let ((.cse667 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2990))) (let ((.cse669 (select .cse667 .cse668))) (let ((.cse670 (let ((.cse671 (store (store .cse667 .cse668 (store .cse669 v_arrayElimCell_119 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse671 (select (select .cse671 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse21 (select (let ((.cse666 (store (store .cse667 .cse668 (store .cse669 v_arrayElimCell_120 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse666 (select (select .cse666 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_120)) 1) (= (select .cse21 (select .cse670 v_arrayElimCell_118)) 1) (= (select .cse21 (select .cse670 v_arrayElimCell_123)) 1)))))) (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse668))))) (.cse118 (forall ((v_arrayElimCell_120 Int) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_119 Int) (v_arrayElimCell_118 Int)) (let ((.cse660 (select v_ArrVal_2990 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse660) (forall ((v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int))) (let ((.cse663 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2990))) (let ((.cse664 (select .cse663 .cse660))) (let ((.cse661 (let ((.cse665 (store (store .cse663 .cse660 (store .cse664 v_arrayElimCell_120 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse665 (select (select .cse665 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse21 (select .cse661 v_arrayElimCell_118)) 1) (= (select .cse21 (select .cse661 v_arrayElimCell_120)) 1) (= (select .cse21 (select (let ((.cse662 (store (store .cse663 .cse660 (store .cse664 v_arrayElimCell_119 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse662 (select (select .cse662 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_123)) 1)))))))))) (.cse71 (forall ((v_arrayElimCell_120 Int) (v_arrayElimCell_121 Int) (v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_119 Int)) (let ((.cse657 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2990))) (let ((.cse655 (select (select .cse657 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse658 (select .cse657 .cse655)) (.cse659 (select v_ArrVal_2980 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse656 (select (store (store .cse657 .cse655 (store .cse658 v_arrayElimCell_119 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2980) .cse659))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse655) (= (select .cse204 (select .cse656 v_arrayElimCell_123)) 1) (= (select .cse204 (select .cse656 v_arrayElimCell_120)) 1) (= (select .cse204 (select (select (store (store .cse657 .cse655 (store .cse658 v_arrayElimCell_121 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2980) .cse659) v_arrayElimCell_123)) 1)))))))) (.cse72 (forall ((v_arrayElimCell_120 Int) (v_arrayElimCell_121 Int) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_119 Int)) (let ((.cse651 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2990))) (let ((.cse652 (select (select .cse651 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (forall ((v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int))) (let ((.cse653 (select .cse651 .cse652)) (.cse654 (select v_ArrVal_2980 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse649 (select (store (store .cse651 .cse652 (store .cse653 v_arrayElimCell_119 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2980) .cse654)) (.cse650 (select (store (store .cse651 .cse652 (store .cse653 v_arrayElimCell_121 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2980) .cse654))) (or (= (select .cse204 (select .cse649 v_arrayElimCell_123)) 1) (= (select .cse204 (select .cse649 v_arrayElimCell_120)) 1) (= (select .cse204 (select .cse650 v_arrayElimCell_123)) 1) (= (select .cse204 (select .cse650 v_arrayElimCell_120)) 1))))) (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse652)))))) (.cse39 (or .cse37 .cse73 (forall ((v_arrayElimCell_120 Int) (v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_119 Int)) (let ((.cse646 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2990))) (let ((.cse645 (select (select .cse646 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse647 (select .cse646 .cse645)) (.cse648 (select v_ArrVal_2980 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse645) (= (select .cse204 (select (select (store (store .cse646 .cse645 (store .cse647 v_arrayElimCell_119 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2980) .cse648) v_arrayElimCell_123)) 1) (= (select .cse204 (select (select (store (store .cse646 .cse645 (store .cse647 v_arrayElimCell_120 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2980) .cse648) v_arrayElimCell_123)) 1)))))))) (.cse40 (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| Int) (v_arrayElimCell_120 Int) (v_arrayElimCell_119 Int) (v_arrayElimCell_118 Int)) (or (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|) (forall ((v_ArrVal_2990 (Array Int Int))) (let ((.cse641 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2990))) (let ((.cse642 (select (select .cse641 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (forall ((v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int))) (let ((.cse643 (select .cse641 .cse642))) (let ((.cse639 (let ((.cse644 (store (store .cse641 .cse642 (store .cse643 v_arrayElimCell_119 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse644 (select (select .cse644 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (.cse638 (store |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| 1))) (or (= (select .cse638 (select .cse639 v_arrayElimCell_123)) 1) (= (select .cse638 (select .cse639 v_arrayElimCell_118)) 1) (= (select .cse638 (select .cse639 v_arrayElimCell_120)) 1) (= (select .cse638 (select (let ((.cse640 (store (store .cse641 .cse642 (store .cse643 v_arrayElimCell_120 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse640 (select (select .cse640 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_118)) 1))))) (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse642))))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|))) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| |c_#StackHeapBarrier|))))) (.cse54 (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| Int) (v_arrayElimCell_119 Int) (v_arrayElimCell_118 Int)) (or (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|))) (forall ((v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int))) (let ((.cse636 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2990))) (let ((.cse637 (select (select .cse636 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= (select (store |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| 1) (select (let ((.cse635 (store (store .cse636 .cse637 (store (select .cse636 .cse637) v_arrayElimCell_119 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse635 (select (select .cse635 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_118)) 1) (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse637))))) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| |c_#StackHeapBarrier|))))) (.cse55 (forall ((v_arrayElimCell_122 Int) (v_arrayElimCell_121 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_119 Int) (v_arrayElimCell_118 Int)) (let ((.cse631 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2990)) (.cse632 (select v_ArrVal_2990 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse633 (select .cse631 .cse632))) (let ((.cse629 (let ((.cse634 (store (store .cse631 .cse632 (store .cse633 v_arrayElimCell_121 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse634 (select (select .cse634 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse21 (select .cse629 v_arrayElimCell_118)) 1) (= (select .cse21 (select (let ((.cse630 (store (store .cse631 .cse632 (store .cse633 v_arrayElimCell_119 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse630 (select (select .cse630 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_122)) 1) (= (select .cse21 (select .cse629 v_arrayElimCell_122)) 1))))))) (.cse89 (and .cse623 (forall ((v_arrayElimCell_120 Int) (v_arrayElimCell_121 Int) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_119 Int)) (let ((.cse626 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2990))) (let ((.cse624 (select (select .cse626 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse624) (forall ((v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int))) (let ((.cse627 (select .cse626 .cse624)) (.cse628 (select v_ArrVal_2980 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse625 (select (store (store .cse626 .cse624 (store .cse627 v_arrayElimCell_119 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2980) .cse628))) (or (= (select .cse204 (select .cse625 v_arrayElimCell_123)) 1) (= (select .cse204 (select .cse625 v_arrayElimCell_120)) 1) (= (select .cse204 (select (select (store (store .cse626 .cse624 (store .cse627 v_arrayElimCell_121 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2980) .cse628) v_arrayElimCell_120)) 1))))))))))) (.cse120 (forall ((v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_119 Int)) (let ((.cse622 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2990))) (let ((.cse621 (select (select .cse622 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse621) (= (select .cse204 (select (select (store (store .cse622 .cse621 (store (select .cse622 .cse621) v_arrayElimCell_119 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2980) (select v_ArrVal_2980 |c_ULTIMATE.start_main_~#s~0#1.offset|)) v_arrayElimCell_123)) 1)))))) (.cse209 (or .cse30 .cse28 .cse31 .cse29)) (.cse98 (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| Int) (v_arrayElimCell_120 Int) (v_arrayElimCell_119 Int) (v_arrayElimCell_118 Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|))) (forall ((v_arrayElimCell_122 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int))) (let ((.cse617 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2990))) (let ((.cse618 (select (select .cse617 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse619 (select .cse617 .cse618))) (let ((.cse614 (let ((.cse620 (store (store .cse617 .cse618 (store .cse619 v_arrayElimCell_119 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse620 (select (select .cse620 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (.cse613 (store |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| 1)) (.cse615 (let ((.cse616 (store (store .cse617 .cse618 (store .cse619 v_arrayElimCell_120 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse616 (select (select .cse616 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse613 (select .cse614 v_arrayElimCell_118)) 1) (= (select .cse613 (select .cse614 v_arrayElimCell_122)) 1) (= (select .cse613 (select .cse615 v_arrayElimCell_122)) 1) (= (select .cse613 (select .cse615 v_arrayElimCell_118)) 1))))))) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| |c_#StackHeapBarrier|))))) (.cse75 (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| Int) (v_arrayElimCell_121 Int) (v_arrayElimCell_119 Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|))) (forall ((v_ArrVal_2990 (Array Int Int))) (let ((.cse609 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2990))) (let ((.cse610 (select (select .cse609 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (forall ((v_arrayElimCell_122 Int) (v_ArrVal_2980 (Array Int Int))) (let ((.cse607 (store |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| 1)) (.cse611 (select .cse609 .cse610))) (or (= (select .cse607 (select (let ((.cse608 (store (store .cse609 .cse610 (store .cse611 v_arrayElimCell_119 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse608 (select (select .cse608 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_122)) 1) (= (select .cse607 (select (let ((.cse612 (store (store .cse609 .cse610 (store .cse611 v_arrayElimCell_121 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse612 (select (select .cse612 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_122)) 1)))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse610)))))) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| |c_#StackHeapBarrier|))))) (.cse82 (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| Int) (v_arrayElimCell_119 Int)) (or (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|))) (forall ((v_arrayElimCell_122 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int))) (let ((.cse605 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2990))) (let ((.cse606 (select (select .cse605 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= (select (store |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| 1) (select (let ((.cse604 (store (store .cse605 .cse606 (store (select .cse605 .cse606) v_arrayElimCell_119 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse604 (select (select .cse604 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_122)) 1) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse606)))))) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| |c_#StackHeapBarrier|))))) (.cse105 (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| Int) (v_arrayElimCell_120 Int) (v_arrayElimCell_119 Int) (v_arrayElimCell_118 Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|))) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|) (forall ((v_ArrVal_2990 (Array Int Int))) (let ((.cse601 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2990))) (let ((.cse598 (select (select .cse601 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse598) (forall ((v_ArrVal_2980 (Array Int Int))) (let ((.cse599 (store |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| 1)) (.cse602 (select .cse601 .cse598))) (or (= (select .cse599 (select (let ((.cse600 (store (store .cse601 .cse598 (store .cse602 v_arrayElimCell_119 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse600 (select (select .cse600 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_118)) 1) (= (select .cse599 (select (let ((.cse603 (store (store .cse601 .cse598 (store .cse602 v_arrayElimCell_120 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse603 (select (select .cse603 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_118)) 1)))))))) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| |c_#StackHeapBarrier|))))) (.cse97 (forall ((v_arrayElimCell_120 Int) (v_arrayElimCell_122 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_119 Int) (v_arrayElimCell_118 Int)) (let ((.cse594 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2990)) (.cse595 (select v_ArrVal_2990 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse596 (select .cse594 .cse595))) (let ((.cse592 (let ((.cse597 (store (store .cse594 .cse595 (store .cse596 v_arrayElimCell_120 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse597 (select (select .cse597 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse21 (select .cse592 v_arrayElimCell_118)) 1) (= (select .cse21 (select (let ((.cse593 (store (store .cse594 .cse595 (store .cse596 v_arrayElimCell_119 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse593 (select (select .cse593 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_122)) 1) (= (select .cse21 (select .cse592 v_arrayElimCell_122)) 1))))))) (.cse106 (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| Int) (v_arrayElimCell_120 Int) (v_arrayElimCell_119 Int)) (or (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|))) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_2990 (Array Int Int))) (let ((.cse588 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2990))) (let ((.cse589 (select (select .cse588 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (forall ((v_arrayElimCell_122 Int) (v_ArrVal_2980 (Array Int Int))) (let ((.cse586 (store |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| 1)) (.cse590 (select .cse588 .cse589))) (or (forall ((v_arrayElimCell_123 Int)) (= (select .cse586 (select (let ((.cse587 (store (store .cse588 .cse589 (store .cse590 v_arrayElimCell_120 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse587 (select (select .cse587 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_123)) 1)) (= (select .cse586 (select (let ((.cse591 (store (store .cse588 .cse589 (store .cse590 v_arrayElimCell_119 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse591 (select (select .cse591 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_122)) 1)))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse589))))))))) (.cse110 (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| Int) (v_arrayElimCell_120 Int) (v_arrayElimCell_119 Int)) (or (forall ((v_ArrVal_2990 (Array Int Int))) (let ((.cse582 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2990))) (let ((.cse583 (select (select .cse582 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (forall ((v_arrayElimCell_122 Int) (v_ArrVal_2980 (Array Int Int))) (let ((.cse584 (select .cse582 .cse583))) (let ((.cse579 (let ((.cse585 (store (store .cse582 .cse583 (store .cse584 v_arrayElimCell_119 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse585 (select (select .cse585 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (.cse578 (store |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| 1)) (.cse580 (let ((.cse581 (store (store .cse582 .cse583 (store .cse584 v_arrayElimCell_120 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse581 (select (select .cse581 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (forall ((v_arrayElimCell_123 Int)) (or (= (select .cse578 (select .cse579 v_arrayElimCell_123)) 1) (= (select .cse578 (select .cse580 v_arrayElimCell_123)) 1))) (= (select .cse578 (select .cse579 v_arrayElimCell_122)) 1) (= (select .cse578 (select .cse580 v_arrayElimCell_122)) 1))))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse583)))))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|))) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| |c_#StackHeapBarrier|))))) (.cse112 (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| Int) (v_arrayElimCell_120 Int) (v_arrayElimCell_119 Int) (v_arrayElimCell_118 Int)) (or (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|))) (forall ((v_arrayElimCell_122 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int))) (let ((.cse574 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2990))) (let ((.cse575 (select (select .cse574 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse576 (select .cse574 .cse575))) (let ((.cse572 (let ((.cse577 (store (store .cse574 .cse575 (store .cse576 v_arrayElimCell_119 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse577 (select (select .cse577 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (.cse571 (store |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| 1))) (or (= (select .cse571 (select .cse572 v_arrayElimCell_118)) 1) (= (select .cse571 (select .cse572 v_arrayElimCell_122)) 1) (= (select .cse571 (select (let ((.cse573 (store (store .cse574 .cse575 (store .cse576 v_arrayElimCell_120 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse573 (select (select .cse573 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_122)) 1))))))) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| |c_#StackHeapBarrier|))))) (.cse93 (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| Int) (v_arrayElimCell_120 Int) (v_arrayElimCell_119 Int) (v_arrayElimCell_118 Int)) (or (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|))) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_2990 (Array Int Int))) (let ((.cse569 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2990))) (let ((.cse570 (select (select .cse569 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (forall ((v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int))) (let ((.cse566 (store |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| 1)) (.cse567 (let ((.cse568 (store (store .cse569 .cse570 (store (select .cse569 .cse570) v_arrayElimCell_119 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse568 (select (select .cse568 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse566 (select .cse567 v_arrayElimCell_123)) 1) (= (select .cse566 (select .cse567 v_arrayElimCell_118)) 1) (= (select .cse566 (select .cse567 v_arrayElimCell_120)) 1)))) (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse570)))))))) (.cse88 (forall ((v_arrayElimCell_120 Int) (v_arrayElimCell_121 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_119 Int) (v_arrayElimCell_118 Int)) (let ((.cse563 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2990)) (.cse560 (select v_ArrVal_2990 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse564 (select .cse563 .cse560))) (let ((.cse561 (let ((.cse565 (store (store .cse563 .cse560 (store .cse564 v_arrayElimCell_121 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse565 (select (select .cse565 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse560) (= (select .cse21 (select .cse561 v_arrayElimCell_118)) 1) (= (select .cse21 (select .cse561 v_arrayElimCell_120)) 1) (= (select .cse21 (select (let ((.cse562 (store (store .cse563 .cse560 (store .cse564 v_arrayElimCell_119 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse562 (select (select .cse562 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_120)) 1))))))) (.cse41 (forall ((v_arrayElimCell_120 Int) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_119 Int)) (let ((.cse557 (select v_ArrVal_2990 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (forall ((v_arrayElimCell_122 Int) (v_ArrVal_2980 (Array Int Int))) (let ((.cse556 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2990))) (let ((.cse558 (select .cse556 .cse557))) (let ((.cse554 (let ((.cse559 (store (store .cse556 .cse557 (store .cse558 v_arrayElimCell_120 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse559 (select (select .cse559 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (forall ((v_arrayElimCell_123 Int)) (= (select .cse21 (select .cse554 v_arrayElimCell_123)) 1)) (= (select .cse21 (select (let ((.cse555 (store (store .cse556 .cse557 (store .cse558 v_arrayElimCell_119 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse555 (select (select .cse555 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_122)) 1) (= (select .cse21 (select .cse554 v_arrayElimCell_122)) 1)))))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse557)))))) (.cse43 (forall ((v_arrayElimCell_120 Int) (v_arrayElimCell_122 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_119 Int)) (let ((.cse550 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2990)) (.cse551 (select v_ArrVal_2990 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse552 (select .cse550 .cse551))) (or (= (select .cse21 (select (let ((.cse549 (store (store .cse550 .cse551 (store .cse552 v_arrayElimCell_119 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse549 (select (select .cse549 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_122)) 1) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse551)) (= (select .cse21 (select (let ((.cse553 (store (store .cse550 .cse551 (store .cse552 v_arrayElimCell_120 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse553 (select (select .cse553 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_122)) 1)))))) (.cse44 (forall ((v_arrayElimCell_120 Int) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_119 Int)) (let ((.cse546 (select v_ArrVal_2990 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (forall ((v_arrayElimCell_122 Int) (v_ArrVal_2980 (Array Int Int))) (let ((.cse545 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2990))) (let ((.cse547 (select .cse545 .cse546))) (let ((.cse543 (let ((.cse548 (store (store .cse545 .cse546 (store .cse547 v_arrayElimCell_120 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse548 (select (select .cse548 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse21 (select .cse543 v_arrayElimCell_122)) 1) (forall ((v_arrayElimCell_123 Int)) (or (= (select .cse21 (select .cse543 v_arrayElimCell_123)) 1) (= (select .cse21 (select (let ((.cse544 (store (store .cse545 .cse546 (store .cse547 v_arrayElimCell_119 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse544 (select (select .cse544 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_123)) 1)))))))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse546)))))) (.cse153 (or .cse30 .cse42)) (.cse45 (forall ((v_arrayElimCell_120 Int) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_119 Int)) (let ((.cse540 (select v_ArrVal_2990 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (forall ((v_arrayElimCell_122 Int) (v_ArrVal_2980 (Array Int Int))) (let ((.cse539 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2990))) (let ((.cse541 (select .cse539 .cse540))) (let ((.cse537 (let ((.cse542 (store (store .cse539 .cse540 (store .cse541 v_arrayElimCell_120 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse542 (select (select .cse542 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (.cse536 (let ((.cse538 (store (store .cse539 .cse540 (store .cse541 v_arrayElimCell_119 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse538 (select (select .cse538 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse21 (select .cse536 v_arrayElimCell_122)) 1) (= (select .cse21 (select .cse537 v_arrayElimCell_122)) 1) (forall ((v_arrayElimCell_123 Int)) (or (= (select .cse21 (select .cse537 v_arrayElimCell_123)) 1) (= (select .cse21 (select .cse536 v_arrayElimCell_123)) 1)))))))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse540)))))) (.cse46 (forall ((v_arrayElimCell_120 Int) (v_ArrVal_2990 (Array Int Int))) (let ((.cse535 (select v_ArrVal_2990 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (forall ((v_arrayElimCell_122 Int) (v_ArrVal_2980 (Array Int Int))) (let ((.cse532 (let ((.cse533 (store (let ((.cse534 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2990))) (store .cse534 .cse535 (store (select .cse534 .cse535) v_arrayElimCell_120 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|))) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse533 (select (select .cse533 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (forall ((v_arrayElimCell_123 Int)) (= (select .cse21 (select .cse532 v_arrayElimCell_123)) 1)) (= (select .cse21 (select .cse532 v_arrayElimCell_122)) 1)))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse535)))))) (.cse115 (forall ((v_arrayElimCell_120 Int) (v_ArrVal_2990 (Array Int Int))) (let ((.cse531 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2990))) (let ((.cse529 (select (select .cse531 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse529) (forall ((v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int))) (let ((.cse530 (select (store (store .cse531 .cse529 (store (select .cse531 .cse529) v_arrayElimCell_120 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2980) (select v_ArrVal_2980 |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (or (= (select .cse204 (select .cse530 v_arrayElimCell_123)) 1) (= (select .cse204 (select .cse530 v_arrayElimCell_120)) 1))))))))) (.cse211 (or .cse30 .cse28 .cse59 .cse29)) (.cse234 (or .cse30 .cse28 .cse29 .cse83)) (.cse128 (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| Int) (v_arrayElimCell_118 Int)) (or (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|))) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| |c_#StackHeapBarrier|)) (forall ((v_arrayElimCell_122 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int))) (let ((.cse524 (store |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| 1)) (.cse525 (let ((.cse526 (store (let ((.cse527 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2990))) (let ((.cse528 (select (select .cse527 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (store .cse527 .cse528 (store (select .cse527 .cse528) v_arrayElimCell_118 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse526 (select (select .cse526 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse524 (select .cse525 v_arrayElimCell_118)) 1) (= (select .cse524 (select .cse525 v_arrayElimCell_122)) 1))))))) (.cse64 (forall ((v_arrayElimCell_120 Int) (v_arrayElimCell_121 Int) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_118 Int)) (let ((.cse520 (select v_ArrVal_2990 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse520) (forall ((v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int))) (let ((.cse521 (let ((.cse522 (store (let ((.cse523 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2990))) (store .cse523 .cse520 (store (select .cse523 .cse520) v_arrayElimCell_121 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|))) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse522 (select (select .cse522 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse21 (select .cse521 v_arrayElimCell_118)) 1) (= (select .cse21 (select .cse521 v_arrayElimCell_120)) 1) (= (select .cse21 (select .cse521 v_arrayElimCell_123)) 1)))))))) (.cse212 (or (forall ((v_arrayElimCell_120 Int) (v_arrayElimCell_121 Int) (v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int))) (let ((.cse516 (select v_ArrVal_2990 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse517 (let ((.cse518 (store (let ((.cse519 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2990))) (store .cse519 .cse516 (store (select .cse519 .cse516) v_arrayElimCell_121 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|))) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse518 (select (select .cse518 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse516) (= (select .cse21 (select .cse517 v_arrayElimCell_120)) 1) (= (select .cse21 (select .cse517 v_arrayElimCell_123)) 1))))) .cse180)) (.cse219 (or .cse180 (forall ((v_arrayElimCell_121 Int) (v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int))) (let ((.cse513 (select v_ArrVal_2990 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse513) (= (select .cse21 (select (let ((.cse514 (store (let ((.cse515 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2990))) (store .cse515 .cse513 (store (select .cse515 .cse513) v_arrayElimCell_121 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|))) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse514 (select (select .cse514 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_123)) 1)))))) (.cse235 (or .cse51 .cse30 .cse28 .cse29)) (.cse201 (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| Int) (v_arrayElimCell_120 Int) (v_arrayElimCell_118 Int)) (or (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|))) (forall ((v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int))) (let ((.cse512 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2990))) (let ((.cse508 (select (select .cse512 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse509 (store |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| 1)) (.cse510 (let ((.cse511 (store (store .cse512 .cse508 (store (select .cse512 .cse508) v_arrayElimCell_118 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse511 (select (select .cse511 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse508) (= (select .cse509 (select .cse510 v_arrayElimCell_120)) 1) (= (select .cse509 (select .cse510 v_arrayElimCell_118)) 1)))))) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| |c_#StackHeapBarrier|))))) (.cse226 (or .cse30 .cse78)) (.cse81 (forall ((v_arrayElimCell_121 Int) (v_ArrVal_2990 (Array Int Int))) (let ((.cse507 (select v_ArrVal_2990 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (forall ((v_arrayElimCell_122 Int) (v_ArrVal_2980 (Array Int Int))) (let ((.cse504 (let ((.cse505 (store (let ((.cse506 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2990))) (store .cse506 .cse507 (store (select .cse506 .cse507) v_arrayElimCell_121 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|))) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse505 (select (select .cse505 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (forall ((v_arrayElimCell_123 Int)) (= (select .cse21 (select .cse504 v_arrayElimCell_123)) 1)) (= (select .cse21 (select .cse504 v_arrayElimCell_122)) 1)))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse507)))))) (.cse202 (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| Int) (v_arrayElimCell_120 Int) (v_arrayElimCell_118 Int)) (or (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|))) (forall ((v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int))) (let ((.cse503 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2990))) (let ((.cse501 (select (select .cse503 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse499 (store |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| 1)) (.cse500 (let ((.cse502 (store (store .cse503 .cse501 (store (select .cse503 .cse501) v_arrayElimCell_118 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse502 (select (select .cse502 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse499 (select .cse500 v_arrayElimCell_123)) 1) (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse501) (= (select .cse499 (select .cse500 v_arrayElimCell_120)) 1) (= (select .cse499 (select .cse500 v_arrayElimCell_118)) 1)))))) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| |c_#StackHeapBarrier|))))) (.cse237 (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| Int) (v_arrayElimCell_118 Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|))) (forall ((v_ArrVal_2990 (Array Int Int))) (let ((.cse497 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2990))) (let ((.cse498 (select (select .cse497 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (forall ((v_ArrVal_2980 (Array Int Int))) (= (select (store |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| 1) (select (let ((.cse496 (store (store .cse497 .cse498 (store (select .cse497 .cse498) v_arrayElimCell_118 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse496 (select (select .cse496 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_118)) 1)) (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse498))))) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| |c_#StackHeapBarrier|))))) (.cse236 (or .cse30 .cse28 .cse78 .cse29)) (.cse84 (forall ((v_arrayElimCell_121 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int))) (let ((.cse494 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2990))) (let ((.cse495 (select (select .cse494 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (forall ((v_arrayElimCell_123 Int)) (= (select .cse204 (select (select (store (store .cse494 .cse495 (store (select .cse494 .cse495) v_arrayElimCell_121 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2980) (select v_ArrVal_2980 |c_ULTIMATE.start_main_~#s~0#1.offset|)) v_arrayElimCell_123)) 1)) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse495))))))) (.cse227 (or (forall ((v_arrayElimCell_121 Int) (v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int))) (= (select .cse204 (select (select (store (let ((.cse492 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2990))) (let ((.cse493 (select (select .cse492 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (store .cse492 .cse493 (store (select .cse492 .cse493) v_arrayElimCell_121 |c_ULTIMATE.start_main_~#s~0#1.base|)))) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2980) (select v_ArrVal_2980 |c_ULTIMATE.start_main_~#s~0#1.offset|)) v_arrayElimCell_123)) 1)) .cse486)) (.cse94 (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse393 (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| Int) (v_arrayElimCell_118 Int)) (or (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|))) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|) (forall ((v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int))) (let ((.cse491 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2990))) (let ((.cse489 (select (select .cse491 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse489) (= (select (store |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| 1) (select (let ((.cse490 (store (store .cse491 .cse489 (store (select .cse491 .cse489) v_arrayElimCell_118 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse490 (select (select .cse490 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_118)) 1))))) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| |c_#StackHeapBarrier|))))) (.cse210 (or .cse486 (forall ((v_arrayElimCell_120 Int) (v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int))) (= (select .cse204 (select (select (store (let ((.cse487 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2990))) (let ((.cse488 (select (select .cse487 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (store .cse487 .cse488 (store (select .cse487 .cse488) v_arrayElimCell_120 |c_ULTIMATE.start_main_~#s~0#1.base|)))) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2980) (select v_ArrVal_2980 |c_ULTIMATE.start_main_~#s~0#1.offset|)) v_arrayElimCell_123)) 1)))) (.cse104 (forall ((v_arrayElimCell_120 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int))) (let ((.cse484 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2990))) (let ((.cse485 (select (select .cse484 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (forall ((v_arrayElimCell_123 Int)) (= (select .cse204 (select (select (store (store .cse484 .cse485 (store (select .cse484 .cse485) v_arrayElimCell_120 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2980) (select v_ArrVal_2980 |c_ULTIMATE.start_main_~#s~0#1.offset|)) v_arrayElimCell_123)) 1)) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse485))))))) (.cse387 (forall ((v_arrayElimCell_120 Int) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_118 Int)) (let ((.cse483 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2990))) (let ((.cse481 (select (select .cse483 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse481) (forall ((v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int))) (let ((.cse482 (select (store (store .cse483 .cse481 (store (select .cse483 .cse481) v_arrayElimCell_118 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2980) (select v_ArrVal_2980 |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (or (= (select .cse204 (select .cse482 v_arrayElimCell_120)) 1) (= (select .cse204 (select .cse482 v_arrayElimCell_123)) 1))))))))) (.cse416 (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| Int) (v_arrayElimCell_120 Int) (v_arrayElimCell_118 Int)) (or (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|))) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_2990 (Array Int Int))) (let ((.cse479 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2990))) (let ((.cse480 (select (select .cse479 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (forall ((v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int))) (let ((.cse476 (store |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| 1)) (.cse477 (let ((.cse478 (store (store .cse479 .cse480 (store (select .cse479 .cse480) v_arrayElimCell_118 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse478 (select (select .cse478 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse476 (select .cse477 v_arrayElimCell_123)) 1) (= (select .cse476 (select .cse477 v_arrayElimCell_120)) 1) (= (select .cse476 (select .cse477 v_arrayElimCell_118)) 1)))) (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse480)))))))) (.cse417 (or (forall ((v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_118 Int)) (let ((.cse475 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2990))) (let ((.cse474 (select (select .cse475 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse474) (= (select .cse204 (select (select (store (store .cse475 .cse474 (store (select .cse475 .cse474) v_arrayElimCell_118 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2980) (select v_ArrVal_2980 |c_ULTIMATE.start_main_~#s~0#1.offset|)) v_arrayElimCell_123)) 1))))) .cse228 .cse37 .cse73)) (.cse435 (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| Int) (v_arrayElimCell_118 Int)) (or (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|))) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| |c_#StackHeapBarrier|)) (forall ((v_arrayElimCell_122 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int))) (let ((.cse472 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2990))) (let ((.cse473 (select (select .cse472 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= (select (store |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| 1) (select (let ((.cse471 (store (store .cse472 .cse473 (store (select .cse472 .cse473) v_arrayElimCell_118 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse471 (select (select .cse471 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_122)) 1) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse473)))))))))) (and (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| Int) (v_arrayElimCell_120 Int) (v_arrayElimCell_118 Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|))) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_2990 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2990))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (forall ((v_arrayElimCell_122 Int) (v_ArrVal_2980 (Array Int Int))) (let ((.cse0 (store |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| 1)) (.cse4 (select .cse2 .cse3))) (or (= (select .cse0 (select (let ((.cse1 (store (store .cse2 .cse3 (store .cse4 v_arrayElimCell_120 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_122)) 1) (= (select .cse0 (select (let ((.cse5 (store (store .cse2 .cse3 (store .cse4 v_arrayElimCell_118 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_122)) 1)))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse3)))))))) (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| Int) (v_arrayElimCell_120 Int) (v_arrayElimCell_118 Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|))) (forall ((v_ArrVal_2990 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2990))) (let ((.cse9 (select (select .cse8 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (forall ((v_ArrVal_2980 (Array Int Int))) (let ((.cse6 (store |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| 1)) (.cse10 (select .cse8 .cse9))) (or (= (select .cse6 (select (let ((.cse7 (store (store .cse8 .cse9 (store .cse10 v_arrayElimCell_120 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse7 (select (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_120)) 1) (= (select .cse6 (select (let ((.cse11 (store (store .cse8 .cse9 (store .cse10 v_arrayElimCell_118 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse11 (select (select .cse11 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_118)) 1)))) (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse9))))) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| Int) (v_arrayElimCell_120 Int) (v_arrayElimCell_118 Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|))) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| |c_#StackHeapBarrier|)) (forall ((v_arrayElimCell_122 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int))) (let ((.cse14 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2990))) (let ((.cse15 (select (select .cse14 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse12 (store |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| 1)) (.cse16 (select .cse14 .cse15))) (or (= (select .cse12 (select (let ((.cse13 (store (store .cse14 .cse15 (store .cse16 v_arrayElimCell_120 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse13 (select (select .cse13 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_122)) 1) (= (select .cse12 (select (let ((.cse17 (store (store .cse14 .cse15 (store .cse16 v_arrayElimCell_118 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse17 (select (select .cse17 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_122)) 1) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse15))))))))) (or (and .cse18 .cse19 (forall ((v_arrayElimCell_120 Int) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_118 Int)) (let ((.cse20 (select v_ArrVal_2990 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse20) (forall ((v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int))) (let ((.cse24 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2990))) (let ((.cse25 (select .cse24 .cse20))) (let ((.cse22 (let ((.cse26 (store (store .cse24 .cse20 (store .cse25 v_arrayElimCell_120 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse26 (select (select .cse26 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse21 (select .cse22 v_arrayElimCell_123)) 1) (= (select .cse21 (select .cse22 v_arrayElimCell_120)) 1) (= (select .cse21 (select (let ((.cse23 (store (store .cse24 .cse20 (store .cse25 v_arrayElimCell_118 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse23 (select (select .cse23 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_118)) 1))))))))) .cse27) .cse28 .cse29) (or .cse30 (let ((.cse36 (<= |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse35 (or .cse36 .cse37 .cse120)) (.cse32 (<= |c_#StackHeapBarrier| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|))) (and (or .cse31 .cse29 .cse32) .cse33 .cse34 .cse35 (or .cse36 .cse37 .cse38) .cse39 .cse40 (or .cse28 .cse29 (and .cse41 .cse42 .cse43 .cse44 .cse45 .cse46)) (or (and .cse47 .cse48 .cse49 .cse50 .cse35 (or .cse51 .cse29 .cse32) .cse52 .cse53 .cse54 (or .cse55 .cse29 .cse32) .cse56 .cse57 .cse58 (or .cse59 .cse29 .cse32) .cse60 .cse61 .cse62 .cse63 (or .cse28 .cse29 (and .cse64 .cse65 .cse66 .cse67)) .cse68 (or .cse28 (and .cse69 .cse70) .cse29) (or .cse37 (and .cse71 .cse72) .cse73) .cse74 .cse75 (or .cse28 (and .cse76 .cse77 .cse78 .cse79 .cse80 .cse81) .cse29) .cse82 (or .cse78 .cse29 .cse32) (or .cse29 .cse83 .cse32) (or .cse37 (and .cse84 .cse85) .cse73) .cse86 .cse87 (or .cse88 .cse29 .cse32) (or .cse36 .cse37 .cse89) .cse90 .cse91 .cse92 .cse93) .cse94) .cse54 (or .cse95 .cse29 .cse32) .cse96 (or .cse97 .cse29 .cse32) .cse62 .cse98 .cse99 .cse100 .cse82 (or .cse42 .cse29 .cse32) .cse101 .cse102 (or .cse37 (and .cse103 .cse104) .cse73) .cse105 .cse106 (or (and .cse18 .cse107) .cse28 .cse29) .cse108 .cse91 .cse109 .cse110 .cse111 .cse112 .cse113 .cse93 .cse114 (or .cse37 (and .cse115 .cse116) .cse73) (or .cse28 .cse29 (and .cse117 .cse118)) (or .cse29 .cse119 .cse32))))) .cse121 (or (forall ((v_arrayElimCell_120 Int) (v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_118 Int)) (let ((.cse125 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2990)) (.cse123 (select v_ArrVal_2990 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse126 (select .cse125 .cse123))) (let ((.cse122 (let ((.cse127 (store (store .cse125 .cse123 (store .cse126 v_arrayElimCell_120 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse127 (select (select .cse127 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse21 (select .cse122 v_arrayElimCell_118)) 1) (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse123) (= (select .cse21 (select (let ((.cse124 (store (store .cse125 .cse123 (store .cse126 v_arrayElimCell_118 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse124 (select (select .cse124 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_123)) 1) (= (select .cse21 (select .cse122 v_arrayElimCell_120)) 1)))))) .cse28 .cse29) .cse128 (or .cse28 .cse29 (and (forall ((v_arrayElimCell_120 Int) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_118 Int)) (let ((.cse132 (select v_ArrVal_2990 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (forall ((v_arrayElimCell_122 Int) (v_ArrVal_2980 (Array Int Int))) (let ((.cse131 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2990))) (let ((.cse133 (select .cse131 .cse132))) (let ((.cse129 (let ((.cse134 (store (store .cse131 .cse132 (store .cse133 v_arrayElimCell_120 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse134 (select (select .cse134 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (forall ((v_arrayElimCell_123 Int)) (or (= (select .cse21 (select .cse129 v_arrayElimCell_123)) 1) (= (select .cse21 (select (let ((.cse130 (store (store .cse131 .cse132 (store .cse133 v_arrayElimCell_118 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse130 (select (select .cse130 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_123)) 1))) (= (select .cse21 (select .cse129 v_arrayElimCell_122)) 1)))))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse132))))) (forall ((v_arrayElimCell_120 Int) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_118 Int)) (let ((.cse137 (select v_ArrVal_2990 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (forall ((v_arrayElimCell_122 Int) (v_ArrVal_2980 (Array Int Int))) (let ((.cse136 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2990))) (let ((.cse138 (select .cse136 .cse137))) (let ((.cse139 (let ((.cse140 (store (store .cse136 .cse137 (store .cse138 v_arrayElimCell_120 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse140 (select (select .cse140 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse21 (select (let ((.cse135 (store (store .cse136 .cse137 (store .cse138 v_arrayElimCell_118 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse135 (select (select .cse135 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_122)) 1) (forall ((v_arrayElimCell_123 Int)) (= (select .cse21 (select .cse139 v_arrayElimCell_123)) 1)) (= (select .cse21 (select .cse139 v_arrayElimCell_122)) 1)))))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse137))))) (or .cse30 (forall ((v_arrayElimCell_120 Int) (v_arrayElimCell_122 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_118 Int)) (let ((.cse142 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2990)) (.cse143 (select v_ArrVal_2990 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse144 (select .cse142 .cse143))) (or (= (select .cse21 (select (let ((.cse141 (store (store .cse142 .cse143 (store .cse144 v_arrayElimCell_118 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse141 (select (select .cse141 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_122)) 1) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse143)) (= (select .cse21 (select (let ((.cse145 (store (store .cse142 .cse143 (store .cse144 v_arrayElimCell_120 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse145 (select (select .cse145 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_122)) 1)))))) (forall ((v_arrayElimCell_120 Int) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_118 Int)) (let ((.cse150 (select v_ArrVal_2990 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (forall ((v_arrayElimCell_122 Int) (v_ArrVal_2980 (Array Int Int))) (let ((.cse149 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2990))) (let ((.cse151 (select .cse149 .cse150))) (let ((.cse146 (let ((.cse152 (store (store .cse149 .cse150 (store .cse151 v_arrayElimCell_118 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse152 (select (select .cse152 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (.cse147 (let ((.cse148 (store (store .cse149 .cse150 (store .cse151 v_arrayElimCell_120 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse148 (select (select .cse148 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse21 (select .cse146 v_arrayElimCell_122)) 1) (forall ((v_arrayElimCell_123 Int)) (or (= (select .cse21 (select .cse147 v_arrayElimCell_123)) 1) (= (select .cse21 (select .cse146 v_arrayElimCell_123)) 1))) (= (select .cse21 (select .cse147 v_arrayElimCell_122)) 1)))))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse150))))) .cse153 .cse46)) (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| Int) (v_arrayElimCell_120 Int) (v_arrayElimCell_118 Int)) (or (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|))) (forall ((v_ArrVal_2990 (Array Int Int))) (let ((.cse157 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2990))) (let ((.cse158 (select (select .cse157 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (forall ((v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int))) (let ((.cse159 (select .cse157 .cse158))) (let ((.cse154 (store |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| 1)) (.cse155 (let ((.cse160 (store (store .cse157 .cse158 (store .cse159 v_arrayElimCell_118 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse160 (select (select .cse160 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse154 (select .cse155 v_arrayElimCell_123)) 1) (= (select .cse154 (select (let ((.cse156 (store (store .cse157 .cse158 (store .cse159 v_arrayElimCell_120 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse156 (select (select .cse156 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_120)) 1) (= (select .cse154 (select .cse155 v_arrayElimCell_118)) 1))))) (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse158))))) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| Int) (v_arrayElimCell_120 Int) (v_arrayElimCell_118 Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|))) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_2990 (Array Int Int))) (let ((.cse164 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2990))) (let ((.cse165 (select (select .cse164 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (forall ((v_arrayElimCell_122 Int) (v_ArrVal_2980 (Array Int Int))) (let ((.cse166 (select .cse164 .cse165))) (let ((.cse162 (let ((.cse167 (store (store .cse164 .cse165 (store .cse166 v_arrayElimCell_120 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse167 (select (select .cse167 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (.cse161 (store |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| 1))) (or (forall ((v_arrayElimCell_123 Int)) (= (select .cse161 (select .cse162 v_arrayElimCell_123)) 1)) (= (select .cse161 (select .cse162 v_arrayElimCell_122)) 1) (= (select .cse161 (select (let ((.cse163 (store (store .cse164 .cse165 (store .cse166 v_arrayElimCell_118 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse163 (select (select .cse163 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_122)) 1))))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse165)))))))) (or .cse30 .cse28 (forall ((v_arrayElimCell_120 Int) (v_arrayElimCell_122 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_118 Int)) (let ((.cse170 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2990)) (.cse171 (select v_ArrVal_2990 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse172 (select .cse170 .cse171))) (let ((.cse168 (let ((.cse173 (store (store .cse170 .cse171 (store .cse172 v_arrayElimCell_120 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse173 (select (select .cse173 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse21 (select .cse168 v_arrayElimCell_118)) 1) (= (select .cse21 (select (let ((.cse169 (store (store .cse170 .cse171 (store .cse172 v_arrayElimCell_118 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse169 (select (select .cse169 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_122)) 1) (= (select .cse21 (select .cse168 v_arrayElimCell_122)) 1)))))) .cse29) .cse174 (or (and (or (forall ((v_arrayElimCell_120 Int) (v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_118 Int)) (let ((.cse177 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2990)) (.cse175 (select v_ArrVal_2990 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse178 (select .cse177 .cse175))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse175) (= (select .cse21 (select (let ((.cse176 (store (store .cse177 .cse175 (store .cse178 v_arrayElimCell_118 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse176 (select (select .cse176 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_123)) 1) (= (select .cse21 (select (let ((.cse179 (store (store .cse177 .cse175 (store .cse178 v_arrayElimCell_120 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse179 (select (select .cse179 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_120)) 1))))) .cse180) (forall ((v_arrayElimCell_120 Int) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_118 Int)) (let ((.cse181 (select v_ArrVal_2990 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse181) (forall ((v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int))) (let ((.cse184 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2990))) (let ((.cse185 (select .cse184 .cse181))) (let ((.cse182 (let ((.cse186 (store (store .cse184 .cse181 (store .cse185 v_arrayElimCell_118 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse186 (select (select .cse186 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse21 (select .cse182 v_arrayElimCell_123)) 1) (= (select .cse21 (select (let ((.cse183 (store (store .cse184 .cse181 (store .cse185 v_arrayElimCell_120 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse183 (select (select .cse183 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_120)) 1) (= (select .cse21 (select .cse182 v_arrayElimCell_118)) 1))))))))) (forall ((v_arrayElimCell_120 Int) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_118 Int)) (let ((.cse187 (select v_ArrVal_2990 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse187) (forall ((v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int))) (let ((.cse190 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2990))) (let ((.cse191 (select .cse190 .cse187))) (let ((.cse188 (let ((.cse192 (store (store .cse190 .cse187 (store .cse191 v_arrayElimCell_120 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse192 (select (select .cse192 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse21 (select .cse188 v_arrayElimCell_118)) 1) (= (select .cse21 (select (let ((.cse189 (store (store .cse190 .cse187 (store .cse191 v_arrayElimCell_118 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse189 (select (select .cse189 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_123)) 1) (= (select .cse21 (select .cse188 v_arrayElimCell_120)) 1)))))))))) .cse28 .cse29) (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| Int) (v_arrayElimCell_120 Int) (v_arrayElimCell_118 Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|))) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| |c_#StackHeapBarrier|)) (forall ((v_arrayElimCell_122 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int))) (let ((.cse197 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2990))) (let ((.cse198 (select (select .cse197 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse199 (select .cse197 .cse198))) (let ((.cse194 (let ((.cse200 (store (store .cse197 .cse198 (store .cse199 v_arrayElimCell_120 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse200 (select (select .cse200 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (.cse193 (store |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| 1)) (.cse195 (let ((.cse196 (store (store .cse197 .cse198 (store .cse199 v_arrayElimCell_118 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse196 (select (select .cse196 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse193 (select .cse194 v_arrayElimCell_122)) 1) (= (select .cse193 (select .cse194 v_arrayElimCell_118)) 1) (= (select .cse193 (select .cse195 v_arrayElimCell_118)) 1) (= (select .cse193 (select .cse195 v_arrayElimCell_122)) 1))))))))) .cse201 .cse202 (or .cse37 (forall ((v_arrayElimCell_120 Int) (v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_118 Int)) (let ((.cse205 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2990))) (let ((.cse203 (select (select .cse205 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse206 (select .cse205 .cse203)) (.cse207 (select v_ArrVal_2980 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse203) (= (select .cse204 (select (select (store (store .cse205 .cse203 (store .cse206 v_arrayElimCell_118 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2980) .cse207) v_arrayElimCell_123)) 1) (= (select .cse204 (select (select (store (store .cse205 .cse203 (store .cse206 v_arrayElimCell_120 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2980) .cse207) v_arrayElimCell_123)) 1)))))) .cse73) .cse208 .cse209 (or .cse94 (and .cse47 .cse49 (or .cse37 .cse73 (and .cse103 .cse210 .cse104)) .cse211 (or .cse28 .cse29 (and .cse64 .cse212 (or (forall ((v_arrayElimCell_120 Int) (v_arrayElimCell_121 Int) (v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_119 Int)) (let ((.cse216 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2990)) (.cse213 (select v_ArrVal_2990 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse217 (select .cse216 .cse213))) (let ((.cse214 (let ((.cse218 (store (store .cse216 .cse213 (store .cse217 v_arrayElimCell_121 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse218 (select (select .cse218 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse213) (= (select .cse21 (select .cse214 v_arrayElimCell_120)) 1) (= (select .cse21 (select (let ((.cse215 (store (store .cse216 .cse213 (store .cse217 v_arrayElimCell_119 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse215 (select (select .cse215 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_120)) 1) (= (select .cse21 (select .cse214 v_arrayElimCell_123)) 1)))))) .cse180) .cse65 .cse66 .cse67 .cse219)) .cse33 (or (and .cse18 .cse19 .cse27 .cse107) .cse28 .cse29) .cse34 .cse52 .cse53 .cse174 .cse56 .cse57 .cse58 .cse60 .cse96 .cse61 .cse63 .cse62 .cse68 .cse208 .cse74 .cse99 .cse100 (or .cse28 (and .cse69 .cse70 (or (forall ((v_arrayElimCell_120 Int) (v_arrayElimCell_121 Int) (v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_119 Int)) (let ((.cse223 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2990)) (.cse220 (select v_ArrVal_2990 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse224 (select .cse223 .cse220))) (let ((.cse221 (let ((.cse225 (store (store .cse223 .cse220 (store .cse224 v_arrayElimCell_121 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse225 (select (select .cse225 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse220) (= (select .cse21 (select .cse221 v_arrayElimCell_120)) 1) (= (select .cse21 (select .cse221 v_arrayElimCell_123)) 1) (= (select .cse21 (select (let ((.cse222 (store (store .cse223 .cse220 (store .cse224 v_arrayElimCell_119 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse222 (select (select .cse222 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_123)) 1)))))) .cse180)) .cse29) .cse101 .cse102 (or .cse28 .cse29 (and (or .cse30 .cse77) .cse76 .cse226 .cse79 .cse80 .cse81)) .cse86 .cse87 (or .cse37 .cse73 (and .cse84 .cse227 .cse85)) .cse90 .cse108 .cse91 (or .cse37 (and .cse115 (or .cse228 .cse116)) .cse73) .cse109 .cse92 .cse111 .cse113 .cse114 .cse48 (or .cse228 .cse37 .cse38 .cse73) .cse50 .cse121 (or .cse28 .cse29 (and (or (forall ((v_arrayElimCell_120 Int) (v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_119 Int)) (let ((.cse231 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2990)) (.cse229 (select v_ArrVal_2990 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse232 (select .cse231 .cse229))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse229) (= (select .cse21 (select (let ((.cse230 (store (store .cse231 .cse229 (store .cse232 v_arrayElimCell_120 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse230 (select (select .cse230 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_120)) 1) (= (select .cse21 (select (let ((.cse233 (store (store .cse231 .cse229 (store .cse232 v_arrayElimCell_119 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse233 (select (select .cse233 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_123)) 1))))) .cse180) .cse117 .cse118)) .cse234 (or (and (or .cse228 .cse71) .cse72) .cse37 .cse73) .cse39 .cse40 .cse54 (or .cse55 .cse30 .cse28 .cse29) (or .cse228 .cse37 .cse73 .cse89) (or .cse228 .cse37 .cse73 .cse120) .cse235 .cse209 .cse98 .cse75 .cse82 .cse105 (or .cse97 .cse30 .cse28 .cse29) .cse106 .cse236 .cse110 .cse112 .cse93 (or .cse88 .cse30 .cse28 .cse29) (or .cse28 .cse29 (and .cse41 (or .cse30 .cse43) .cse44 .cse153 .cse45 .cse46)))) .cse237 (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| Int) (v_arrayElimCell_120 Int) (v_arrayElimCell_118 Int)) (or (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|))) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| |c_#StackHeapBarrier|)) (forall ((v_arrayElimCell_122 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int))) (let ((.cse240 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2990))) (let ((.cse241 (select (select .cse240 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse242 (select .cse240 .cse241))) (let ((.cse238 (store |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| 1)) (.cse243 (let ((.cse244 (store (store .cse240 .cse241 (store .cse242 v_arrayElimCell_118 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse244 (select (select .cse244 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse238 (select (let ((.cse239 (store (store .cse240 .cse241 (store .cse242 v_arrayElimCell_120 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse239 (select (select .cse239 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_122)) 1) (= (select .cse238 (select .cse243 v_arrayElimCell_118)) 1) (= (select .cse238 (select .cse243 v_arrayElimCell_122)) 1))))))))) (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| Int) (v_arrayElimCell_120 Int) (v_arrayElimCell_118 Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|))) (forall ((v_ArrVal_2990 (Array Int Int))) (let ((.cse248 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2990))) (let ((.cse249 (select (select .cse248 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (forall ((v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int))) (let ((.cse250 (select .cse248 .cse249))) (let ((.cse245 (store |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| 1)) (.cse246 (let ((.cse251 (store (store .cse248 .cse249 (store .cse250 v_arrayElimCell_118 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse251 (select (select .cse251 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse245 (select .cse246 v_arrayElimCell_123)) 1) (= (select .cse245 (select (let ((.cse247 (store (store .cse248 .cse249 (store .cse250 v_arrayElimCell_120 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse247 (select (select .cse247 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_120)) 1) (= (select .cse245 (select .cse246 v_arrayElimCell_118)) 1))))) (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse249))))) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| |c_#StackHeapBarrier|)))) (or .cse37 .cse73 (and (or (forall ((v_arrayElimCell_120 Int) (v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_118 Int)) (let ((.cse254 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2990))) (let ((.cse252 (select (select .cse254 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse255 (select .cse254 .cse252)) (.cse256 (select v_ArrVal_2980 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse253 (select (store (store .cse254 .cse252 (store .cse255 v_arrayElimCell_118 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2980) .cse256))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse252) (= (select .cse204 (select .cse253 v_arrayElimCell_120)) 1) (= (select .cse204 (select .cse253 v_arrayElimCell_123)) 1) (= (select .cse204 (select (select (store (store .cse254 .cse252 (store .cse255 v_arrayElimCell_120 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2980) .cse256) v_arrayElimCell_123)) 1))))))) .cse228) .cse115)) (or (and (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| Int) (v_arrayElimCell_121 Int) (v_arrayElimCell_118 Int)) (or (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|))) (forall ((v_ArrVal_2990 (Array Int Int))) (let ((.cse260 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2990))) (let ((.cse261 (select (select .cse260 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (forall ((v_arrayElimCell_122 Int) (v_ArrVal_2980 (Array Int Int))) (let ((.cse262 (select .cse260 .cse261))) (let ((.cse257 (store |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| 1)) (.cse258 (let ((.cse263 (store (store .cse260 .cse261 (store .cse262 v_arrayElimCell_118 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse263 (select (select .cse263 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (forall ((v_arrayElimCell_123 Int)) (or (= (select .cse257 (select .cse258 v_arrayElimCell_123)) 1) (= (select .cse257 (select (let ((.cse259 (store (store .cse260 .cse261 (store .cse262 v_arrayElimCell_121 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse259 (select (select .cse259 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_123)) 1))) (= (select .cse257 (select .cse258 v_arrayElimCell_122)) 1))))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse261)))))) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| Int) (v_arrayElimCell_121 Int) (v_arrayElimCell_118 Int)) (or (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|))) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_2990 (Array Int Int))) (let ((.cse266 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2990))) (let ((.cse267 (select (select .cse266 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (forall ((v_arrayElimCell_122 Int) (v_ArrVal_2980 (Array Int Int))) (let ((.cse264 (store |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| 1)) (.cse268 (select .cse266 .cse267))) (or (= (select .cse264 (select (let ((.cse265 (store (store .cse266 .cse267 (store .cse268 v_arrayElimCell_118 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse265 (select (select .cse265 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_122)) 1) (forall ((v_arrayElimCell_123 Int)) (= (select .cse264 (select (let ((.cse269 (store (store .cse266 .cse267 (store .cse268 v_arrayElimCell_121 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse269 (select (select .cse269 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_123)) 1))))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse267)))))))) (or .cse30 (forall ((v_arrayElimCell_122 Int) (v_arrayElimCell_121 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_118 Int)) (let ((.cse272 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2990)) (.cse273 (select v_ArrVal_2990 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse274 (select .cse272 .cse273))) (let ((.cse270 (let ((.cse275 (store (store .cse272 .cse273 (store .cse274 v_arrayElimCell_121 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse275 (select (select .cse275 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse21 (select .cse270 v_arrayElimCell_118)) 1) (= (select .cse21 (select (let ((.cse271 (store (store .cse272 .cse273 (store .cse274 v_arrayElimCell_118 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse271 (select (select .cse271 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_122)) 1) (= (select .cse21 (select .cse270 v_arrayElimCell_122)) 1)))))) .cse28 .cse29) .cse211 (or (and (forall ((v_arrayElimCell_120 Int) (v_arrayElimCell_121 Int) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_118 Int)) (let ((.cse276 (select v_ArrVal_2990 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse276) (forall ((v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int))) (let ((.cse278 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2990))) (let ((.cse279 (select .cse278 .cse276))) (let ((.cse280 (let ((.cse281 (store (store .cse278 .cse276 (store .cse279 v_arrayElimCell_118 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse281 (select (select .cse281 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse21 (select (let ((.cse277 (store (store .cse278 .cse276 (store .cse279 v_arrayElimCell_121 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse277 (select (select .cse277 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_120)) 1) (= (select .cse21 (select .cse280 v_arrayElimCell_123)) 1) (= (select .cse21 (select .cse280 v_arrayElimCell_118)) 1))))))))) (forall ((v_arrayElimCell_120 Int) (v_arrayElimCell_121 Int) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_118 Int)) (let ((.cse282 (select v_ArrVal_2990 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse282) (forall ((v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int))) (let ((.cse285 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2990))) (let ((.cse286 (select .cse285 .cse282))) (let ((.cse283 (let ((.cse287 (store (store .cse285 .cse282 (store .cse286 v_arrayElimCell_121 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse287 (select (select .cse287 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse21 (select .cse283 v_arrayElimCell_118)) 1) (= (select .cse21 (select .cse283 v_arrayElimCell_120)) 1) (= (select .cse21 (select (let ((.cse284 (store (store .cse285 .cse282 (store .cse286 v_arrayElimCell_118 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse284 (select (select .cse284 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_123)) 1) (= (select .cse21 (select .cse283 v_arrayElimCell_123)) 1))))))))) (or .cse180 (forall ((v_arrayElimCell_120 Int) (v_arrayElimCell_121 Int) (v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_118 Int)) (let ((.cse291 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2990)) (.cse288 (select v_ArrVal_2990 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse292 (select .cse291 .cse288))) (let ((.cse289 (let ((.cse293 (store (store .cse291 .cse288 (store .cse292 v_arrayElimCell_121 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse293 (select (select .cse293 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse288) (= (select .cse21 (select .cse289 v_arrayElimCell_120)) 1) (= (select .cse21 (select (let ((.cse290 (store (store .cse291 .cse288 (store .cse292 v_arrayElimCell_118 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse290 (select (select .cse290 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_123)) 1) (= (select .cse21 (select .cse289 v_arrayElimCell_123)) 1)))))))) .cse28 .cse29) (or .cse37 .cse73 (and (forall ((v_arrayElimCell_120 Int) (v_arrayElimCell_121 Int) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_118 Int)) (let ((.cse297 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2990))) (let ((.cse294 (select (select .cse297 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse294) (forall ((v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int))) (let ((.cse298 (select .cse297 .cse294)) (.cse299 (select v_ArrVal_2980 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse295 (select (store (store .cse297 .cse294 (store .cse298 v_arrayElimCell_121 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2980) .cse299)) (.cse296 (select (store (store .cse297 .cse294 (store .cse298 v_arrayElimCell_118 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2980) .cse299))) (or (= (select .cse204 (select .cse295 v_arrayElimCell_123)) 1) (= (select .cse204 (select .cse295 v_arrayElimCell_120)) 1) (= (select .cse204 (select .cse296 v_arrayElimCell_120)) 1) (= (select .cse204 (select .cse296 v_arrayElimCell_123)) 1))))))))) (or .cse228 (forall ((v_arrayElimCell_120 Int) (v_arrayElimCell_121 Int) (v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_118 Int)) (let ((.cse301 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2990))) (let ((.cse300 (select (select .cse301 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse302 (select .cse301 .cse300)) (.cse303 (select v_ArrVal_2980 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse304 (select (store (store .cse301 .cse300 (store .cse302 v_arrayElimCell_118 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2980) .cse303))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse300) (= (select .cse204 (select (select (store (store .cse301 .cse300 (store .cse302 v_arrayElimCell_121 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2980) .cse303) v_arrayElimCell_123)) 1) (= (select .cse204 (select .cse304 v_arrayElimCell_120)) 1) (= (select .cse204 (select .cse304 v_arrayElimCell_123)) 1)))))))))) .cse234 .cse128 (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| Int) (v_arrayElimCell_121 Int) (v_arrayElimCell_118 Int)) (or (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|))) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| |c_#StackHeapBarrier|)) (forall ((v_arrayElimCell_122 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int))) (let ((.cse308 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2990))) (let ((.cse309 (select (select .cse308 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse310 (select .cse308 .cse309))) (let ((.cse306 (let ((.cse311 (store (store .cse308 .cse309 (store .cse310 v_arrayElimCell_118 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse311 (select (select .cse311 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (.cse305 (store |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| 1))) (or (= (select .cse305 (select .cse306 v_arrayElimCell_118)) 1) (= (select .cse305 (select .cse306 v_arrayElimCell_122)) 1) (= (select .cse305 (select (let ((.cse307 (store (store .cse308 .cse309 (store .cse310 v_arrayElimCell_121 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse307 (select (select .cse307 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_122)) 1))))))))) (or .cse28 .cse29 (and (or .cse180 (forall ((v_arrayElimCell_120 Int) (v_arrayElimCell_121 Int) (v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_118 Int)) (let ((.cse313 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2990)) (.cse314 (select v_ArrVal_2990 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse315 (select .cse313 .cse314))) (let ((.cse316 (let ((.cse317 (store (store .cse313 .cse314 (store .cse315 v_arrayElimCell_121 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse317 (select (select .cse317 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse21 (select (let ((.cse312 (store (store .cse313 .cse314 (store .cse315 v_arrayElimCell_118 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse312 (select (select .cse312 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_120)) 1) (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse314) (= (select .cse21 (select .cse316 v_arrayElimCell_120)) 1) (= (select .cse21 (select .cse316 v_arrayElimCell_123)) 1))))))) .cse64 (forall ((v_arrayElimCell_120 Int) (v_arrayElimCell_121 Int) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_118 Int)) (let ((.cse318 (select v_ArrVal_2990 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse318) (forall ((v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int))) (let ((.cse321 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2990))) (let ((.cse322 (select .cse321 .cse318))) (let ((.cse319 (let ((.cse323 (store (store .cse321 .cse318 (store .cse322 v_arrayElimCell_121 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse323 (select (select .cse323 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse21 (select .cse319 v_arrayElimCell_120)) 1) (= (select .cse21 (select .cse319 v_arrayElimCell_123)) 1) (= (select .cse21 (select (let ((.cse320 (store (store .cse321 .cse318 (store .cse322 v_arrayElimCell_118 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse320 (select (select .cse320 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_118)) 1))))))))) (forall ((v_arrayElimCell_120 Int) (v_arrayElimCell_121 Int) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_118 Int)) (let ((.cse324 (select v_ArrVal_2990 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse324) (forall ((v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int))) (let ((.cse326 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2990))) (let ((.cse327 (select .cse326 .cse324))) (let ((.cse328 (let ((.cse329 (store (store .cse326 .cse324 (store .cse327 v_arrayElimCell_121 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse329 (select (select .cse329 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse21 (select (let ((.cse325 (store (store .cse326 .cse324 (store .cse327 v_arrayElimCell_118 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse325 (select (select .cse325 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_120)) 1) (= (select .cse21 (select .cse328 v_arrayElimCell_118)) 1) (= (select .cse21 (select .cse328 v_arrayElimCell_120)) 1) (= (select .cse21 (select .cse328 v_arrayElimCell_123)) 1))))))))) .cse212 .cse219)) (or .cse28 (forall ((v_arrayElimCell_120 Int) (v_arrayElimCell_121 Int) (v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_118 Int)) (let ((.cse334 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2990)) (.cse331 (select v_ArrVal_2990 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse335 (select .cse334 .cse331))) (let ((.cse330 (let ((.cse336 (store (store .cse334 .cse331 (store .cse335 v_arrayElimCell_118 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse336 (select (select .cse336 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (.cse332 (let ((.cse333 (store (store .cse334 .cse331 (store .cse335 v_arrayElimCell_121 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse333 (select (select .cse333 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse21 (select .cse330 v_arrayElimCell_120)) 1) (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse331) (= (select .cse21 (select .cse332 v_arrayElimCell_118)) 1) (= (select .cse21 (select .cse332 v_arrayElimCell_120)) 1) (= (select .cse21 (select .cse330 v_arrayElimCell_123)) 1) (= (select .cse21 (select .cse332 v_arrayElimCell_123)) 1)))))) .cse29) (or .cse30 (forall ((v_arrayElimCell_120 Int) (v_arrayElimCell_121 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_118 Int)) (let ((.cse338 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2990)) (.cse339 (select v_ArrVal_2990 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse340 (select .cse338 .cse339))) (let ((.cse341 (let ((.cse342 (store (store .cse338 .cse339 (store .cse340 v_arrayElimCell_121 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse342 (select (select .cse342 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse21 (select (let ((.cse337 (store (store .cse338 .cse339 (store .cse340 v_arrayElimCell_118 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse337 (select (select .cse337 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_120)) 1) (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse339) (= (select .cse21 (select .cse341 v_arrayElimCell_118)) 1) (= (select .cse21 (select .cse341 v_arrayElimCell_120)) 1)))))) .cse28 .cse29) (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| Int) (v_arrayElimCell_120 Int) (v_arrayElimCell_118 Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|))) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_2990 (Array Int Int))) (let ((.cse346 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2990))) (let ((.cse347 (select (select .cse346 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (forall ((v_ArrVal_2980 (Array Int Int))) (let ((.cse343 (store |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| 1)) (.cse344 (let ((.cse345 (store (store .cse346 .cse347 (store (select .cse346 .cse347) v_arrayElimCell_118 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse345 (select (select .cse345 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse343 (select .cse344 v_arrayElimCell_120)) 1) (= (select .cse343 (select .cse344 v_arrayElimCell_118)) 1)))) (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse347))))))) (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| Int) (v_arrayElimCell_121 Int) (v_arrayElimCell_118 Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|))) (forall ((v_ArrVal_2990 (Array Int Int))) (let ((.cse350 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2990))) (let ((.cse351 (select (select .cse350 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (forall ((v_arrayElimCell_122 Int) (v_ArrVal_2980 (Array Int Int))) (let ((.cse348 (store |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| 1)) (.cse352 (select .cse350 .cse351))) (or (= (select .cse348 (select (let ((.cse349 (store (store .cse350 .cse351 (store .cse352 v_arrayElimCell_118 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse349 (select (select .cse349 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_122)) 1) (= (select .cse348 (select (let ((.cse353 (store (store .cse350 .cse351 (store .cse352 v_arrayElimCell_121 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse353 (select (select .cse353 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_122)) 1)))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse351)))))) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| |c_#StackHeapBarrier|)))) .cse235 .cse201 (or (and (forall ((v_arrayElimCell_121 Int) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_118 Int)) (let ((.cse354 (select v_ArrVal_2990 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse354)) (forall ((v_arrayElimCell_122 Int) (v_ArrVal_2980 (Array Int Int))) (let ((.cse357 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2990))) (let ((.cse358 (select .cse357 .cse354))) (let ((.cse355 (let ((.cse359 (store (store .cse357 .cse354 (store .cse358 v_arrayElimCell_121 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse359 (select (select .cse359 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (forall ((v_arrayElimCell_123 Int)) (= (select .cse21 (select .cse355 v_arrayElimCell_123)) 1)) (= (select .cse21 (select (let ((.cse356 (store (store .cse357 .cse354 (store .cse358 v_arrayElimCell_118 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse356 (select (select .cse356 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_122)) 1) (= (select .cse21 (select .cse355 v_arrayElimCell_122)) 1))))))))) (forall ((v_arrayElimCell_121 Int) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_118 Int)) (let ((.cse362 (select v_ArrVal_2990 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (forall ((v_arrayElimCell_122 Int) (v_ArrVal_2980 (Array Int Int))) (let ((.cse361 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2990))) (let ((.cse363 (select .cse361 .cse362))) (let ((.cse364 (let ((.cse365 (store (store .cse361 .cse362 (store .cse363 v_arrayElimCell_121 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse365 (select (select .cse365 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (forall ((v_arrayElimCell_123 Int)) (or (= (select .cse21 (select (let ((.cse360 (store (store .cse361 .cse362 (store .cse363 v_arrayElimCell_118 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse360 (select (select .cse360 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_123)) 1) (= (select .cse21 (select .cse364 v_arrayElimCell_123)) 1))) (= (select .cse21 (select .cse364 v_arrayElimCell_122)) 1)))))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse362))))) .cse226 (or .cse30 (forall ((v_arrayElimCell_122 Int) (v_arrayElimCell_121 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_118 Int)) (let ((.cse367 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2990)) (.cse368 (select v_ArrVal_2990 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse369 (select .cse367 .cse368))) (or (= (select .cse21 (select (let ((.cse366 (store (store .cse367 .cse368 (store .cse369 v_arrayElimCell_118 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse366 (select (select .cse366 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_122)) 1) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse368)) (= (select .cse21 (select (let ((.cse370 (store (store .cse367 .cse368 (store .cse369 v_arrayElimCell_121 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse370 (select (select .cse370 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_122)) 1)))))) (forall ((v_arrayElimCell_121 Int) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_118 Int)) (let ((.cse375 (select v_ArrVal_2990 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (forall ((v_arrayElimCell_122 Int) (v_ArrVal_2980 (Array Int Int))) (let ((.cse374 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2990))) (let ((.cse376 (select .cse374 .cse375))) (let ((.cse371 (let ((.cse377 (store (store .cse374 .cse375 (store .cse376 v_arrayElimCell_118 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse377 (select (select .cse377 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (.cse372 (let ((.cse373 (store (store .cse374 .cse375 (store .cse376 v_arrayElimCell_121 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse373 (select (select .cse373 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (forall ((v_arrayElimCell_123 Int)) (or (= (select .cse21 (select .cse371 v_arrayElimCell_123)) 1) (= (select .cse21 (select .cse372 v_arrayElimCell_123)) 1))) (= (select .cse21 (select .cse371 v_arrayElimCell_122)) 1) (= (select .cse21 (select .cse372 v_arrayElimCell_122)) 1)))))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse375))))) .cse81) .cse28 .cse29) .cse202 (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| Int) (v_arrayElimCell_120 Int) (v_arrayElimCell_118 Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|))) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_2990 (Array Int Int))) (let ((.cse381 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2990))) (let ((.cse382 (select (select .cse381 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (forall ((v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int))) (let ((.cse378 (store |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| 1)) (.cse379 (let ((.cse380 (store (store .cse381 .cse382 (store (select .cse381 .cse382) v_arrayElimCell_118 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse380 (select (select .cse380 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse378 (select .cse379 v_arrayElimCell_123)) 1) (= (select .cse378 (select .cse379 v_arrayElimCell_120)) 1) (= (select .cse378 (select .cse379 v_arrayElimCell_118)) 1)))) (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse382))))))) (or (forall ((v_arrayElimCell_121 Int) (v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_118 Int)) (let ((.cse384 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2990))) (let ((.cse383 (select (select .cse384 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse385 (select .cse384 .cse383)) (.cse386 (select v_ArrVal_2980 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse383) (= (select .cse204 (select (select (store (store .cse384 .cse383 (store .cse385 v_arrayElimCell_121 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2980) .cse386) v_arrayElimCell_123)) 1) (= (select .cse204 (select (select (store (store .cse384 .cse383 (store .cse385 v_arrayElimCell_118 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2980) .cse386) v_arrayElimCell_123)) 1)))))) .cse37 .cse73) .cse237 (or (and .cse387 (forall ((v_arrayElimCell_120 Int) (v_arrayElimCell_121 Int) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_118 Int)) (let ((.cse389 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2990))) (let ((.cse388 (select (select .cse389 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse388) (forall ((v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int))) (let ((.cse390 (select .cse389 .cse388)) (.cse391 (select v_ArrVal_2980 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse392 (select (store (store .cse389 .cse388 (store .cse390 v_arrayElimCell_118 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2980) .cse391))) (or (= (select .cse204 (select (select (store (store .cse389 .cse388 (store .cse390 v_arrayElimCell_121 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2980) .cse391) v_arrayElimCell_120)) 1) (= (select .cse204 (select .cse392 v_arrayElimCell_120)) 1) (= (select .cse204 (select .cse392 v_arrayElimCell_123)) 1)))))))))) .cse228 .cse37 .cse73) .cse393 (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| Int) (v_arrayElimCell_121 Int) (v_arrayElimCell_118 Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|))) (forall ((v_arrayElimCell_122 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int))) (let ((.cse398 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2990))) (let ((.cse399 (select (select .cse398 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse400 (select .cse398 .cse399))) (let ((.cse395 (let ((.cse401 (store (store .cse398 .cse399 (store .cse400 v_arrayElimCell_118 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse401 (select (select .cse401 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (.cse394 (store |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| 1)) (.cse396 (let ((.cse397 (store (store .cse398 .cse399 (store .cse400 v_arrayElimCell_121 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse397 (select (select .cse397 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse394 (select .cse395 v_arrayElimCell_118)) 1) (= (select .cse394 (select .cse395 v_arrayElimCell_122)) 1) (= (select .cse394 (select .cse396 v_arrayElimCell_118)) 1) (= (select .cse394 (select .cse396 v_arrayElimCell_122)) 1))))))) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| |c_#StackHeapBarrier|)))) (or (forall ((v_arrayElimCell_122 Int) (v_arrayElimCell_121 Int) (v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_118 Int)) (let ((.cse403 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2990)) (.cse404 (select v_ArrVal_2990 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse405 (select .cse403 .cse404))) (let ((.cse406 (let ((.cse407 (store (store .cse403 .cse404 (store .cse405 v_arrayElimCell_121 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse407 (select (select .cse407 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse21 (select (let ((.cse402 (store (store .cse403 .cse404 (store .cse405 v_arrayElimCell_118 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse402 (select (select .cse402 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_122)) 1) (= (select .cse21 (select .cse406 v_arrayElimCell_123)) 1) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse404)) (= (select .cse21 (select .cse406 v_arrayElimCell_122)) 1)))))) .cse28 .cse29) (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| Int) (v_arrayElimCell_121 Int) (v_arrayElimCell_118 Int)) (or (forall ((v_ArrVal_2990 (Array Int Int))) (let ((.cse412 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2990))) (let ((.cse413 (select (select .cse412 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (forall ((v_arrayElimCell_122 Int) (v_ArrVal_2980 (Array Int Int))) (let ((.cse414 (select .cse412 .cse413))) (let ((.cse409 (let ((.cse415 (store (store .cse412 .cse413 (store .cse414 v_arrayElimCell_118 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse415 (select (select .cse415 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (.cse408 (store |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| 1)) (.cse410 (let ((.cse411 (store (store .cse412 .cse413 (store .cse414 v_arrayElimCell_121 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse411 (select (select .cse411 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (forall ((v_arrayElimCell_123 Int)) (or (= (select .cse408 (select .cse409 v_arrayElimCell_123)) 1) (= (select .cse408 (select .cse410 v_arrayElimCell_123)) 1))) (= (select .cse408 (select .cse409 v_arrayElimCell_122)) 1) (= (select .cse408 (select .cse410 v_arrayElimCell_122)) 1))))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse413)))))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|))) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| |c_#StackHeapBarrier|)))) .cse236 .cse416 .cse417 (or .cse37 (and .cse84 .cse227 (forall ((v_arrayElimCell_121 Int) (v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_118 Int)) (let ((.cse418 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2990))) (let ((.cse419 (select (select .cse418 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse420 (select .cse418 .cse419)) (.cse421 (select v_ArrVal_2980 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (select .cse204 (select (select (store (store .cse418 .cse419 (store .cse420 v_arrayElimCell_121 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2980) .cse421) v_arrayElimCell_123)) 1) (= (select .cse204 (select (select (store (store .cse418 .cse419 (store .cse420 v_arrayElimCell_118 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2980) .cse421) v_arrayElimCell_123)) 1))))))) .cse73) (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| Int) (v_arrayElimCell_121 Int) (v_arrayElimCell_118 Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|))) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_2990 (Array Int Int))) (let ((.cse424 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2990))) (let ((.cse425 (select (select .cse424 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (forall ((v_arrayElimCell_122 Int) (v_ArrVal_2980 (Array Int Int))) (let ((.cse426 (select .cse424 .cse425))) (let ((.cse422 (store |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| 1)) (.cse427 (let ((.cse428 (store (store .cse424 .cse425 (store .cse426 v_arrayElimCell_121 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse428 (select (select .cse428 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse422 (select (let ((.cse423 (store (store .cse424 .cse425 (store .cse426 v_arrayElimCell_118 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse423 (select (select .cse423 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_122)) 1) (forall ((v_arrayElimCell_123 Int)) (= (select .cse422 (select .cse427 v_arrayElimCell_123)) 1)) (= (select .cse422 (select .cse427 v_arrayElimCell_122)) 1))))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse425)))))))) (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| Int) (v_arrayElimCell_121 Int) (v_arrayElimCell_118 Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|))) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|) (forall ((v_arrayElimCell_122 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int))) (let ((.cse431 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2990))) (let ((.cse432 (select (select .cse431 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse429 (store |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| 1)) (.cse433 (select .cse431 .cse432))) (or (= (select .cse429 (select (let ((.cse430 (store (store .cse431 .cse432 (store .cse433 v_arrayElimCell_118 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse430 (select (select .cse430 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_122)) 1) (= (select .cse429 (select (let ((.cse434 (store (store .cse431 .cse432 (store .cse433 v_arrayElimCell_121 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse434 (select (select .cse434 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_122)) 1) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse432))))))) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| |c_#StackHeapBarrier|)))) .cse435) .cse94) .cse393 (or .cse28 (forall ((v_arrayElimCell_120 Int) (v_arrayElimCell_122 Int) (v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_118 Int)) (let ((.cse438 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2990)) (.cse439 (select v_ArrVal_2990 |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse440 (select .cse438 .cse439))) (let ((.cse436 (let ((.cse441 (store (store .cse438 .cse439 (store .cse440 v_arrayElimCell_120 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse441 (select (select .cse441 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse21 (select .cse436 v_arrayElimCell_123)) 1) (= (select .cse21 (select (let ((.cse437 (store (store .cse438 .cse439 (store .cse440 v_arrayElimCell_118 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~head#1.base| v_ArrVal_2980))) (select .cse437 (select (select .cse437 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_122)) 1) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse439)) (= (select .cse21 (select .cse436 v_arrayElimCell_122)) 1)))))) .cse29) (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| Int) (v_arrayElimCell_120 Int) (v_arrayElimCell_118 Int)) (or (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|))) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_2990 (Array Int Int))) (let ((.cse444 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2990))) (let ((.cse445 (select (select .cse444 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (forall ((v_arrayElimCell_122 Int) (v_ArrVal_2980 (Array Int Int))) (let ((.cse442 (store |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| 1)) (.cse446 (select .cse444 .cse445))) (or (forall ((v_arrayElimCell_123 Int)) (= (select .cse442 (select (let ((.cse443 (store (store .cse444 .cse445 (store .cse446 v_arrayElimCell_120 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse443 (select (select .cse443 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_123)) 1)) (= (select .cse442 (select (let ((.cse447 (store (store .cse444 .cse445 (store .cse446 v_arrayElimCell_118 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse447 (select (select .cse447 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_122)) 1)))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse445)))))))) (or .cse37 .cse73 (and .cse210 .cse104 (forall ((v_arrayElimCell_120 Int) (v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int)) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_118 Int)) (let ((.cse448 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2990))) (let ((.cse449 (select (select .cse448 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse450 (select .cse448 .cse449)) (.cse451 (select v_ArrVal_2980 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (select .cse204 (select (select (store (store .cse448 .cse449 (store .cse450 v_arrayElimCell_118 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2980) .cse451) v_arrayElimCell_123)) 1) (= (select .cse204 (select (select (store (store .cse448 .cse449 (store .cse450 v_arrayElimCell_120 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2980) .cse451) v_arrayElimCell_123)) 1)))))))) (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| Int) (v_arrayElimCell_120 Int) (v_arrayElimCell_118 Int)) (or (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|))) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_2990 (Array Int Int))) (let ((.cse455 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2990))) (let ((.cse456 (select (select .cse455 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (forall ((v_arrayElimCell_122 Int) (v_ArrVal_2980 (Array Int Int))) (let ((.cse457 (select .cse455 .cse456))) (let ((.cse453 (let ((.cse458 (store (store .cse455 .cse456 (store .cse457 v_arrayElimCell_118 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse458 (select (select .cse458 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (.cse452 (store |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| 1))) (or (= (select .cse452 (select .cse453 v_arrayElimCell_122)) 1) (forall ((v_arrayElimCell_123 Int)) (or (= (select .cse452 (select .cse453 v_arrayElimCell_123)) 1) (= (select .cse452 (select (let ((.cse454 (store (store .cse455 .cse456 (store .cse457 v_arrayElimCell_120 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse454 (select (select .cse454 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_123)) 1))))))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse456)))))))) (or .cse228 .cse37 .cse73 (and (forall ((v_arrayElimCell_120 Int) (v_ArrVal_2990 (Array Int Int)) (v_arrayElimCell_118 Int)) (let ((.cse460 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2990))) (let ((.cse459 (select (select .cse460 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse459) (forall ((v_arrayElimCell_123 Int) (v_ArrVal_2980 (Array Int Int))) (let ((.cse461 (select .cse460 .cse459)) (.cse462 (select v_ArrVal_2980 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (select .cse204 (select (select (store (store .cse460 .cse459 (store .cse461 v_arrayElimCell_118 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2980) .cse462) v_arrayElimCell_123)) 1) (= (select .cse204 (select (select (store (store .cse460 .cse459 (store .cse461 v_arrayElimCell_120 |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2980) .cse462) v_arrayElimCell_120)) 1)))))))) .cse387)) .cse416 .cse417 (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| Int) (v_arrayElimCell_120 Int) (v_arrayElimCell_118 Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|))) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_2990 (Array Int Int))) (let ((.cse467 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2990))) (let ((.cse468 (select (select .cse467 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (forall ((v_arrayElimCell_122 Int) (v_ArrVal_2980 (Array Int Int))) (let ((.cse469 (select .cse467 .cse468))) (let ((.cse465 (let ((.cse470 (store (store .cse467 .cse468 (store .cse469 v_arrayElimCell_118 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse470 (select (select .cse470 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (.cse463 (store |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| 1)) (.cse464 (let ((.cse466 (store (store .cse467 .cse468 (store .cse469 v_arrayElimCell_120 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_30| v_ArrVal_2980))) (select .cse466 (select (select .cse466 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse463 (select .cse464 v_arrayElimCell_122)) 1) (= (select .cse463 (select .cse465 v_arrayElimCell_122)) 1) (forall ((v_arrayElimCell_123 Int)) (or (= (select .cse463 (select .cse465 v_arrayElimCell_123)) 1) (= (select .cse463 (select .cse464 v_arrayElimCell_123)) 1))))))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse468)))))))) .cse435)))) is different from true [2023-02-15 22:29:10,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [323793838] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:29:10,349 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:29:10,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 31] total 55 [2023-02-15 22:29:10,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982761470] [2023-02-15 22:29:10,349 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:29:10,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2023-02-15 22:29:10,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:29:10,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2023-02-15 22:29:10,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=2985, Unknown=48, NotChecked=690, Total=3906 [2023-02-15 22:29:10,352 INFO L87 Difference]: Start difference. First operand 92 states and 101 transitions. Second operand has 56 states, 52 states have (on average 1.8653846153846154) internal successors, (97), 48 states have internal predecessors, (97), 5 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-15 22:29:22,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:29:22,416 INFO L93 Difference]: Finished difference Result 140 states and 154 transitions. [2023-02-15 22:29:22,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-02-15 22:29:22,417 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 52 states have (on average 1.8653846153846154) internal successors, (97), 48 states have internal predecessors, (97), 5 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 55 [2023-02-15 22:29:22,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:29:22,418 INFO L225 Difference]: With dead ends: 140 [2023-02-15 22:29:22,418 INFO L226 Difference]: Without dead ends: 140 [2023-02-15 22:29:22,420 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 95 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 2016 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=756, Invalid=7406, Unknown=52, NotChecked=1098, Total=9312 [2023-02-15 22:29:22,420 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 1146 mSDsluCounter, 976 mSDsCounter, 0 mSdLazyCounter, 2222 mSolverCounterSat, 58 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1146 SdHoareTripleChecker+Valid, 1017 SdHoareTripleChecker+Invalid, 2282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 2222 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2023-02-15 22:29:22,420 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1146 Valid, 1017 Invalid, 2282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 2222 Invalid, 2 Unknown, 0 Unchecked, 5.0s Time] [2023-02-15 22:29:22,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2023-02-15 22:29:22,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 97. [2023-02-15 22:29:22,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 72 states have (on average 1.4305555555555556) internal successors, (103), 92 states have internal predecessors, (103), 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) [2023-02-15 22:29:22,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 109 transitions. [2023-02-15 22:29:22,422 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 109 transitions. Word has length 55 [2023-02-15 22:29:22,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:29:22,422 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 109 transitions. [2023-02-15 22:29:22,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 52 states have (on average 1.8653846153846154) internal successors, (97), 48 states have internal predecessors, (97), 5 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-15 22:29:22,422 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 109 transitions. [2023-02-15 22:29:22,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-02-15 22:29:22,423 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:29:22,423 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:29:22,428 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-02-15 22:29:22,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:29:22,629 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-02-15 22:29:22,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:29:22,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1524453911, now seen corresponding path program 1 times [2023-02-15 22:29:22,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:29:22,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907889297] [2023-02-15 22:29:22,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:29:22,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:29:22,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:24,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:29:24,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:24,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 22:29:24,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:24,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 22:29:24,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:25,235 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 22:29:25,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:29:25,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907889297] [2023-02-15 22:29:25,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907889297] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:29:25,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1285623992] [2023-02-15 22:29:25,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:29:25,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:29:25,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:29:25,236 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 22:29:25,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-02-15 22:29:25,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:25,450 INFO L263 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 128 conjunts are in the unsatisfiable core [2023-02-15 22:29:25,453 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:29:25,467 INFO L350 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 [2023-02-15 22:29:25,574 INFO L350 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 [2023-02-15 22:29:25,871 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 22:29:25,872 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-15 22:29:26,706 INFO L350 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 [2023-02-15 22:29:27,156 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 22:29:27,156 INFO L350 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 19 treesize of output 26 [2023-02-15 22:29:27,164 INFO L350 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 12 treesize of output 8 [2023-02-15 22:29:27,770 INFO L350 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 18 treesize of output 10 [2023-02-15 22:29:27,776 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2023-02-15 22:29:27,783 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 22:29:27,924 INFO L350 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 [2023-02-15 22:29:28,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:29:28,761 INFO L350 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 14 treesize of output 16 [2023-02-15 22:29:28,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:29:28,780 INFO L350 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 24 [2023-02-15 22:29:28,811 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-02-15 22:29:28,812 INFO L350 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 1 case distinctions, treesize of input 15 treesize of output 15 [2023-02-15 22:29:30,212 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-02-15 22:29:30,213 INFO L350 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 63 treesize of output 45 [2023-02-15 22:29:30,229 INFO L350 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 36 [2023-02-15 22:29:30,520 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2023-02-15 22:29:30,520 INFO L350 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 3 case distinctions, treesize of input 82 treesize of output 65 [2023-02-15 22:29:30,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:29:30,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:29:30,532 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2023-02-15 22:29:31,436 INFO L321 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2023-02-15 22:29:31,437 INFO L350 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 84 treesize of output 46 [2023-02-15 22:29:31,929 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-02-15 22:29:31,929 INFO L350 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 1 case distinctions, treesize of input 26 treesize of output 16 [2023-02-15 22:29:32,111 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 14 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:29:32,111 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:29:33,280 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3182 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_3182))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse0)) (forall ((v_ArrVal_3183 (Array Int Int))) (<= 0 (+ (select (select .cse1 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_3183) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse0) 4))))))) (forall ((v_ArrVal_3182 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_3182))) (let ((.cse4 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_3183 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_3183))) (let ((.cse3 (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (<= (+ (select (select .cse2 .cse3) .cse4) 8) (select |c_#length| (select (select .cse5 .cse3) .cse4)))))) (not (<= 0 .cse4))))))) is different from false [2023-02-15 22:29:33,318 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))) (.cse5 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (and (forall ((v_ArrVal_3182 (Array Int Int))) (let ((.cse0 (store .cse5 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_3182))) (let ((.cse2 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_3183 (Array Int Int))) (let ((.cse3 (store .cse4 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_3183))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (<= (+ (select (select .cse0 .cse1) .cse2) 8) (select |c_#length| (select (select .cse3 .cse1) .cse2)))))) (not (<= 0 .cse2)))))) (forall ((v_ArrVal_3182 (Array Int Int))) (let ((.cse6 (store .cse5 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_3182))) (let ((.cse7 (select (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_3183 (Array Int Int))) (<= 0 (+ (select (select .cse6 (select (select (store .cse4 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_3183) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse7) 4))) (not (<= 0 .cse7)))))))) is different from false [2023-02-15 22:29:33,454 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))) (.cse5 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (and (forall ((v_ArrVal_3182 (Array Int Int))) (let ((.cse1 (store .cse5 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_3182))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse0)) (forall ((v_ArrVal_3183 (Array Int Int))) (let ((.cse3 (store .cse4 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_3183))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (<= (+ (select (select .cse1 .cse2) .cse0) 8) (select |c_#length| (select (select .cse3 .cse2) .cse0)))))))))) (forall ((v_ArrVal_3182 (Array Int Int))) (let ((.cse7 (store .cse5 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_3182))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse6)) (forall ((v_ArrVal_3183 (Array Int Int))) (<= 0 (+ (select (select .cse7 (select (select (store .cse4 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_3183) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse6) 4))))))))) is different from false [2023-02-15 22:29:33,487 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))) (.cse5 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (and (forall ((v_ArrVal_3182 (Array Int Int))) (let ((.cse0 (store .cse5 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_3182))) (let ((.cse2 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_3183 (Array Int Int))) (let ((.cse3 (store .cse4 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_3183))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (<= (+ (select (select .cse0 .cse1) .cse2) 8) (select |c_#length| (select (select .cse3 .cse1) .cse2)))))) (not (<= 0 .cse2)))))) (forall ((v_ArrVal_3182 (Array Int Int))) (let ((.cse6 (store .cse5 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_3182))) (let ((.cse7 (select (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_3183 (Array Int Int))) (<= 0 (+ (select (select .cse6 (select (select (store .cse4 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_3183) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse7) 4))) (not (<= 0 .cse7)))))))) is different from false [2023-02-15 22:29:33,521 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse9 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse8 (store (select |c_#memory_$Pointer$.base| .cse8) .cse9 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))) (.cse5 (store |c_#memory_$Pointer$.offset| .cse8 (store (select |c_#memory_$Pointer$.offset| .cse8) .cse9 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (and (forall ((v_ArrVal_3182 (Array Int Int))) (let ((.cse1 (store .cse5 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_3182))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse0)) (forall ((v_ArrVal_3183 (Array Int Int))) (let ((.cse3 (store .cse4 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_3183))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (<= (+ (select (select .cse1 .cse2) .cse0) 8) (select |c_#length| (select (select .cse3 .cse2) .cse0)))))))))) (forall ((v_ArrVal_3182 (Array Int Int))) (let ((.cse7 (store .cse5 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_3182))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse6)) (forall ((v_ArrVal_3183 (Array Int Int))) (<= 0 (+ (select (select .cse7 (select (select (store .cse4 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_3183) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse6) 4)))))))))) is different from false [2023-02-15 22:29:34,405 INFO L350 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 877 treesize of output 749 [2023-02-15 22:29:35,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1285623992] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:29:35,343 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:29:35,343 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 32] total 56 [2023-02-15 22:29:35,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989664498] [2023-02-15 22:29:35,343 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:29:35,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2023-02-15 22:29:35,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:29:35,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2023-02-15 22:29:35,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=3827, Unknown=25, NotChecked=640, Total=4692 [2023-02-15 22:29:35,345 INFO L87 Difference]: Start difference. First operand 97 states and 109 transitions. Second operand has 57 states, 53 states have (on average 1.830188679245283) internal successors, (97), 49 states have internal predecessors, (97), 5 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-15 22:29:52,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:29:52,159 INFO L93 Difference]: Finished difference Result 233 states and 259 transitions. [2023-02-15 22:29:52,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2023-02-15 22:29:52,159 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 53 states have (on average 1.830188679245283) internal successors, (97), 49 states have internal predecessors, (97), 5 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 55 [2023-02-15 22:29:52,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:29:52,160 INFO L225 Difference]: With dead ends: 233 [2023-02-15 22:29:52,160 INFO L226 Difference]: Without dead ends: 233 [2023-02-15 22:29:52,161 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 107 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 2273 ImplicationChecksByTransitivity, 19.5s TimeCoverageRelationStatistics Valid=735, Invalid=9970, Unknown=27, NotChecked=1040, Total=11772 [2023-02-15 22:29:52,162 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 1548 mSDsluCounter, 1305 mSDsCounter, 0 mSdLazyCounter, 2696 mSolverCounterSat, 35 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1548 SdHoareTripleChecker+Valid, 1345 SdHoareTripleChecker+Invalid, 2733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 2696 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2023-02-15 22:29:52,162 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1548 Valid, 1345 Invalid, 2733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 2696 Invalid, 2 Unknown, 0 Unchecked, 6.2s Time] [2023-02-15 22:29:52,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2023-02-15 22:29:52,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 101. [2023-02-15 22:29:52,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 76 states have (on average 1.4078947368421053) internal successors, (107), 96 states have internal predecessors, (107), 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) [2023-02-15 22:29:52,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 113 transitions. [2023-02-15 22:29:52,164 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 113 transitions. Word has length 55 [2023-02-15 22:29:52,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:29:52,164 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 113 transitions. [2023-02-15 22:29:52,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 53 states have (on average 1.830188679245283) internal successors, (97), 49 states have internal predecessors, (97), 5 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-15 22:29:52,164 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 113 transitions. [2023-02-15 22:29:52,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-02-15 22:29:52,165 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:29:52,165 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:29:52,173 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2023-02-15 22:29:52,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:29:52,366 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-02-15 22:29:52,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:29:52,366 INFO L85 PathProgramCache]: Analyzing trace with hash -416358246, now seen corresponding path program 1 times [2023-02-15 22:29:52,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:29:52,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683759115] [2023-02-15 22:29:52,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:29:52,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:29:52,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:54,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:29:54,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:54,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 22:29:54,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:54,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 22:29:54,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:55,402 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 22:29:55,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:29:55,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683759115] [2023-02-15 22:29:55,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683759115] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:29:55,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1792711382] [2023-02-15 22:29:55,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:29:55,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:29:55,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:29:55,404 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 22:29:55,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-02-15 22:29:55,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:55,651 INFO L263 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 151 conjunts are in the unsatisfiable core [2023-02-15 22:29:55,654 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:29:55,669 INFO L350 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 [2023-02-15 22:29:55,796 INFO L350 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 [2023-02-15 22:29:56,242 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 22:29:56,243 INFO L350 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 [2023-02-15 22:29:56,588 INFO L350 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 [2023-02-15 22:29:56,977 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 22:29:56,978 INFO L350 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 [2023-02-15 22:29:58,223 INFO L350 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 18 treesize of output 10 [2023-02-15 22:29:58,230 INFO L350 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 11 treesize of output 7 [2023-02-15 22:29:58,237 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 22:29:58,887 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 22:29:59,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:29:59,375 INFO L350 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 24 [2023-02-15 22:29:59,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:29:59,403 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-02-15 22:29:59,403 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 18 [2023-02-15 22:29:59,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:29:59,432 INFO L350 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 14 treesize of output 16 [2023-02-15 22:30:00,844 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-02-15 22:30:00,845 INFO L350 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 73 treesize of output 51 [2023-02-15 22:30:00,853 INFO L350 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 18 treesize of output 20 [2023-02-15 22:30:00,875 INFO L350 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 36 [2023-02-15 22:30:01,175 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2023-02-15 22:30:01,175 INFO L350 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 3 case distinctions, treesize of input 111 treesize of output 82 [2023-02-15 22:30:01,187 INFO L350 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 43 treesize of output 34 [2023-02-15 22:30:01,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:30:01,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:30:01,203 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2023-02-15 22:30:02,040 INFO L321 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2023-02-15 22:30:02,040 INFO L350 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 86 treesize of output 48 [2023-02-15 22:30:02,566 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-02-15 22:30:02,566 INFO L350 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 1 case distinctions, treesize of input 26 treesize of output 16 [2023-02-15 22:30:02,645 INFO L350 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 [2023-02-15 22:30:02,650 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 7 refuted. 6 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 22:30:02,650 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:30:03,714 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3388 (Array Int Int)) (v_ArrVal_3389 Int) (v_ArrVal_3390 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_3390))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_3388))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_ArrVal_3389)) (select (select .cse0 .cse1) .cse2)) (+ (select (select .cse3 .cse1) .cse2) 4)))) |c_ULTIMATE.start_main_~uneq~0#1|) (not (<= 0 .cse2)))))) is different from false [2023-02-15 22:30:05,436 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:30:05,437 INFO L350 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 305 treesize of output 298 [2023-02-15 22:30:05,468 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:30:05,469 INFO L350 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 4724 treesize of output 4468 [2023-02-15 22:30:05,504 INFO L350 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 5392 treesize of output 4482 [2023-02-15 22:30:05,566 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:30:05,567 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1759 treesize of output 1631 [2023-02-15 22:30:05,772 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:30:05,773 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 4899 treesize of output 4381 [2023-02-15 22:30:06,991 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_sll_circular_insert_~data#1| |c_ULTIMATE.start_main_~uneq~0#1|))) (and (or .cse0 (forall ((v_ArrVal_3400 (Array Int Int)) (v_ArrVal_3401 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| Int) (v_ArrVal_3390 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_3401))) (let ((.cse3 (select (select .cse1 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse2 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_3400) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (not (<= 0 (select (select (store (store .cse1 .cse2 (store (select .cse1 .cse2) .cse3 0)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_3390) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| |c_#StackHeapBarrier|)) (not (<= 0 .cse3)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|))) (not (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| .cse2))))))) (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| Int)) (or (forall ((v_ArrVal_3401 (Array Int Int))) (let ((.cse9 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_3401))) (let ((.cse4 (select (select .cse9 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (not (<= 0 .cse4)) (forall ((v_ArrVal_3400 (Array Int Int)) (v_ArrVal_3390 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_3400))) (let ((.cse8 (select (select .cse7 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse5 (select (select (store (store .cse9 .cse8 (store (select .cse9 .cse8) .cse4 0)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_3390) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse5)) (forall ((v_ArrVal_3388 (Array Int Int))) (= (select (let ((.cse6 (store (store .cse7 .cse8 (store (select .cse7 .cse8) .cse4 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_3388))) (select .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse5) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|))))))))))) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|))))) (or .cse0 (forall ((v_ArrVal_3388 (Array Int Int)) (v_ArrVal_3400 (Array Int Int)) (v_ArrVal_3401 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| Int) (v_ArrVal_3390 (Array Int Int))) (let ((.cse15 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_3401)) (.cse13 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_3400))) (let ((.cse14 (select (select .cse13 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse11 (select (select .cse15 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse10 (select (select (store (store .cse15 .cse14 (store (select .cse15 .cse14) .cse11 0)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_3390) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse10)) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| |c_#StackHeapBarrier|)) (not (<= 0 .cse11)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|))) (not (= (select (let ((.cse12 (store (store .cse13 .cse14 (store (select .cse13 .cse14) .cse11 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_3388))) (select .cse12 (select (select .cse12 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse10) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)))))))) (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| Int)) (or (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|))) (forall ((v_ArrVal_3401 (Array Int Int))) (let ((.cse23 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_3401))) (let ((.cse22 (select (select .cse23 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (forall ((v_ArrVal_3400 (Array Int Int)) (v_ArrVal_3390 (Array Int Int))) (let ((.cse20 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_3400))) (let ((.cse21 (select (select .cse20 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse16 (store (store .cse23 .cse21 (store (select .cse23 .cse21) .cse22 0)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_3390))) (let ((.cse18 (select (select .cse16 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_3388 (Array Int Int))) (let ((.cse19 (store (store .cse20 .cse21 (store (select .cse20 .cse21) .cse22 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_3388))) (let ((.cse17 (select (select .cse19 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (select (select .cse16 .cse17) .cse18) 0) (not (= (select (select .cse19 .cse17) .cse18) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)))))) (not (<= 0 .cse18)))))))) (not (<= 0 .cse22)))))))) (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| Int)) (or (forall ((v_ArrVal_3401 (Array Int Int))) (let ((.cse29 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_3401))) (let ((.cse27 (select (select .cse29 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (forall ((v_ArrVal_3400 (Array Int Int)) (v_ArrVal_3390 (Array Int Int))) (let ((.cse25 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_3400))) (let ((.cse26 (select (select .cse25 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse28 (select (select (store (store .cse29 .cse26 (store (select .cse29 .cse26) .cse27 0)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_3390) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_3388 (Array Int Int))) (not (= (select (let ((.cse24 (store (store .cse25 .cse26 (store (select .cse25 .cse26) .cse27 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_3388))) (select .cse24 (select (select .cse24 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse28) .cse26))) (not (<= 0 .cse28)) (not (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| .cse26))))))) (not (<= 0 .cse27)))))) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|))))) (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| Int)) (or (forall ((v_ArrVal_3401 (Array Int Int))) (let ((.cse37 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_3401))) (let ((.cse36 (select (select .cse37 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (forall ((v_ArrVal_3400 (Array Int Int)) (v_ArrVal_3390 (Array Int Int))) (let ((.cse34 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_3400))) (let ((.cse35 (select (select .cse34 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse31 (store (store .cse37 .cse35 (store (select .cse37 .cse35) .cse36 0)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_3390))) (let ((.cse30 (select (select .cse31 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse30)) (forall ((v_ArrVal_3388 (Array Int Int))) (let ((.cse33 (store (store .cse34 .cse35 (store (select .cse34 .cse35) .cse36 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_3388))) (let ((.cse32 (select (select .cse33 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (+ (select (select .cse31 .cse32) .cse30) 4) 0)) (not (= (select (select .cse33 .cse32) .cse30) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)))))))))))) (not (<= 0 .cse36)))))) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|))))) (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| Int)) (or (forall ((v_ArrVal_3401 (Array Int Int))) (let ((.cse43 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_3401))) (let ((.cse42 (select (select .cse43 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (forall ((v_ArrVal_3400 (Array Int Int)) (v_ArrVal_3390 (Array Int Int))) (let ((.cse40 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_3400))) (let ((.cse41 (select (select .cse40 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse39 (store (store .cse43 .cse41 (store (select .cse43 .cse41) .cse42 0)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_3390))) (let ((.cse38 (select (select .cse39 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse38)) (forall ((v_ArrVal_3388 (Array Int Int))) (= (select (select .cse39 (select (select (store (store .cse40 .cse41 (store (select .cse40 .cse41) .cse42 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| v_ArrVal_3388) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse38) 0)) (not (= |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| .cse41)))))))) (not (<= 0 .cse42)))))) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_36|))))))) is different from false [2023-02-15 22:30:07,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1792711382] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:30:07,037 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:30:07,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 34] total 58 [2023-02-15 22:30:07,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288960098] [2023-02-15 22:30:07,037 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:30:07,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2023-02-15 22:30:07,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:30:07,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2023-02-15 22:30:07,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=4321, Unknown=14, NotChecked=266, Total=4830 [2023-02-15 22:30:07,038 INFO L87 Difference]: Start difference. First operand 101 states and 113 transitions. Second operand has 58 states, 55 states have (on average 1.7636363636363637) internal successors, (97), 50 states have internal predecessors, (97), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-15 22:30:16,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:30:16,690 INFO L93 Difference]: Finished difference Result 127 states and 139 transitions. [2023-02-15 22:30:16,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-02-15 22:30:16,691 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 55 states have (on average 1.7636363636363637) internal successors, (97), 50 states have internal predecessors, (97), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 57 [2023-02-15 22:30:16,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:30:16,692 INFO L225 Difference]: With dead ends: 127 [2023-02-15 22:30:16,692 INFO L226 Difference]: Without dead ends: 127 [2023-02-15 22:30:16,692 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 89 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1933 ImplicationChecksByTransitivity, 14.5s TimeCoverageRelationStatistics Valid=693, Invalid=7131, Unknown=16, NotChecked=350, Total=8190 [2023-02-15 22:30:16,693 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 1618 mSDsluCounter, 1024 mSDsCounter, 0 mSdLazyCounter, 1869 mSolverCounterSat, 31 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1618 SdHoareTripleChecker+Valid, 1070 SdHoareTripleChecker+Invalid, 1903 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1869 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2023-02-15 22:30:16,693 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1618 Valid, 1070 Invalid, 1903 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1869 Invalid, 3 Unknown, 0 Unchecked, 4.3s Time] [2023-02-15 22:30:16,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2023-02-15 22:30:16,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 101. [2023-02-15 22:30:16,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 76 states have (on average 1.394736842105263) internal successors, (106), 96 states have internal predecessors, (106), 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) [2023-02-15 22:30:16,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 112 transitions. [2023-02-15 22:30:16,695 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 112 transitions. Word has length 57 [2023-02-15 22:30:16,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:30:16,695 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 112 transitions. [2023-02-15 22:30:16,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 55 states have (on average 1.7636363636363637) internal successors, (97), 50 states have internal predecessors, (97), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-15 22:30:16,695 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 112 transitions. [2023-02-15 22:30:16,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-02-15 22:30:16,695 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:30:16,695 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:30:16,711 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-02-15 22:30:16,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-02-15 22:30:16,896 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-02-15 22:30:16,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:30:16,897 INFO L85 PathProgramCache]: Analyzing trace with hash -416322472, now seen corresponding path program 1 times [2023-02-15 22:30:16,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:30:16,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939359554] [2023-02-15 22:30:16,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:30:16,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:30:16,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:30:17,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:30:17,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:30:17,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 22:30:17,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:30:17,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 22:30:17,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:30:17,359 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-02-15 22:30:17,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:30:17,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939359554] [2023-02-15 22:30:17,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939359554] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:30:17,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1716519055] [2023-02-15 22:30:17,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:30:17,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:30:17,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:30:17,361 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 22:30:17,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-02-15 22:30:17,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:30:17,623 INFO L263 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-15 22:30:17,624 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:30:17,891 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-02-15 22:30:17,892 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:30:18,236 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-02-15 22:30:18,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1716519055] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:30:18,237 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 22:30:18,237 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 18 [2023-02-15 22:30:18,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120091112] [2023-02-15 22:30:18,237 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 22:30:18,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-15 22:30:18,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:30:18,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-15 22:30:18,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2023-02-15 22:30:18,239 INFO L87 Difference]: Start difference. First operand 101 states and 112 transitions. Second operand has 18 states, 18 states have (on average 4.0) internal successors, (72), 17 states have internal predecessors, (72), 5 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2023-02-15 22:30:18,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:30:18,853 INFO L93 Difference]: Finished difference Result 87 states and 94 transitions. [2023-02-15 22:30:18,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 22:30:18,855 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.0) internal successors, (72), 17 states have internal predecessors, (72), 5 states have call successors, (7), 2 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 57 [2023-02-15 22:30:18,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:30:18,855 INFO L225 Difference]: With dead ends: 87 [2023-02-15 22:30:18,855 INFO L226 Difference]: Without dead ends: 87 [2023-02-15 22:30:18,855 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 109 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=111, Invalid=351, Unknown=0, NotChecked=0, Total=462 [2023-02-15 22:30:18,856 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 370 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 598 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 22:30:18,856 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [371 Valid, 598 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 22:30:18,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2023-02-15 22:30:18,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 83. [2023-02-15 22:30:18,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 64 states have (on average 1.296875) internal successors, (83), 78 states have internal predecessors, (83), 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) [2023-02-15 22:30:18,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 89 transitions. [2023-02-15 22:30:18,857 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 89 transitions. Word has length 57 [2023-02-15 22:30:18,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:30:18,858 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 89 transitions. [2023-02-15 22:30:18,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.0) internal successors, (72), 17 states have internal predecessors, (72), 5 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2023-02-15 22:30:18,858 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 89 transitions. [2023-02-15 22:30:18,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-02-15 22:30:18,858 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:30:18,858 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:30:18,865 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2023-02-15 22:30:19,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2023-02-15 22:30:19,065 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-02-15 22:30:19,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:30:19,066 INFO L85 PathProgramCache]: Analyzing trace with hash -688328851, now seen corresponding path program 1 times [2023-02-15 22:30:19,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:30:19,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809479508] [2023-02-15 22:30:19,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:30:19,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:30:19,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:30:21,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:30:21,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:30:21,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 22:30:21,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:30:22,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 22:30:22,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:30:23,250 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 22:30:23,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:30:23,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809479508] [2023-02-15 22:30:23,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809479508] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:30:23,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1666374791] [2023-02-15 22:30:23,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:30:23,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:30:23,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:30:23,251 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 22:30:23,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-02-15 22:30:23,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:30:23,531 INFO L263 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 140 conjunts are in the unsatisfiable core [2023-02-15 22:30:23,534 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:30:23,695 INFO L350 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 [2023-02-15 22:30:24,575 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 22:30:24,576 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-15 22:30:24,995 INFO L350 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 [2023-02-15 22:30:25,480 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:30:25,481 INFO L350 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 28 treesize of output 29 [2023-02-15 22:30:26,315 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 22:30:26,315 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 21 [2023-02-15 22:30:26,325 INFO L350 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 11 treesize of output 7 [2023-02-15 22:30:26,333 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 22:30:27,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:30:27,619 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 22:30:27,619 INFO L350 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 54 treesize of output 50 [2023-02-15 22:30:27,712 INFO L321 Elim1Store]: treesize reduction 72, result has 37.4 percent of original size [2023-02-15 22:30:27,713 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 34 treesize of output 57 [2023-02-15 22:30:27,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:30:27,761 INFO L350 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 14 treesize of output 16 [2023-02-15 22:30:30,231 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:30:30,270 INFO L321 Elim1Store]: treesize reduction 32, result has 25.6 percent of original size [2023-02-15 22:30:30,270 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 129 treesize of output 77 [2023-02-15 22:30:30,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:30:30,291 INFO L350 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 53 treesize of output 39 [2023-02-15 22:30:30,690 INFO L321 Elim1Store]: treesize reduction 56, result has 21.1 percent of original size [2023-02-15 22:30:30,690 INFO L350 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 136 treesize of output 83 [2023-02-15 22:30:30,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:30:30,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:30:30,726 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 141 treesize of output 118 [2023-02-15 22:30:32,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:30:32,637 INFO L350 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 157 treesize of output 88 [2023-02-15 22:30:33,064 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:30:33,110 INFO L321 Elim1Store]: treesize reduction 65, result has 14.5 percent of original size [2023-02-15 22:30:33,110 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 108 treesize of output 51 [2023-02-15 22:30:33,571 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:30:33,571 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:30:33,706 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3772 (Array Int Int))) (= (select |c_#valid| (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_3772)) (.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select .cse0 (select (select .cse0 .cse1) .cse2)) (select (select .cse3 .cse1) .cse2))))) 1)) is different from false [2023-02-15 22:30:36,213 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_42| Int) (v_ArrVal_3783 (Array Int Int)) (v_ArrVal_3772 (Array Int Int)) (v_ArrVal_3784 (Array Int Int)) (v_ArrVal_3782 Int)) (let ((.cse9 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_42| v_ArrVal_3783))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_42|))) (= (select (store |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_42| v_ArrVal_3782) (let ((.cse7 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_42| v_ArrVal_3784))) (let ((.cse8 (select (select .cse7 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse3 (store (store .cse9 .cse8 (store (select .cse9 .cse8) .cse6 0)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_42| v_ArrVal_3772)) (.cse0 (let ((.cse5 (select .cse7 .cse8))) (let ((.cse4 (store .cse7 .cse8 (store .cse5 .cse6 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_42|)))) (store .cse4 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_42| (store (select .cse4 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_42|) 0 (select .cse5 .cse6))))))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select .cse0 (select (select .cse0 .cse1) .cse2)) (select (select .cse3 .cse1) .cse2))))))) 1) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_42| |c_#StackHeapBarrier|)) (not (<= 0 .cse6)))))) is different from false [2023-02-15 22:30:36,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1666374791] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:30:36,217 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:30:36,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 36] total 68 [2023-02-15 22:30:36,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942147580] [2023-02-15 22:30:36,217 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:30:36,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2023-02-15 22:30:36,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:30:36,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2023-02-15 22:30:36,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=5458, Unknown=9, NotChecked=298, Total=6006 [2023-02-15 22:30:36,219 INFO L87 Difference]: Start difference. First operand 83 states and 89 transitions. Second operand has 69 states, 64 states have (on average 1.59375) internal successors, (102), 60 states have internal predecessors, (102), 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) [2023-02-15 22:30:54,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:30:54,110 INFO L93 Difference]: Finished difference Result 162 states and 174 transitions. [2023-02-15 22:30:54,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-02-15 22:30:54,111 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 64 states have (on average 1.59375) internal successors, (102), 60 states have internal predecessors, (102), 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 59 [2023-02-15 22:30:54,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:30:54,112 INFO L225 Difference]: With dead ends: 162 [2023-02-15 22:30:54,112 INFO L226 Difference]: Without dead ends: 162 [2023-02-15 22:30:54,113 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 104 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2321 ImplicationChecksByTransitivity, 23.2s TimeCoverageRelationStatistics Valid=698, Invalid=10011, Unknown=11, NotChecked=410, Total=11130 [2023-02-15 22:30:54,113 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 634 mSDsluCounter, 1657 mSDsCounter, 0 mSdLazyCounter, 3127 mSolverCounterSat, 38 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 636 SdHoareTripleChecker+Valid, 1695 SdHoareTripleChecker+Invalid, 3167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 3127 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:30:54,113 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [636 Valid, 1695 Invalid, 3167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 3127 Invalid, 2 Unknown, 0 Unchecked, 7.1s Time] [2023-02-15 22:30:54,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2023-02-15 22:30:54,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 116. [2023-02-15 22:30:54,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 95 states have (on average 1.2210526315789474) internal successors, (116), 109 states have internal predecessors, (116), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-15 22:30:54,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 126 transitions. [2023-02-15 22:30:54,119 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 126 transitions. Word has length 59 [2023-02-15 22:30:54,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:30:54,119 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 126 transitions. [2023-02-15 22:30:54,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 64 states have (on average 1.59375) internal successors, (102), 60 states have internal predecessors, (102), 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) [2023-02-15 22:30:54,120 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 126 transitions. [2023-02-15 22:30:54,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-02-15 22:30:54,120 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:30:54,120 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:30:54,126 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2023-02-15 22:30:54,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2023-02-15 22:30:54,327 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-02-15 22:30:54,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:30:54,327 INFO L85 PathProgramCache]: Analyzing trace with hash -688328850, now seen corresponding path program 1 times [2023-02-15 22:30:54,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:30:54,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152966625] [2023-02-15 22:30:54,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:30:54,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:30:54,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:30:58,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:30:58,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:30:59,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 22:30:59,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:30:59,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 22:30:59,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:31:01,127 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 22:31:01,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:31:01,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152966625] [2023-02-15 22:31:01,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152966625] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:31:01,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [21244377] [2023-02-15 22:31:01,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:31:01,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:31:01,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:31:01,128 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 22:31:01,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-02-15 22:31:01,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:31:01,387 INFO L263 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 170 conjunts are in the unsatisfiable core [2023-02-15 22:31:01,390 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:31:01,413 INFO L350 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 [2023-02-15 22:31:01,431 INFO L350 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 [2023-02-15 22:31:03,346 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 22:31:03,346 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2023-02-15 22:31:03,446 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 22:31:03,447 INFO L350 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 [2023-02-15 22:31:04,032 INFO L350 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 [2023-02-15 22:31:04,065 INFO L350 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 [2023-02-15 22:31:04,745 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:31:04,745 INFO L350 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 47 treesize of output 44 [2023-02-15 22:31:04,758 INFO L350 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 25 treesize of output 25 [2023-02-15 22:31:05,753 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 22:31:05,754 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 40 [2023-02-15 22:31:05,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:31:05,765 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2023-02-15 22:31:05,772 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2023-02-15 22:31:05,779 INFO L350 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 11 treesize of output 7 [2023-02-15 22:31:07,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:31:07,247 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 22:31:07,247 INFO L350 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 89 treesize of output 75 [2023-02-15 22:31:07,304 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-02-15 22:31:07,304 INFO L350 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 [2023-02-15 22:31:07,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:31:07,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:31:07,327 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 35 [2023-02-15 22:31:07,356 INFO L350 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 20 treesize of output 22 [2023-02-15 22:31:10,287 INFO L321 Elim1Store]: treesize reduction 32, result has 25.6 percent of original size [2023-02-15 22:31:10,287 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 157 treesize of output 97 [2023-02-15 22:31:10,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:31:10,351 INFO L321 Elim1Store]: treesize reduction 37, result has 7.5 percent of original size [2023-02-15 22:31:10,351 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 83 treesize of output 48 [2023-02-15 22:31:10,758 INFO L321 Elim1Store]: treesize reduction 56, result has 21.1 percent of original size [2023-02-15 22:31:10,758 INFO L350 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 140 treesize of output 79 [2023-02-15 22:31:10,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:31:10,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:31:10,782 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 139 treesize of output 104 [2023-02-15 22:31:13,279 INFO L321 Elim1Store]: treesize reduction 85, result has 11.5 percent of original size [2023-02-15 22:31:13,280 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 10 case distinctions, treesize of input 187 treesize of output 93 [2023-02-15 22:31:13,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:31:13,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:31:13,326 INFO L321 Elim1Store]: treesize reduction 10, result has 41.2 percent of original size [2023-02-15 22:31:13,326 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 28 [2023-02-15 22:31:13,904 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:31:13,904 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:31:21,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [21244377] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:31:21,045 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:31:21,045 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 35] total 70 [2023-02-15 22:31:21,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603267822] [2023-02-15 22:31:21,045 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:31:21,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2023-02-15 22:31:21,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:31:21,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2023-02-15 22:31:21,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=7239, Unknown=3, NotChecked=0, Total=7482 [2023-02-15 22:31:21,047 INFO L87 Difference]: Start difference. First operand 116 states and 126 transitions. Second operand has 71 states, 67 states have (on average 1.5522388059701493) internal successors, (104), 62 states have internal predecessors, (104), 5 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-15 22:31:44,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:31:44,688 INFO L93 Difference]: Finished difference Result 161 states and 175 transitions. [2023-02-15 22:31:44,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-02-15 22:31:44,689 INFO L78 Accepts]: Start accepts. Automaton has has 71 states, 67 states have (on average 1.5522388059701493) internal successors, (104), 62 states have internal predecessors, (104), 5 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 59 [2023-02-15 22:31:44,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:31:44,690 INFO L225 Difference]: With dead ends: 161 [2023-02-15 22:31:44,690 INFO L226 Difference]: Without dead ends: 161 [2023-02-15 22:31:44,690 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1982 ImplicationChecksByTransitivity, 35.6s TimeCoverageRelationStatistics Valid=707, Invalid=12398, Unknown=5, NotChecked=0, Total=13110 [2023-02-15 22:31:44,691 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 596 mSDsluCounter, 1911 mSDsCounter, 0 mSdLazyCounter, 3328 mSolverCounterSat, 37 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 598 SdHoareTripleChecker+Valid, 1953 SdHoareTripleChecker+Invalid, 3367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 3328 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2023-02-15 22:31:44,691 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [598 Valid, 1953 Invalid, 3367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 3328 Invalid, 2 Unknown, 0 Unchecked, 8.2s Time] [2023-02-15 22:31:44,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2023-02-15 22:31:44,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 118. [2023-02-15 22:31:44,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 97 states have (on average 1.2164948453608246) internal successors, (118), 111 states have internal predecessors, (118), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-15 22:31:44,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 128 transitions. [2023-02-15 22:31:44,693 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 128 transitions. Word has length 59 [2023-02-15 22:31:44,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:31:44,694 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 128 transitions. [2023-02-15 22:31:44,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 67 states have (on average 1.5522388059701493) internal successors, (104), 62 states have internal predecessors, (104), 5 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-15 22:31:44,694 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 128 transitions. [2023-02-15 22:31:44,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-02-15 22:31:44,694 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:31:44,695 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:31:44,703 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2023-02-15 22:31:44,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2023-02-15 22:31:44,901 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-02-15 22:31:44,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:31:44,902 INFO L85 PathProgramCache]: Analyzing trace with hash -59058512, now seen corresponding path program 1 times [2023-02-15 22:31:44,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:31:44,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009262835] [2023-02-15 22:31:44,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:31:44,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:31:44,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:31:49,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:31:49,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:31:50,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 22:31:50,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:31:51,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 22:31:51,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:31:53,120 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 22:31:53,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:31:53,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009262835] [2023-02-15 22:31:53,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009262835] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:31:53,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1726691988] [2023-02-15 22:31:53,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:31:53,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:31:53,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:31:53,122 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 22:31:53,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-02-15 22:31:53,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:31:53,396 INFO L263 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 193 conjunts are in the unsatisfiable core [2023-02-15 22:31:53,399 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:31:53,650 INFO L350 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 [2023-02-15 22:31:53,929 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 22:31:56,646 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 22:31:56,647 INFO L350 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 22 [2023-02-15 22:31:56,659 INFO L350 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 7 treesize of output 3 [2023-02-15 22:31:56,752 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 22:31:56,752 INFO L350 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 [2023-02-15 22:31:57,649 INFO L350 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 [2023-02-15 22:31:57,658 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-02-15 22:31:57,717 INFO L350 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 [2023-02-15 22:31:58,635 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:31:58,636 INFO L350 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 70 treesize of output 63 [2023-02-15 22:31:58,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:31:58,654 INFO L350 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 33 treesize of output 28 [2023-02-15 22:31:58,662 INFO L350 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 25 treesize of output 25 [2023-02-15 22:31:59,986 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 22:31:59,986 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 44 [2023-02-15 22:31:59,995 INFO L350 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 9 treesize of output 3 [2023-02-15 22:32:00,004 INFO L350 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 11 treesize of output 7 [2023-02-15 22:32:00,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:32:00,016 INFO L350 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 22 treesize of output 10 [2023-02-15 22:32:01,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:32:01,453 INFO L321 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-02-15 22:32:01,454 INFO L350 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 95 treesize of output 74 [2023-02-15 22:32:01,505 INFO L321 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2023-02-15 22:32:01,505 INFO L350 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 26 treesize of output 33 [2023-02-15 22:32:01,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:32:01,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:32:01,562 INFO L321 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-02-15 22:32:01,562 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 38 [2023-02-15 22:32:01,590 INFO L350 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 11 treesize of output 7 [2023-02-15 22:32:01,623 INFO L350 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 7 treesize of output 3 [2023-02-15 22:32:01,757 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-02-15 22:32:01,757 INFO L350 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 [2023-02-15 22:32:05,491 INFO L321 Elim1Store]: treesize reduction 32, result has 25.6 percent of original size [2023-02-15 22:32:05,491 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 171 treesize of output 107 [2023-02-15 22:32:05,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:32:05,547 INFO L321 Elim1Store]: treesize reduction 37, result has 7.5 percent of original size [2023-02-15 22:32:05,548 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 83 treesize of output 48 [2023-02-15 22:32:05,555 INFO L350 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 20 treesize of output 22 [2023-02-15 22:32:06,053 INFO L321 Elim1Store]: treesize reduction 56, result has 21.1 percent of original size [2023-02-15 22:32:06,053 INFO L350 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 166 treesize of output 97 [2023-02-15 22:32:06,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:32:06,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:32:06,072 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 163 treesize of output 111 [2023-02-15 22:32:06,121 INFO L350 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 36 treesize of output 38 [2023-02-15 22:32:08,977 INFO L321 Elim1Store]: treesize reduction 85, result has 11.5 percent of original size [2023-02-15 22:32:08,977 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 10 case distinctions, treesize of input 195 treesize of output 101 [2023-02-15 22:32:08,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:32:08,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:32:09,009 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-02-15 22:32:09,009 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 25 [2023-02-15 22:32:09,732 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:32:09,737 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:32:09,737 INFO L350 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 19 treesize of output 10 [2023-02-15 22:32:10,040 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:32:10,040 INFO L328 TraceCheckSpWp]: Computing backward predicates...