./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-simple/sll2n_insert_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability 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/AutomizerReach.xml -i ../sv-benchmarks/c/list-simple/sll2n_insert_equal.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 43bf83586090da08f52ccb7b612d2451c8f1efe9c820d873134ac51350c022e3 --- Real Ultimate output --- This is Ultimate 0.2.2-?-e8d5503-m [2023-02-15 19:49:28,527 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 19:49:28,529 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 19:49:28,563 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 19:49:28,563 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 19:49:28,566 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 19:49:28,567 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 19:49:28,569 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 19:49:28,570 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 19:49:28,574 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 19:49:28,575 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 19:49:28,576 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 19:49:28,576 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 19:49:28,578 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 19:49:28,579 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 19:49:28,580 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 19:49:28,581 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 19:49:28,582 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 19:49:28,583 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 19:49:28,586 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 19:49:28,587 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 19:49:28,588 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 19:49:28,589 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 19:49:28,590 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 19:49:28,596 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 19:49:28,596 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 19:49:28,597 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 19:49:28,598 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 19:49:28,598 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 19:49:28,599 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 19:49:28,599 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 19:49:28,599 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 19:49:28,600 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 19:49:28,601 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 19:49:28,602 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 19:49:28,602 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 19:49:28,608 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 19:49:28,609 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 19:49:28,609 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 19:49:28,610 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 19:49:28,611 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 19:49:28,611 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-15 19:49:28,642 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 19:49:28,642 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 19:49:28,643 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 19:49:28,643 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 19:49:28,644 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 19:49:28,644 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 19:49:28,644 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 19:49:28,644 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 19:49:28,645 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 19:49:28,645 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 19:49:28,645 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 19:49:28,645 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 19:49:28,646 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 19:49:28,646 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 19:49:28,646 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-15 19:49:28,646 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 19:49:28,646 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-15 19:49:28,646 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 19:49:28,647 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-15 19:49:28,647 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 19:49:28,647 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-15 19:49:28,647 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 19:49:28,647 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 19:49:28,647 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 19:49:28,648 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 19:49:28,648 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 19:49:28,648 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 19:49:28,648 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-15 19:49:28,648 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 19:49:28,649 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 19:49:28,649 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 19:49:28,649 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-15 19:49:28,649 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 19:49:28,649 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 19:49:28,649 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 19:49:28,649 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 ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 43bf83586090da08f52ccb7b612d2451c8f1efe9c820d873134ac51350c022e3 [2023-02-15 19:49:28,882 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 19:49:28,908 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 19:49:28,909 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 19:49:28,910 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 19:49:28,910 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 19:49:28,911 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2n_insert_equal.i [2023-02-15 19:49:29,873 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 19:49:30,127 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 19:49:30,128 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_insert_equal.i [2023-02-15 19:49:30,135 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a82c30728/37c1095c353e4d5a9096ca29db4c2af5/FLAG90afb158c [2023-02-15 19:49:30,145 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a82c30728/37c1095c353e4d5a9096ca29db4c2af5 [2023-02-15 19:49:30,147 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 19:49:30,148 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 19:49:30,148 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 19:49:30,148 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 19:49:30,151 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 19:49:30,151 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 07:49:30" (1/1) ... [2023-02-15 19:49:30,152 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cf0287c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:49:30, skipping insertion in model container [2023-02-15 19:49:30,152 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 07:49:30" (1/1) ... [2023-02-15 19:49:30,157 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 19:49:30,192 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 19:49:30,427 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/sll2n_insert_equal.i[24301,24314] [2023-02-15 19:49:30,430 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 19:49:30,440 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 19:49:30,471 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/sll2n_insert_equal.i[24301,24314] [2023-02-15 19:49:30,472 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 19:49:30,489 INFO L208 MainTranslator]: Completed translation [2023-02-15 19:49:30,490 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:49:30 WrapperNode [2023-02-15 19:49:30,490 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 19:49:30,490 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 19:49:30,491 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 19:49:30,491 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 19:49:30,495 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:49:30" (1/1) ... [2023-02-15 19:49:30,504 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:49:30" (1/1) ... [2023-02-15 19:49:30,518 INFO L138 Inliner]: procedures = 127, calls = 32, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 119 [2023-02-15 19:49:30,519 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 19:49:30,519 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 19:49:30,519 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 19:49:30,519 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 19:49:30,533 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:49:30" (1/1) ... [2023-02-15 19:49:30,533 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:49:30" (1/1) ... [2023-02-15 19:49:30,536 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:49:30" (1/1) ... [2023-02-15 19:49:30,536 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:49:30" (1/1) ... [2023-02-15 19:49:30,540 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:49:30" (1/1) ... [2023-02-15 19:49:30,542 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:49:30" (1/1) ... [2023-02-15 19:49:30,544 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:49:30" (1/1) ... [2023-02-15 19:49:30,544 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:49:30" (1/1) ... [2023-02-15 19:49:30,546 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 19:49:30,547 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 19:49:30,547 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 19:49:30,547 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 19:49:30,548 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:49:30" (1/1) ... [2023-02-15 19:49:30,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 19:49:30,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:49:30,591 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 19:49:30,602 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 19:49:30,624 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-15 19:49:30,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-15 19:49:30,624 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-02-15 19:49:30,624 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-02-15 19:49:30,624 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-15 19:49:30,624 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 19:49:30,625 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-15 19:49:30,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-15 19:49:30,625 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-15 19:49:30,625 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-15 19:49:30,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-02-15 19:49:30,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-15 19:49:30,625 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 19:49:30,625 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 19:49:30,765 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 19:49:30,767 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 19:49:30,948 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 19:49:30,953 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 19:49:30,954 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2023-02-15 19:49:30,955 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 07:49:30 BoogieIcfgContainer [2023-02-15 19:49:30,955 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 19:49:30,957 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 19:49:30,957 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 19:49:30,959 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 19:49:30,959 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 07:49:30" (1/3) ... [2023-02-15 19:49:30,959 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22090e5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 07:49:30, skipping insertion in model container [2023-02-15 19:49:30,959 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:49:30" (2/3) ... [2023-02-15 19:49:30,960 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22090e5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 07:49:30, skipping insertion in model container [2023-02-15 19:49:30,960 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 07:49:30" (3/3) ... [2023-02-15 19:49:30,960 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_insert_equal.i [2023-02-15 19:49:30,972 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 19:49:30,972 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-15 19:49:30,998 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 19:49:31,002 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=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@37bbb14e, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 19:49:31,002 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-15 19:49:31,017 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 25 states have (on average 1.52) internal successors, (38), 26 states have internal predecessors, (38), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 19:49:31,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-15 19:49:31,021 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:49:31,022 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:49:31,022 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:49:31,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:49:31,025 INFO L85 PathProgramCache]: Analyzing trace with hash -497301104, now seen corresponding path program 1 times [2023-02-15 19:49:31,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:49:31,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872087297] [2023-02-15 19:49:31,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:49:31,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:49:31,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:49:31,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-15 19:49:31,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:49:31,191 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 19:49:31,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:49:31,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872087297] [2023-02-15 19:49:31,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872087297] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:49:31,193 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:49:31,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 19:49:31,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340951541] [2023-02-15 19:49:31,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:49:31,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 19:49:31,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:49:31,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 19:49:31,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 19:49:31,217 INFO L87 Difference]: Start difference. First operand has 30 states, 25 states have (on average 1.52) internal successors, (38), 26 states have internal predecessors, (38), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 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 19:49:31,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:49:31,278 INFO L93 Difference]: Finished difference Result 54 states and 75 transitions. [2023-02-15 19:49:31,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 19:49:31,280 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 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 19 [2023-02-15 19:49:31,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:49:31,284 INFO L225 Difference]: With dead ends: 54 [2023-02-15 19:49:31,284 INFO L226 Difference]: Without dead ends: 24 [2023-02-15 19:49:31,286 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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 19:49:31,288 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 0 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 19:49:31,288 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 55 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 19:49:31,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2023-02-15 19:49:31,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2023-02-15 19:49:31,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 19:49:31,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2023-02-15 19:49:31,310 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 19 [2023-02-15 19:49:31,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:49:31,310 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2023-02-15 19:49:31,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 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 19:49:31,311 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2023-02-15 19:49:31,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-15 19:49:31,312 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:49:31,312 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:49:31,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-15 19:49:31,312 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:49:31,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:49:31,313 INFO L85 PathProgramCache]: Analyzing trace with hash -1988891516, now seen corresponding path program 1 times [2023-02-15 19:49:31,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:49:31,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714188189] [2023-02-15 19:49:31,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:49:31,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:49:31,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:49:31,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-15 19:49:31,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:49:31,461 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 19:49:31,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:49:31,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714188189] [2023-02-15 19:49:31,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714188189] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:49:31,467 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:49:31,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 19:49:31,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009084458] [2023-02-15 19:49:31,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:49:31,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 19:49:31,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:49:31,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 19:49:31,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 19:49:31,470 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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 19:49:31,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:49:31,518 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2023-02-15 19:49:31,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 19:49:31,518 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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 19 [2023-02-15 19:49:31,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:49:31,520 INFO L225 Difference]: With dead ends: 46 [2023-02-15 19:49:31,521 INFO L226 Difference]: Without dead ends: 28 [2023-02-15 19:49:31,533 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 19:49:31,533 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 2 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 19:49:31,534 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 64 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 19:49:31,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-02-15 19:49:31,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2023-02-15 19:49:31,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 19:49:31,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2023-02-15 19:49:31,539 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 19 [2023-02-15 19:49:31,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:49:31,539 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2023-02-15 19:49:31,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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 19:49:31,539 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2023-02-15 19:49:31,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-02-15 19:49:31,540 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:49:31,540 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:49:31,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-15 19:49:31,540 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:49:31,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:49:31,541 INFO L85 PathProgramCache]: Analyzing trace with hash 208174980, now seen corresponding path program 1 times [2023-02-15 19:49:31,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:49:31,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666300910] [2023-02-15 19:49:31,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:49:31,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:49:31,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:49:31,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 19:49:31,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:49:31,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-02-15 19:49:31,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:49:31,750 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-15 19:49:31,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:49:31,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666300910] [2023-02-15 19:49:31,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666300910] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:49:31,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [528711205] [2023-02-15 19:49:31,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:49:31,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:49:31,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:49:31,769 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 19:49:31,773 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 19:49:31,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:49:31,890 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-15 19:49:31,895 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:49:31,946 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:49:31,946 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:49:31,989 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-15 19:49:31,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [528711205] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 19:49:31,990 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 19:49:31,990 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2023-02-15 19:49:31,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189154102] [2023-02-15 19:49:31,993 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 19:49:31,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 19:49:31,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:49:31,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 19:49:31,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-02-15 19:49:31,996 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-15 19:49:32,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:49:32,040 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2023-02-15 19:49:32,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 19:49:32,041 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 28 [2023-02-15 19:49:32,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:49:32,042 INFO L225 Difference]: With dead ends: 47 [2023-02-15 19:49:32,042 INFO L226 Difference]: Without dead ends: 29 [2023-02-15 19:49:32,042 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 56 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-02-15 19:49:32,044 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 2 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 19:49:32,046 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 64 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 19:49:32,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-02-15 19:49:32,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2023-02-15 19:49:32,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 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 19:49:32,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2023-02-15 19:49:32,054 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 28 [2023-02-15 19:49:32,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:49:32,054 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2023-02-15 19:49:32,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-15 19:49:32,056 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2023-02-15 19:49:32,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-15 19:49:32,057 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:49:32,057 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:49:32,066 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-15 19:49:32,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:49:32,266 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:49:32,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:49:32,267 INFO L85 PathProgramCache]: Analyzing trace with hash -941011836, now seen corresponding path program 2 times [2023-02-15 19:49:32,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:49:32,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209969234] [2023-02-15 19:49:32,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:49:32,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:49:32,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:49:32,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 19:49:32,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:49:32,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 19:49:32,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:49:32,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 19:49:32,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:49:32,372 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-02-15 19:49:32,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:49:32,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209969234] [2023-02-15 19:49:32,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209969234] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:49:32,373 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:49:32,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 19:49:32,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061857166] [2023-02-15 19:49:32,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:49:32,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 19:49:32,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:49:32,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 19:49:32,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 19:49:32,377 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 19:49:32,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:49:32,405 INFO L93 Difference]: Finished difference Result 45 states and 55 transitions. [2023-02-15 19:49:32,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 19:49:32,406 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 37 [2023-02-15 19:49:32,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:49:32,408 INFO L225 Difference]: With dead ends: 45 [2023-02-15 19:49:32,408 INFO L226 Difference]: Without dead ends: 38 [2023-02-15 19:49:32,408 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 19:49:32,413 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 9 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 19:49:32,414 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 64 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 19:49:32,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-02-15 19:49:32,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 31. [2023-02-15 19:49:32,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 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 19:49:32,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2023-02-15 19:49:32,420 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 37 [2023-02-15 19:49:32,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:49:32,421 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2023-02-15 19:49:32,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 19:49:32,421 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2023-02-15 19:49:32,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-15 19:49:32,424 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:49:32,426 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:49:32,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-15 19:49:32,427 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:49:32,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:49:32,427 INFO L85 PathProgramCache]: Analyzing trace with hash -883753534, now seen corresponding path program 1 times [2023-02-15 19:49:32,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:49:32,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092376507] [2023-02-15 19:49:32,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:49:32,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:49:32,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:49:32,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 19:49:32,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:49:32,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 19:49:32,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:49:32,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 19:49:32,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:49:32,605 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-02-15 19:49:32,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:49:32,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092376507] [2023-02-15 19:49:32,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092376507] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:49:32,606 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:49:32,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 19:49:32,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004851664] [2023-02-15 19:49:32,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:49:32,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 19:49:32,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:49:32,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 19:49:32,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-02-15 19:49:32,607 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 19:49:32,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:49:32,632 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2023-02-15 19:49:32,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 19:49:32,633 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 37 [2023-02-15 19:49:32,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:49:32,634 INFO L225 Difference]: With dead ends: 38 [2023-02-15 19:49:32,634 INFO L226 Difference]: Without dead ends: 30 [2023-02-15 19:49:32,635 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-02-15 19:49:32,635 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 13 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 19:49:32,635 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 64 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 19:49:32,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-02-15 19:49:32,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2023-02-15 19:49:32,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 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 19:49:32,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2023-02-15 19:49:32,642 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 37 [2023-02-15 19:49:32,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:49:32,642 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2023-02-15 19:49:32,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 19:49:32,642 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2023-02-15 19:49:32,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-02-15 19:49:32,643 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:49:32,643 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:49:32,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-15 19:49:32,643 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:49:32,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:49:32,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1457377551, now seen corresponding path program 1 times [2023-02-15 19:49:32,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:49:32,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502815275] [2023-02-15 19:49:32,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:49:32,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:49:32,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:49:33,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 19:49:33,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:49:33,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 19:49:33,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:49:33,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 19:49:33,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:49:33,256 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-15 19:49:33,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:49:33,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502815275] [2023-02-15 19:49:33,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502815275] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:49:33,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [173383108] [2023-02-15 19:49:33,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:49:33,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:49:33,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:49:33,261 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 19:49:33,264 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 19:49:33,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:49:33,386 INFO L263 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 36 conjunts are in the unsatisfiable core [2023-02-15 19:49:33,390 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:49:33,568 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 8 treesize of output 4 [2023-02-15 19:49:33,625 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (not (= 0 |c_node_create_#res#1.base|)) (exists ((v_ArrVal_545 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| v_ArrVal_545)))) is different from true [2023-02-15 19:49:33,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:49:33,677 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 15 treesize of output 17 [2023-02-15 19:49:33,774 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2023-02-15 19:49:33,775 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 22 treesize of output 31 [2023-02-15 19:49:35,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:49:35,895 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2023-02-15 19:49:35,895 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 2 case distinctions, treesize of input 33 treesize of output 40 [2023-02-15 19:49:35,910 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 19:49:35,921 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 16 treesize of output 8 [2023-02-15 19:49:35,923 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 2 not checked. [2023-02-15 19:49:35,923 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:49:36,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [173383108] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:49:36,180 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 19:49:36,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 30 [2023-02-15 19:49:36,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000097153] [2023-02-15 19:49:36,180 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 19:49:36,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-02-15 19:49:36,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:49:36,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-02-15 19:49:36,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=974, Unknown=33, NotChecked=64, Total=1190 [2023-02-15 19:49:36,181 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand has 30 states, 28 states have (on average 1.7857142857142858) internal successors, (50), 24 states have internal predecessors, (50), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2023-02-15 19:49:44,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:49:44,819 INFO L93 Difference]: Finished difference Result 50 states and 60 transitions. [2023-02-15 19:49:44,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-02-15 19:49:44,819 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 28 states have (on average 1.7857142857142858) internal successors, (50), 24 states have internal predecessors, (50), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 38 [2023-02-15 19:49:44,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:49:44,820 INFO L225 Difference]: With dead ends: 50 [2023-02-15 19:49:44,820 INFO L226 Difference]: Without dead ends: 47 [2023-02-15 19:49:44,821 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 411 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=312, Invalid=1729, Unknown=33, NotChecked=88, Total=2162 [2023-02-15 19:49:44,821 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 203 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 52 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 19:49:44,822 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 163 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 240 Invalid, 0 Unknown, 52 Unchecked, 0.2s Time] [2023-02-15 19:49:44,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2023-02-15 19:49:44,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 31. [2023-02-15 19:49:44,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 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 19:49:44,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2023-02-15 19:49:44,827 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 38 [2023-02-15 19:49:44,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:49:44,827 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2023-02-15 19:49:44,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 28 states have (on average 1.7857142857142858) internal successors, (50), 24 states have internal predecessors, (50), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2023-02-15 19:49:44,828 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2023-02-15 19:49:44,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-02-15 19:49:44,828 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:49:44,828 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:49:44,834 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-02-15 19:49:45,033 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,SelfDestructingSolverStorable5 [2023-02-15 19:49:45,034 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:49:45,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:49:45,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1457379225, now seen corresponding path program 1 times [2023-02-15 19:49:45,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:49:45,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490449621] [2023-02-15 19:49:45,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:49:45,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:49:45,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:49:45,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 19:49:45,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:49:45,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 19:49:45,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:49:45,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 19:49:45,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:49:46,149 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-15 19:49:46,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:49:46,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490449621] [2023-02-15 19:49:46,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490449621] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:49:46,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [499030107] [2023-02-15 19:49:46,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:49:46,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:49:46,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:49:46,151 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 19:49:46,154 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 19:49:46,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:49:46,422 INFO L263 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 126 conjunts are in the unsatisfiable core [2023-02-15 19:49:46,426 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:49:46,432 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 19:49:46,477 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 19:49:46,548 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 19:49:46,548 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 19:49:46,642 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 19:49:46,684 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 11 treesize of output 7 [2023-02-15 19:49:46,744 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 19:49:46,745 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 19:49:46,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:49:46,831 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 21 treesize of output 20 [2023-02-15 19:49:47,043 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 19:49:47,047 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 19:49:47,052 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 19:49:47,055 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 19:49:47,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:49:47,257 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 19:49:47,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:49:47,268 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 35 treesize of output 33 [2023-02-15 19:49:47,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:49:47,276 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-02-15 19:49:47,277 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 19:49: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 19:49:47,528 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 19:49:47,528 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 80 treesize of output 71 [2023-02-15 19:49:47,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:49:47,539 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 33 treesize of output 28 [2023-02-15 19:49:47,544 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 36 treesize of output 27 [2023-02-15 19:49:47,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:49:47,626 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 47 treesize of output 43 [2023-02-15 19:49:47,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:49:47,632 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 27 treesize of output 32 [2023-02-15 19:49:47,635 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 19:49:47,699 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 40 treesize of output 24 [2023-02-15 19:49:47,704 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 24 treesize of output 10 [2023-02-15 19:49:47,737 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 19:49:47,769 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 19:49:47,769 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:49:47,789 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_728 (Array Int Int)) (v_ArrVal_729 (Array Int Int)) (v_ArrVal_730 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_728) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_729) |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_insert_~new_node~0#1.base| v_ArrVal_730) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2023-02-15 19:49:47,800 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_724 (Array Int Int)) (v_ArrVal_728 (Array Int Int)) (v_ArrVal_729 (Array Int Int)) (v_ArrVal_727 Int) (v_ArrVal_730 (Array Int Int))) (= (let ((.cse0 (+ |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| 4))) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base|) .cse0 v_ArrVal_727)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_728) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_724) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_729) |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_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base|) .cse0 |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_730) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2023-02-15 19:49:47,824 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_724 (Array Int Int)) (v_ArrVal_728 (Array Int Int)) (v_ArrVal_729 (Array Int Int)) (|v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_10| Int) (v_ArrVal_727 Int) (v_ArrVal_730 (Array Int Int))) (or (not (<= |c_ULTIMATE.start_sll_insert_~last~0#1.offset| |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_10|)) (= (let ((.cse0 (+ |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_10| 4))) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_insert_~last~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_insert_~last~0#1.base|) .cse0 v_ArrVal_727)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_728) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_724) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_729) |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_insert_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~last~0#1.base|) .cse0 |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_730) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) |c_ULTIMATE.start_main_~data~0#1|))) is different from false [2023-02-15 19:49:48,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [499030107] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:49:48,523 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 19:49:48,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 23] total 40 [2023-02-15 19:49:48,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982938362] [2023-02-15 19:49:48,524 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 19:49:48,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2023-02-15 19:49:48,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:49:48,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2023-02-15 19:49:48,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1574, Unknown=34, NotChecked=246, Total=1980 [2023-02-15 19:49:48,527 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand has 40 states, 38 states have (on average 1.5789473684210527) internal successors, (60), 32 states have internal predecessors, (60), 4 states have call successors, (4), 3 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-15 19:49:49,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:49:49,608 INFO L93 Difference]: Finished difference Result 45 states and 54 transitions. [2023-02-15 19:49:49,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-02-15 19:49:49,611 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 38 states have (on average 1.5789473684210527) internal successors, (60), 32 states have internal predecessors, (60), 4 states have call successors, (4), 3 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 38 [2023-02-15 19:49:49,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:49:49,613 INFO L225 Difference]: With dead ends: 45 [2023-02-15 19:49:49,614 INFO L226 Difference]: Without dead ends: 43 [2023-02-15 19:49:49,617 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 522 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=337, Invalid=2720, Unknown=35, NotChecked=330, Total=3422 [2023-02-15 19:49:49,617 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 183 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 537 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 19:49:49,617 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 221 Invalid, 571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 537 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 19:49:49,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2023-02-15 19:49:49,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 37. [2023-02-15 19:49:49,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.21875) internal successors, (39), 32 states have internal predecessors, (39), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 19:49:49,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 45 transitions. [2023-02-15 19:49:49,623 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 45 transitions. Word has length 38 [2023-02-15 19:49:49,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:49:49,624 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 45 transitions. [2023-02-15 19:49:49,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 38 states have (on average 1.5789473684210527) internal successors, (60), 32 states have internal predecessors, (60), 4 states have call successors, (4), 3 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-15 19:49:49,624 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2023-02-15 19:49:49,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-02-15 19:49:49,625 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:49:49,625 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:49:49,631 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 19:49:49,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:49:49,831 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:49:49,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:49:49,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1514637527, now seen corresponding path program 1 times [2023-02-15 19:49:49,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:49:49,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974616357] [2023-02-15 19:49:49,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:49:49,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:49:49,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:49:50,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 19:49:50,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:49:50,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 19:49:50,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:49:50,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 19:49:50,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:49:50,136 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-15 19:49:50,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:49:50,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974616357] [2023-02-15 19:49:50,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974616357] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:49:50,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1436956268] [2023-02-15 19:49:50,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:49:50,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:49:50,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:49:50,139 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 19:49:50,155 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 19:49:50,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:49:50,295 INFO L263 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 34 conjunts are in the unsatisfiable core [2023-02-15 19:49:50,297 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:49:50,472 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 19:49:50,506 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_901 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_901))) (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|))) is different from true [2023-02-15 19:49:50,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:49:50,520 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 19:49:50,543 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 25 treesize of output 13 [2023-02-15 19:49:50,584 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 2 not checked. [2023-02-15 19:49:50,584 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:49:50,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1436956268] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:49:50,674 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 19:49:50,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 25 [2023-02-15 19:49:50,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363966204] [2023-02-15 19:49:50,674 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 19:49:50,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-02-15 19:49:50,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:49:50,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-02-15 19:49:50,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=571, Unknown=3, NotChecked=48, Total=702 [2023-02-15 19:49:50,675 INFO L87 Difference]: Start difference. First operand 37 states and 45 transitions. Second operand has 25 states, 23 states have (on average 2.130434782608696) internal successors, (49), 19 states have internal predecessors, (49), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-15 19:49:51,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:49:51,000 INFO L93 Difference]: Finished difference Result 50 states and 60 transitions. [2023-02-15 19:49:51,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-15 19:49:51,001 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 2.130434782608696) internal successors, (49), 19 states have internal predecessors, (49), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 38 [2023-02-15 19:49:51,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:49:51,001 INFO L225 Difference]: With dead ends: 50 [2023-02-15 19:49:51,001 INFO L226 Difference]: Without dead ends: 42 [2023-02-15 19:49:51,002 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 36 SyntacticMatches, 4 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=170, Invalid=953, Unknown=3, NotChecked=64, Total=1190 [2023-02-15 19:49:51,002 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 129 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 39 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 19:49:51,002 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 197 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 203 Invalid, 0 Unknown, 39 Unchecked, 0.1s Time] [2023-02-15 19:49:51,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2023-02-15 19:49:51,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 37. [2023-02-15 19:49:51,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.1875) internal successors, (38), 32 states have internal predecessors, (38), 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 19:49:51,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2023-02-15 19:49:51,008 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 38 [2023-02-15 19:49:51,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:49:51,009 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 44 transitions. [2023-02-15 19:49:51,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 2.130434782608696) internal successors, (49), 19 states have internal predecessors, (49), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-15 19:49:51,009 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2023-02-15 19:49:51,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-02-15 19:49:51,010 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:49:51,010 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:49:51,018 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-02-15 19:49:51,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:49:51,218 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:49:51,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:49:51,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1501961106, now seen corresponding path program 2 times [2023-02-15 19:49:51,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:49:51,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972512161] [2023-02-15 19:49:51,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:49:51,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:49:51,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:49:51,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 19:49:51,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:49:51,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 19:49:51,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:49:51,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 19:49:51,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:49:51,339 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-02-15 19:49:51,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:49:51,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972512161] [2023-02-15 19:49:51,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972512161] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:49:51,339 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:49:51,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 19:49:51,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166807464] [2023-02-15 19:49:51,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:49:51,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 19:49:51,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:49:51,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 19:49:51,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-15 19:49:51,341 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 19:49:51,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:49:51,370 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2023-02-15 19:49:51,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 19:49:51,370 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 39 [2023-02-15 19:49:51,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:49:51,371 INFO L225 Difference]: With dead ends: 42 [2023-02-15 19:49:51,371 INFO L226 Difference]: Without dead ends: 32 [2023-02-15 19:49:51,371 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-02-15 19:49:51,372 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 23 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 19:49:51,372 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 68 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 19:49:51,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-02-15 19:49:51,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2023-02-15 19:49:51,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 27 states have internal predecessors, (30), 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 19:49:51,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2023-02-15 19:49:51,377 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 39 [2023-02-15 19:49:51,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:49:51,378 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2023-02-15 19:49:51,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 19:49:51,378 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2023-02-15 19:49:51,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-02-15 19:49:51,378 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:49:51,379 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:49:51,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-02-15 19:49:51,379 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:49:51,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:49:51,379 INFO L85 PathProgramCache]: Analyzing trace with hash 382129514, now seen corresponding path program 1 times [2023-02-15 19:49:51,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:49:51,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446746913] [2023-02-15 19:49:51,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:49:51,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:49:51,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:49:52,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 19:49:52,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:49:52,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 19:49:52,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:49:52,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 19:49:52,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:49:52,322 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-15 19:49:52,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:49:52,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446746913] [2023-02-15 19:49:52,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446746913] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:49:52,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [145946142] [2023-02-15 19:49:52,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:49:52,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:49:52,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:49:52,347 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 19:49:52,348 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 19:49:52,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:49:52,481 INFO L263 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 113 conjunts are in the unsatisfiable core [2023-02-15 19:49:52,488 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:49:52,491 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 19:49:52,526 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 19:49:52,625 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 19:49:52,625 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 1 case distinctions, treesize of input 12 treesize of output 14 [2023-02-15 19:49:52,692 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 19:49:52,693 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 11 treesize of output 7 [2023-02-15 19:49:52,821 INFO L321 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2023-02-15 19:49:52,821 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 33 [2023-02-15 19:49:52,877 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 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 19:49:53,077 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-15 19:49:53,078 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 67 treesize of output 30 [2023-02-15 19:49:53,083 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 19:49:53,089 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 19:49:53,090 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 10 [2023-02-15 19:49:53,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:49:53,295 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 19:49:53,295 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 73 treesize of output 61 [2023-02-15 19:49:53,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:49:53,312 INFO L321 Elim1Store]: treesize reduction 24, result has 46.7 percent of original size [2023-02-15 19:49:53,313 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 33 [2023-02-15 19:49:53,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:49:53,324 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 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 19:49:53,621 INFO L321 Elim1Store]: treesize reduction 46, result has 56.2 percent of original size [2023-02-15 19:49:53,621 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 87 treesize of output 98 [2023-02-15 19:49:53,639 INFO L321 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2023-02-15 19:49:53,639 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 21 treesize of output 20 [2023-02-15 19:49:53,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:49:53,929 INFO L321 Elim1Store]: treesize reduction 88, result has 42.1 percent of original size [2023-02-15 19:49:53,929 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 203 treesize of output 182 [2023-02-15 19:49:53,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:49:53,963 INFO L321 Elim1Store]: treesize reduction 48, result has 44.8 percent of original size [2023-02-15 19:49:53,963 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 183 treesize of output 215 [2023-02-15 19:49:55,514 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 19:49:55,985 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 19:49:56,056 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-15 19:49:56,057 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 56 treesize of output 23 [2023-02-15 19:49:56,060 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 13 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 19:49:56,060 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:49:58,256 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_sll_insert_~last~0#1.offset| Int) (|ULTIMATE.start_sll_insert_~last~0#1.base| Int) (v_ArrVal_1176 (Array Int Int))) (not (= 0 (let ((.cse3 (+ |ULTIMATE.start_sll_insert_~last~0#1.offset| 4))) (select (let ((.cse0 (let ((.cse2 (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_insert_~last~0#1.base|))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_insert_~last~0#1.base| (store .cse2 .cse3 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|)))) (store .cse1 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select .cse1 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) (+ |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset| 4) (select .cse2 .cse3))))))) (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| |ULTIMATE.start_sll_insert_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_insert_~last~0#1.base|) .cse3 |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1176) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))))) is different from false [2023-02-15 19:50:00,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [145946142] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:50:00,707 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 19:50:00,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 25] total 41 [2023-02-15 19:50:00,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627897804] [2023-02-15 19:50:00,707 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 19:50:00,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-02-15 19:50:00,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:50:00,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-02-15 19:50:00,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=1996, Unknown=15, NotChecked=90, Total=2256 [2023-02-15 19:50:00,709 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 41 states, 39 states have (on average 1.5897435897435896) internal successors, (62), 33 states have internal predecessors, (62), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-15 19:50:02,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:50:02,643 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2023-02-15 19:50:02,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-02-15 19:50:02,644 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 39 states have (on average 1.5897435897435896) internal successors, (62), 33 states have internal predecessors, (62), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 40 [2023-02-15 19:50:02,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:50:02,645 INFO L225 Difference]: With dead ends: 41 [2023-02-15 19:50:02,645 INFO L226 Difference]: Without dead ends: 38 [2023-02-15 19:50:02,646 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 774 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=431, Invalid=3590, Unknown=15, NotChecked=124, Total=4160 [2023-02-15 19:50:02,647 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 136 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 594 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 594 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-15 19:50:02,647 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 348 Invalid, 610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 594 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-15 19:50:02,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-02-15 19:50:02,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 33. [2023-02-15 19:50:02,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 28 states have internal predecessors, (31), 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 19:50:02,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2023-02-15 19:50:02,669 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 40 [2023-02-15 19:50:02,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:50:02,670 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2023-02-15 19:50:02,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 39 states have (on average 1.5897435897435896) internal successors, (62), 33 states have internal predecessors, (62), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-15 19:50:02,670 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2023-02-15 19:50:02,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-02-15 19:50:02,672 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:50:02,673 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:50:02,685 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 19:50:02,880 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 19:50:02,880 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:50:02,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:50:02,881 INFO L85 PathProgramCache]: Analyzing trace with hash 382131188, now seen corresponding path program 1 times [2023-02-15 19:50:02,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:50:02,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507394411] [2023-02-15 19:50:02,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:50:02,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:50:02,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:50:03,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 19:50:03,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:50:03,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 19:50:03,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:50:03,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 19:50:03,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:50:03,994 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-15 19:50:03,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:50:03,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507394411] [2023-02-15 19:50:03,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507394411] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:50:03,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1307347321] [2023-02-15 19:50:03,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:50:03,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:50:03,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:50:04,009 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 19:50:04,080 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 19:50:04,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:50:04,229 INFO L263 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 154 conjunts are in the unsatisfiable core [2023-02-15 19:50:04,232 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:50:04,269 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 19:50:04,524 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 19:50:04,524 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 19:50:04,581 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 13 treesize of output 9 [2023-02-15 19:50:04,596 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 19:50:04,826 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:50:04,826 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 1 case distinctions, treesize of input 57 treesize of output 28 [2023-02-15 19:50:04,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:50:04,831 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 15 treesize of output 7 [2023-02-15 19:50:04,833 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 19:50:04,912 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 11 treesize of output 7 [2023-02-15 19:50:04,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:50:04,993 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 19:50:04,996 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 65 treesize of output 59 [2023-02-15 19:50:05,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:50:05,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:50:05,013 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2023-02-15 19:50:05,013 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 25 treesize of output 38 [2023-02-15 19:50:05,035 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-02-15 19:50:05,036 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 19:50:05,348 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 19:50:05,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:50:05,351 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:50:05,351 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 1 case distinctions, treesize of input 132 treesize of output 89 [2023-02-15 19:50:05,356 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 33 treesize of output 28 [2023-02-15 19:50:05,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:50:05,362 INFO L321 Elim1Store]: treesize reduction 31, result has 3.1 percent of original size [2023-02-15 19:50:05,363 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 43 [2023-02-15 19:50:05,451 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2023-02-15 19:50:05,451 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 126 treesize of output 95 [2023-02-15 19:50:05,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:50:05,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:50:05,459 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 39 treesize of output 42 [2023-02-15 19:50:05,471 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 19:50:05,606 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 19:50:05,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:50:05,610 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:50:05,610 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 120 treesize of output 68 [2023-02-15 19:50:05,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:50:05,615 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 22 [2023-02-15 19:50:05,731 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 19:50:05,765 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 13 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:50:05,766 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:50:05,902 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1359 (Array Int Int)) (v_ArrVal_1360 Int) (v_ArrVal_1362 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1362)) (.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1359))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) (+ |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset| 4) v_ArrVal_1360))) (.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (let ((.cse3 (+ .cse5 4))) (select (select .cse0 (select (select .cse1 .cse2) .cse3)) (select (select .cse4 .cse2) .cse3))) |c_ULTIMATE.start_main_~data~0#1|) (not (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse0 .cse2) .cse5))))))) is different from false [2023-02-15 19:50:06,030 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1359 (Array Int Int)) (v_ArrVal_1360 Int) (v_ArrVal_1355 Int) (v_ArrVal_1362 (Array Int Int))) (let ((.cse7 (+ |c_ULTIMATE.start_sll_insert_~last~0#1.offset| 4))) (let ((.cse5 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~last~0#1.base|) .cse7 |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1362)) (.cse3 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~last~0#1.base|) .cse7 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1359))) (let ((.cse0 (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_sll_insert_~last~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_insert_~last~0#1.base|) .cse7 v_ArrVal_1355)))) (store .cse6 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select .cse6 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) (+ |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset| 4) v_ArrVal_1360)))) (.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse0 .cse1) .cse2))) (= (let ((.cse4 (+ .cse2 4))) (select (select .cse0 (select (select .cse3 .cse1) .cse4)) (select (select .cse5 .cse1) .cse4))) |c_ULTIMATE.start_main_~data~0#1|)))))) is different from false [2023-02-15 19:50:06,287 INFO L321 Elim1Store]: treesize reduction 4, result has 98.9 percent of original size [2023-02-15 19:50:06,288 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 41452 treesize of output 39455 [2023-02-15 19:50:24,701 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse106 (= |c_ULTIMATE.start_sll_insert_~data#1| |c_ULTIMATE.start_main_~data~0#1|))) (and (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| Int)) (or (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))) (forall ((v_ArrVal_1359 (Array Int Int)) (v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1370)) (.cse8 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1369))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse4 (+ (select (select .cse6 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse5 (store (store .cse8 .cse7 (store (select .cse8 .cse7) .cse4 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1359))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_1362 (Array Int Int))) (let ((.cse0 (store (store .cse6 .cse7 (store (select .cse6 .cse7) .cse4 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1362))) (let ((.cse3 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (+ .cse3 4))) (or (= (select (select .cse0 .cse1) .cse2) .cse3) (= .cse3 4) (= .cse3 .cse4) (= (select (select .cse5 .cse1) .cse2) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)))))) (= .cse1 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| Int)) (or (forall ((v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1362 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (let ((.cse18 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1370)) (.cse17 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1369))) (let ((.cse15 (select (select .cse17 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse13 (+ (select (select .cse18 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse10 (store (store .cse18 .cse15 (store (select .cse18 .cse15) .cse13 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1362))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= .cse9 0) (forall ((v_ArrVal_1359 (Array Int Int))) (let ((.cse16 (store (store .cse17 .cse15 (store (select .cse17 .cse15) .cse13 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1359))) (let ((.cse11 (select (select .cse16 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse12 (+ .cse9 4))) (let ((.cse14 (select (select .cse16 .cse11) .cse12))) (or (not (= (select (select .cse10 .cse11) .cse12) .cse13)) (= .cse14 .cse11) (not (= .cse14 .cse15)) (= .cse11 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)))))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| Int)) (or (forall ((v_ArrVal_1359 (Array Int Int)) (v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (let ((.cse27 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1370)) (.cse28 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1369))) (let ((.cse25 (select (select .cse28 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse22 (+ (select (select .cse27 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse26 (store (store .cse28 .cse25 (store (select .cse28 .cse25) .cse22 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1359))) (let ((.cse20 (select (select .cse26 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_1362 (Array Int Int))) (let ((.cse19 (store (store .cse27 .cse25 (store (select .cse27 .cse25) .cse22 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1362))) (let ((.cse24 (select (select .cse19 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse21 (+ .cse24 4))) (let ((.cse23 (select (select .cse26 .cse20) .cse21))) (or (not (= (select (select .cse19 .cse20) .cse21) .cse22)) (= .cse23 .cse20) (not (= .cse24 4)) (not (= .cse23 .cse25)))))))) (= .cse20 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| Int)) (or (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1362 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (let ((.cse35 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1370)) (.cse32 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1369))) (let ((.cse33 (select (select .cse32 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse34 (+ (select (select .cse35 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse31 (store (store .cse35 .cse33 (store (select .cse35 .cse33) .cse34 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1362))) (let ((.cse29 (select (select .cse31 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse29 4)) (forall ((v_ArrVal_1359 (Array Int Int))) (let ((.cse30 (select (select .cse31 (select (select (store (store .cse32 .cse33 (store (select .cse32 .cse33) .cse34 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1359) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ .cse29 4)))) (or (= .cse30 .cse29) (= .cse30 0)))))))))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| Int)) (or (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))) (forall ((v_ArrVal_1359 (Array Int Int)) (v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (let ((.cse43 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1370)) (.cse45 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1369))) (let ((.cse44 (select (select .cse45 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse41 (+ (select (select .cse43 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse38 (store (store .cse45 .cse44 (store (select .cse45 .cse44) .cse41 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1359))) (let ((.cse39 (select (select .cse38 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_1362 (Array Int Int))) (let ((.cse42 (store (store .cse43 .cse44 (store (select .cse43 .cse44) .cse41 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1362))) (let ((.cse37 (select (select .cse42 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse40 (+ .cse37 4))) (let ((.cse36 (select (select .cse42 .cse39) .cse40))) (or (= .cse36 .cse37) (= .cse37 4) (= (select (select .cse38 .cse39) .cse40) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|) (= .cse36 .cse41))))))) (= .cse39 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| Int)) (or (forall ((v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1362 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (let ((.cse55 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1370)) (.cse54 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1369))) (let ((.cse52 (select (select .cse54 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse48 (+ (select (select .cse55 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse53 (store (store .cse55 .cse52 (store (select .cse55 .cse52) .cse48 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1362))) (let ((.cse46 (select (select .cse53 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= .cse46 0) (forall ((v_ArrVal_1359 (Array Int Int))) (let ((.cse49 (store (store .cse54 .cse52 (store (select .cse54 .cse52) .cse48 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1359))) (let ((.cse50 (select (select .cse49 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse51 (+ .cse46 4))) (let ((.cse47 (select (select .cse53 .cse50) .cse51))) (or (not (= .cse47 .cse48)) (= .cse47 .cse46) (not (= (select (select .cse49 .cse50) .cse51) .cse52)) (= .cse50 .cse52) (= .cse50 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)))))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| Int)) (or (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))) (forall ((v_ArrVal_1359 (Array Int Int)) (v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (let ((.cse60 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1370)) (.cse63 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1369))) (let ((.cse61 (select (select .cse63 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse62 (+ (select (select .cse60 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse59 (select (select (store (store .cse63 .cse61 (store (select .cse63 .cse61) .cse62 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1359) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_1362 (Array Int Int))) (let ((.cse58 (store (store .cse60 .cse61 (store (select .cse60 .cse61) .cse62 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1362))) (let ((.cse57 (select (select .cse58 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse56 (select (select .cse58 .cse59) (+ .cse57 4)))) (or (= .cse56 .cse57) (not (= .cse57 4)) (= .cse56 0)))))) (= .cse59 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)))))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| Int)) (or (forall ((v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1362 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (let ((.cse72 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1370)) (.cse69 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1369))) (let ((.cse70 (select (select .cse69 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse71 (+ (select (select .cse72 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse67 (store (store .cse72 .cse70 (store (select .cse72 .cse70) .cse71 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1362))) (let ((.cse68 (select (select .cse67 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_1359 (Array Int Int))) (let ((.cse64 (store (store .cse69 .cse70 (store (select .cse69 .cse70) .cse71 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1359))) (let ((.cse65 (select (select .cse64 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse66 (+ .cse68 4))) (or (= (select (select .cse64 .cse65) .cse66) .cse65) (= (select (select .cse67 .cse65) .cse66) 0))))) (not (= .cse68 4)))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))) (or (and (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| Int)) (or (forall ((v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1362 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (let ((.cse79 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1370)) (.cse77 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1369))) (let ((.cse78 (select (select .cse77 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse75 (+ (select (select .cse79 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse76 (store (store .cse79 .cse78 (store (select .cse79 .cse78) .cse75 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1362))) (let ((.cse73 (select (select .cse76 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= .cse73 0) (= .cse73 4) (forall ((v_ArrVal_1359 (Array Int Int))) (let ((.cse74 (select (select .cse76 (select (select (store (store .cse77 .cse78 (store (select .cse77 .cse78) .cse75 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1359) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ .cse73 4)))) (or (= .cse74 .cse73) (= .cse74 .cse75)))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| Int)) (or (forall ((v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1362 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (let ((.cse88 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1370)) (.cse86 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1369))) (let ((.cse87 (select (select .cse86 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse85 (+ (select (select .cse88 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse84 (store (store .cse88 .cse87 (store (select .cse88 .cse87) .cse85 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1362))) (let ((.cse80 (select (select .cse84 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= .cse80 0) (forall ((v_ArrVal_1359 (Array Int Int))) (let ((.cse81 (store (store .cse86 .cse87 (store (select .cse86 .cse87) .cse85 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1359))) (let ((.cse82 (select (select .cse81 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse83 (+ .cse80 4))) (or (= (select (select .cse81 .cse82) .cse83) .cse82) (= (select (select .cse84 .cse82) .cse83) .cse85))))) (= .cse80 4))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| Int)) (or (forall ((v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1362 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (let ((.cse96 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1370)) (.cse94 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1369))) (let ((.cse95 (select (select .cse94 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse92 (+ (select (select .cse96 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse93 (store (store .cse96 .cse95 (store (select .cse96 .cse95) .cse92 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1362))) (let ((.cse89 (select (select .cse93 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= .cse89 0) (forall ((v_ArrVal_1359 (Array Int Int))) (let ((.cse91 (select (select (store (store .cse94 .cse95 (store (select .cse94 .cse95) .cse92 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1359) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse90 (select (select .cse93 .cse91) (+ .cse89 4)))) (or (= .cse90 .cse89) (= .cse91 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|) (= .cse90 .cse92))))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| Int)) (or (forall ((v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1362 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (let ((.cse105 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1370)) (.cse103 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1369))) (let ((.cse104 (select (select .cse103 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse102 (+ (select (select .cse105 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse101 (store (store .cse105 .cse104 (store (select .cse105 .cse104) .cse102 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1362))) (let ((.cse97 (select (select .cse101 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= .cse97 0) (forall ((v_ArrVal_1359 (Array Int Int))) (let ((.cse98 (store (store .cse103 .cse104 (store (select .cse103 .cse104) .cse102 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1359))) (let ((.cse99 (select (select .cse98 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse100 (+ .cse97 4))) (or (= (select (select .cse98 .cse99) .cse100) .cse99) (= .cse99 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|) (= (select (select .cse101 .cse99) .cse100) .cse102))))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)))))) .cse106) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| Int)) (or (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))) (forall ((v_ArrVal_1359 (Array Int Int)) (v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (let ((.cse113 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1370)) (.cse115 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1369))) (let ((.cse114 (select (select .cse115 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse111 (+ (select (select .cse113 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse112 (store (store .cse115 .cse114 (store (select .cse115 .cse114) .cse111 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1359))) (let ((.cse108 (select (select .cse112 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_1362 (Array Int Int))) (let ((.cse107 (store (store .cse113 .cse114 (store (select .cse113 .cse114) .cse111 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1362))) (let ((.cse110 (select (select .cse107 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse109 (+ .cse110 4))) (or (= (select (select .cse107 .cse108) .cse109) .cse110) (= .cse110 .cse111) (= (select (select .cse112 .cse108) .cse109) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)))))) (= .cse108 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| Int)) (or (forall ((v_ArrVal_1359 (Array Int Int)) (v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (let ((.cse124 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1370)) (.cse125 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1369))) (let ((.cse122 (select (select .cse125 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse117 (+ (select (select .cse124 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse119 (store (store .cse125 .cse122 (store (select .cse125 .cse122) .cse117 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1359))) (let ((.cse120 (select (select .cse119 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_1362 (Array Int Int))) (let ((.cse123 (store (store .cse124 .cse122 (store (select .cse124 .cse122) .cse117 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1362))) (let ((.cse118 (select (select .cse123 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse121 (+ .cse118 4))) (let ((.cse116 (select (select .cse123 .cse120) .cse121))) (or (not (= .cse116 .cse117)) (= .cse116 .cse118) (= .cse118 4) (not (= (select (select .cse119 .cse120) .cse121) .cse122)))))))) (= .cse120 .cse122) (= .cse120 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| Int)) (or (forall ((v_ArrVal_1359 (Array Int Int)) (v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (let ((.cse133 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1370)) (.cse135 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1369))) (let ((.cse129 (select (select .cse135 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse134 (+ (select (select .cse133 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse126 (store (store .cse135 .cse129 (store (select .cse135 .cse129) .cse134 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1359))) (let ((.cse127 (select (select .cse126 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_1362 (Array Int Int))) (let ((.cse132 (store (store .cse133 .cse129 (store (select .cse133 .cse129) .cse134 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1362))) (let ((.cse131 (select (select .cse132 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse128 (+ .cse131 4))) (let ((.cse130 (select (select .cse132 .cse127) .cse128))) (or (= (select (select .cse126 .cse127) .cse128) .cse129) (= .cse130 .cse131) (= .cse130 0))))))) (= .cse127 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| Int)) (or (forall ((v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1362 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (let ((.cse143 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1370)) (.cse141 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1369))) (let ((.cse139 (select (select .cse141 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse142 (+ (select (select .cse143 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse136 (select (select (store (store .cse143 .cse139 (store (select .cse143 .cse139) .cse142 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1362) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= .cse136 0) (forall ((v_ArrVal_1359 (Array Int Int))) (let ((.cse140 (store (store .cse141 .cse139 (store (select .cse141 .cse139) .cse142 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1359))) (let ((.cse138 (select (select .cse140 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse137 (select (select .cse140 .cse138) (+ .cse136 4)))) (or (= .cse137 .cse138) (= .cse138 .cse139) (= .cse138 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|) (= .cse137 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| Int)) (or (forall ((v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1362 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (let ((.cse153 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1370)) (.cse152 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1369))) (let ((.cse150 (select (select .cse152 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse146 (+ (select (select .cse153 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse151 (store (store .cse153 .cse150 (store (select .cse153 .cse150) .cse146 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1362))) (let ((.cse144 (select (select .cse151 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= .cse144 0) (forall ((v_ArrVal_1359 (Array Int Int))) (let ((.cse147 (store (store .cse152 .cse150 (store (select .cse152 .cse150) .cse146 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1359))) (let ((.cse148 (select (select .cse147 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse149 (+ .cse144 4))) (let ((.cse145 (select (select .cse151 .cse148) .cse149))) (or (not (= .cse145 .cse146)) (= .cse145 .cse144) (not (= (select (select .cse147 .cse148) .cse149) .cse150)) (= .cse148 .cse150)))))) (= .cse144 4))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| Int)) (or (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))) (forall ((v_ArrVal_1359 (Array Int Int)) (v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (let ((.cse163 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1370)) (.cse164 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1369))) (let ((.cse159 (select (select .cse164 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse155 (+ (select (select .cse163 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse162 (store (store .cse164 .cse159 (store (select .cse164 .cse159) .cse155 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1359))) (let ((.cse157 (select (select .cse162 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_1362 (Array Int Int))) (let ((.cse160 (store (store .cse163 .cse159 (store (select .cse163 .cse159) .cse155 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1362))) (let ((.cse158 (select (select .cse160 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse161 (+ .cse158 4))) (let ((.cse156 (select (select .cse162 .cse157) .cse161)) (.cse154 (select (select .cse160 .cse157) .cse161))) (or (not (= .cse154 .cse155)) (= .cse156 .cse157) (= .cse158 4) (= .cse158 .cse155) (not (= .cse156 .cse159)) (= .cse154 4))))))) (= .cse157 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))))))) (or .cse106 (and (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| Int)) (or (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1359 (Array Int Int)) (v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (let ((.cse170 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1370)) (.cse172 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1369))) (let ((.cse171 (select (select .cse172 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse167 (+ (select (select .cse170 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse169 (select (select (store (store .cse172 .cse171 (store (select .cse172 .cse171) .cse167 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1359) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_1362 (Array Int Int))) (let ((.cse168 (store (store .cse170 .cse171 (store (select .cse170 .cse171) .cse167 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1362))) (let ((.cse166 (select (select .cse168 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse165 (select (select .cse168 .cse169) (+ .cse166 4)))) (or (= .cse165 .cse166) (= .cse166 4) (= .cse165 .cse167)))))) (= .cse169 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)))))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| Int)) (or (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))) (forall ((v_ArrVal_1359 (Array Int Int)) (v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (let ((.cse178 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1370)) (.cse180 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1369))) (let ((.cse179 (select (select .cse180 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse177 (+ (select (select .cse178 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse173 (store (store .cse180 .cse179 (store (select .cse180 .cse179) .cse177 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1359))) (let ((.cse174 (select (select .cse173 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_1362 (Array Int Int))) (let ((.cse176 (store (store .cse178 .cse179 (store (select .cse178 .cse179) .cse177 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1362))) (let ((.cse175 (+ (select (select .cse176 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (or (= (select (select .cse173 .cse174) .cse175) .cse174) (= (select (select .cse176 .cse174) .cse175) .cse177))))) (= .cse174 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| Int)) (or (forall ((v_ArrVal_1359 (Array Int Int)) (v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (let ((.cse186 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1370)) (.cse188 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1369))) (let ((.cse187 (select (select .cse188 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse183 (+ (select (select .cse186 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse185 (select (select (store (store .cse188 .cse187 (store (select .cse188 .cse187) .cse183 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1359) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_1362 (Array Int Int))) (let ((.cse184 (store (store .cse186 .cse187 (store (select .cse186 .cse187) .cse183 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1362))) (let ((.cse182 (select (select .cse184 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse181 (select (select .cse184 .cse185) (+ .cse182 4)))) (or (= .cse181 .cse182) (= .cse181 .cse183)))))) (= .cse185 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| Int)) (or (forall ((v_ArrVal_1359 (Array Int Int)) (v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (let ((.cse195 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1370)) (.cse197 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1369))) (let ((.cse196 (select (select .cse197 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse194 (+ (select (select .cse195 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse189 (store (store .cse197 .cse196 (store (select .cse197 .cse196) .cse194 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1359))) (let ((.cse190 (select (select .cse189 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_1362 (Array Int Int))) (let ((.cse193 (store (store .cse195 .cse196 (store (select .cse195 .cse196) .cse194 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1362))) (let ((.cse192 (select (select .cse193 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse191 (+ .cse192 4))) (or (= (select (select .cse189 .cse190) .cse191) .cse190) (= .cse192 4) (= (select (select .cse193 .cse190) .cse191) .cse194)))))) (= .cse190 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| Int)) (or (forall ((v_ArrVal_1359 (Array Int Int)) (v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (let ((.cse203 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1370)) (.cse205 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1369))) (let ((.cse200 (select (select .cse205 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse204 (+ (select (select .cse203 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse202 (store (store .cse205 .cse200 (store (select .cse205 .cse200) .cse204 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1359))) (let ((.cse199 (select (select .cse202 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_1362 (Array Int Int))) (let ((.cse201 (select (select (store (store .cse203 .cse200 (store (select .cse203 .cse200) .cse204 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1362) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse198 (select (select .cse202 .cse199) (+ .cse201 4)))) (or (= .cse198 .cse199) (= .cse198 .cse200) (= .cse201 4) (= .cse198 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))) (= .cse199 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| Int)) (or (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))) (forall ((v_ArrVal_1359 (Array Int Int)) (v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (let ((.cse211 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1370)) (.cse213 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1369))) (let ((.cse207 (select (select .cse213 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse212 (+ (select (select .cse211 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse206 (select (select (store (store .cse213 .cse207 (store (select .cse213 .cse207) .cse212 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1359) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= .cse206 .cse207) (= .cse206 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|) (forall ((v_ArrVal_1362 (Array Int Int))) (let ((.cse210 (store (store .cse211 .cse207 (store (select .cse211 .cse207) .cse212 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1362))) (let ((.cse209 (select (select .cse210 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse208 (select (select .cse210 .cse206) (+ .cse209 4)))) (or (= .cse208 .cse209) (= .cse208 0))))))))))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| Int)) (or (forall ((v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1362 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (let ((.cse222 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1370)) (.cse220 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1369))) (let ((.cse221 (select (select .cse220 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse215 (+ (select (select .cse222 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse216 (store (store .cse222 .cse221 (store (select .cse222 .cse221) .cse215 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1362))) (let ((.cse214 (select (select .cse216 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= .cse214 0) (= .cse214 4) (= .cse214 .cse215) (forall ((v_ArrVal_1359 (Array Int Int))) (let ((.cse219 (store (store .cse220 .cse221 (store (select .cse220 .cse221) .cse215 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1359))) (let ((.cse217 (select (select .cse219 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse218 (+ .cse214 4))) (or (= (select (select .cse216 .cse217) .cse218) .cse214) (= (select (select .cse219 .cse217) .cse218) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| Int)) (or (forall ((v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1362 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (let ((.cse230 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1370)) (.cse228 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1369))) (let ((.cse229 (select (select .cse228 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse224 (+ (select (select .cse230 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse223 (select (select (store (store .cse230 .cse229 (store (select .cse230 .cse229) .cse224 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1362) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= .cse223 0) (= .cse223 4) (= .cse223 .cse224) (forall ((v_ArrVal_1359 (Array Int Int))) (let ((.cse227 (store (store .cse228 .cse229 (store (select .cse228 .cse229) .cse224 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1359))) (let ((.cse226 (select (select .cse227 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse225 (select (select .cse227 .cse226) (+ .cse223 4)))) (or (= .cse225 .cse226) (= .cse225 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))) (or .cse106 (and (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| Int)) (or (forall ((v_ArrVal_1359 (Array Int Int)) (v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (let ((.cse235 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1370)) (.cse237 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1369))) (let ((.cse233 (select (select .cse237 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse236 (+ (select (select .cse235 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse234 (store (store .cse237 .cse233 (store (select .cse237 .cse233) .cse236 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1359))) (let ((.cse232 (select (select .cse234 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_1362 (Array Int Int))) (let ((.cse231 (select (select .cse234 .cse232) (+ (select (select (store (store .cse235 .cse233 (store (select .cse235 .cse233) .cse236 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1362) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) (or (= .cse231 .cse232) (= .cse231 .cse233)))) (= .cse232 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| Int)) (or (forall ((v_ArrVal_1359 (Array Int Int)) (v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (let ((.cse244 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1370)) (.cse246 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1369))) (let ((.cse241 (select (select .cse246 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse245 (+ (select (select .cse244 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse238 (store (store .cse246 .cse241 (store (select .cse246 .cse241) .cse245 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1359))) (let ((.cse239 (select (select .cse238 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_1362 (Array Int Int))) (let ((.cse242 (store (store .cse244 .cse241 (store (select .cse244 .cse241) .cse245 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1362))) (let ((.cse243 (select (select .cse242 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse240 (+ .cse243 4))) (or (= (select (select .cse238 .cse239) .cse240) .cse241) (= (select (select .cse242 .cse239) .cse240) .cse243) (= .cse243 4)))))) (= .cse239 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| Int)) (or (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1359 (Array Int Int)) (v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (let ((.cse252 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1370)) (.cse254 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1369))) (let ((.cse249 (select (select .cse254 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse253 (+ (select (select .cse252 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse251 (store (store .cse254 .cse249 (store (select .cse254 .cse249) .cse253 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1359))) (let ((.cse248 (select (select .cse251 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_1362 (Array Int Int))) (let ((.cse250 (select (select (store (store .cse252 .cse249 (store (select .cse252 .cse249) .cse253 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1362) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse247 (select (select .cse251 .cse248) (+ .cse250 4)))) (or (= .cse247 .cse248) (= .cse247 .cse249) (= .cse250 4))))) (= .cse248 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| Int)) (or (forall ((v_ArrVal_1359 (Array Int Int)) (v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (let ((.cse261 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1370)) (.cse263 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1369))) (let ((.cse258 (select (select .cse263 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse262 (+ (select (select .cse261 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse256 (store (store .cse263 .cse258 (store (select .cse263 .cse258) .cse262 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1359))) (let ((.cse255 (select (select .cse256 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= .cse255 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|) (forall ((v_ArrVal_1362 (Array Int Int))) (let ((.cse259 (store (store .cse261 .cse258 (store (select .cse261 .cse258) .cse262 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1362))) (let ((.cse260 (select (select .cse259 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse257 (+ .cse260 4))) (or (= (select (select .cse256 .cse255) .cse257) .cse258) (= (select (select .cse259 .cse255) .cse257) .cse260)))))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| Int)) (or (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))) (forall ((v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1362 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (let ((.cse273 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1370)) (.cse272 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1369))) (let ((.cse270 (select (select .cse272 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse266 (+ (select (select .cse273 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse271 (store (store .cse273 .cse270 (store (select .cse273 .cse270) .cse266 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1362))) (let ((.cse264 (select (select .cse271 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse264 4)) (forall ((v_ArrVal_1359 (Array Int Int))) (let ((.cse267 (store (store .cse272 .cse270 (store (select .cse272 .cse270) .cse266 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1359))) (let ((.cse268 (select (select .cse267 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse269 (+ .cse264 4))) (let ((.cse265 (select (select .cse271 .cse268) .cse269))) (or (not (= .cse265 .cse266)) (= .cse265 .cse264) (not (= (select (select .cse267 .cse268) .cse269) .cse270))))))))))))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| Int)) (or (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1362 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (let ((.cse282 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1370)) (.cse280 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1369))) (let ((.cse278 (select (select .cse280 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse281 (+ (select (select .cse282 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse274 (store (store .cse282 .cse278 (store (select .cse282 .cse278) .cse281 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1362))) (let ((.cse277 (select (select .cse274 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_1359 (Array Int Int))) (let ((.cse279 (store (store .cse280 .cse278 (store (select .cse280 .cse278) .cse281 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1359))) (let ((.cse275 (select (select .cse279 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse276 (+ .cse277 4))) (or (= (select (select .cse274 .cse275) .cse276) .cse277) (not (= .cse275 .cse278)) (= (select (select .cse279 .cse275) .cse276) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))) (not (= .cse277 .cse281)) (= .cse277 4))))))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| Int)) (or (forall ((v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1362 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (let ((.cse290 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1370)) (.cse288 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1369))) (let ((.cse286 (select (select .cse288 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse289 (+ (select (select .cse290 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse283 (select (select (store (store .cse290 .cse286 (store (select .cse290 .cse286) .cse289 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1362) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= .cse283 0) (forall ((v_ArrVal_1359 (Array Int Int))) (let ((.cse287 (store (store .cse288 .cse286 (store (select .cse288 .cse286) .cse289 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1359))) (let ((.cse285 (select (select .cse287 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse284 (select (select .cse287 .cse285) (+ .cse283 4)))) (or (= .cse284 .cse285) (= .cse284 .cse286) (= .cse285 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|) (= .cse284 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| Int)) (or (forall ((v_ArrVal_1359 (Array Int Int)) (v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (let ((.cse296 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1370)) (.cse298 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1369))) (let ((.cse297 (select (select .cse298 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse294 (+ (select (select .cse296 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse295 (store (store .cse298 .cse297 (store (select .cse298 .cse297) .cse294 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1359))) (let ((.cse292 (select (select .cse295 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_1362 (Array Int Int))) (let ((.cse293 (select (select (store (store .cse296 .cse297 (store (select .cse296 .cse297) .cse294 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1362) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse291 (select (select .cse295 .cse292) (+ .cse293 4)))) (or (= .cse291 .cse292) (= .cse293 4) (= .cse293 .cse294) (= .cse291 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))) (= .cse292 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))) (or (and (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| Int)) (or (forall ((v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1362 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (let ((.cse305 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1370)) (.cse304 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1369))) (let ((.cse303 (select (select .cse304 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse300 (+ (select (select .cse305 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse301 (store (store .cse305 .cse303 (store (select .cse305 .cse303) .cse300 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1362))) (let ((.cse299 (select (select .cse301 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse299 .cse300)) (= .cse299 4) (forall ((v_ArrVal_1359 (Array Int Int))) (let ((.cse302 (select (select (store (store .cse304 .cse303 (store (select .cse304 .cse303) .cse300 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1359) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (select (select .cse301 .cse302) (+ .cse299 4)) .cse299) (not (= .cse302 .cse303))))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| Int)) (or (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))) (forall ((v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1362 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (let ((.cse312 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1370)) (.cse310 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1369))) (let ((.cse309 (select (select .cse310 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse311 (+ (select (select .cse312 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse308 (select (select (store (store .cse312 .cse309 (store (select .cse312 .cse309) .cse311 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1362) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_1359 (Array Int Int))) (let ((.cse306 (store (store .cse310 .cse309 (store (select .cse310 .cse309) .cse311 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1359))) (let ((.cse307 (select (select .cse306 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (select (select .cse306 .cse307) (+ .cse308 4)) .cse307) (not (= .cse307 .cse309)))))) (not (= .cse308 .cse311)) (= .cse308 4))))))))) .cse106) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| Int)) (or (forall ((v_ArrVal_1359 (Array Int Int)) (v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (let ((.cse320 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1370)) (.cse322 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1369))) (let ((.cse321 (select (select .cse322 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse318 (+ (select (select .cse320 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse315 (store (store .cse322 .cse321 (store (select .cse322 .cse321) .cse318 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1359))) (let ((.cse316 (select (select .cse315 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_1362 (Array Int Int))) (let ((.cse319 (store (store .cse320 .cse321 (store (select .cse320 .cse321) .cse318 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1362))) (let ((.cse314 (select (select .cse319 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse317 (+ .cse314 4))) (let ((.cse313 (select (select .cse319 .cse316) .cse317))) (or (= .cse313 .cse314) (= (select (select .cse315 .cse316) .cse317) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|) (= .cse313 .cse318))))))) (= .cse316 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| Int)) (or (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))) (forall ((v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1362 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (let ((.cse332 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1370)) (.cse330 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1369))) (let ((.cse324 (select (select .cse330 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse331 (+ (select (select .cse332 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse325 (store (store .cse332 .cse324 (store (select .cse332 .cse324) .cse331 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1362))) (let ((.cse328 (select (select .cse325 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_1359 (Array Int Int))) (let ((.cse329 (store (store .cse330 .cse324 (store (select .cse330 .cse324) .cse331 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1359))) (let ((.cse326 (select (select .cse329 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse327 (+ .cse328 4))) (let ((.cse323 (select (select .cse329 .cse326) .cse327))) (or (= .cse323 .cse324) (= (select (select .cse325 .cse326) .cse327) .cse328) (= .cse326 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|) (= .cse323 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)))))) (= .cse328 0))))))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| Int)) (or (forall ((v_ArrVal_1359 (Array Int Int)) (v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (let ((.cse340 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1370)) (.cse341 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1369))) (let ((.cse334 (select (select .cse341 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse337 (+ (select (select .cse340 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse339 (store (store .cse341 .cse334 (store (select .cse341 .cse334) .cse337 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1359))) (let ((.cse333 (select (select .cse339 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= .cse333 .cse334) (= .cse333 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|) (forall ((v_ArrVal_1362 (Array Int Int))) (let ((.cse335 (store (store .cse340 .cse334 (store (select .cse340 .cse334) .cse337 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1362))) (let ((.cse338 (select (select .cse335 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse336 (+ .cse338 4))) (or (not (= (select (select .cse335 .cse333) .cse336) .cse337)) (= .cse338 4) (not (= (select (select .cse339 .cse333) .cse336) .cse334))))))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| Int)) (or (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1359 (Array Int Int)) (v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (let ((.cse348 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1370)) (.cse351 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1369))) (let ((.cse349 (select (select .cse351 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse350 (+ (select (select .cse348 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse344 (store (store .cse351 .cse349 (store (select .cse351 .cse349) .cse350 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1359))) (let ((.cse345 (select (select .cse344 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_1362 (Array Int Int))) (let ((.cse347 (store (store .cse348 .cse349 (store (select .cse348 .cse349) .cse350 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1362))) (let ((.cse343 (select (select .cse347 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse346 (+ .cse343 4))) (let ((.cse342 (select (select .cse347 .cse345) .cse346))) (or (= .cse342 .cse343) (not (= (select (select .cse344 .cse345) .cse346) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)) (not (= .cse342 4)))))))) (= .cse345 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| Int)) (or (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1362 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (let ((.cse360 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1370)) (.cse357 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1369))) (let ((.cse358 (select (select .cse357 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse359 (+ (select (select .cse360 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse353 (store (store .cse360 .cse358 (store (select .cse360 .cse358) .cse359 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1362))) (let ((.cse352 (select (select .cse353 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse352 4)) (forall ((v_ArrVal_1359 (Array Int Int))) (let ((.cse356 (store (store .cse357 .cse358 (store (select .cse357 .cse358) .cse359 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1359))) (let ((.cse354 (select (select .cse356 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse355 (+ .cse352 4))) (or (= (select (select .cse353 .cse354) .cse355) .cse352) (= (select (select .cse356 .cse354) .cse355) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))))))))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| Int)) (or (forall ((v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1362 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (let ((.cse368 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1370)) (.cse366 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1369))) (let ((.cse364 (select (select .cse366 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse367 (+ (select (select .cse368 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse365 (store (store .cse368 .cse364 (store (select .cse368 .cse364) .cse367 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1362))) (let ((.cse362 (select (select .cse365 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_1359 (Array Int Int))) (let ((.cse363 (select (select (store (store .cse366 .cse364 (store (select .cse366 .cse364) .cse367 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1359) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse361 (select (select .cse365 .cse363) (+ .cse362 4)))) (or (= .cse361 .cse362) (= .cse363 .cse364) (= .cse361 0))))) (= .cse362 0) (= .cse362 4))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| Int)) (or (forall ((v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1362 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (let ((.cse376 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1370)) (.cse374 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1369))) (let ((.cse375 (select (select .cse374 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse370 (+ (select (select .cse376 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse369 (select (select (store (store .cse376 .cse375 (store (select .cse376 .cse375) .cse370 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1362) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= .cse369 0) (= .cse369 .cse370) (forall ((v_ArrVal_1359 (Array Int Int))) (let ((.cse373 (store (store .cse374 .cse375 (store (select .cse374 .cse375) .cse370 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1359))) (let ((.cse372 (select (select .cse373 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse371 (select (select .cse373 .cse372) (+ .cse369 4)))) (or (= .cse371 .cse372) (= .cse372 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|) (= .cse371 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| Int)) (or (forall ((v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1362 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (let ((.cse385 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1370)) (.cse383 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1369))) (let ((.cse381 (select (select .cse383 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse384 (+ (select (select .cse385 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse378 (store (store .cse385 .cse381 (store (select .cse385 .cse381) .cse384 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1362))) (let ((.cse377 (select (select .cse378 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= .cse377 0) (forall ((v_ArrVal_1359 (Array Int Int))) (let ((.cse382 (store (store .cse383 .cse381 (store (select .cse383 .cse381) .cse384 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1359))) (let ((.cse379 (select (select .cse382 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse380 (+ .cse377 4))) (or (= (select (select .cse378 .cse379) .cse380) .cse377) (= .cse379 .cse381) (= .cse379 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|) (= (select (select .cse382 .cse379) .cse380) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| Int)) (or (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))) (forall ((v_ArrVal_1359 (Array Int Int)) (v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (let ((.cse390 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1370)) (.cse393 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1369))) (let ((.cse391 (select (select .cse393 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse392 (+ (select (select .cse390 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse389 (store (store .cse393 .cse391 (store (select .cse393 .cse391) .cse392 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1359))) (let ((.cse387 (select (select .cse389 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_1362 (Array Int Int))) (let ((.cse388 (select (select (store (store .cse390 .cse391 (store (select .cse390 .cse391) .cse392 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1362) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse386 (select (select .cse389 .cse387) (+ .cse388 4)))) (or (= .cse386 .cse387) (not (= .cse388 4)) (= .cse386 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))) (= .cse387 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| Int)) (or (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))) (forall ((v_ArrVal_1359 (Array Int Int)) (v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (let ((.cse398 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1370)) (.cse401 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1369))) (let ((.cse399 (select (select .cse401 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse400 (+ (select (select .cse398 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse395 (store (store .cse401 .cse399 (store (select .cse401 .cse399) .cse400 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1359))) (let ((.cse394 (select (select .cse395 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= .cse394 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|) (forall ((v_ArrVal_1362 (Array Int Int))) (let ((.cse397 (store (store .cse398 .cse399 (store (select .cse398 .cse399) .cse400 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1362))) (let ((.cse396 (+ (select (select .cse397 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (or (not (= (select (select .cse395 .cse394) .cse396) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)) (not (= (select (select .cse397 .cse394) .cse396) 4)))))))))))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| Int)) (or (forall ((v_ArrVal_1359 (Array Int Int)) (v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (let ((.cse410 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1370)) (.cse411 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1369))) (let ((.cse408 (select (select .cse411 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse403 (+ (select (select .cse410 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse405 (store (store .cse411 .cse408 (store (select .cse411 .cse408) .cse403 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1359))) (let ((.cse406 (select (select .cse405 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_1362 (Array Int Int))) (let ((.cse409 (store (store .cse410 .cse408 (store (select .cse410 .cse408) .cse403 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1362))) (let ((.cse404 (select (select .cse409 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse407 (+ .cse404 4))) (let ((.cse402 (select (select .cse409 .cse406) .cse407))) (or (not (= .cse402 .cse403)) (= .cse402 .cse404) (not (= .cse404 4)) (not (= (select (select .cse405 .cse406) .cse407) .cse408)))))))) (= .cse406 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| Int)) (or (forall ((v_ArrVal_1359 (Array Int Int)) (v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (let ((.cse416 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1370)) (.cse418 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1369))) (let ((.cse414 (select (select .cse418 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse417 (+ (select (select .cse416 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse415 (store (store .cse418 .cse414 (store (select .cse418 .cse414) .cse417 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1359))) (let ((.cse412 (select (select .cse415 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= .cse412 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|) (forall ((v_ArrVal_1362 (Array Int Int))) (let ((.cse413 (select (select .cse415 .cse412) (+ (select (select (store (store .cse416 .cse414 (store (select .cse416 .cse414) .cse417 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1362) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) (or (= .cse413 .cse412) (= .cse413 .cse414) (= .cse413 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| Int)) (or (forall ((v_ArrVal_1359 (Array Int Int)) (v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (let ((.cse426 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1370)) (.cse428 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1369))) (let ((.cse427 (select (select .cse428 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse424 (+ (select (select .cse426 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse425 (store (store .cse428 .cse427 (store (select .cse428 .cse427) .cse424 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1359))) (let ((.cse420 (select (select .cse425 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_1362 (Array Int Int))) (let ((.cse422 (store (store .cse426 .cse427 (store (select .cse426 .cse427) .cse424 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1362))) (let ((.cse421 (select (select .cse422 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse423 (+ .cse421 4))) (let ((.cse419 (select (select .cse425 .cse420) .cse423))) (or (= .cse419 .cse420) (= .cse421 4) (= .cse419 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|) (= (select (select .cse422 .cse420) .cse423) .cse424))))))) (= .cse420 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))) (or .cse106 (and (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| Int)) (or (forall ((v_ArrVal_1359 (Array Int Int)) (v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (let ((.cse432 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1370)) (.cse435 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1369))) (let ((.cse433 (select (select .cse435 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse434 (+ (select (select .cse432 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse430 (store (store .cse435 .cse433 (store (select .cse435 .cse433) .cse434 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1359))) (let ((.cse429 (select (select .cse430 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= .cse429 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|) (forall ((v_ArrVal_1362 (Array Int Int))) (let ((.cse431 (select (select (store (store .cse432 .cse433 (store (select .cse432 .cse433) .cse434 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1362) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (select (select .cse430 .cse429) (+ .cse431 4)) .cse429) (not (= .cse431 4))))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| Int)) (or (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1359 (Array Int Int)) (v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (let ((.cse439 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1370)) (.cse442 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1369))) (let ((.cse440 (select (select .cse442 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse441 (+ (select (select .cse439 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse437 (select (select (store (store .cse442 .cse440 (store (select .cse442 .cse440) .cse441 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1359) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_1362 (Array Int Int))) (let ((.cse436 (store (store .cse439 .cse440 (store (select .cse439 .cse440) .cse441 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1362))) (let ((.cse438 (select (select .cse436 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (select (select .cse436 .cse437) (+ .cse438 4)) .cse438) (not (= .cse438 4)))))) (= .cse437 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)))))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| Int)) (or (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))) (forall ((v_ArrVal_1359 (Array Int Int)) (v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (let ((.cse449 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1370)) (.cse450 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1369))) (let ((.cse444 (select (select .cse450 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse447 (+ (select (select .cse449 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse448 (store (store .cse450 .cse444 (store (select .cse450 .cse444) .cse447 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1359))) (let ((.cse443 (select (select .cse448 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= .cse443 .cse444) (= .cse443 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|) (forall ((v_ArrVal_1362 (Array Int Int))) (let ((.cse445 (store (store .cse449 .cse444 (store (select .cse449 .cse444) .cse447 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1362))) (let ((.cse446 (+ (select (select .cse445 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (or (not (= (select (select .cse445 .cse443) .cse446) .cse447)) (not (= (select (select .cse448 .cse443) .cse446) .cse444)))))))))))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| Int)) (or (forall ((v_ArrVal_1359 (Array Int Int)) (v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (let ((.cse456 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1370)) (.cse458 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1369))) (let ((.cse452 (select (select .cse458 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse457 (+ (select (select .cse456 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse451 (select (select (store (store .cse458 .cse452 (store (select .cse458 .cse452) .cse457 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1359) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= .cse451 .cse452) (= .cse451 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|) (forall ((v_ArrVal_1362 (Array Int Int))) (let ((.cse455 (store (store .cse456 .cse452 (store (select .cse456 .cse452) .cse457 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1362))) (let ((.cse454 (select (select .cse455 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse453 (select (select .cse455 .cse451) (+ .cse454 4)))) (or (= .cse453 .cse454) (= .cse454 4) (= .cse453 0))))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| Int)) (or (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))) (forall ((v_ArrVal_1359 (Array Int Int)) (v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (let ((.cse467 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1370)) (.cse468 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1369))) (let ((.cse465 (select (select .cse468 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse460 (+ (select (select .cse467 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse462 (store (store .cse468 .cse465 (store (select .cse468 .cse465) .cse460 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1359))) (let ((.cse463 (select (select .cse462 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_1362 (Array Int Int))) (let ((.cse466 (store (store .cse467 .cse465 (store (select .cse467 .cse465) .cse460 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1362))) (let ((.cse461 (select (select .cse466 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse464 (+ .cse461 4))) (let ((.cse459 (select (select .cse466 .cse463) .cse464))) (or (not (= .cse459 .cse460)) (= .cse461 .cse460) (not (= (select (select .cse462 .cse463) .cse464) .cse465)) (= .cse459 4))))))) (= .cse463 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| Int)) (or (forall ((v_ArrVal_1359 (Array Int Int)) (v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (let ((.cse477 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1370)) (.cse478 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1369))) (let ((.cse470 (select (select .cse478 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse472 (+ (select (select .cse477 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse474 (store (store .cse478 .cse470 (store (select .cse478 .cse470) .cse472 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1359))) (let ((.cse469 (select (select .cse474 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= .cse469 .cse470) (forall ((v_ArrVal_1362 (Array Int Int))) (let ((.cse476 (store (store .cse477 .cse470 (store (select .cse477 .cse470) .cse472 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1362))) (let ((.cse473 (select (select .cse476 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse475 (+ .cse473 4))) (let ((.cse471 (select (select .cse476 .cse469) .cse475))) (or (not (= .cse471 .cse472)) (= .cse471 .cse473) (not (= (select (select .cse474 .cse469) .cse475) .cse470)))))))) (= .cse469 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| Int)) (or (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1362 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (let ((.cse488 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1370)) (.cse486 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1369))) (let ((.cse480 (select (select .cse486 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse487 (+ (select (select .cse488 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse481 (store (store .cse488 .cse480 (store (select .cse488 .cse480) .cse487 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1362))) (let ((.cse484 (select (select .cse481 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_1359 (Array Int Int))) (let ((.cse485 (store (store .cse486 .cse480 (store (select .cse486 .cse480) .cse487 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1359))) (let ((.cse482 (select (select .cse485 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse483 (+ .cse484 4))) (let ((.cse479 (select (select .cse485 .cse482) .cse483))) (or (= .cse479 .cse480) (= (select (select .cse481 .cse482) .cse483) .cse484) (= .cse479 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)))))) (= .cse484 0) (= .cse484 4))))))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| Int)) (or (forall ((v_ArrVal_1359 (Array Int Int)) (v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (let ((.cse493 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1370)) (.cse495 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1369))) (let ((.cse490 (select (select .cse495 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse494 (+ (select (select .cse493 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse492 (store (store .cse495 .cse490 (store (select .cse495 .cse490) .cse494 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1359))) (let ((.cse489 (select (select .cse492 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= .cse489 .cse490) (= .cse489 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|) (forall ((v_ArrVal_1362 (Array Int Int))) (let ((.cse491 (select (select .cse492 .cse489) (+ (select (select (store (store .cse493 .cse490 (store (select .cse493 .cse490) .cse494 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1362) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) (or (= .cse491 .cse489) (= .cse491 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| Int)) (or (forall ((v_ArrVal_1359 (Array Int Int)) (v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (let ((.cse503 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1370)) (.cse505 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1369))) (let ((.cse497 (select (select .cse505 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse504 (+ (select (select .cse503 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse502 (store (store .cse505 .cse497 (store (select .cse505 .cse497) .cse504 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1359))) (let ((.cse499 (select (select .cse502 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_1362 (Array Int Int))) (let ((.cse498 (store (store .cse503 .cse497 (store (select .cse503 .cse497) .cse504 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1362))) (let ((.cse501 (select (select .cse498 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse500 (+ .cse501 4))) (let ((.cse496 (select (select .cse502 .cse499) .cse500))) (or (= .cse496 .cse497) (= (select (select .cse498 .cse499) .cse500) .cse501) (= .cse496 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))))) (= .cse499 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))) (or (and (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| Int)) (or (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))) (forall ((v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1362 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (let ((.cse512 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1370)) (.cse510 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1369))) (let ((.cse509 (select (select .cse510 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse511 (+ (select (select .cse512 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse507 (store (store .cse512 .cse509 (store (select .cse512 .cse509) .cse511 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1362))) (let ((.cse506 (select (select .cse507 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= .cse506 0) (= .cse506 4) (forall ((v_ArrVal_1359 (Array Int Int))) (let ((.cse508 (select (select (store (store .cse510 .cse509 (store (select .cse510 .cse509) .cse511 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1359) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (select (select .cse507 .cse508) (+ .cse506 4)) .cse506) (= .cse508 .cse509)))))))))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| Int)) (or (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1362 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (let ((.cse519 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1370)) (.cse517 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1369))) (let ((.cse516 (select (select .cse517 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse518 (+ (select (select .cse519 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse513 (select (select (store (store .cse519 .cse516 (store (select .cse519 .cse516) .cse518 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1362) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= .cse513 0) (= .cse513 4) (forall ((v_ArrVal_1359 (Array Int Int))) (let ((.cse514 (store (store .cse517 .cse516 (store (select .cse517 .cse516) .cse518 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1359))) (let ((.cse515 (select (select .cse514 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (select (select .cse514 .cse515) (+ .cse513 4)) .cse515) (= .cse515 .cse516)))))))))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)))))) .cse106) (or .cse106 (and (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| Int)) (or (forall ((v_ArrVal_1359 (Array Int Int)) (v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (let ((.cse523 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1370)) (.cse525 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1369))) (let ((.cse521 (select (select .cse525 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse524 (+ (select (select .cse523 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse522 (store (store .cse525 .cse521 (store (select .cse525 .cse521) .cse524 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1359))) (let ((.cse520 (select (select .cse522 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= .cse520 .cse521) (= .cse520 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|) (forall ((v_ArrVal_1362 (Array Int Int))) (= (select (select .cse522 .cse520) (+ (select (select (store (store .cse523 .cse521 (store (select .cse523 .cse521) .cse524 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1362) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) .cse520)))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| Int)) (or (forall ((v_ArrVal_1359 (Array Int Int)) (v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (let ((.cse529 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1370)) (.cse532 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1369))) (let ((.cse530 (select (select .cse532 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse531 (+ (select (select .cse529 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse527 (select (select (store (store .cse532 .cse530 (store (select .cse532 .cse530) .cse531 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1359) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_1362 (Array Int Int))) (let ((.cse526 (store (store .cse529 .cse530 (store (select .cse529 .cse530) .cse531 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1362))) (let ((.cse528 (select (select .cse526 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse526 .cse527) (+ .cse528 4)) .cse528)))) (= .cse527 .cse530) (= .cse527 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| Int)) (or (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))) (forall ((v_ArrVal_1359 (Array Int Int)) (v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (let ((.cse538 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1370)) (.cse541 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1369))) (let ((.cse539 (select (select .cse541 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse540 (+ (select (select .cse538 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse537 (store (store .cse541 .cse539 (store (select .cse541 .cse539) .cse540 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1359))) (let ((.cse534 (select (select .cse537 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_1362 (Array Int Int))) (let ((.cse533 (store (store .cse538 .cse539 (store (select .cse538 .cse539) .cse540 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1362))) (let ((.cse536 (select (select .cse533 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse535 (+ .cse536 4))) (or (= (select (select .cse533 .cse534) .cse535) .cse536) (= (select (select .cse537 .cse534) .cse535) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)))))) (= .cse534 .cse539) (= .cse534 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| Int)) (or (forall ((v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1362 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (let ((.cse551 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1370)) (.cse549 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1369))) (let ((.cse550 (select (select .cse549 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse546 (+ (select (select .cse551 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse544 (store (store .cse551 .cse550 (store (select .cse551 .cse550) .cse546 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1362))) (let ((.cse548 (select (select .cse544 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_1359 (Array Int Int))) (let ((.cse547 (store (store .cse549 .cse550 (store (select .cse549 .cse550) .cse546 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1359))) (let ((.cse543 (select (select .cse547 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse545 (+ .cse548 4))) (let ((.cse542 (select (select .cse547 .cse543) .cse545))) (or (= .cse542 .cse543) (= .cse543 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|) (= .cse542 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|) (= (select (select .cse544 .cse543) .cse545) .cse546)))))) (= .cse548 0))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| Int)) (or (forall ((v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1362 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (let ((.cse561 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1370)) (.cse560 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1369))) (let ((.cse557 (select (select .cse560 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse553 (+ (select (select .cse561 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse558 (store (store .cse561 .cse557 (store (select .cse561 .cse557) .cse553 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1362))) (let ((.cse559 (select (select .cse558 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_1359 (Array Int Int))) (let ((.cse554 (store (store .cse560 .cse557 (store (select .cse560 .cse557) .cse553 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1359))) (let ((.cse555 (select (select .cse554 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse556 (+ .cse559 4))) (let ((.cse552 (select (select .cse558 .cse555) .cse556))) (or (not (= .cse552 .cse553)) (not (= (select (select .cse554 .cse555) .cse556) .cse557)) (= .cse552 4)))))) (= .cse559 0) (= .cse559 4) (= .cse559 .cse553))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))) (or .cse106 (and (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| Int)) (or (forall ((v_ArrVal_1359 (Array Int Int)) (v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (let ((.cse565 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1370)) (.cse568 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1369))) (let ((.cse566 (select (select .cse568 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse567 (+ (select (select .cse565 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse563 (select (select (store (store .cse568 .cse566 (store (select .cse568 .cse566) .cse567 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1359) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_1362 (Array Int Int))) (let ((.cse562 (store (store .cse565 .cse566 (store (select .cse565 .cse566) .cse567 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1362))) (let ((.cse564 (select (select .cse562 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (select (select .cse562 .cse563) (+ .cse564 4)) .cse564) (= .cse564 4))))) (= .cse563 .cse566) (= .cse563 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| Int)) (or (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1359 (Array Int Int)) (v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (let ((.cse572 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1370)) (.cse575 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1369))) (let ((.cse573 (select (select .cse575 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse574 (+ (select (select .cse572 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse569 (store (store .cse575 .cse573 (store (select .cse575 .cse573) .cse574 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1359))) (let ((.cse570 (select (select .cse569 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_1362 (Array Int Int))) (let ((.cse571 (select (select (store (store .cse572 .cse573 (store (select .cse572 .cse573) .cse574 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1362) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (select (select .cse569 .cse570) (+ .cse571 4)) .cse570) (= .cse571 4)))) (= .cse570 .cse573) (= .cse570 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))))) (or (and (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| Int)) (or (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))) (forall ((v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1362 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (let ((.cse584 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1370)) (.cse581 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1369))) (let ((.cse582 (select (select .cse581 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse583 (+ (select (select .cse584 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse579 (store (store .cse584 .cse582 (store (select .cse584 .cse582) .cse583 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1362))) (let ((.cse580 (select (select .cse579 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_1359 (Array Int Int))) (let ((.cse576 (store (store .cse581 .cse582 (store (select .cse581 .cse582) .cse583 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1359))) (let ((.cse577 (select (select .cse576 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse578 (+ .cse580 4))) (or (= (select (select .cse576 .cse577) .cse578) .cse577) (= (select (select .cse579 .cse577) .cse578) 0))))) (= .cse580 .cse583) (= .cse580 4))))))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| Int)) (or (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))) (forall ((v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1362 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (let ((.cse593 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1370)) (.cse591 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1369))) (let ((.cse589 (select (select .cse591 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse592 (+ (select (select .cse593 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse585 (store (store .cse593 .cse589 (store (select .cse593 .cse589) .cse592 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1362))) (let ((.cse588 (select (select .cse585 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_1359 (Array Int Int))) (let ((.cse590 (store (store .cse591 .cse589 (store (select .cse591 .cse589) .cse592 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1359))) (let ((.cse586 (select (select .cse590 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse587 (+ .cse588 4))) (or (= (select (select .cse585 .cse586) .cse587) .cse588) (= .cse586 .cse589) (= (select (select .cse590 .cse586) .cse587) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))) (= .cse588 4))))))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| Int)) (or (forall ((v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1362 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (let ((.cse603 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1370)) (.cse602 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1369))) (let ((.cse600 (select (select .cse602 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse595 (+ (select (select .cse603 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse601 (store (store .cse603 .cse600 (store (select .cse603 .cse600) .cse595 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1362))) (let ((.cse596 (select (select .cse601 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_1359 (Array Int Int))) (let ((.cse597 (store (store .cse602 .cse600 (store (select .cse602 .cse600) .cse595 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1359))) (let ((.cse598 (select (select .cse597 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse599 (+ .cse596 4))) (let ((.cse594 (select (select .cse601 .cse598) .cse599))) (or (not (= .cse594 .cse595)) (= .cse594 .cse596) (not (= (select (select .cse597 .cse598) .cse599) .cse600)) (= .cse598 .cse600)))))) (= .cse596 4))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| Int)) (or (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))) (forall ((v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1362 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (let ((.cse612 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1370)) (.cse611 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1369))) (let ((.cse609 (select (select .cse611 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse607 (+ (select (select .cse612 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse604 (store (store .cse612 .cse609 (store (select .cse612 .cse609) .cse607 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1362))) (let ((.cse610 (select (select .cse604 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_1359 (Array Int Int))) (let ((.cse608 (store (store .cse611 .cse609 (store (select .cse611 .cse609) .cse607 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1359))) (let ((.cse605 (select (select .cse608 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse606 (+ .cse610 4))) (or (not (= (select (select .cse604 .cse605) .cse606) .cse607)) (not (= (select (select .cse608 .cse605) .cse606) .cse609)))))) (= .cse610 .cse607) (= .cse610 4))))))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| Int)) (or (forall ((v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1362 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (let ((.cse622 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1370)) (.cse621 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1369))) (let ((.cse619 (select (select .cse621 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse617 (+ (select (select .cse622 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse614 (store (store .cse622 .cse619 (store (select .cse622 .cse619) .cse617 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1362))) (let ((.cse613 (select (select .cse614 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= .cse613 4) (forall ((v_ArrVal_1359 (Array Int Int))) (let ((.cse620 (store (store .cse621 .cse619 (store (select .cse621 .cse619) .cse617 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1359))) (let ((.cse615 (select (select .cse620 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse616 (+ .cse613 4))) (let ((.cse618 (select (select .cse620 .cse615) .cse616))) (or (not (= (select (select .cse614 .cse615) .cse616) .cse617)) (= .cse618 .cse615) (not (= .cse618 .cse619))))))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| Int)) (or (forall ((v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1362 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (let ((.cse631 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1370)) (.cse629 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1369))) (let ((.cse627 (select (select .cse629 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse630 (+ (select (select .cse631 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse628 (store (store .cse631 .cse627 (store (select .cse631 .cse627) .cse630 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1362))) (let ((.cse623 (select (select .cse628 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= .cse623 4) (forall ((v_ArrVal_1359 (Array Int Int))) (let ((.cse624 (store (store .cse629 .cse627 (store (select .cse629 .cse627) .cse630 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1359))) (let ((.cse625 (select (select .cse624 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse626 (+ .cse623 4))) (or (= (select (select .cse624 .cse625) .cse626) .cse625) (= .cse625 .cse627) (= (select (select .cse628 .cse625) .cse626) 0))))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| Int)) (or (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))) (forall ((v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1362 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (let ((.cse639 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1370)) (.cse637 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1369))) (let ((.cse638 (select (select .cse637 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse633 (+ (select (select .cse639 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse632 (select (select (store (store .cse639 .cse638 (store (select .cse639 .cse638) .cse633 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1362) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= .cse632 .cse633) (= .cse632 4) (forall ((v_ArrVal_1359 (Array Int Int))) (let ((.cse636 (store (store .cse637 .cse638 (store (select .cse637 .cse638) .cse633 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1359))) (let ((.cse635 (select (select .cse636 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse634 (select (select .cse636 .cse635) (+ .cse632 4)))) (or (= .cse634 .cse635) (= .cse634 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))))))))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| Int)) (or (forall ((v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1362 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (let ((.cse648 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1370)) (.cse646 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1369))) (let ((.cse647 (select (select .cse646 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse641 (+ (select (select .cse648 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse642 (store (store .cse648 .cse647 (store (select .cse648 .cse647) .cse641 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1362))) (let ((.cse640 (select (select .cse642 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= .cse640 .cse641) (= .cse640 4) (forall ((v_ArrVal_1359 (Array Int Int))) (let ((.cse645 (store (store .cse646 .cse647 (store (select .cse646 .cse647) .cse641 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1359))) (let ((.cse643 (select (select .cse645 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse644 (+ .cse640 4))) (or (= (select (select .cse642 .cse643) .cse644) .cse640) (= (select (select .cse645 .cse643) .cse644) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| Int)) (or (forall ((v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1362 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (let ((.cse655 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1370)) (.cse652 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1369))) (let ((.cse653 (select (select .cse652 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse654 (+ (select (select .cse655 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse651 (store (store .cse655 .cse653 (store (select .cse655 .cse653) .cse654 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1362))) (let ((.cse650 (select (select .cse651 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_1359 (Array Int Int))) (let ((.cse649 (select (select .cse651 (select (select (store (store .cse652 .cse653 (store (select .cse652 .cse653) .cse654 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1359) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ .cse650 4)))) (or (= .cse649 .cse650) (= .cse649 0)))) (= .cse650 .cse654) (= .cse650 4))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| Int)) (or (forall ((v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1362 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (let ((.cse663 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1370)) (.cse661 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1369))) (let ((.cse659 (select (select .cse661 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse662 (+ (select (select .cse663 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse660 (store (store .cse663 .cse659 (store (select .cse663 .cse659) .cse662 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1362))) (let ((.cse657 (select (select .cse660 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_1359 (Array Int Int))) (let ((.cse658 (select (select (store (store .cse661 .cse659 (store (select .cse661 .cse659) .cse662 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1359) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse656 (select (select .cse660 .cse658) (+ .cse657 4)))) (or (= .cse656 .cse657) (= .cse658 .cse659) (= .cse656 0))))) (= .cse657 4))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| Int)) (or (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1362 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (let ((.cse671 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1370)) (.cse669 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1369))) (let ((.cse666 (select (select .cse669 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse670 (+ (select (select .cse671 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse668 (select (select (store (store .cse671 .cse666 (store (select .cse671 .cse666) .cse670 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1362) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_1359 (Array Int Int))) (let ((.cse667 (store (store .cse669 .cse666 (store (select .cse669 .cse666) .cse670 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1359))) (let ((.cse665 (select (select .cse667 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse664 (select (select .cse667 .cse665) (+ .cse668 4)))) (or (= .cse664 .cse665) (= .cse665 .cse666) (= .cse664 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)))))) (= .cse668 4)))))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)))))) (not (= |c_ULTIMATE.start_main_~data~0#1| |c_ULTIMATE.start_sll_insert_~data#1|))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| Int)) (or (forall ((v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1362 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (let ((.cse679 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1370)) (.cse677 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1369))) (let ((.cse674 (select (select .cse677 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse678 (+ (select (select .cse679 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse676 (select (select (store (store .cse679 .cse674 (store (select .cse679 .cse674) .cse678 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1362) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_1359 (Array Int Int))) (let ((.cse675 (store (store .cse677 .cse674 (store (select .cse677 .cse674) .cse678 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1359))) (let ((.cse673 (select (select .cse675 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse672 (select (select .cse675 .cse673) (+ .cse676 4)))) (or (= .cse672 .cse673) (= .cse673 .cse674) (= .cse672 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)))))) (= .cse676 0) (= .cse676 4)))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| Int)) (or (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))) (forall ((v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1362 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (let ((.cse688 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1370)) (.cse685 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1369))) (let ((.cse686 (select (select .cse685 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse687 (+ (select (select .cse688 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse684 (store (store .cse688 .cse686 (store (select .cse688 .cse686) .cse687 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1362))) (let ((.cse680 (select (select .cse684 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= .cse680 0) (forall ((v_ArrVal_1359 (Array Int Int))) (let ((.cse681 (store (store .cse685 .cse686 (store (select .cse685 .cse686) .cse687 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1359))) (let ((.cse682 (select (select .cse681 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse683 (+ .cse680 4))) (or (not (= (select (select .cse681 .cse682) .cse683) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)) (= .cse682 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|) (not (= (select (select .cse684 .cse682) .cse683) 4)))))))))))))) (or .cse106 (and (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| Int)) (or (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1362 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (let ((.cse695 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1370)) (.cse693 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1369))) (let ((.cse692 (select (select .cse693 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse694 (+ (select (select .cse695 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse691 (select (select (store (store .cse695 .cse692 (store (select .cse695 .cse692) .cse694 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1362) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_1359 (Array Int Int))) (let ((.cse689 (store (store .cse693 .cse692 (store (select .cse693 .cse692) .cse694 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1359))) (let ((.cse690 (select (select .cse689 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (select (select .cse689 .cse690) (+ .cse691 4)) .cse690) (= .cse690 .cse692) (= .cse690 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))) (= .cse691 0)))))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| Int)) (or (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))) (forall ((v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1362 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (let ((.cse702 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1370)) (.cse700 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1369))) (let ((.cse699 (select (select .cse700 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse701 (+ (select (select .cse702 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse696 (store (store .cse702 .cse699 (store (select .cse702 .cse699) .cse701 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1362))) (let ((.cse698 (select (select .cse696 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_1359 (Array Int Int))) (let ((.cse697 (select (select (store (store .cse700 .cse699 (store (select .cse700 .cse699) .cse701 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1359) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (select (select .cse696 .cse697) (+ .cse698 4)) .cse698) (= .cse697 .cse699) (= .cse697 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)))) (= .cse698 0))))))))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| Int)) (or (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1362 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (let ((.cse710 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1370)) (.cse709 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1369))) (let ((.cse707 (select (select .cse709 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse704 (+ (select (select .cse710 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse708 (store (store .cse710 .cse707 (store (select .cse710 .cse707) .cse704 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1362))) (let ((.cse703 (select (select .cse708 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse703 .cse704)) (= .cse703 4) (forall ((v_ArrVal_1359 (Array Int Int))) (let ((.cse706 (select (select (store (store .cse709 .cse707 (store (select .cse709 .cse707) .cse704 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1359) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse705 (select (select .cse708 .cse706) (+ .cse703 4)))) (or (= .cse705 .cse703) (not (= .cse706 .cse707)) (= .cse705 0))))))))))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| Int)) (or (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1362 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (let ((.cse721 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1370)) (.cse720 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1369))) (let ((.cse716 (select (select .cse720 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse712 (+ (select (select .cse721 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse717 (store (store .cse721 .cse716 (store (select .cse721 .cse716) .cse712 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1362))) (let ((.cse711 (select (select .cse717 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= .cse711 0) (= .cse711 .cse712) (forall ((v_ArrVal_1359 (Array Int Int))) (let ((.cse719 (store (store .cse720 .cse716 (store (select .cse720 .cse716) .cse712 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1359))) (let ((.cse715 (select (select .cse719 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse718 (+ .cse711 4))) (let ((.cse714 (select (select .cse719 .cse715) .cse718)) (.cse713 (select (select .cse717 .cse715) .cse718))) (or (not (= .cse713 .cse712)) (= .cse714 .cse715) (not (= .cse714 .cse716)) (= .cse715 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|) (= .cse713 4)))))))))))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| Int)) (or (forall ((v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1362 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (let ((.cse731 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1370)) (.cse729 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1369))) (let ((.cse730 (select (select .cse729 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse727 (+ (select (select .cse731 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse728 (store (store .cse731 .cse730 (store (select .cse731 .cse730) .cse727 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1362))) (let ((.cse722 (select (select .cse728 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= .cse722 0) (= .cse722 4) (forall ((v_ArrVal_1359 (Array Int Int))) (let ((.cse724 (store (store .cse729 .cse730 (store (select .cse729 .cse730) .cse727 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1359))) (let ((.cse725 (select (select .cse724 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse726 (+ .cse722 4))) (let ((.cse723 (select (select .cse728 .cse725) .cse726))) (or (= .cse723 .cse722) (= (select (select .cse724 .cse725) .cse726) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|) (= .cse723 .cse727)))))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| Int)) (or (forall ((v_ArrVal_1359 (Array Int Int)) (v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (let ((.cse737 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1370)) (.cse740 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1369))) (let ((.cse738 (select (select .cse740 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse739 (+ (select (select .cse737 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse733 (store (store .cse740 .cse738 (store (select .cse740 .cse738) .cse739 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1359))) (let ((.cse734 (select (select .cse733 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_1362 (Array Int Int))) (let ((.cse736 (store (store .cse737 .cse738 (store (select .cse737 .cse738) .cse739 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1362))) (let ((.cse732 (select (select .cse736 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse735 (+ .cse732 4))) (or (= .cse732 4) (not (= (select (select .cse733 .cse734) .cse735) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)) (not (= (select (select .cse736 .cse734) .cse735) 4))))))) (= .cse734 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| Int)) (or (forall ((v_ArrVal_1359 (Array Int Int)) (v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (let ((.cse746 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1370)) (.cse749 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1369))) (let ((.cse747 (select (select .cse749 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse748 (+ (select (select .cse746 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse745 (store (store .cse749 .cse747 (store (select .cse749 .cse747) .cse748 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1359))) (let ((.cse742 (select (select .cse745 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_1362 (Array Int Int))) (let ((.cse741 (store (store .cse746 .cse747 (store (select .cse746 .cse747) .cse748 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1362))) (let ((.cse744 (select (select .cse741 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse743 (+ .cse744 4))) (or (= (select (select .cse741 .cse742) .cse743) .cse744) (not (= .cse744 4)) (= (select (select .cse745 .cse742) .cse743) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)))))) (= .cse742 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| Int)) (or (forall ((v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1362 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (let ((.cse759 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1370)) (.cse758 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1369))) (let ((.cse756 (select (select .cse758 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse754 (+ (select (select .cse759 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse751 (store (store .cse759 .cse756 (store (select .cse759 .cse756) .cse754 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1362))) (let ((.cse750 (select (select .cse751 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= .cse750 0) (= .cse750 4) (forall ((v_ArrVal_1359 (Array Int Int))) (let ((.cse757 (store (store .cse758 .cse756 (store (select .cse758 .cse756) .cse754 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1359))) (let ((.cse752 (select (select .cse757 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse753 (+ .cse750 4))) (let ((.cse755 (select (select .cse757 .cse752) .cse753))) (or (not (= (select (select .cse751 .cse752) .cse753) .cse754)) (= .cse755 .cse752) (not (= .cse755 .cse756))))))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| Int)) (or (forall ((v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1362 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (let ((.cse767 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1370)) (.cse766 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1369))) (let ((.cse764 (select (select .cse766 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse761 (+ (select (select .cse767 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse760 (select (select (store (store .cse767 .cse764 (store (select .cse767 .cse764) .cse761 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1362) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse760 .cse761)) (= .cse760 4) (forall ((v_ArrVal_1359 (Array Int Int))) (let ((.cse765 (store (store .cse766 .cse764 (store (select .cse766 .cse764) .cse761 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1359))) (let ((.cse763 (select (select .cse765 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse762 (select (select .cse765 .cse763) (+ .cse760 4)))) (or (= .cse762 .cse763) (not (= .cse763 .cse764)) (= .cse762 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))) (or (and (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| Int)) (or (forall ((v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1362 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (let ((.cse773 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1370)) (.cse770 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1369))) (let ((.cse771 (select (select .cse770 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse772 (+ (select (select .cse773 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse769 (store (store .cse773 .cse771 (store (select .cse773 .cse771) .cse772 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1362))) (let ((.cse768 (select (select .cse769 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse768 4)) (forall ((v_ArrVal_1359 (Array Int Int))) (= (select (select .cse769 (select (select (store (store .cse770 .cse771 (store (select .cse770 .cse771) .cse772 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1359) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ .cse768 4)) .cse768)))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| Int)) (or (forall ((v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1362 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (let ((.cse780 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1370)) (.cse777 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1369))) (let ((.cse778 (select (select .cse777 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse779 (+ (select (select .cse780 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse776 (select (select (store (store .cse780 .cse778 (store (select .cse780 .cse778) .cse779 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1362) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_1359 (Array Int Int))) (let ((.cse774 (store (store .cse777 .cse778 (store (select .cse777 .cse778) .cse779 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1359))) (let ((.cse775 (select (select .cse774 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse774 .cse775) (+ .cse776 4)) .cse775)))) (not (= .cse776 4))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)))))) .cse106) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| Int)) (or (forall ((v_ArrVal_1359 (Array Int Int)) (v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (let ((.cse786 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1370)) (.cse789 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1369))) (let ((.cse787 (select (select .cse789 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse788 (+ (select (select .cse786 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse781 (store (store .cse789 .cse787 (store (select .cse789 .cse787) .cse788 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1359))) (let ((.cse782 (select (select .cse781 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_1362 (Array Int Int))) (let ((.cse785 (store (store .cse786 .cse787 (store (select .cse786 .cse787) .cse788 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1362))) (let ((.cse784 (select (select .cse785 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse783 (+ .cse784 4))) (or (= (select (select .cse781 .cse782) .cse783) .cse782) (= .cse784 4) (= (select (select .cse785 .cse782) .cse783) 0)))))) (= .cse782 .cse787) (= .cse782 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| Int)) (or (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))) (forall ((v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1362 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (let ((.cse798 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1370)) (.cse796 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1369))) (let ((.cse794 (select (select .cse796 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse797 (+ (select (select .cse798 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse795 (store (store .cse798 .cse794 (store (select .cse798 .cse794) .cse797 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1362))) (let ((.cse790 (select (select .cse795 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= .cse790 0) (= .cse790 4) (forall ((v_ArrVal_1359 (Array Int Int))) (let ((.cse791 (store (store .cse796 .cse794 (store (select .cse796 .cse794) .cse797 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1359))) (let ((.cse792 (select (select .cse791 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse793 (+ .cse790 4))) (or (= (select (select .cse791 .cse792) .cse793) .cse792) (= .cse792 .cse794) (= (select (select .cse795 .cse792) .cse793) 0))))))))))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| Int)) (or (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))) (forall ((v_ArrVal_1359 (Array Int Int)) (v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (let ((.cse805 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1370)) (.cse807 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1369))) (let ((.cse800 (select (select .cse807 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse806 (+ (select (select .cse805 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse804 (store (store .cse807 .cse800 (store (select .cse807 .cse800) .cse806 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1359))) (let ((.cse799 (select (select .cse804 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= .cse799 .cse800) (= .cse799 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|) (forall ((v_ArrVal_1362 (Array Int Int))) (let ((.cse801 (store (store .cse805 .cse800 (store (select .cse805 .cse800) .cse806 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1362))) (let ((.cse803 (select (select .cse801 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse802 (+ .cse803 4))) (or (= (select (select .cse801 .cse799) .cse802) .cse803) (= .cse803 4) (= (select (select .cse804 .cse799) .cse802) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)))))))))))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| Int)) (or (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))) (forall ((v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1362 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (let ((.cse817 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1370)) (.cse815 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1369))) (let ((.cse816 (select (select .cse815 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse812 (+ (select (select .cse817 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse810 (store (store .cse817 .cse816 (store (select .cse817 .cse816) .cse812 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1362))) (let ((.cse814 (select (select .cse810 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_1359 (Array Int Int))) (let ((.cse813 (store (store .cse815 .cse816 (store (select .cse815 .cse816) .cse812 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1359))) (let ((.cse809 (select (select .cse813 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse811 (+ .cse814 4))) (let ((.cse808 (select (select .cse813 .cse809) .cse811))) (or (= .cse808 .cse809) (= .cse808 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|) (= (select (select .cse810 .cse809) .cse811) .cse812)))))) (= .cse814 0) (= .cse814 4))))))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| Int)) (or (forall ((v_ArrVal_1359 (Array Int Int)) (v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (let ((.cse824 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1370)) (.cse826 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1369))) (let ((.cse820 (select (select .cse826 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse825 (+ (select (select .cse824 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse823 (store (store .cse826 .cse820 (store (select .cse826 .cse820) .cse825 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1359))) (let ((.cse819 (select (select .cse823 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_1362 (Array Int Int))) (let ((.cse821 (store (store .cse824 .cse820 (store (select .cse824 .cse820) .cse825 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1362))) (let ((.cse822 (+ (select (select .cse821 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse818 (select (select .cse823 .cse819) .cse822))) (or (= .cse818 .cse819) (= .cse818 .cse820) (= (select (select .cse821 .cse819) .cse822) 0)))))) (= .cse819 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| Int)) (or (forall ((v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1362 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (let ((.cse835 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1370)) (.cse832 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1369))) (let ((.cse833 (select (select .cse832 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse834 (+ (select (select .cse835 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse827 (store (store .cse835 .cse833 (store (select .cse835 .cse833) .cse834 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1362))) (let ((.cse830 (select (select .cse827 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_1359 (Array Int Int))) (let ((.cse831 (store (store .cse832 .cse833 (store (select .cse832 .cse833) .cse834 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1359))) (let ((.cse828 (select (select .cse831 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse829 (+ .cse830 4))) (or (= (select (select .cse827 .cse828) .cse829) .cse830) (= .cse828 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|) (= (select (select .cse831 .cse828) .cse829) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))) (= .cse830 0) (= .cse830 .cse834))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))) (or .cse106 (and (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| Int)) (or (forall ((v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1362 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (let ((.cse844 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1370)) (.cse842 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1369))) (let ((.cse840 (select (select .cse842 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse843 (+ (select (select .cse844 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse841 (store (store .cse844 .cse840 (store (select .cse844 .cse840) .cse843 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1362))) (let ((.cse836 (select (select .cse841 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= .cse836 0) (forall ((v_ArrVal_1359 (Array Int Int))) (let ((.cse837 (store (store .cse842 .cse840 (store (select .cse842 .cse840) .cse843 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1359))) (let ((.cse839 (+ .cse836 4)) (.cse838 (select (select .cse837 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (select (select .cse837 .cse838) .cse839) .cse840) (= (select (select .cse841 .cse838) .cse839) .cse836) (= .cse838 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| Int)) (or (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))) (forall ((v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1362 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (let ((.cse852 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1370)) (.cse850 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1369))) (let ((.cse848 (select (select .cse850 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse851 (+ (select (select .cse852 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse845 (select (select (store (store .cse852 .cse848 (store (select .cse852 .cse848) .cse851 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1362) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= .cse845 0) (= .cse845 4) (forall ((v_ArrVal_1359 (Array Int Int))) (let ((.cse849 (store (store .cse850 .cse848 (store (select .cse850 .cse848) .cse851 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1359))) (let ((.cse847 (select (select .cse849 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse846 (select (select .cse849 .cse847) (+ .cse845 4)))) (or (= .cse846 .cse847) (= .cse846 .cse848))))))))))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| Int)) (or (forall ((v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1362 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (let ((.cse861 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1370)) (.cse859 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1369))) (let ((.cse857 (select (select .cse859 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse860 (+ (select (select .cse861 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse858 (store (store .cse861 .cse857 (store (select .cse861 .cse857) .cse860 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1362))) (let ((.cse853 (select (select .cse858 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= .cse853 0) (forall ((v_ArrVal_1359 (Array Int Int))) (let ((.cse854 (store (store .cse859 .cse857 (store (select .cse859 .cse857) .cse860 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1359))) (let ((.cse855 (select (select .cse854 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse856 (+ .cse853 4))) (or (= (select (select .cse854 .cse855) .cse856) .cse857) (= (select (select .cse858 .cse855) .cse856) .cse853))))) (= .cse853 4))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| Int)) (or (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))) (forall ((v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1362 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (let ((.cse869 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1370)) (.cse867 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1369))) (let ((.cse865 (select (select .cse867 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse868 (+ (select (select .cse869 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse862 (select (select (store (store .cse869 .cse865 (store (select .cse869 .cse865) .cse868 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1362) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= .cse862 0) (forall ((v_ArrVal_1359 (Array Int Int))) (let ((.cse866 (store (store .cse867 .cse865 (store (select .cse867 .cse865) .cse868 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1359))) (let ((.cse864 (select (select .cse866 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse863 (select (select .cse866 .cse864) (+ .cse862 4)))) (or (= .cse863 .cse864) (= .cse863 .cse865) (= .cse864 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))))))))))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| Int)) (or (forall ((v_ArrVal_1359 (Array Int Int)) (v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (let ((.cse879 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1370)) (.cse880 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1369))) (let ((.cse875 (select (select .cse880 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse871 (+ (select (select .cse879 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse878 (store (store .cse880 .cse875 (store (select .cse880 .cse875) .cse871 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1359))) (let ((.cse873 (select (select .cse878 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_1362 (Array Int Int))) (let ((.cse876 (store (store .cse879 .cse875 (store (select .cse879 .cse875) .cse871 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1362))) (let ((.cse874 (select (select .cse876 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse877 (+ .cse874 4))) (let ((.cse872 (select (select .cse878 .cse873) .cse877)) (.cse870 (select (select .cse876 .cse873) .cse877))) (or (not (= .cse870 .cse871)) (= .cse872 .cse873) (= .cse874 .cse871) (not (= .cse872 .cse875)) (= .cse870 4))))))) (= .cse873 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| Int)) (or (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))) (forall ((v_ArrVal_1359 (Array Int Int)) (v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (let ((.cse889 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1370)) (.cse890 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1369))) (let ((.cse887 (select (select .cse890 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse882 (+ (select (select .cse889 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse884 (store (store .cse890 .cse887 (store (select .cse890 .cse887) .cse882 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1359))) (let ((.cse885 (select (select .cse884 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_1362 (Array Int Int))) (let ((.cse888 (store (store .cse889 .cse887 (store (select .cse889 .cse887) .cse882 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1362))) (let ((.cse883 (select (select .cse888 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse886 (+ .cse883 4))) (let ((.cse881 (select (select .cse888 .cse885) .cse886))) (or (not (= .cse881 .cse882)) (= .cse883 4) (= .cse883 .cse882) (not (= (select (select .cse884 .cse885) .cse886) .cse887)) (= .cse881 4))))))) (= .cse885 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| Int)) (or (forall ((v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1362 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (let ((.cse898 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1370)) (.cse895 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1369))) (let ((.cse896 (select (select .cse895 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse897 (+ (select (select .cse898 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse891 (select (select (store (store .cse898 .cse896 (store (select .cse898 .cse896) .cse897 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1362) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse891 4)) (forall ((v_ArrVal_1359 (Array Int Int))) (let ((.cse894 (store (store .cse895 .cse896 (store (select .cse895 .cse896) .cse897 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1359))) (let ((.cse893 (select (select .cse894 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse892 (select (select .cse894 .cse893) (+ .cse891 4)))) (or (= .cse892 .cse893) (= .cse892 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| Int)) (or (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))) (forall ((v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1362 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (let ((.cse907 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1370)) (.cse904 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1369))) (let ((.cse905 (select (select .cse904 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse906 (+ (select (select .cse907 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse903 (store (store .cse907 .cse905 (store (select .cse907 .cse905) .cse906 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1362))) (let ((.cse899 (select (select .cse903 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= .cse899 0) (= .cse899 4) (forall ((v_ArrVal_1359 (Array Int Int))) (let ((.cse900 (store (store .cse904 .cse905 (store (select .cse904 .cse905) .cse906 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1359))) (let ((.cse901 (select (select .cse900 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse902 (+ .cse899 4))) (or (not (= (select (select .cse900 .cse901) .cse902) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)) (not (= (select (select .cse903 .cse901) .cse902) 4)))))))))))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| Int)) (or (forall ((v_ArrVal_1359 (Array Int Int)) (v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (let ((.cse915 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1370)) (.cse917 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1369))) (let ((.cse909 (select (select .cse917 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse916 (+ (select (select .cse915 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse914 (store (store .cse917 .cse909 (store (select .cse917 .cse909) .cse916 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1359))) (let ((.cse911 (select (select .cse914 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_1362 (Array Int Int))) (let ((.cse910 (store (store .cse915 .cse909 (store (select .cse915 .cse909) .cse916 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1362))) (let ((.cse913 (select (select .cse910 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse912 (+ .cse913 4))) (let ((.cse908 (select (select .cse914 .cse911) .cse912))) (or (= .cse908 .cse909) (= (select (select .cse910 .cse911) .cse912) .cse913) (= .cse913 4) (= .cse908 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))))) (= .cse911 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| Int)) (or (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1362 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (let ((.cse925 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1370)) (.cse923 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1369))) (let ((.cse921 (select (select .cse923 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse924 (+ (select (select .cse925 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse918 (select (select (store (store .cse925 .cse921 (store (select .cse925 .cse921) .cse924 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1362) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= .cse918 0) (= .cse918 4) (forall ((v_ArrVal_1359 (Array Int Int))) (let ((.cse922 (store (store .cse923 .cse921 (store (select .cse923 .cse921) .cse924 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1359))) (let ((.cse920 (select (select .cse922 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse919 (select (select .cse922 .cse920) (+ .cse918 4)))) (or (= .cse919 .cse920) (= .cse919 .cse921) (= .cse919 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))))))))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| Int)) (or (forall ((v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1362 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (let ((.cse935 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1370)) (.cse933 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1369))) (let ((.cse930 (select (select .cse933 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse934 (+ (select (select .cse935 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse932 (store (store .cse935 .cse930 (store (select .cse935 .cse930) .cse934 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1362))) (let ((.cse926 (select (select .cse932 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= .cse926 0) (forall ((v_ArrVal_1359 (Array Int Int))) (let ((.cse927 (store (store .cse933 .cse930 (store (select .cse933 .cse930) .cse934 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1359))) (let ((.cse928 (select (select .cse927 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse929 (+ .cse926 4))) (let ((.cse931 (select (select .cse932 .cse928) .cse929))) (or (= (select (select .cse927 .cse928) .cse929) .cse930) (= .cse931 .cse926) (= .cse928 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|) (= .cse931 0)))))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| Int)) (or (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))) (forall ((v_ArrVal_1359 (Array Int Int)) (v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (let ((.cse943 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1370)) (.cse945 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1369))) (let ((.cse938 (select (select .cse945 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse944 (+ (select (select .cse943 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse942 (store (store .cse945 .cse938 (store (select .cse945 .cse938) .cse944 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1359))) (let ((.cse937 (select (select .cse942 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_1362 (Array Int Int))) (let ((.cse940 (store (store .cse943 .cse938 (store (select .cse943 .cse938) .cse944 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1362))) (let ((.cse939 (select (select .cse940 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse941 (+ .cse939 4))) (let ((.cse936 (select (select .cse942 .cse937) .cse941))) (or (= .cse936 .cse937) (= .cse936 .cse938) (= .cse939 4) (= (select (select .cse940 .cse937) .cse941) 0))))))) (= .cse937 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| Int)) (or (forall ((v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1362 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (let ((.cse955 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1370)) (.cse954 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1369))) (let ((.cse952 (select (select .cse954 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse947 (+ (select (select .cse955 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse953 (store (store .cse955 .cse952 (store (select .cse955 .cse952) .cse947 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1362))) (let ((.cse946 (select (select .cse953 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= .cse946 0) (= .cse946 .cse947) (forall ((v_ArrVal_1359 (Array Int Int))) (let ((.cse949 (store (store .cse954 .cse952 (store (select .cse954 .cse952) .cse947 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1359))) (let ((.cse950 (select (select .cse949 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse951 (+ .cse946 4))) (let ((.cse948 (select (select .cse953 .cse950) .cse951))) (or (not (= .cse948 .cse947)) (not (= (select (select .cse949 .cse950) .cse951) .cse952)) (= .cse950 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|) (= .cse948 4)))))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| Int)) (or (forall ((v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1362 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (let ((.cse965 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1370)) (.cse962 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1369))) (let ((.cse963 (select (select .cse962 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse964 (+ (select (select .cse965 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse961 (store (store .cse965 .cse963 (store (select .cse965 .cse963) .cse964 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1362))) (let ((.cse956 (select (select .cse961 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= .cse956 0) (forall ((v_ArrVal_1359 (Array Int Int))) (let ((.cse958 (store (store .cse962 .cse963 (store (select .cse962 .cse963) .cse964 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1359))) (let ((.cse959 (select (select .cse958 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse960 (+ .cse956 4))) (let ((.cse957 (select (select .cse961 .cse959) .cse960))) (or (= .cse957 .cse956) (not (= (select (select .cse958 .cse959) .cse960) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)) (= .cse959 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|) (not (= .cse957 4))))))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| Int)) (or (forall ((v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1362 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (let ((.cse974 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1370)) (.cse972 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1369))) (let ((.cse970 (select (select .cse972 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse973 (+ (select (select .cse974 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse966 (store (store .cse974 .cse970 (store (select .cse974 .cse970) .cse973 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1362))) (let ((.cse969 (select (select .cse966 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_1359 (Array Int Int))) (let ((.cse971 (store (store .cse972 .cse970 (store (select .cse972 .cse970) .cse973 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1359))) (let ((.cse967 (select (select .cse971 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse968 (+ .cse969 4))) (or (= (select (select .cse966 .cse967) .cse968) .cse969) (= .cse967 .cse970) (= (select (select .cse971 .cse967) .cse968) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))) (= .cse969 0) (= .cse969 4))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| Int)) (or (forall ((v_ArrVal_1359 (Array Int Int)) (v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (let ((.cse980 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1370)) (.cse983 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1369))) (let ((.cse981 (select (select .cse983 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse982 (+ (select (select .cse980 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse975 (store (store .cse983 .cse981 (store (select .cse983 .cse981) .cse982 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1359))) (let ((.cse976 (select (select .cse975 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_1362 (Array Int Int))) (let ((.cse979 (store (store .cse980 .cse981 (store (select .cse980 .cse981) .cse982 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1362))) (let ((.cse978 (select (select .cse979 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse977 (+ .cse978 4))) (or (= (select (select .cse975 .cse976) .cse977) .cse976) (not (= .cse978 4)) (= (select (select .cse979 .cse976) .cse977) 0)))))) (= .cse976 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| Int)) (or (forall ((v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1362 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (let ((.cse991 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1370)) (.cse989 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1369))) (let ((.cse987 (select (select .cse989 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse990 (+ (select (select .cse991 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse988 (store (store .cse991 .cse987 (store (select .cse991 .cse987) .cse990 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1362))) (let ((.cse984 (select (select .cse988 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= .cse984 0) (forall ((v_ArrVal_1359 (Array Int Int))) (let ((.cse986 (select (select (store (store .cse989 .cse987 (store (select .cse989 .cse987) .cse990 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1359) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse985 (select (select .cse988 .cse986) (+ .cse984 4)))) (or (= .cse985 .cse984) (= .cse986 .cse987) (= .cse986 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|) (= .cse985 0))))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| Int)) (or (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))) (forall ((v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1362 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (let ((.cse1002 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1370)) (.cse1001 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1369))) (let ((.cse996 (select (select .cse1001 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse993 (+ (select (select .cse1002 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse997 (store (store .cse1002 .cse996 (store (select .cse1002 .cse996) .cse993 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1362))) (let ((.cse1000 (select (select .cse997 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_1359 (Array Int Int))) (let ((.cse999 (store (store .cse1001 .cse996 (store (select .cse1001 .cse996) .cse993 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1359))) (let ((.cse995 (select (select .cse999 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse998 (+ .cse1000 4))) (let ((.cse994 (select (select .cse999 .cse995) .cse998)) (.cse992 (select (select .cse997 .cse995) .cse998))) (or (not (= .cse992 .cse993)) (= .cse994 .cse995) (not (= .cse994 .cse996)) (= .cse992 4)))))) (= .cse1000 0) (= .cse1000 4) (= .cse1000 .cse993))))))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| Int)) (or (forall ((v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1362 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (let ((.cse1011 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1370)) (.cse1009 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1369))) (let ((.cse1006 (select (select .cse1009 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse1010 (+ (select (select .cse1011 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse1007 (store (store .cse1011 .cse1006 (store (select .cse1011 .cse1006) .cse1010 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1362))) (let ((.cse1008 (select (select .cse1007 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_1359 (Array Int Int))) (let ((.cse1003 (store (store .cse1009 .cse1006 (store (select .cse1009 .cse1006) .cse1010 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1359))) (let ((.cse1004 (select (select .cse1003 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1005 (+ .cse1008 4))) (or (= (select (select .cse1003 .cse1004) .cse1005) .cse1004) (= .cse1004 .cse1006) (= .cse1004 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|) (= (select (select .cse1007 .cse1004) .cse1005) 0))))) (= .cse1008 0))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| Int)) (or (forall ((v_ArrVal_1359 (Array Int Int)) (v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (let ((.cse1017 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1370)) (.cse1019 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1369))) (let ((.cse1013 (select (select .cse1019 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse1018 (+ (select (select .cse1017 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse1016 (store (store .cse1019 .cse1013 (store (select .cse1019 .cse1013) .cse1018 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1359))) (let ((.cse1012 (select (select .cse1016 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= .cse1012 .cse1013) (forall ((v_ArrVal_1362 (Array Int Int))) (let ((.cse1015 (select (select (store (store .cse1017 .cse1013 (store (select .cse1017 .cse1013) .cse1018 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1362) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1014 (select (select .cse1016 .cse1012) (+ .cse1015 4)))) (or (= .cse1014 .cse1012) (= .cse1015 4) (= .cse1014 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))) (= .cse1012 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| Int)) (or (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1359 (Array Int Int)) (v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (let ((.cse1025 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1370)) (.cse1027 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1369))) (let ((.cse1026 (select (select .cse1027 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse1023 (+ (select (select .cse1025 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse1024 (store (store .cse1027 .cse1026 (store (select .cse1027 .cse1026) .cse1023 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1359))) (let ((.cse1021 (select (select .cse1024 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_1362 (Array Int Int))) (let ((.cse1022 (select (select (store (store .cse1025 .cse1026 (store (select .cse1025 .cse1026) .cse1023 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1362) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1020 (select (select .cse1024 .cse1021) (+ .cse1022 4)))) (or (= .cse1020 .cse1021) (= .cse1022 .cse1023) (= .cse1020 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))) (= .cse1021 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| Int)) (or (forall ((v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1362 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (let ((.cse1037 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1370)) (.cse1035 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1369))) (let ((.cse1030 (select (select .cse1035 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse1036 (+ (select (select .cse1037 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse1031 (store (store .cse1037 .cse1030 (store (select .cse1037 .cse1030) .cse1036 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1362))) (let ((.cse1034 (select (select .cse1031 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_1359 (Array Int Int))) (let ((.cse1033 (store (store .cse1035 .cse1030 (store (select .cse1035 .cse1030) .cse1036 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1359))) (let ((.cse1029 (select (select .cse1033 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1032 (+ .cse1034 4))) (let ((.cse1028 (select (select .cse1033 .cse1029) .cse1032))) (or (= .cse1028 .cse1029) (= .cse1028 .cse1030) (= (select (select .cse1031 .cse1029) .cse1032) 0)))))) (= .cse1034 0) (= .cse1034 4))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| Int)) (or (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1362 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (let ((.cse1047 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1370)) (.cse1045 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1369))) (let ((.cse1042 (select (select .cse1045 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse1046 (+ (select (select .cse1047 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse1044 (store (store .cse1047 .cse1042 (store (select .cse1047 .cse1042) .cse1046 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1362))) (let ((.cse1038 (select (select .cse1044 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= .cse1038 0) (= .cse1038 4) (forall ((v_ArrVal_1359 (Array Int Int))) (let ((.cse1039 (store (store .cse1045 .cse1042 (store (select .cse1045 .cse1042) .cse1046 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1359))) (let ((.cse1040 (select (select .cse1039 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1041 (+ .cse1038 4))) (let ((.cse1043 (select (select .cse1044 .cse1040) .cse1041))) (or (= (select (select .cse1039 .cse1040) .cse1041) .cse1042) (= .cse1043 .cse1038) (= .cse1043 0)))))))))))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| Int)) (or (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1362 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (let ((.cse1057 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1370)) (.cse1054 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1369))) (let ((.cse1055 (select (select .cse1054 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse1056 (+ (select (select .cse1057 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse1051 (store (store .cse1057 .cse1055 (store (select .cse1057 .cse1055) .cse1056 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1362))) (let ((.cse1048 (select (select .cse1051 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= .cse1048 0) (= .cse1048 4) (forall ((v_ArrVal_1359 (Array Int Int))) (let ((.cse1053 (store (store .cse1054 .cse1055 (store (select .cse1054 .cse1055) .cse1056 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1359))) (let ((.cse1050 (select (select .cse1053 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1052 (+ .cse1048 4))) (let ((.cse1049 (select (select .cse1053 .cse1050) .cse1052))) (or (= .cse1049 .cse1050) (not (= .cse1049 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)) (not (= (select (select .cse1051 .cse1050) .cse1052) 4))))))))))))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| Int)) (or (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1359 (Array Int Int)) (v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (let ((.cse1064 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1370)) (.cse1066 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1369))) (let ((.cse1065 (select (select .cse1066 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse1062 (+ (select (select .cse1064 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse1063 (store (store .cse1066 .cse1065 (store (select .cse1066 .cse1065) .cse1062 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1359))) (let ((.cse1058 (select (select .cse1063 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= .cse1058 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|) (forall ((v_ArrVal_1362 (Array Int Int))) (let ((.cse1060 (store (store .cse1064 .cse1065 (store (select .cse1064 .cse1065) .cse1062 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1362))) (let ((.cse1061 (+ (select (select .cse1060 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse1059 (select (select .cse1063 .cse1058) .cse1061))) (or (= .cse1059 .cse1058) (= .cse1059 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|) (= (select (select .cse1060 .cse1058) .cse1061) .cse1062)))))))))))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| Int)) (or (forall ((v_ArrVal_1359 (Array Int Int)) (v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (let ((.cse1072 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1370)) (.cse1074 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1369))) (let ((.cse1068 (select (select .cse1074 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse1073 (+ (select (select .cse1072 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse1069 (store (store .cse1074 .cse1068 (store (select .cse1074 .cse1068) .cse1073 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1359))) (let ((.cse1067 (select (select .cse1069 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= .cse1067 .cse1068) (= .cse1067 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|) (forall ((v_ArrVal_1362 (Array Int Int))) (let ((.cse1071 (store (store .cse1072 .cse1068 (store (select .cse1072 .cse1068) .cse1073 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1362))) (let ((.cse1070 (+ (select (select .cse1071 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (or (= (select (select .cse1069 .cse1067) .cse1070) .cse1067) (= (select (select .cse1071 .cse1067) .cse1070) 0))))))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| Int)) (or (forall ((v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1362 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (let ((.cse1083 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1370)) (.cse1082 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1369))) (let ((.cse1080 (select (select .cse1082 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse1076 (+ (select (select .cse1083 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse1081 (store (store .cse1083 .cse1080 (store (select .cse1083 .cse1080) .cse1076 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1362))) (let ((.cse1075 (select (select .cse1081 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse1075 .cse1076)) (forall ((v_ArrVal_1359 (Array Int Int))) (let ((.cse1077 (store (store .cse1082 .cse1080 (store (select .cse1082 .cse1080) .cse1076 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1359))) (let ((.cse1078 (select (select .cse1077 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1079 (+ .cse1075 4))) (or (= (select (select .cse1077 .cse1078) .cse1079) .cse1078) (not (= .cse1078 .cse1080)) (= (select (select .cse1081 .cse1078) .cse1079) 0))))) (= .cse1075 4))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| Int)) (or (forall ((v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1362 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (let ((.cse1093 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1370)) (.cse1091 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1369))) (let ((.cse1086 (select (select .cse1091 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse1092 (+ (select (select .cse1093 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse1087 (store (store .cse1093 .cse1086 (store (select .cse1093 .cse1086) .cse1092 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1362))) (let ((.cse1090 (select (select .cse1087 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_1359 (Array Int Int))) (let ((.cse1089 (store (store .cse1091 .cse1086 (store (select .cse1091 .cse1086) .cse1092 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1359))) (let ((.cse1085 (select (select .cse1089 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1088 (+ .cse1090 4))) (let ((.cse1084 (select (select .cse1089 .cse1085) .cse1088))) (or (= .cse1084 .cse1085) (= .cse1084 .cse1086) (= .cse1085 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|) (= (select (select .cse1087 .cse1085) .cse1088) 0)))))) (= .cse1090 0))))))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| Int)) (or (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1359 (Array Int Int)) (v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (let ((.cse1101 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1370)) (.cse1103 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1369))) (let ((.cse1097 (select (select .cse1103 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse1102 (+ (select (select .cse1101 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse1094 (store (store .cse1103 .cse1097 (store (select .cse1103 .cse1097) .cse1102 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1359))) (let ((.cse1095 (select (select .cse1094 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_1362 (Array Int Int))) (let ((.cse1100 (store (store .cse1101 .cse1097 (store (select .cse1101 .cse1097) .cse1102 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1362))) (let ((.cse1099 (select (select .cse1100 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1096 (+ .cse1099 4))) (let ((.cse1098 (select (select .cse1100 .cse1095) .cse1096))) (or (= (select (select .cse1094 .cse1095) .cse1096) .cse1097) (= .cse1098 .cse1099) (= .cse1099 4) (= .cse1098 0))))))) (= .cse1095 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| Int)) (or (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))) (forall ((v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1362 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (let ((.cse1113 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1370)) (.cse1112 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1369))) (let ((.cse1110 (select (select .cse1112 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse1108 (+ (select (select .cse1113 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse1105 (store (store .cse1113 .cse1110 (store (select .cse1113 .cse1110) .cse1108 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1362))) (let ((.cse1104 (select (select .cse1105 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse1104 4)) (forall ((v_ArrVal_1359 (Array Int Int))) (let ((.cse1111 (store (store .cse1112 .cse1110 (store (select .cse1112 .cse1110) .cse1108 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1359))) (let ((.cse1106 (select (select .cse1111 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1107 (+ .cse1104 4))) (let ((.cse1109 (select (select .cse1111 .cse1106) .cse1107))) (or (not (= (select (select .cse1105 .cse1106) .cse1107) .cse1108)) (= .cse1109 .cse1106) (not (= .cse1109 .cse1110))))))))))))))) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| Int)) (or (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1362 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (let ((.cse1123 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1370)) (.cse1121 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1369))) (let ((.cse1122 (select (select .cse1121 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse1119 (+ (select (select .cse1123 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse1120 (store (store .cse1123 .cse1122 (store (select .cse1123 .cse1122) .cse1119 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1362))) (let ((.cse1114 (select (select .cse1120 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= .cse1114 0) (forall ((v_ArrVal_1359 (Array Int Int))) (let ((.cse1117 (store (store .cse1121 .cse1122 (store (select .cse1121 .cse1122) .cse1119 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_1359))) (let ((.cse1116 (select (select .cse1117 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1118 (+ .cse1114 4))) (let ((.cse1115 (select (select .cse1120 .cse1116) .cse1118))) (or (= .cse1115 .cse1114) (= .cse1116 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|) (= (select (select .cse1117 .cse1116) .cse1118) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|) (= .cse1115 .cse1119)))))))))))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22|))))))) is different from true [2023-02-15 19:50:24,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1307347321] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:50:24,733 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 19:50:24,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 26] total 44 [2023-02-15 19:50:24,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363167829] [2023-02-15 19:50:24,735 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 19:50:24,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2023-02-15 19:50:24,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:50:24,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2023-02-15 19:50:24,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=2201, Unknown=4, NotChecked=288, Total=2652 [2023-02-15 19:50:24,737 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand has 44 states, 42 states have (on average 1.5238095238095237) internal successors, (64), 36 states have internal predecessors, (64), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-15 19:50:32,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:50:32,279 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2023-02-15 19:50:32,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-02-15 19:50:32,280 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 42 states have (on average 1.5238095238095237) internal successors, (64), 36 states have internal predecessors, (64), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 40 [2023-02-15 19:50:32,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:50:32,281 INFO L225 Difference]: With dead ends: 38 [2023-02-15 19:50:32,281 INFO L226 Difference]: Without dead ends: 36 [2023-02-15 19:50:32,282 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 66 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 925 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=388, Invalid=3780, Unknown=4, NotChecked=384, Total=4556 [2023-02-15 19:50:32,282 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 161 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 591 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 612 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2023-02-15 19:50:32,282 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 306 Invalid, 612 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 591 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2023-02-15 19:50:32,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2023-02-15 19:50:32,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2023-02-15 19:50:32,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.103448275862069) internal successors, (32), 29 states have internal predecessors, (32), 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 19:50:32,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2023-02-15 19:50:32,305 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 40 [2023-02-15 19:50:32,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:50:32,306 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2023-02-15 19:50:32,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 42 states have (on average 1.5238095238095237) internal successors, (64), 36 states have internal predecessors, (64), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-15 19:50:32,306 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2023-02-15 19:50:32,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-02-15 19:50:32,307 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:50:32,307 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:50:32,314 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 19:50:32,508 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 19:50:32,508 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:50:32,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:50:32,509 INFO L85 PathProgramCache]: Analyzing trace with hash -2139083003, now seen corresponding path program 2 times [2023-02-15 19:50:32,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:50:32,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235083734] [2023-02-15 19:50:32,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:50:32,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:50:32,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:50:34,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 19:50:34,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:50:35,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 19:50:35,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:50:35,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 19:50:35,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:50:36,046 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 19:50:36,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:50:36,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235083734] [2023-02-15 19:50:36,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235083734] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:50:36,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [426921182] [2023-02-15 19:50:36,047 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 19:50:36,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:50:36,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:50:36,055 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 19:50:36,057 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 19:50:36,222 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 19:50:36,223 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 19:50:36,225 INFO L263 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 120 conjunts are in the unsatisfiable core [2023-02-15 19:50:36,228 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:50:37,107 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 19:50:37,579 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 19:50:38,496 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:50:38,496 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 1 case distinctions, treesize of input 44 treesize of output 23 [2023-02-15 19:50:38,505 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 19:50:38,513 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 19:50:39,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:50:39,206 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 19:50:39,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:50:39,255 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 19:50:39,256 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 50 treesize of output 48 [2023-02-15 19:50:39,308 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-02-15 19:50:39,308 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 19:50:40,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:50:40,298 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 19:50:40,306 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:50:40,306 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 110 treesize of output 72 [2023-02-15 19:50:40,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:50:40,344 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 50 treesize of output 40 [2023-02-15 19:50:40,691 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-02-15 19:50:40,691 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 4 new quantified variables, introduced 2 case distinctions, treesize of input 97 treesize of output 61 [2023-02-15 19:50:40,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:50:40,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:50:40,706 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 39 treesize of output 42 [2023-02-15 19:50:41,704 INFO L321 Elim1Store]: treesize reduction 48, result has 69.4 percent of original size [2023-02-15 19:50:41,705 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 7 new quantified variables, introduced 10 case distinctions, treesize of input 197 treesize of output 265 [2023-02-15 19:50:50,440 INFO L321 Elim1Store]: treesize reduction 68, result has 48.9 percent of original size [2023-02-15 19:50:50,440 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 11 new quantified variables, introduced 21 case distinctions, treesize of input 149 treesize of output 131 [2023-02-15 19:50:51,919 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 19:50:51,920 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:50:54,183 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1548 (Array Int Int)) (v_ArrVal_1547 (Array Int Int)) (v_ArrVal_1542 (Array Int Int)) (|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_25| Int)) (or (not (= 0 (let ((.cse9 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_25| v_ArrVal_1547)) (.cse7 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_25| v_ArrVal_1548))) (let ((.cse8 (select (select .cse7 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse6 (+ (select (select .cse9 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse3 (store (store .cse9 .cse8 (store (select .cse9 .cse8) .cse6 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_25| v_ArrVal_1542)) (.cse0 (let ((.cse5 (select .cse7 .cse8))) (let ((.cse4 (store .cse7 .cse8 (store .cse5 .cse6 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_25|)))) (store .cse4 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_25| (store (select .cse4 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_25|) 4 (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|) 4))) (select (select .cse0 (select (select .cse0 .cse1) .cse2)) (+ (select (select .cse3 .cse1) .cse2) 4)))))))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_25|))) (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_25| |c_#StackHeapBarrier|)))) is different from false [2023-02-15 19:50:54,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [426921182] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:50:54,188 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 19:50:54,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 43 [2023-02-15 19:50:54,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811141681] [2023-02-15 19:50:54,189 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 19:50:54,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2023-02-15 19:50:54,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:50:54,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2023-02-15 19:50:54,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=2387, Unknown=12, NotChecked=98, Total=2652 [2023-02-15 19:50:54,191 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand has 43 states, 41 states have (on average 1.4634146341463414) internal successors, (60), 35 states have internal predecessors, (60), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 19:51:01,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:51:01,472 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2023-02-15 19:51:01,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-02-15 19:51:01,473 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 41 states have (on average 1.4634146341463414) internal successors, (60), 35 states have internal predecessors, (60), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 42 [2023-02-15 19:51:01,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:51:01,474 INFO L225 Difference]: With dead ends: 42 [2023-02-15 19:51:01,474 INFO L226 Difference]: Without dead ends: 39 [2023-02-15 19:51:01,475 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 27 SyntacticMatches, 6 SemanticMatches, 67 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 930 ImplicationChecksByTransitivity, 18.0s TimeCoverageRelationStatistics Valid=389, Invalid=4159, Unknown=12, NotChecked=132, Total=4692 [2023-02-15 19:51:01,475 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 139 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 604 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-02-15 19:51:01,476 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 367 Invalid, 614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 604 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-02-15 19:51:01,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2023-02-15 19:51:01,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 35. [2023-02-15 19:51:01,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.1) internal successors, (33), 30 states have internal predecessors, (33), 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 19:51:01,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2023-02-15 19:51:01,484 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 42 [2023-02-15 19:51:01,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:51:01,485 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2023-02-15 19:51:01,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 41 states have (on average 1.4634146341463414) internal successors, (60), 35 states have internal predecessors, (60), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 19:51:01,485 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2023-02-15 19:51:01,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-02-15 19:51:01,485 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:51:01,485 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:51:01,495 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 19:51:01,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:51:01,687 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:51:01,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:51:01,688 INFO L85 PathProgramCache]: Analyzing trace with hash -2139081329, now seen corresponding path program 2 times [2023-02-15 19:51:01,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:51:01,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019029408] [2023-02-15 19:51:01,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:51:01,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:51:01,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:51:05,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 19:51:05,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:51:05,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 19:51:05,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:51:05,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 19:51:05,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:51:06,763 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 19:51:06,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:51:06,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019029408] [2023-02-15 19:51:06,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019029408] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:51:06,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1998596474] [2023-02-15 19:51:06,764 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 19:51:06,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:51:06,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:51:06,765 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 19:51:06,767 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 19:51:06,935 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 19:51:06,936 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 19:51:06,939 WARN L261 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 211 conjunts are in the unsatisfiable core [2023-02-15 19:51:06,944 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:51:06,958 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 19:51:07,228 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 19:51:07,606 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 11 treesize of output 7 [2023-02-15 19:51:07,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:51:07,885 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 19:51:08,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:51:08,179 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 20 [2023-02-15 19:51:08,193 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 19:51:08,214 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 19:51:08,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:51:08,652 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 19:51:08,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 7 treesize of output 3 [2023-02-15 19:51:08,670 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 19:51:08,678 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 19:51:09,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:51:09,606 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2023-02-15 19:51:09,606 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 22 treesize of output 33 [2023-02-15 19:51:09,658 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 16 treesize of output 18 [2023-02-15 19:51:09,689 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 16 treesize of output 18 [2023-02-15 19:51:09,711 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 19:51:10,064 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 21 treesize of output 20 [2023-02-15 19:51:10,080 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 20 treesize of output 22 [2023-02-15 19:51:10,118 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 27 treesize of output 26 [2023-02-15 19:51:11,546 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 19:51:11,546 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 114 treesize of output 52 [2023-02-15 19:51:11,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:51:11,561 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2023-02-15 19:51:11,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:51:11,574 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2023-02-15 19:51:11,583 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 19:51:11,931 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2023-02-15 19:51:12,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:51:12,383 INFO L321 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2023-02-15 19:51:12,383 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 122 treesize of output 98 [2023-02-15 19:51:12,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:51:12,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:51:12,466 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-02-15 19:51:12,466 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 33 [2023-02-15 19:51:12,502 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 22 treesize of output 24 [2023-02-15 19:51:12,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:51:12,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:51:12,538 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 48 [2023-02-15 19:51:14,353 INFO L321 Elim1Store]: treesize reduction 58, result has 59.7 percent of original size [2023-02-15 19:51:14,353 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 136 treesize of output 149 [2023-02-15 19:51:14,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:51:14,646 INFO L321 Elim1Store]: treesize reduction 76, result has 44.1 percent of original size [2023-02-15 19:51:14,647 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 44 treesize of output 81 [2023-02-15 19:51:14,764 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2023-02-15 19:51:14,765 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 2 case distinctions, treesize of input 21 treesize of output 34 [2023-02-15 19:51:14,778 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 19:51:14,803 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 19:51:19,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:51:20,733 INFO L321 Elim1Store]: treesize reduction 258, result has 55.1 percent of original size [2023-02-15 19:51:20,734 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 2 disjoint index pairs (out of 36 index pairs), introduced 12 new quantified variables, introduced 43 case distinctions, treesize of input 658 treesize of output 686 [2023-02-15 19:51:20,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:51:20,906 INFO L217 Elim1Store]: Index analysis took 152 ms [2023-02-15 19:51:22,673 INFO L321 Elim1Store]: treesize reduction 298, result has 55.1 percent of original size [2023-02-15 19:51:22,673 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 2 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 43 case distinctions, treesize of input 469 treesize of output 740 [2023-02-15 19:51:22,747 INFO L321 Elim1Store]: treesize reduction 60, result has 1.6 percent of original size [2023-02-15 19:51:22,747 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 382 treesize of output 374