./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety/test-0219.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety/test-0219.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4a489d3e73f8fa53a32414f65b592ba5db703c103e5e16e188592c7c2dfeab95 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 15:39:39,272 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 15:39:39,369 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-13 15:39:39,379 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 15:39:39,380 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 15:39:39,410 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 15:39:39,413 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 15:39:39,413 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 15:39:39,414 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 15:39:39,414 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 15:39:39,415 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 15:39:39,416 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 15:39:39,416 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 15:39:39,416 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 15:39:39,417 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 15:39:39,417 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 15:39:39,417 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 15:39:39,417 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 15:39:39,417 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 15:39:39,417 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 15:39:39,418 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-13 15:39:39,418 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-13 15:39:39,418 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-13 15:39:39,418 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 15:39:39,418 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-13 15:39:39,418 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 15:39:39,418 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-13 15:39:39,418 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 15:39:39,418 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 15:39:39,418 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 15:39:39,419 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 15:39:39,419 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 15:39:39,419 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 15:39:39,419 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 15:39:39,419 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 15:39:39,419 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 15:39:39,419 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 15:39:39,419 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 15:39:39,419 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 15:39:39,419 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 15:39:39,419 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 15:39:39,419 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 15:39:39,419 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4a489d3e73f8fa53a32414f65b592ba5db703c103e5e16e188592c7c2dfeab95 [2024-11-13 15:39:39,775 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 15:39:39,785 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 15:39:39,790 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 15:39:39,791 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 15:39:39,791 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 15:39:39,793 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/memsafety/test-0219.i Unable to find full path for "g++" [2024-11-13 15:39:41,816 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 15:39:42,141 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 15:39:42,142 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/sv-benchmarks/c/memsafety/test-0219.i [2024-11-13 15:39:42,155 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd/data/da5543afa/b0fa55fb32714d1580a89c2bd4d8e024/FLAG333a17d0a [2024-11-13 15:39:42,170 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd/data/da5543afa/b0fa55fb32714d1580a89c2bd4d8e024 [2024-11-13 15:39:42,172 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 15:39:42,174 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 15:39:42,176 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 15:39:42,176 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 15:39:42,180 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 15:39:42,182 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 03:39:42" (1/1) ... [2024-11-13 15:39:42,183 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24c969b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:39:42, skipping insertion in model container [2024-11-13 15:39:42,183 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 03:39:42" (1/1) ... [2024-11-13 15:39:42,226 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 15:39:42,694 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 15:39:42,706 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 15:39:42,771 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 15:39:42,804 INFO L204 MainTranslator]: Completed translation [2024-11-13 15:39:42,804 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:39:42 WrapperNode [2024-11-13 15:39:42,804 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 15:39:42,807 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 15:39:42,807 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 15:39:42,807 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 15:39:42,818 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:39:42" (1/1) ... [2024-11-13 15:39:42,839 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:39:42" (1/1) ... [2024-11-13 15:39:42,873 INFO L138 Inliner]: procedures = 180, calls = 36, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 113 [2024-11-13 15:39:42,873 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 15:39:42,877 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 15:39:42,877 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 15:39:42,877 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 15:39:42,889 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:39:42" (1/1) ... [2024-11-13 15:39:42,889 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:39:42" (1/1) ... [2024-11-13 15:39:42,893 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:39:42" (1/1) ... [2024-11-13 15:39:42,910 INFO L175 MemorySlicer]: Split 22 memory accesses to 3 slices as follows [2, 12, 8]. 55 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 8 writes are split as follows [0, 6, 2]. [2024-11-13 15:39:42,911 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:39:42" (1/1) ... [2024-11-13 15:39:42,911 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:39:42" (1/1) ... [2024-11-13 15:39:42,926 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:39:42" (1/1) ... [2024-11-13 15:39:42,930 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:39:42" (1/1) ... [2024-11-13 15:39:42,936 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:39:42" (1/1) ... [2024-11-13 15:39:42,937 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:39:42" (1/1) ... [2024-11-13 15:39:42,939 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 15:39:42,940 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 15:39:42,940 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 15:39:42,941 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 15:39:42,941 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:39:42" (1/1) ... [2024-11-13 15:39:42,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 15:39:42,959 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:39:42,971 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 15:39:42,973 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 15:39:42,998 INFO L130 BoogieDeclarations]: Found specification of procedure calloc_model [2024-11-13 15:39:42,998 INFO L138 BoogieDeclarations]: Found implementation of procedure calloc_model [2024-11-13 15:39:42,998 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-13 15:39:42,998 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 15:39:42,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-13 15:39:42,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-13 15:39:43,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-13 15:39:43,000 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-13 15:39:43,000 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-13 15:39:43,000 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-13 15:39:43,000 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-13 15:39:43,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-13 15:39:43,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-13 15:39:43,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-13 15:39:43,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 15:39:43,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-13 15:39:43,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-13 15:39:43,000 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 15:39:43,000 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 15:39:43,144 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 15:39:43,146 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 15:39:43,545 INFO L? ?]: Removed 94 outVars from TransFormulas that were not future-live. [2024-11-13 15:39:43,546 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 15:39:43,558 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 15:39:43,558 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-13 15:39:43,558 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 03:39:43 BoogieIcfgContainer [2024-11-13 15:39:43,559 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 15:39:43,561 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 15:39:43,561 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 15:39:43,566 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 15:39:43,566 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 03:39:42" (1/3) ... [2024-11-13 15:39:43,567 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66d6afda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 03:39:43, skipping insertion in model container [2024-11-13 15:39:43,567 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:39:42" (2/3) ... [2024-11-13 15:39:43,567 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66d6afda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 03:39:43, skipping insertion in model container [2024-11-13 15:39:43,568 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 03:39:43" (3/3) ... [2024-11-13 15:39:43,569 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0219.i [2024-11-13 15:39:43,588 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 15:39:43,590 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG test-0219.i that has 2 procedures, 108 locations, 1 initial locations, 5 loop locations, and 46 error locations. [2024-11-13 15:39:43,645 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 15:39:43,657 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@4c4a20b5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 15:39:43,657 INFO L334 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2024-11-13 15:39:43,661 INFO L276 IsEmpty]: Start isEmpty. Operand has 108 states, 58 states have (on average 2.0) internal successors, (116), 104 states have internal predecessors, (116), 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) [2024-11-13 15:39:43,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-13 15:39:43,667 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:39:43,668 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-13 15:39:43,668 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [calloc_modelErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, calloc_modelErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-13 15:39:43,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:39:43,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1358920, now seen corresponding path program 1 times [2024-11-13 15:39:43,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:39:43,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882809470] [2024-11-13 15:39:43,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:39:43,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:39:43,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:43,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:39:43,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:39:43,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882809470] [2024-11-13 15:39:43,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882809470] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:39:43,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:39:43,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 15:39:43,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117328467] [2024-11-13 15:39:43,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:39:43,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 15:39:43,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:39:43,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 15:39:43,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 15:39:43,887 INFO L87 Difference]: Start difference. First operand has 108 states, 58 states have (on average 2.0) internal successors, (116), 104 states have internal predecessors, (116), 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 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:39:43,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:39:43,912 INFO L93 Difference]: Finished difference Result 108 states and 113 transitions. [2024-11-13 15:39:43,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 15:39:43,914 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-13 15:39:43,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:39:43,919 INFO L225 Difference]: With dead ends: 108 [2024-11-13 15:39:43,919 INFO L226 Difference]: Without dead ends: 106 [2024-11-13 15:39:43,920 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 15:39:43,923 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 15:39:43,924 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 15:39:43,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-13 15:39:43,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2024-11-13 15:39:43,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 57 states have (on average 1.8771929824561404) internal successors, (107), 102 states have internal predecessors, (107), 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) [2024-11-13 15:39:43,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 111 transitions. [2024-11-13 15:39:43,958 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 111 transitions. Word has length 4 [2024-11-13 15:39:43,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:39:43,959 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 111 transitions. [2024-11-13 15:39:43,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:39:43,959 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 111 transitions. [2024-11-13 15:39:43,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-13 15:39:43,959 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:39:43,960 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-13 15:39:43,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 15:39:43,960 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting calloc_modelErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [calloc_modelErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, calloc_modelErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-13 15:39:43,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:39:43,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1303845400, now seen corresponding path program 1 times [2024-11-13 15:39:43,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:39:43,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068066991] [2024-11-13 15:39:43,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:39:43,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:39:44,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:44,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:39:44,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:39:44,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068066991] [2024-11-13 15:39:44,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068066991] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:39:44,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:39:44,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 15:39:44,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551685157] [2024-11-13 15:39:44,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:39:44,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 15:39:44,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:39:44,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 15:39:44,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:39:44,184 INFO L87 Difference]: Start difference. First operand 106 states and 111 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:39:44,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:39:44,331 INFO L93 Difference]: Finished difference Result 105 states and 110 transitions. [2024-11-13 15:39:44,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 15:39:44,332 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-13 15:39:44,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:39:44,333 INFO L225 Difference]: With dead ends: 105 [2024-11-13 15:39:44,333 INFO L226 Difference]: Without dead ends: 105 [2024-11-13 15:39:44,333 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:39:44,334 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 4 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 15:39:44,334 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 164 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 15:39:44,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-13 15:39:44,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2024-11-13 15:39:44,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 57 states have (on average 1.8596491228070176) internal successors, (106), 101 states have internal predecessors, (106), 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) [2024-11-13 15:39:44,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 110 transitions. [2024-11-13 15:39:44,346 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 110 transitions. Word has length 6 [2024-11-13 15:39:44,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:39:44,346 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 110 transitions. [2024-11-13 15:39:44,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:39:44,349 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 110 transitions. [2024-11-13 15:39:44,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-13 15:39:44,349 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:39:44,349 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:39:44,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 15:39:44,350 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting calloc_modelErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [calloc_modelErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, calloc_modelErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-13 15:39:44,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:39:44,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1764501770, now seen corresponding path program 1 times [2024-11-13 15:39:44,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:39:44,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623512931] [2024-11-13 15:39:44,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:39:44,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:39:44,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 15:39:44,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1378131729] [2024-11-13 15:39:44,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:39:44,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:39:44,404 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:39:44,408 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:39:44,411 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-13 15:39:44,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:44,527 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-13 15:39:44,533 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:39:44,629 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-13 15:39:44,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:39:44,673 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 15:39:44,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:39:44,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623512931] [2024-11-13 15:39:44,674 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-13 15:39:44,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1378131729] [2024-11-13 15:39:44,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1378131729] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:39:44,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:39:44,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 15:39:44,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10048911] [2024-11-13 15:39:44,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:39:44,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 15:39:44,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:39:44,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 15:39:44,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:39:44,676 INFO L87 Difference]: Start difference. First operand 105 states and 110 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:39:44,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:39:44,808 INFO L93 Difference]: Finished difference Result 104 states and 109 transitions. [2024-11-13 15:39:44,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 15:39:44,809 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-13 15:39:44,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:39:44,810 INFO L225 Difference]: With dead ends: 104 [2024-11-13 15:39:44,811 INFO L226 Difference]: Without dead ends: 104 [2024-11-13 15:39:44,811 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 15:39:44,812 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 9 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 15:39:44,812 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 265 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 15:39:44,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-13 15:39:44,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2024-11-13 15:39:44,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 57 states have (on average 1.8421052631578947) internal successors, (105), 100 states have internal predecessors, (105), 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) [2024-11-13 15:39:44,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 109 transitions. [2024-11-13 15:39:44,820 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 109 transitions. Word has length 7 [2024-11-13 15:39:44,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:39:44,820 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 109 transitions. [2024-11-13 15:39:44,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:39:44,821 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 109 transitions. [2024-11-13 15:39:44,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-13 15:39:44,821 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:39:44,821 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:39:44,837 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-13 15:39:45,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:39:45,022 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [calloc_modelErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, calloc_modelErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-13 15:39:45,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:39:45,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1543504784, now seen corresponding path program 1 times [2024-11-13 15:39:45,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:39:45,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54917249] [2024-11-13 15:39:45,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:39:45,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:39:45,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:45,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-13 15:39:45,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:45,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-13 15:39:45,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:45,546 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 15:39:45,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:39:45,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54917249] [2024-11-13 15:39:45,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54917249] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:39:45,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:39:45,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 15:39:45,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693103983] [2024-11-13 15:39:45,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:39:45,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 15:39:45,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:39:45,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 15:39:45,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-13 15:39:45,548 INFO L87 Difference]: Start difference. First operand 104 states and 109 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-13 15:39:45,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:39:45,856 INFO L93 Difference]: Finished difference Result 101 states and 106 transitions. [2024-11-13 15:39:45,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 15:39:45,857 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2024-11-13 15:39:45,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:39:45,858 INFO L225 Difference]: With dead ends: 101 [2024-11-13 15:39:45,858 INFO L226 Difference]: Without dead ends: 101 [2024-11-13 15:39:45,858 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-13 15:39:45,861 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 13 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 15:39:45,862 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 361 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 15:39:45,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-13 15:39:45,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2024-11-13 15:39:45,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 57 states have (on average 1.7894736842105263) internal successors, (102), 97 states have internal predecessors, (102), 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) [2024-11-13 15:39:45,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 106 transitions. [2024-11-13 15:39:45,873 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 106 transitions. Word has length 26 [2024-11-13 15:39:45,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:39:45,874 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 106 transitions. [2024-11-13 15:39:45,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-13 15:39:45,875 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 106 transitions. [2024-11-13 15:39:45,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-13 15:39:45,876 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:39:45,876 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:39:45,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-13 15:39:45,876 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [calloc_modelErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, calloc_modelErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-13 15:39:45,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:39:45,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1543504785, now seen corresponding path program 1 times [2024-11-13 15:39:45,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:39:45,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185602798] [2024-11-13 15:39:45,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:39:45,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:39:45,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 15:39:45,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1106779685] [2024-11-13 15:39:45,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:39:45,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:39:45,920 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:39:45,922 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:39:45,924 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-13 15:39:46,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:46,053 INFO L255 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-13 15:39:46,059 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:39:46,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-13 15:39:46,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2024-11-13 15:39:46,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:39:46,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-13 15:39:46,727 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 15:39:46,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-13 15:39:46,758 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 15:39:46,758 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 15:39:46,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:39:46,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185602798] [2024-11-13 15:39:46,758 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-13 15:39:46,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1106779685] [2024-11-13 15:39:46,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1106779685] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:39:46,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:39:46,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 15:39:46,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442519192] [2024-11-13 15:39:46,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:39:46,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 15:39:46,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:39:46,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 15:39:46,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-13 15:39:46,760 INFO L87 Difference]: Start difference. First operand 101 states and 106 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-13 15:39:47,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:39:47,410 INFO L93 Difference]: Finished difference Result 98 states and 103 transitions. [2024-11-13 15:39:47,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 15:39:47,411 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2024-11-13 15:39:47,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:39:47,412 INFO L225 Difference]: With dead ends: 98 [2024-11-13 15:39:47,412 INFO L226 Difference]: Without dead ends: 98 [2024-11-13 15:39:47,412 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-13 15:39:47,413 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 14 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-13 15:39:47,413 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 313 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-13 15:39:47,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-13 15:39:47,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-11-13 15:39:47,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 57 states have (on average 1.736842105263158) internal successors, (99), 94 states have internal predecessors, (99), 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) [2024-11-13 15:39:47,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 103 transitions. [2024-11-13 15:39:47,419 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 103 transitions. Word has length 26 [2024-11-13 15:39:47,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:39:47,419 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 103 transitions. [2024-11-13 15:39:47,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-13 15:39:47,420 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 103 transitions. [2024-11-13 15:39:47,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-13 15:39:47,420 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:39:47,420 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:39:47,442 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-13 15:39:47,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:39:47,621 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [calloc_modelErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, calloc_modelErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-13 15:39:47,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:39:47,621 INFO L85 PathProgramCache]: Analyzing trace with hash -1908780077, now seen corresponding path program 1 times [2024-11-13 15:39:47,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:39:47,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429506995] [2024-11-13 15:39:47,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:39:47,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:39:47,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:47,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-13 15:39:47,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:48,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-13 15:39:48,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:48,238 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 15:39:48,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:39:48,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429506995] [2024-11-13 15:39:48,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429506995] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:39:48,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [249043131] [2024-11-13 15:39:48,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:39:48,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:39:48,239 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:39:48,241 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:39:48,246 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-13 15:39:48,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:48,376 INFO L255 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-13 15:39:48,379 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:39:48,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-13 15:39:48,459 WARN L873 $PredicateComparison]: unable to prove that (exists ((|calloc_model_~ptr~0#1.base| Int)) (and (= (select |c_old(#valid)| |calloc_model_~ptr~0#1.base|) 0) (= |c_#valid| (store |c_old(#valid)| |calloc_model_~ptr~0#1.base| (select |c_#valid| |calloc_model_~ptr~0#1.base|))))) is different from true [2024-11-13 15:39:48,529 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-13 15:39:48,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-13 15:39:48,552 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-13 15:39:48,552 INFO L378 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 [2024-11-13 15:39:48,575 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-11-13 15:39:48,575 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:39:48,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [249043131] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:39:48,695 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 15:39:48,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 13 [2024-11-13 15:39:48,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606365541] [2024-11-13 15:39:48,696 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 15:39:48,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-13 15:39:48,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:39:48,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-13 15:39:48,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=151, Unknown=1, NotChecked=24, Total=210 [2024-11-13 15:39:48,698 INFO L87 Difference]: Start difference. First operand 98 states and 103 transitions. Second operand has 14 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 11 states have internal predecessors, (37), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-13 15:39:49,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:39:49,274 INFO L93 Difference]: Finished difference Result 99 states and 106 transitions. [2024-11-13 15:39:49,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 15:39:49,275 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 11 states have internal predecessors, (37), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 30 [2024-11-13 15:39:49,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:39:49,277 INFO L225 Difference]: With dead ends: 99 [2024-11-13 15:39:49,277 INFO L226 Difference]: Without dead ends: 99 [2024-11-13 15:39:49,278 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=64, Invalid=281, Unknown=1, NotChecked=34, Total=380 [2024-11-13 15:39:49,279 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 29 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 100 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-13 15:39:49,279 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 501 Invalid, 548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 442 Invalid, 0 Unknown, 100 Unchecked, 0.4s Time] [2024-11-13 15:39:49,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-13 15:39:49,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 95. [2024-11-13 15:39:49,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 57 states have (on average 1.6842105263157894) internal successors, (96), 91 states have internal predecessors, (96), 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) [2024-11-13 15:39:49,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 100 transitions. [2024-11-13 15:39:49,285 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 100 transitions. Word has length 30 [2024-11-13 15:39:49,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:39:49,285 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 100 transitions. [2024-11-13 15:39:49,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 11 states have internal predecessors, (37), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-13 15:39:49,286 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 100 transitions. [2024-11-13 15:39:49,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-13 15:39:49,286 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:39:49,286 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:39:49,308 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-13 15:39:49,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:39:49,491 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [calloc_modelErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, calloc_modelErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-13 15:39:49,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:39:49,491 INFO L85 PathProgramCache]: Analyzing trace with hash -1908780076, now seen corresponding path program 1 times [2024-11-13 15:39:49,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:39:49,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969302391] [2024-11-13 15:39:49,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:39:49,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:39:49,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:50,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-13 15:39:50,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:50,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-13 15:39:50,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:50,427 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 15:39:50,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:39:50,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969302391] [2024-11-13 15:39:50,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969302391] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:39:50,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:39:50,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-13 15:39:50,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909570749] [2024-11-13 15:39:50,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:39:50,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-13 15:39:50,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:39:50,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-13 15:39:50,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-13 15:39:50,430 INFO L87 Difference]: Start difference. First operand 95 states and 100 transitions. Second operand has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-13 15:39:50,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:39:50,750 INFO L93 Difference]: Finished difference Result 103 states and 109 transitions. [2024-11-13 15:39:50,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 15:39:50,751 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2024-11-13 15:39:50,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:39:50,752 INFO L225 Difference]: With dead ends: 103 [2024-11-13 15:39:50,752 INFO L226 Difference]: Without dead ends: 99 [2024-11-13 15:39:50,752 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-13 15:39:50,753 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 4 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 15:39:50,756 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 314 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 15:39:50,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-13 15:39:50,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-11-13 15:39:50,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 60 states have (on average 1.6666666666666667) internal successors, (100), 95 states have internal predecessors, (100), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-13 15:39:50,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 105 transitions. [2024-11-13 15:39:50,769 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 105 transitions. Word has length 30 [2024-11-13 15:39:50,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:39:50,769 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 105 transitions. [2024-11-13 15:39:50,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-13 15:39:50,770 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 105 transitions. [2024-11-13 15:39:50,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-13 15:39:50,771 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:39:50,771 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:39:50,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-13 15:39:50,771 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [calloc_modelErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, calloc_modelErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-13 15:39:50,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:39:50,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1816140970, now seen corresponding path program 1 times [2024-11-13 15:39:50,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:39:50,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939093742] [2024-11-13 15:39:50,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:39:50,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:39:50,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:51,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-13 15:39:51,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:51,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-13 15:39:51,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:51,827 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 15:39:51,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:39:51,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939093742] [2024-11-13 15:39:51,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939093742] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:39:51,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [891541707] [2024-11-13 15:39:51,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:39:51,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:39:51,829 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:39:51,832 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:39:51,834 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-13 15:39:52,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:39:52,014 INFO L255 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-13 15:39:52,017 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:39:52,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-13 15:39:52,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-13 15:39:53,307 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 15:39:53,307 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-13 15:39:53,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-13 15:39:53,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-13 15:39:53,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-13 15:39:53,373 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 15:39:53,373 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:40:06,469 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 15:40:06,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [891541707] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 15:40:06,469 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 15:40:06,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 28 [2024-11-13 15:40:06,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919093358] [2024-11-13 15:40:06,470 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 15:40:06,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-13 15:40:06,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:40:06,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-13 15:40:06,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=651, Unknown=3, NotChecked=0, Total=756 [2024-11-13 15:40:06,472 INFO L87 Difference]: Start difference. First operand 99 states and 105 transitions. Second operand has 28 states, 28 states have (on average 1.7857142857142858) internal successors, (50), 24 states have internal predecessors, (50), 1 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-13 15:40:25,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:40:25,019 INFO L93 Difference]: Finished difference Result 116 states and 125 transitions. [2024-11-13 15:40:25,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-13 15:40:25,019 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.7857142857142858) internal successors, (50), 24 states have internal predecessors, (50), 1 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 1 states have call successors, (4) Word has length 31 [2024-11-13 15:40:25,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:40:25,020 INFO L225 Difference]: With dead ends: 116 [2024-11-13 15:40:25,020 INFO L226 Difference]: Without dead ends: 108 [2024-11-13 15:40:25,021 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 30.9s TimeCoverageRelationStatistics Valid=160, Invalid=955, Unknown=7, NotChecked=0, Total=1122 [2024-11-13 15:40:25,021 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 5 mSDsluCounter, 652 mSDsCounter, 0 mSdLazyCounter, 981 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 743 SdHoareTripleChecker+Invalid, 986 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 981 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-13 15:40:25,022 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 743 Invalid, 986 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 981 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-13 15:40:25,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-13 15:40:25,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 102. [2024-11-13 15:40:25,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 63 states have (on average 1.6825396825396826) internal successors, (106), 98 states have internal predecessors, (106), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-13 15:40:25,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 111 transitions. [2024-11-13 15:40:25,027 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 111 transitions. Word has length 31 [2024-11-13 15:40:25,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:40:25,028 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 111 transitions. [2024-11-13 15:40:25,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.7857142857142858) internal successors, (50), 24 states have internal predecessors, (50), 1 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-13 15:40:25,028 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 111 transitions. [2024-11-13 15:40:25,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-13 15:40:25,029 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:40:25,029 INFO L215 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:40:25,049 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-13 15:40:25,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:40:25,234 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [calloc_modelErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, calloc_modelErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-13 15:40:25,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:40:25,235 INFO L85 PathProgramCache]: Analyzing trace with hash -976168620, now seen corresponding path program 2 times [2024-11-13 15:40:25,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:40:25,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508274623] [2024-11-13 15:40:25,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:40:25,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:40:25,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 15:40:25,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1886376323] [2024-11-13 15:40:25,289 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 15:40:25,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:40:25,289 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:40:25,291 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:40:25,293 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-13 15:40:25,491 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-13 15:40:25,492 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 15:40:25,501 INFO L255 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-11-13 15:40:25,506 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:40:25,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2024-11-13 15:40:25,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-13 15:40:26,020 WARN L873 $PredicateComparison]: unable to prove that (exists ((|calloc_model_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= (select |c_old(#valid)| |calloc_model_#Ultimate.C_memset_#ptr#1.base|) 0) (= |c_#valid| (store |c_old(#valid)| |calloc_model_#Ultimate.C_memset_#ptr#1.base| (select |c_#valid| |calloc_model_#Ultimate.C_memset_#ptr#1.base|))) (= |c_#length| (store |c_old(#length)| |calloc_model_#Ultimate.C_memset_#ptr#1.base| (select |c_#length| |calloc_model_#Ultimate.C_memset_#ptr#1.base|))))) is different from true [2024-11-13 15:40:26,138 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-13 15:40:26,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-13 15:40:26,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-13 15:40:26,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:40:26,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-13 15:40:26,192 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 15:40:26,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-13 15:40:26,234 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 10 not checked. [2024-11-13 15:40:26,234 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:40:26,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:40:26,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508274623] [2024-11-13 15:40:26,568 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-13 15:40:26,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1886376323] [2024-11-13 15:40:26,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1886376323] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:40:26,568 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-13 15:40:26,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2024-11-13 15:40:26,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604151453] [2024-11-13 15:40:26,568 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-13 15:40:26,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-13 15:40:26,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:40:26,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-13 15:40:26,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=108, Unknown=1, NotChecked=20, Total=156 [2024-11-13 15:40:26,569 INFO L87 Difference]: Start difference. First operand 102 states and 111 transitions. Second operand has 11 states, 10 states have (on average 2.7) internal successors, (27), 9 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 15:40:27,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:40:27,395 INFO L93 Difference]: Finished difference Result 99 states and 108 transitions. [2024-11-13 15:40:27,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 15:40:27,396 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 9 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 34 [2024-11-13 15:40:27,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:40:27,397 INFO L225 Difference]: With dead ends: 99 [2024-11-13 15:40:27,397 INFO L226 Difference]: Without dead ends: 99 [2024-11-13 15:40:27,398 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=49, Invalid=226, Unknown=1, NotChecked=30, Total=306 [2024-11-13 15:40:27,398 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 34 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 409 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 90 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-13 15:40:27,398 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 318 Invalid, 506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 409 Invalid, 0 Unknown, 90 Unchecked, 0.5s Time] [2024-11-13 15:40:27,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-13 15:40:27,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-11-13 15:40:27,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 63 states have (on average 1.6349206349206349) internal successors, (103), 95 states have internal predecessors, (103), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-13 15:40:27,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 108 transitions. [2024-11-13 15:40:27,404 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 108 transitions. Word has length 34 [2024-11-13 15:40:27,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:40:27,404 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 108 transitions. [2024-11-13 15:40:27,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 9 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 15:40:27,405 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 108 transitions. [2024-11-13 15:40:27,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-13 15:40:27,405 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:40:27,406 INFO L215 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:40:27,415 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-13 15:40:27,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:40:27,610 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [calloc_modelErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, calloc_modelErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-13 15:40:27,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:40:27,611 INFO L85 PathProgramCache]: Analyzing trace with hash -1468561248, now seen corresponding path program 1 times [2024-11-13 15:40:27,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:40:27,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127148051] [2024-11-13 15:40:27,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:40:27,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:40:27,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:28,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-13 15:40:28,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:28,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-13 15:40:28,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:28,430 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-13 15:40:28,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:40:28,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127148051] [2024-11-13 15:40:28,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127148051] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:40:28,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:40:28,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-13 15:40:28,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352849112] [2024-11-13 15:40:28,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:40:28,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-13 15:40:28,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:40:28,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-13 15:40:28,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2024-11-13 15:40:28,432 INFO L87 Difference]: Start difference. First operand 99 states and 108 transitions. Second operand has 15 states, 12 states have (on average 2.25) internal successors, (27), 11 states have internal predecessors, (27), 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) [2024-11-13 15:40:28,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:40:28,864 INFO L93 Difference]: Finished difference Result 122 states and 131 transitions. [2024-11-13 15:40:28,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 15:40:28,864 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 2.25) internal successors, (27), 11 states have internal predecessors, (27), 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 40 [2024-11-13 15:40:28,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:40:28,865 INFO L225 Difference]: With dead ends: 122 [2024-11-13 15:40:28,865 INFO L226 Difference]: Without dead ends: 122 [2024-11-13 15:40:28,866 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2024-11-13 15:40:28,866 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 103 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 15:40:28,866 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 373 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 15:40:28,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-13 15:40:28,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 101. [2024-11-13 15:40:28,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 67 states have (on average 1.626865671641791) internal successors, (109), 97 states have internal predecessors, (109), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-13 15:40:28,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 114 transitions. [2024-11-13 15:40:28,871 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 114 transitions. Word has length 40 [2024-11-13 15:40:28,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:40:28,872 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 114 transitions. [2024-11-13 15:40:28,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 2.25) internal successors, (27), 11 states have internal predecessors, (27), 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) [2024-11-13 15:40:28,872 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 114 transitions. [2024-11-13 15:40:28,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-13 15:40:28,873 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:40:28,873 INFO L215 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:40:28,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-13 15:40:28,873 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [calloc_modelErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, calloc_modelErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-13 15:40:28,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:40:28,873 INFO L85 PathProgramCache]: Analyzing trace with hash -1468561247, now seen corresponding path program 1 times [2024-11-13 15:40:28,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:40:28,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955017869] [2024-11-13 15:40:28,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:40:28,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:40:28,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:29,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-13 15:40:29,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:29,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-13 15:40:29,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:30,069 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-13 15:40:30,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:40:30,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955017869] [2024-11-13 15:40:30,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955017869] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:40:30,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1343677234] [2024-11-13 15:40:30,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:40:30,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:40:30,070 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:40:30,072 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:40:30,075 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-13 15:40:30,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:30,227 INFO L255 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 55 conjuncts are in the unsatisfiable core [2024-11-13 15:40:30,230 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:40:30,498 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-13 15:40:30,498 INFO L378 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 14 treesize of output 13 [2024-11-13 15:40:30,528 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-13 15:40:30,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-13 15:40:30,875 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-13 15:40:30,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-11-13 15:40:30,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-13 15:40:30,998 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-13 15:40:30,998 INFO L378 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 14 treesize of output 13 [2024-11-13 15:40:31,270 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-13 15:40:31,270 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:40:31,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1343677234] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:40:31,634 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 15:40:31,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 26 [2024-11-13 15:40:31,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505526196] [2024-11-13 15:40:31,635 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 15:40:31,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-13 15:40:31,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:40:31,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-13 15:40:31,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=782, Unknown=0, NotChecked=0, Total=930 [2024-11-13 15:40:31,636 INFO L87 Difference]: Start difference. First operand 101 states and 114 transitions. Second operand has 28 states, 24 states have (on average 2.75) internal successors, (66), 22 states have internal predecessors, (66), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-13 15:40:32,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:40:32,725 INFO L93 Difference]: Finished difference Result 120 states and 130 transitions. [2024-11-13 15:40:32,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-13 15:40:32,725 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 24 states have (on average 2.75) internal successors, (66), 22 states have internal predecessors, (66), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 40 [2024-11-13 15:40:32,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:40:32,726 INFO L225 Difference]: With dead ends: 120 [2024-11-13 15:40:32,726 INFO L226 Difference]: Without dead ends: 120 [2024-11-13 15:40:32,727 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 393 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=268, Invalid=1214, Unknown=0, NotChecked=0, Total=1482 [2024-11-13 15:40:32,728 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 108 mSDsluCounter, 641 mSDsCounter, 0 mSdLazyCounter, 889 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 697 SdHoareTripleChecker+Invalid, 905 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 889 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-13 15:40:32,728 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 697 Invalid, 905 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 889 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-13 15:40:32,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-13 15:40:32,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 99. [2024-11-13 15:40:32,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 67 states have (on average 1.5671641791044777) internal successors, (105), 95 states have internal predecessors, (105), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-13 15:40:32,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 110 transitions. [2024-11-13 15:40:32,734 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 110 transitions. Word has length 40 [2024-11-13 15:40:32,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:40:32,734 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 110 transitions. [2024-11-13 15:40:32,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 24 states have (on average 2.75) internal successors, (66), 22 states have internal predecessors, (66), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-13 15:40:32,734 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 110 transitions. [2024-11-13 15:40:32,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-13 15:40:32,735 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:40:32,735 INFO L215 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:40:32,756 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-13 15:40:32,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:40:32,940 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [calloc_modelErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, calloc_modelErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-13 15:40:32,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:40:32,941 INFO L85 PathProgramCache]: Analyzing trace with hash -826588042, now seen corresponding path program 1 times [2024-11-13 15:40:32,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:40:32,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981622713] [2024-11-13 15:40:32,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:40:32,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:40:32,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:33,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-13 15:40:33,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:33,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-13 15:40:33,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:33,291 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-13 15:40:33,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:40:33,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981622713] [2024-11-13 15:40:33,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981622713] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:40:33,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:40:33,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 15:40:33,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326042820] [2024-11-13 15:40:33,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:40:33,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 15:40:33,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:40:33,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 15:40:33,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-13 15:40:33,294 INFO L87 Difference]: Start difference. First operand 99 states and 110 transitions. Second operand has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 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) [2024-11-13 15:40:33,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:40:33,658 INFO L93 Difference]: Finished difference Result 154 states and 170 transitions. [2024-11-13 15:40:33,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 15:40:33,659 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 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 47 [2024-11-13 15:40:33,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:40:33,660 INFO L225 Difference]: With dead ends: 154 [2024-11-13 15:40:33,660 INFO L226 Difference]: Without dead ends: 154 [2024-11-13 15:40:33,660 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-11-13 15:40:33,661 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 51 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 15:40:33,661 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 321 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 15:40:33,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-11-13 15:40:33,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 99. [2024-11-13 15:40:33,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 67 states have (on average 1.5522388059701493) internal successors, (104), 95 states have internal predecessors, (104), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-13 15:40:33,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 109 transitions. [2024-11-13 15:40:33,667 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 109 transitions. Word has length 47 [2024-11-13 15:40:33,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:40:33,668 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 109 transitions. [2024-11-13 15:40:33,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 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) [2024-11-13 15:40:33,668 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 109 transitions. [2024-11-13 15:40:33,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-13 15:40:33,669 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:40:33,669 INFO L215 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:40:33,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-13 15:40:33,669 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [calloc_modelErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, calloc_modelErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-13 15:40:33,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:40:33,670 INFO L85 PathProgramCache]: Analyzing trace with hash -826588041, now seen corresponding path program 1 times [2024-11-13 15:40:33,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:40:33,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959198699] [2024-11-13 15:40:33,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:40:33,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:40:33,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:34,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-13 15:40:34,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:34,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-13 15:40:34,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:34,253 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-13 15:40:34,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:40:34,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959198699] [2024-11-13 15:40:34,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959198699] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:40:34,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1605639741] [2024-11-13 15:40:34,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:40:34,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:40:34,254 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:40:34,256 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:40:34,258 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-13 15:40:34,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:34,442 INFO L255 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-13 15:40:34,449 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:40:35,313 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-13 15:40:35,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-13 15:40:35,435 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 15:40:35,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2024-11-13 15:40:35,441 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 15:40:35,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2024-11-13 15:40:35,478 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-13 15:40:35,479 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:40:35,567 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 56 [2024-11-13 15:40:35,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 82 [2024-11-13 15:40:35,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:40:35,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:40:35,802 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:40:35,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 29 [2024-11-13 15:40:36,380 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-13 15:40:36,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1605639741] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 15:40:36,380 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 15:40:36,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 12] total 32 [2024-11-13 15:40:36,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975629898] [2024-11-13 15:40:36,381 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 15:40:36,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-13 15:40:36,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:40:36,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-13 15:40:36,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=918, Unknown=0, NotChecked=0, Total=1056 [2024-11-13 15:40:36,382 INFO L87 Difference]: Start difference. First operand 99 states and 109 transitions. Second operand has 33 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-13 15:40:37,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:40:37,819 INFO L93 Difference]: Finished difference Result 141 states and 154 transitions. [2024-11-13 15:40:37,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-13 15:40:37,820 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 47 [2024-11-13 15:40:37,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:40:37,821 INFO L225 Difference]: With dead ends: 141 [2024-11-13 15:40:37,821 INFO L226 Difference]: Without dead ends: 141 [2024-11-13 15:40:37,822 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 408 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=295, Invalid=1867, Unknown=0, NotChecked=0, Total=2162 [2024-11-13 15:40:37,822 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 256 mSDsluCounter, 790 mSDsCounter, 0 mSdLazyCounter, 833 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 849 SdHoareTripleChecker+Invalid, 836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 833 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-13 15:40:37,822 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 849 Invalid, 836 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 833 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-13 15:40:37,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-11-13 15:40:37,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 99. [2024-11-13 15:40:37,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 67 states have (on average 1.537313432835821) internal successors, (103), 95 states have internal predecessors, (103), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-13 15:40:37,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 108 transitions. [2024-11-13 15:40:37,827 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 108 transitions. Word has length 47 [2024-11-13 15:40:37,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:40:37,830 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 108 transitions. [2024-11-13 15:40:37,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 29 states have internal predecessors, (114), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-13 15:40:37,831 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 108 transitions. [2024-11-13 15:40:37,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-13 15:40:37,831 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:40:37,832 INFO L215 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:40:37,854 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-13 15:40:38,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:40:38,032 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [calloc_modelErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, calloc_modelErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-13 15:40:38,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:40:38,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1836779723, now seen corresponding path program 1 times [2024-11-13 15:40:38,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:40:38,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186379251] [2024-11-13 15:40:38,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:40:38,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:40:38,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:38,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-13 15:40:38,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:38,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-13 15:40:38,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:38,196 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-13 15:40:38,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:40:38,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186379251] [2024-11-13 15:40:38,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186379251] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:40:38,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:40:38,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 15:40:38,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041252489] [2024-11-13 15:40:38,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:40:38,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 15:40:38,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:40:38,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 15:40:38,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 15:40:38,198 INFO L87 Difference]: Start difference. First operand 99 states and 108 transitions. Second operand has 6 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 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) [2024-11-13 15:40:38,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:40:38,385 INFO L93 Difference]: Finished difference Result 111 states and 120 transitions. [2024-11-13 15:40:38,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 15:40:38,386 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 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 50 [2024-11-13 15:40:38,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:40:38,387 INFO L225 Difference]: With dead ends: 111 [2024-11-13 15:40:38,387 INFO L226 Difference]: Without dead ends: 111 [2024-11-13 15:40:38,387 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-13 15:40:38,388 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 18 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 15:40:38,388 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 272 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 15:40:38,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-13 15:40:38,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 98. [2024-11-13 15:40:38,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 67 states have (on average 1.5223880597014925) internal successors, (102), 94 states have internal predecessors, (102), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-13 15:40:38,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 107 transitions. [2024-11-13 15:40:38,392 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 107 transitions. Word has length 50 [2024-11-13 15:40:38,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:40:38,392 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 107 transitions. [2024-11-13 15:40:38,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 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) [2024-11-13 15:40:38,393 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 107 transitions. [2024-11-13 15:40:38,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-13 15:40:38,394 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:40:38,395 INFO L215 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:40:38,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-13 15:40:38,395 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [calloc_modelErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, calloc_modelErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-13 15:40:38,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:40:38,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1836779722, now seen corresponding path program 1 times [2024-11-13 15:40:38,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:40:38,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428826202] [2024-11-13 15:40:38,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:40:38,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:40:38,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:39,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-13 15:40:39,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:39,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-13 15:40:39,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:39,223 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-13 15:40:39,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:40:39,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428826202] [2024-11-13 15:40:39,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428826202] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:40:39,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1815614672] [2024-11-13 15:40:39,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:40:39,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:40:39,224 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:40:39,226 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:40:39,228 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-13 15:40:39,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:39,437 INFO L255 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-13 15:40:39,442 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:40:40,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-13 15:40:40,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-13 15:40:40,406 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 15:40:40,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2024-11-13 15:40:40,412 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 15:40:40,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2024-11-13 15:40:40,419 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-13 15:40:40,419 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 15:40:40,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1815614672] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:40:40,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 15:40:40,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [15] total 23 [2024-11-13 15:40:40,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890060874] [2024-11-13 15:40:40,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:40:40,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-13 15:40:40,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:40:40,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-13 15:40:40,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=477, Unknown=0, NotChecked=0, Total=552 [2024-11-13 15:40:40,421 INFO L87 Difference]: Start difference. First operand 98 states and 107 transitions. Second operand has 11 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 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) [2024-11-13 15:40:41,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:40:41,095 INFO L93 Difference]: Finished difference Result 138 states and 151 transitions. [2024-11-13 15:40:41,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-13 15:40:41,096 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 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 50 [2024-11-13 15:40:41,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:40:41,097 INFO L225 Difference]: With dead ends: 138 [2024-11-13 15:40:41,097 INFO L226 Difference]: Without dead ends: 138 [2024-11-13 15:40:41,098 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=93, Invalid=609, Unknown=0, NotChecked=0, Total=702 [2024-11-13 15:40:41,100 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 98 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-13 15:40:41,101 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 403 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-13 15:40:41,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-11-13 15:40:41,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 99. [2024-11-13 15:40:41,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 68 states have (on average 1.5147058823529411) internal successors, (103), 95 states have internal predecessors, (103), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-13 15:40:41,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 108 transitions. [2024-11-13 15:40:41,110 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 108 transitions. Word has length 50 [2024-11-13 15:40:41,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:40:41,110 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 108 transitions. [2024-11-13 15:40:41,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 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) [2024-11-13 15:40:41,110 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 108 transitions. [2024-11-13 15:40:41,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-13 15:40:41,111 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:40:41,111 INFO L215 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:40:41,134 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-13 15:40:41,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:40:41,312 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [calloc_modelErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, calloc_modelErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-13 15:40:41,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:40:41,312 INFO L85 PathProgramCache]: Analyzing trace with hash 86247385, now seen corresponding path program 1 times [2024-11-13 15:40:41,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:40:41,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035109577] [2024-11-13 15:40:41,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:40:41,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:40:41,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:41,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-13 15:40:41,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:41,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-13 15:40:41,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:42,538 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 15:40:42,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:40:42,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035109577] [2024-11-13 15:40:42,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035109577] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:40:42,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [552233057] [2024-11-13 15:40:42,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:40:42,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:40:42,540 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:40:42,541 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:40:42,546 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-13 15:40:42,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:40:42,760 INFO L255 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 60 conjuncts are in the unsatisfiable core [2024-11-13 15:40:42,764 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:40:43,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-13 15:40:43,528 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-13 15:40:43,528 INFO L378 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 [2024-11-13 15:40:43,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-13 15:40:43,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-13 15:40:44,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-13 15:40:44,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-13 15:40:44,439 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 15:40:44,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2024-11-13 15:40:44,454 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 15:40:44,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-13 15:40:44,526 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 15:40:44,528 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:40:44,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 12 [2024-11-13 15:40:44,626 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-13 15:40:44,626 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:40:44,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 64 [2024-11-13 15:40:44,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 133 treesize of output 121 [2024-11-13 15:41:03,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 206 treesize of output 194 [2024-11-13 15:41:04,070 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:41:04,071 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 297 treesize of output 287 [2024-11-13 15:41:04,707 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 206 treesize of output 194 [2024-11-13 15:41:04,846 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:41:04,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 297 treesize of output 287 [2024-11-13 15:41:05,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 206 treesize of output 194 [2024-11-13 15:41:05,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 206 treesize of output 194 [2024-11-13 15:41:05,802 INFO L349 Elim1Store]: treesize reduction 38, result has 61.6 percent of original size [2024-11-13 15:41:05,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 319 treesize of output 353 [2024-11-13 15:41:05,852 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:41:05,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 67 treesize of output 83 [2024-11-13 15:41:05,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2024-11-13 15:41:06,004 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:41:06,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 54 [2024-11-13 15:41:06,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-13 15:41:06,266 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-13 15:41:06,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 195 treesize of output 195 [2024-11-13 15:41:12,215 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:41:12,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 297 treesize of output 287 [2024-11-13 15:41:12,633 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:41:12,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 297 treesize of output 287 [2024-11-13 15:41:13,736 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:41:13,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2024-11-13 15:41:13,750 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:41:13,750 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2024-11-13 15:41:13,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2024-11-13 15:41:13,805 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:41:13,805 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 67 [2024-11-13 15:41:57,473 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-13 15:41:57,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [552233057] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 15:41:57,473 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 15:41:57,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19, 22] total 54 [2024-11-13 15:41:57,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313698838] [2024-11-13 15:41:57,473 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 15:41:57,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2024-11-13 15:41:57,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:41:57,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2024-11-13 15:41:57,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=2627, Unknown=10, NotChecked=0, Total=2862 [2024-11-13 15:41:57,476 INFO L87 Difference]: Start difference. First operand 99 states and 108 transitions. Second operand has 54 states, 50 states have (on average 2.72) internal successors, (136), 48 states have internal predecessors, (136), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-13 15:42:04,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:42:04,630 INFO L93 Difference]: Finished difference Result 148 states and 166 transitions. [2024-11-13 15:42:04,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-11-13 15:42:04,631 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 50 states have (on average 2.72) internal successors, (136), 48 states have internal predecessors, (136), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 52 [2024-11-13 15:42:04,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:42:04,632 INFO L225 Difference]: With dead ends: 148 [2024-11-13 15:42:04,632 INFO L226 Difference]: Without dead ends: 139 [2024-11-13 15:42:04,634 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1907 ImplicationChecksByTransitivity, 58.1s TimeCoverageRelationStatistics Valid=823, Invalid=8097, Unknown=10, NotChecked=0, Total=8930 [2024-11-13 15:42:04,635 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 272 mSDsluCounter, 962 mSDsCounter, 0 mSdLazyCounter, 2222 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 1005 SdHoareTripleChecker+Invalid, 2257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 2222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-11-13 15:42:04,635 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 1005 Invalid, 2257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 2222 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-11-13 15:42:04,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-11-13 15:42:04,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 98. [2024-11-13 15:42:04,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 71 states have (on average 1.4647887323943662) internal successors, (104), 94 states have internal predecessors, (104), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-13 15:42:04,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 109 transitions. [2024-11-13 15:42:04,640 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 109 transitions. Word has length 52 [2024-11-13 15:42:04,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:42:04,640 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 109 transitions. [2024-11-13 15:42:04,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 50 states have (on average 2.72) internal successors, (136), 48 states have internal predecessors, (136), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-13 15:42:04,640 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 109 transitions. [2024-11-13 15:42:04,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-13 15:42:04,641 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:42:04,641 INFO L215 NwaCegarLoop]: trace histogram [5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:42:04,661 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-13 15:42:04,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-13 15:42:04,845 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [calloc_modelErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, calloc_modelErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-13 15:42:04,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:42:04,846 INFO L85 PathProgramCache]: Analyzing trace with hash 647621680, now seen corresponding path program 1 times [2024-11-13 15:42:04,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:42:04,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408365303] [2024-11-13 15:42:04,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:42:04,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:42:04,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:42:05,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-13 15:42:05,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:42:05,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-13 15:42:05,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:42:06,254 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 11 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 15:42:06,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:42:06,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408365303] [2024-11-13 15:42:06,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408365303] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:42:06,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1079806819] [2024-11-13 15:42:06,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:42:06,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:42:06,255 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:42:06,257 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:42:06,260 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-13 15:42:06,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:42:06,487 INFO L255 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 83 conjuncts are in the unsatisfiable core [2024-11-13 15:42:06,492 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:42:07,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-13 15:42:07,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-13 15:42:08,178 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2024-11-13 15:42:08,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 26 [2024-11-13 15:42:08,264 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 15:42:08,265 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 15:42:08,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2024-11-13 15:42:08,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-13 15:42:08,732 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 15:42:08,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 36 [2024-11-13 15:42:08,740 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 15:42:08,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-13 15:42:08,844 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 15:42:08,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2024-11-13 15:42:08,850 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 15:42:08,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 14 [2024-11-13 15:42:08,948 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-13 15:42:08,949 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:42:09,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 209 treesize of output 193 [2024-11-13 15:42:11,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 264 treesize of output 254 [2024-11-13 15:42:11,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1234 treesize of output 1154 [2024-11-13 15:42:11,311 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:42:11,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 42 [2024-11-13 15:42:11,319 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:42:11,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2024-11-13 15:42:11,329 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:42:11,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 38 [2024-11-13 15:42:11,347 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:42:11,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 36 [2024-11-13 15:42:11,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42 [2024-11-13 15:42:11,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-13 15:42:11,428 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:42:11,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 80 [2024-11-13 15:42:11,558 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:42:11,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 73 [2024-11-13 15:42:11,687 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:42:11,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2024-11-13 15:42:11,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:42:11,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2024-11-13 15:42:11,700 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 15:42:11,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:42:11,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2024-11-13 15:42:11,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 264 treesize of output 254 [2024-11-13 15:42:11,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1234 treesize of output 1154 [2024-11-13 15:42:12,035 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2024-11-13 15:42:13,554 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-13 15:42:13,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1079806819] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 15:42:13,554 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 15:42:13,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 20, 22] total 58 [2024-11-13 15:42:13,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624518154] [2024-11-13 15:42:13,554 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 15:42:13,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2024-11-13 15:42:13,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:42:13,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2024-11-13 15:42:13,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=256, Invalid=3050, Unknown=0, NotChecked=0, Total=3306 [2024-11-13 15:42:13,557 INFO L87 Difference]: Start difference. First operand 98 states and 109 transitions. Second operand has 58 states, 54 states have (on average 2.574074074074074) internal successors, (139), 52 states have internal predecessors, (139), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-13 15:42:22,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:42:22,298 INFO L93 Difference]: Finished difference Result 291 states and 321 transitions. [2024-11-13 15:42:22,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2024-11-13 15:42:22,299 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 54 states have (on average 2.574074074074074) internal successors, (139), 52 states have internal predecessors, (139), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 53 [2024-11-13 15:42:22,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:42:22,300 INFO L225 Difference]: With dead ends: 291 [2024-11-13 15:42:22,300 INFO L226 Difference]: Without dead ends: 273 [2024-11-13 15:42:22,304 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5205 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=1316, Invalid=16774, Unknown=0, NotChecked=0, Total=18090 [2024-11-13 15:42:22,305 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 674 mSDsluCounter, 849 mSDsCounter, 0 mSdLazyCounter, 2012 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 674 SdHoareTripleChecker+Valid, 889 SdHoareTripleChecker+Invalid, 2069 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 2012 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-13 15:42:22,305 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [674 Valid, 889 Invalid, 2069 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 2012 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-13 15:42:22,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2024-11-13 15:42:22,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 149. [2024-11-13 15:42:22,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 118 states have (on average 1.3559322033898304) internal successors, (160), 142 states have internal predecessors, (160), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-13 15:42:22,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 170 transitions. [2024-11-13 15:42:22,314 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 170 transitions. Word has length 53 [2024-11-13 15:42:22,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:42:22,314 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 170 transitions. [2024-11-13 15:42:22,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 54 states have (on average 2.574074074074074) internal successors, (139), 52 states have internal predecessors, (139), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-13 15:42:22,315 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 170 transitions. [2024-11-13 15:42:22,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-13 15:42:22,315 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:42:22,315 INFO L215 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:42:22,336 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-13 15:42:22,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-13 15:42:22,519 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE === [calloc_modelErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, calloc_modelErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-13 15:42:22,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:42:22,520 INFO L85 PathProgramCache]: Analyzing trace with hash 46467199, now seen corresponding path program 1 times [2024-11-13 15:42:22,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:42:22,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906187391] [2024-11-13 15:42:22,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:42:22,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:42:22,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:42:23,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-13 15:42:23,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:42:23,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-13 15:42:23,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:42:23,998 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 12 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 15:42:23,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:42:23,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906187391] [2024-11-13 15:42:23,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906187391] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:42:23,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1423007710] [2024-11-13 15:42:23,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:42:23,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:42:23,999 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:42:24,000 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:42:24,003 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-13 15:42:24,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:42:24,241 INFO L255 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 107 conjuncts are in the unsatisfiable core [2024-11-13 15:42:24,246 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:42:24,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-13 15:42:25,037 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 15:42:25,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-13 15:42:25,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-13 15:42:25,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-13 15:42:25,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2024-11-13 15:42:25,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-13 15:42:26,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 21 [2024-11-13 15:42:26,105 INFO L378 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 38 treesize of output 29 [2024-11-13 15:42:26,183 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 15:42:26,185 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 15:42:26,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2024-11-13 15:42:26,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-13 15:42:26,774 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 15:42:26,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 40 [2024-11-13 15:42:26,785 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 15:42:26,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-13 15:42:26,892 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 15:42:26,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2024-11-13 15:42:27,215 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 15:42:27,221 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-13 15:42:27,221 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 19 [2024-11-13 15:42:27,270 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-13 15:42:27,270 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:42:27,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 202 treesize of output 186 [2024-11-13 15:43:40,957 INFO L349 Elim1Store]: treesize reduction 27, result has 59.1 percent of original size [2024-11-13 15:43:40,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 815 treesize of output 825 [2024-11-13 15:43:41,014 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:43:41,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 96 treesize of output 118 [2024-11-13 15:43:41,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 110 [2024-11-13 15:43:41,184 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:43:41,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 120 treesize of output 124 [2024-11-13 15:43:41,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-13 15:43:41,332 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:43:41,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 572 treesize of output 586 [2024-11-13 15:44:24,322 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:44:24,322 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 66 [2024-11-13 15:44:24,341 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:44:24,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 70 [2024-11-13 15:44:24,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 110 [2024-11-13 15:44:24,409 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:44:24,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 235 treesize of output 239 [2024-11-13 15:44:24,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 750 treesize of output 730 [2024-11-13 15:44:25,632 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 750 treesize of output 730 [2024-11-13 15:44:30,913 WARN L873 $PredicateComparison]: unable to prove that (or (< |c_ULTIMATE.start_l1_insert_~list#1.offset| 0) (let ((.cse10 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|))) (.cse9 (select (select |c_#memory_$Pointer$#2.base| |c_~#list~0.base|) |c_~#list~0.offset|))) (let ((.cse37 (= |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse9)) (.cse12 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l1_insert_~item~1#1.base|)) (.cse93 (= |c_ULTIMATE.start_l2_insert_~list#1.base| .cse9)) (.cse11 (select .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base|))) (let ((.cse406 (forall ((v_ArrVal_1434 Int)) (let ((.cse787 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434)))) (let ((.cse788 (select (select .cse787 .cse9) |c_ULTIMATE.start_l2_insert_~list#1.offset|))) (or (= (select (select .cse787 |c_ULTIMATE.start_l2_insert_~item~0#1.base|) .cse788) 0) (< .cse788 0)))))) (.cse13 (< |c_ULTIMATE.start_l2_insert_~list#1.offset| 4)) (.cse3 (not .cse93)) (.cse15 (= |c_ULTIMATE.start_l1_insert_~item~1#1.offset| |c_ULTIMATE.start_l2_insert_~list#1.offset|)) (.cse413 (forall ((v_arrayElimCell_109 Int) (|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_arrayElimCell_110 Int) (v_ArrVal_1434 Int) (v_arrayElimCell_114 Int) (v_ArrVal_1436 Int)) (let ((.cse786 (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse783 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse786)) (.cse785 (+ v_arrayElimCell_109 4))) (let ((.cse782 (+ v_ArrVal_1436 4)) (.cse784 (select (select .cse783 .cse9) .cse785))) (or (= .cse782 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (< v_arrayElimCell_109 0) (< v_ArrVal_1436 0) (= (select (select .cse783 v_arrayElimCell_110) .cse784) 0) (< .cse784 0) (= |c_ULTIMATE.start_l2_insert_~list#1.offset| .cse785) (< (select .cse12 .cse782) 0) (= (select (select .cse783 v_arrayElimCell_114) (select .cse786 .cse782)) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436) (= (select (select .cse783 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) .cse784) 0) (= v_ArrVal_1436 v_arrayElimCell_109))))))) (.cse0 (not .cse37)) (.cse53 (forall ((|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_ArrVal_1434 Int)) (or (= (select (select (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434)) |ULTIMATE.start_l1_insert_#t~mem13#1.base|) v_ArrVal_1434) 0) (< v_ArrVal_1434 0)))) (.cse21 (= |c_ULTIMATE.start_l2_insert_~list#1.base| |c_ULTIMATE.start_l1_insert_~item~1#1.base|)) (.cse2 (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| 4))) (let ((.cse112 (forall ((v_arrayElimCell_109 Int) (|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_prenex_5 Int) (v_arrayElimCell_110 Int) (v_ArrVal_1434 Int) (v_ArrVal_1436 Int)) (let ((.cse779 (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse778 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse779)) (.cse781 (+ v_arrayElimCell_109 4))) (let ((.cse777 (+ v_ArrVal_1436 4)) (.cse780 (select (select .cse778 .cse9) .cse781))) (or (= .cse777 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (= (select (select .cse778 v_prenex_5) (select .cse779 .cse777)) 0) (< v_arrayElimCell_109 0) (< v_ArrVal_1436 0) (= (select (select .cse778 v_arrayElimCell_110) .cse780) 0) (< .cse780 0) (= |c_ULTIMATE.start_l2_insert_~list#1.offset| .cse781) (< (select .cse12 .cse777) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436) (= (select (select .cse778 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) .cse780) 0) (= v_ArrVal_1436 v_arrayElimCell_109))))))) (.cse174 (or (forall ((|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_ArrVal_1434 Int)) (let ((.cse775 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434)))) (let ((.cse776 (select (select .cse775 .cse9) |c_ULTIMATE.start_l2_insert_~list#1.offset|))) (or (= (select (select .cse775 |c_ULTIMATE.start_l2_insert_~item~0#1.base|) .cse776) 0) (= (select (select .cse775 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) v_ArrVal_1434) 0) (< .cse776 0) (< v_ArrVal_1434 0))))) .cse2)) (.cse27 (forall ((v_ArrVal_1434 Int) (v_ArrVal_1436 Int) (v_arrayElimCell_118 Int)) (let ((.cse774 (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse771 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse774))) (let ((.cse772 (select (select .cse771 .cse9) |c_ULTIMATE.start_l2_insert_~list#1.offset|)) (.cse773 (+ v_ArrVal_1436 4))) (or (= (select (select .cse771 |c_ULTIMATE.start_l2_insert_~item~0#1.base|) .cse772) 0) (= .cse773 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (= (select (select .cse771 v_arrayElimCell_118) (select .cse774 .cse773)) 0) (< v_ArrVal_1436 0) (< .cse772 0) (= .cse773 |c_ULTIMATE.start_l2_insert_~list#1.offset|) (< (select .cse12 .cse773) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436))))))) (.cse14 (forall ((v_prenex_5 Int) (v_ArrVal_1434 Int) (v_ArrVal_1436 Int)) (let ((.cse770 (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse767 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse770))) (let ((.cse768 (select (select .cse767 .cse9) |c_ULTIMATE.start_l2_insert_~list#1.offset|)) (.cse769 (+ v_ArrVal_1436 4))) (or (= (select (select .cse767 |c_ULTIMATE.start_l2_insert_~item~0#1.base|) .cse768) 0) (= .cse769 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (= (select (select .cse767 v_prenex_5) (select .cse770 .cse769)) 0) (< v_ArrVal_1436 0) (< .cse768 0) (= .cse769 |c_ULTIMATE.start_l2_insert_~list#1.offset|) (< (select .cse12 .cse769) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436))))))) (.cse60 (= |c_~#list~0.offset| |c_ULTIMATE.start_l1_insert_~list#1.offset|)) (.cse144 (or (forall ((v_arrayElimCell_109 Int) (v_arrayElimCell_110 Int) (v_arrayElimCell_115 Int) (v_ArrVal_1434 Int) (v_ArrVal_1436 Int)) (let ((.cse766 (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse764 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse766)) (.cse763 (+ v_arrayElimCell_109 4))) (let ((.cse765 (select (select .cse764 .cse9) .cse763)) (.cse762 (+ v_ArrVal_1436 4))) (or (= .cse762 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (= |c_ULTIMATE.start_l1_insert_~item~1#1.offset| .cse763) (< v_arrayElimCell_109 0) (< v_ArrVal_1436 0) (= (select (select .cse764 v_arrayElimCell_110) .cse765) 0) (= .cse762 |c_ULTIMATE.start_l2_insert_~list#1.offset|) (< .cse765 0) (= |c_ULTIMATE.start_l2_insert_~list#1.offset| .cse763) (< (select .cse12 .cse762) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436) (= (select (select .cse764 v_arrayElimCell_115) (select .cse766 .cse762)) 0) (= v_ArrVal_1436 v_arrayElimCell_109)))))) .cse37)) (.cse186 (or .cse21 (and (or (forall ((v_arrayElimCell_109 Int) (|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_arrayElimCell_110 Int) (v_ArrVal_1434 Int) (v_arrayElimCell_114 Int) (v_ArrVal_1436 Int)) (let ((.cse757 (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse755 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse757))) (let ((.cse754 (+ v_ArrVal_1436 4)) (.cse756 (select (select .cse755 .cse9) (+ v_arrayElimCell_109 4)))) (or (= .cse754 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (< v_arrayElimCell_109 0) (< v_ArrVal_1436 0) (= (select (select .cse755 v_arrayElimCell_110) .cse756) 0) (= .cse754 |c_ULTIMATE.start_l2_insert_~list#1.offset|) (< .cse756 0) (< (select .cse12 .cse754) 0) (= (select (select .cse755 v_arrayElimCell_114) (select .cse757 .cse754)) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436) (= (select (select .cse755 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) .cse756) 0) (= v_ArrVal_1436 v_arrayElimCell_109)))))) .cse37) (forall ((v_ArrVal_1436 Int)) (let ((.cse760 (+ v_ArrVal_1436 4))) (or (forall ((v_arrayElimCell_109 Int) (|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_arrayElimCell_110 Int) (v_ArrVal_1434 Int) (v_arrayElimCell_118 Int)) (let ((.cse759 (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse758 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse759))) (let ((.cse761 (select (select .cse758 .cse9) (+ v_arrayElimCell_109 4)))) (or (= (select (select .cse758 v_arrayElimCell_118) (select .cse759 .cse760)) 0) (< v_arrayElimCell_109 0) (= (select (select .cse758 v_arrayElimCell_110) .cse761) 0) (< .cse761 0) (= (select (select .cse758 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) .cse761) 0) (= v_ArrVal_1436 v_arrayElimCell_109)))))) (= .cse760 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (< v_ArrVal_1436 0) (= .cse760 |c_ULTIMATE.start_l2_insert_~list#1.offset|) (< (select .cse12 .cse760) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436))))))) (.cse168 (or .cse21 (forall ((v_arrayElimCell_109 Int) (|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_arrayElimCell_110 Int) (v_ArrVal_1434 Int) (v_arrayElimCell_114 Int) (v_ArrVal_1436 Int)) (let ((.cse753 (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse751 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse753))) (let ((.cse750 (+ v_ArrVal_1436 4)) (.cse752 (select (select .cse751 .cse9) (+ v_arrayElimCell_109 4)))) (or (= .cse750 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (< v_arrayElimCell_109 0) (< v_ArrVal_1436 0) (= (select (select .cse751 v_arrayElimCell_110) .cse752) 0) (= .cse750 |c_ULTIMATE.start_l2_insert_~list#1.offset|) (< .cse752 0) (< (select .cse12 .cse750) 0) (= (select (select .cse751 v_arrayElimCell_114) (select .cse753 .cse750)) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436) (= (select (select .cse751 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) .cse752) 0)))))) .cse37)) (.cse424 (or (and (forall ((v_ArrVal_1436 Int)) (let ((.cse723 (+ v_ArrVal_1436 4))) (or (= .cse723 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (< v_ArrVal_1436 0) (< (select .cse12 .cse723) 0) (forall ((v_arrayElimCell_109 Int) (|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_arrayElimCell_110 Int) (v_ArrVal_1434 Int)) (let ((.cse726 (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse727 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse726))) (let ((.cse724 (select .cse727 v_arrayElimCell_110)) (.cse725 (select (select .cse727 .cse9) (+ v_arrayElimCell_109 4)))) (or (< v_arrayElimCell_109 0) (= (select .cse724 .cse725) 0) (< .cse725 0) (= (select .cse724 (select .cse726 .cse723)) 0) (= (select (select .cse727 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) .cse725) 0)))))) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436)))) (forall ((v_ArrVal_1436 Int)) (or (forall ((v_ArrVal_1434 Int)) (let ((.cse733 (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse731 (select .cse733 (+ v_ArrVal_1436 4)))) (or (forall ((v_arrayElimCell_110 Int)) (let ((.cse732 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse733))) (let ((.cse728 (select .cse732 v_arrayElimCell_110))) (or (forall ((v_arrayElimCell_109 Int)) (let ((.cse729 (select (select .cse732 .cse9) (+ v_arrayElimCell_109 4)))) (or (< v_arrayElimCell_109 0) (= (select .cse728 .cse729) 0) (< .cse729 0) (forall ((|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int)) (let ((.cse730 (select .cse732 |ULTIMATE.start_l1_insert_#t~mem13#1.base|))) (or (= (select .cse730 .cse731) 0) (= (select .cse730 .cse729) 0))))))) (= (select .cse728 .cse731) 0))))) (< .cse731 0))))) (< v_ArrVal_1436 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436))) (or (and (forall ((v_ArrVal_1436 Int)) (or (forall ((v_arrayElimCell_110 Int) (v_ArrVal_1434 Int)) (let ((.cse738 (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse737 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse738))) (let ((.cse735 (select (select .cse737 .cse9) |c_ULTIMATE.start_l1_insert_~item~1#1.offset|)) (.cse736 (select .cse738 (+ v_ArrVal_1436 4)))) (or (forall ((|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int)) (let ((.cse734 (select .cse737 |ULTIMATE.start_l1_insert_#t~mem13#1.base|))) (or (= (select .cse734 .cse735) 0) (= (select .cse734 .cse736) 0)))) (< .cse735 0) (< .cse736 0) (= (select (select .cse737 v_arrayElimCell_110) .cse736) 0)))))) (< v_ArrVal_1436 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436))) (forall ((v_ArrVal_1436 Int)) (let ((.cse739 (+ v_ArrVal_1436 4))) (or (= .cse739 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (< v_ArrVal_1436 0) (< (select .cse12 .cse739) 0) (forall ((|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_arrayElimCell_110 Int) (v_ArrVal_1434 Int)) (let ((.cse742 (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse740 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse742))) (let ((.cse741 (select (select .cse740 .cse9) |c_ULTIMATE.start_l1_insert_~item~1#1.offset|))) (or (= (select (select .cse740 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) .cse741) 0) (< .cse741 0) (= (select (select .cse740 v_arrayElimCell_110) (select .cse742 .cse739)) 0)))))) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436))))) .cse0 .cse2) (or (and (or .cse0 .cse53) (forall ((v_ArrVal_1434 Int)) (or (forall ((|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int)) (let ((.cse745 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434)))) (let ((.cse743 (select .cse745 |ULTIMATE.start_l1_insert_#t~mem13#1.base|))) (or (= (select .cse743 v_ArrVal_1434) 0) (forall ((v_arrayElimCell_109 Int)) (let ((.cse744 (select (select .cse745 .cse9) (+ v_arrayElimCell_109 4)))) (or (< v_arrayElimCell_109 0) (< .cse744 0) (forall ((v_arrayElimCell_110 Int)) (= (select (select .cse745 v_arrayElimCell_110) .cse744) 0)) (= (select .cse743 .cse744) 0)))))))) (< v_ArrVal_1434 0)))) .cse2) (or (forall ((v_arrayElimCell_109 Int) (|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_arrayElimCell_110 Int) (v_ArrVal_1434 Int) (v_arrayElimCell_114 Int) (v_ArrVal_1436 Int)) (let ((.cse749 (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse747 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse749))) (let ((.cse746 (+ v_ArrVal_1436 4)) (.cse748 (select (select .cse747 .cse9) (+ v_arrayElimCell_109 4)))) (or (= .cse746 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (< v_arrayElimCell_109 0) (< v_ArrVal_1436 0) (= (select (select .cse747 v_arrayElimCell_110) .cse748) 0) (< .cse748 0) (< (select .cse12 .cse746) 0) (= (select (select .cse747 v_arrayElimCell_114) (select .cse749 .cse746)) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436) (= (select (select .cse747 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) .cse748) 0)))))) .cse37)) .cse21)) (.cse425 (or (and (forall ((v_ArrVal_1436 Int)) (or (forall ((v_arrayElimCell_109 Int)) (or (< v_arrayElimCell_109 0) (forall ((|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_arrayElimCell_110 Int) (v_ArrVal_1434 Int)) (let ((.cse705 (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse701 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse705))) (let ((.cse703 (select .cse705 (+ v_ArrVal_1436 4))) (.cse704 (select .cse701 |ULTIMATE.start_l1_insert_#t~mem13#1.base|)) (.cse702 (select (select .cse701 .cse9) (+ v_arrayElimCell_109 4)))) (or (= (select (select .cse701 v_arrayElimCell_110) .cse702) 0) (< .cse702 0) (= (select (select .cse701 |c_ULTIMATE.start_l2_insert_~item~0#1.base|) .cse703) 0) (< .cse703 0) (= (select .cse704 .cse703) 0) (= (select .cse704 .cse702) 0)))))))) (< v_ArrVal_1436 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436))) (forall ((v_ArrVal_1436 Int)) (let ((.cse706 (+ v_ArrVal_1436 4))) (or (= .cse706 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (< v_ArrVal_1436 0) (= .cse706 |c_ULTIMATE.start_l2_insert_~list#1.offset|) (forall ((v_arrayElimCell_109 Int) (|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_arrayElimCell_110 Int) (v_arrayElimCell_115 Int) (v_ArrVal_1434 Int)) (let ((.cse709 (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse707 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse709))) (let ((.cse708 (select (select .cse707 .cse9) (+ v_arrayElimCell_109 4)))) (or (< v_arrayElimCell_109 0) (= (select (select .cse707 v_arrayElimCell_110) .cse708) 0) (< .cse708 0) (= (select (select .cse707 v_arrayElimCell_115) (select .cse709 .cse706)) 0) (= (select (select .cse707 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) .cse708) 0)))))) (< (select .cse12 .cse706) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436)))) (or (forall ((v_arrayElimCell_109 Int) (|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_arrayElimCell_110 Int) (v_ArrVal_1434 Int)) (let ((.cse711 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434)))) (let ((.cse710 (select .cse711 |ULTIMATE.start_l1_insert_#t~mem13#1.base|)) (.cse712 (select (select .cse711 .cse9) (+ v_arrayElimCell_109 4)))) (or (< v_arrayElimCell_109 0) (= (select .cse710 v_ArrVal_1434) 0) (= (select (select .cse711 v_arrayElimCell_110) .cse712) 0) (< v_ArrVal_1434 0) (< .cse712 0) (= (select .cse710 .cse712) 0))))) .cse2) (forall ((v_ArrVal_1436 Int)) (let ((.cse713 (+ v_ArrVal_1436 4))) (or (< v_ArrVal_1436 0) (= .cse713 |c_ULTIMATE.start_l2_insert_~list#1.offset|) (forall ((v_arrayElimCell_109 Int) (|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_arrayElimCell_110 Int) (v_arrayElimCell_115 Int) (v_ArrVal_1434 Int)) (let ((.cse718 (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse714 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse718))) (let ((.cse716 (select .cse718 .cse713)) (.cse717 (select .cse714 |ULTIMATE.start_l1_insert_#t~mem13#1.base|)) (.cse715 (select (select .cse714 .cse9) (+ v_arrayElimCell_109 4)))) (or (< v_arrayElimCell_109 0) (= (select (select .cse714 v_arrayElimCell_110) .cse715) 0) (< .cse715 0) (= (select (select .cse714 v_arrayElimCell_115) .cse716) 0) (< .cse716 0) (= (select .cse717 .cse716) 0) (= (select .cse717 .cse715) 0)))))) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436)))) (forall ((v_ArrVal_1436 Int)) (let ((.cse719 (+ v_ArrVal_1436 4))) (or (= .cse719 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (< v_ArrVal_1436 0) (< (select .cse11 .cse719) 0) (forall ((v_arrayElimCell_109 Int) (|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_arrayElimCell_110 Int) (v_ArrVal_1434 Int)) (let ((.cse722 (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse720 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse722))) (let ((.cse721 (select (select .cse720 .cse9) (+ v_arrayElimCell_109 4)))) (or (< v_arrayElimCell_109 0) (= (select (select .cse720 v_arrayElimCell_110) .cse721) 0) (< .cse721 0) (= (select (select .cse720 |c_ULTIMATE.start_l2_insert_~item~0#1.base|) (select .cse722 .cse719)) 0) (= (select (select .cse720 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) .cse721) 0)))))) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436))))) .cse37)) (.cse169 (or (forall ((v_arrayElimCell_109 Int) (|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_arrayElimCell_110 Int) (v_arrayElimCell_115 Int) (v_ArrVal_1434 Int) (v_ArrVal_1436 Int)) (let ((.cse700 (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse698 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse700))) (let ((.cse697 (+ v_ArrVal_1436 4)) (.cse699 (select (select .cse698 .cse9) (+ v_arrayElimCell_109 4)))) (or (= .cse697 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (< v_arrayElimCell_109 0) (< v_ArrVal_1436 0) (= (select (select .cse698 v_arrayElimCell_110) .cse699) 0) (= .cse697 |c_ULTIMATE.start_l2_insert_~list#1.offset|) (< .cse699 0) (< (select .cse12 .cse697) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436) (= (select (select .cse698 v_arrayElimCell_115) (select .cse700 .cse697)) 0) (= (select (select .cse698 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) .cse699) 0)))))) .cse37)) (.cse94 (or (and (or .cse413 .cse37) (forall ((v_ArrVal_1436 Int)) (let ((.cse692 (+ v_ArrVal_1436 4))) (or (= .cse692 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (< v_ArrVal_1436 0) (forall ((v_arrayElimCell_109 Int) (|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_arrayElimCell_110 Int) (v_ArrVal_1434 Int) (v_arrayElimCell_119 Int)) (let ((.cse696 (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse693 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse696)) (.cse695 (+ v_arrayElimCell_109 4))) (let ((.cse694 (select (select .cse693 .cse9) .cse695))) (or (< v_arrayElimCell_109 0) (= (select (select .cse693 v_arrayElimCell_110) .cse694) 0) (< .cse694 0) (= |c_ULTIMATE.start_l2_insert_~list#1.offset| .cse695) (= (select (select .cse693 v_arrayElimCell_119) (select .cse696 .cse692)) 0) (= (select (select .cse693 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) .cse694) 0) (= v_ArrVal_1436 v_arrayElimCell_109)))))) (< (select .cse12 .cse692) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436))))) .cse21)) (.cse187 (or (forall ((v_arrayElimCell_109 Int) (|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_arrayElimCell_110 Int) (v_arrayElimCell_115 Int) (v_ArrVal_1434 Int) (v_ArrVal_1436 Int)) (let ((.cse691 (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse689 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse691))) (let ((.cse688 (+ v_ArrVal_1436 4)) (.cse690 (select (select .cse689 .cse9) (+ v_arrayElimCell_109 4)))) (or (= .cse688 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (< v_arrayElimCell_109 0) (< v_ArrVal_1436 0) (= (select (select .cse689 v_arrayElimCell_110) .cse690) 0) (= .cse688 |c_ULTIMATE.start_l2_insert_~list#1.offset|) (< .cse690 0) (< (select .cse12 .cse688) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436) (= (select (select .cse689 v_arrayElimCell_115) (select .cse691 .cse688)) 0) (= (select (select .cse689 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) .cse690) 0) (= v_ArrVal_1436 v_arrayElimCell_109)))))) .cse37)) (.cse430 (or .cse21 .cse37 (forall ((v_arrayElimCell_109 Int) (|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_arrayElimCell_110 Int) (v_ArrVal_1434 Int) (v_arrayElimCell_114 Int) (v_ArrVal_1436 Int)) (let ((.cse687 (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse685 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse687))) (let ((.cse684 (+ v_ArrVal_1436 4)) (.cse686 (select (select .cse685 .cse9) (+ v_arrayElimCell_109 4)))) (or (= .cse684 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (< v_arrayElimCell_109 0) (< v_ArrVal_1436 0) (= (select (select .cse685 v_arrayElimCell_110) .cse686) 0) (< .cse686 0) (< (select .cse12 .cse684) 0) (= (select (select .cse685 v_arrayElimCell_114) (select .cse687 .cse684)) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436) (= (select (select .cse685 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) .cse686) 0) (= v_ArrVal_1436 v_arrayElimCell_109)))))))) (.cse128 (or (forall ((v_arrayElimCell_109 Int) (v_arrayElimCell_110 Int) (v_arrayElimCell_115 Int) (v_ArrVal_1434 Int) (v_ArrVal_1436 Int)) (let ((.cse683 (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse681 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse683)) (.cse680 (+ v_arrayElimCell_109 4))) (let ((.cse682 (select (select .cse681 .cse9) .cse680)) (.cse679 (+ v_ArrVal_1436 4))) (or (= .cse679 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (= |c_ULTIMATE.start_l1_insert_~item~1#1.offset| .cse680) (< v_arrayElimCell_109 0) (< v_ArrVal_1436 0) (= (select (select .cse681 v_arrayElimCell_110) .cse682) 0) (= .cse679 |c_ULTIMATE.start_l2_insert_~list#1.offset|) (< .cse682 0) (< (select .cse12 .cse679) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436) (= (select (select .cse681 v_arrayElimCell_115) (select .cse683 .cse679)) 0) (= v_ArrVal_1436 v_arrayElimCell_109)))))) .cse37)) (.cse61 (= |c_~#list~0.base| |c_ULTIMATE.start_l1_insert_~list#1.base|)) (.cse379 (or .cse406 .cse13 .cse3 .cse15)) (.cse405 (or .cse0 (forall ((|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_ArrVal_1434 Int)) (let ((.cse677 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434)))) (let ((.cse678 (select (select .cse677 .cse9) |c_ULTIMATE.start_l1_insert_~item~1#1.offset|))) (or (= (select (select .cse677 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) .cse678) 0) (< .cse678 0))))) .cse2)) (.cse383 (forall ((|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_ArrVal_1434 Int)) (let ((.cse675 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434)))) (let ((.cse676 (select (select .cse675 .cse9) |c_ULTIMATE.start_l2_insert_~list#1.offset|))) (or (= (select (select .cse675 |c_ULTIMATE.start_l2_insert_~item~0#1.base|) .cse676) 0) (< .cse676 0) (= (select (select .cse675 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) .cse676) 0)))))) (.cse391 (or .cse406 .cse13 .cse3)) (.cse431 (forall ((v_ArrVal_1436 Int)) (let ((.cse671 (+ v_ArrVal_1436 4))) (or (= .cse671 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (< v_ArrVal_1436 0) (= .cse671 |c_ULTIMATE.start_l2_insert_~list#1.offset|) (forall ((|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_ArrVal_1434 Int) (v_arrayElimCell_118 Int)) (let ((.cse674 (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse672 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse674))) (let ((.cse673 (select (select .cse672 .cse9) |c_ULTIMATE.start_l1_insert_~item~1#1.offset|))) (or (= (select (select .cse672 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) .cse673) 0) (= (select (select .cse672 v_arrayElimCell_118) (select .cse674 .cse671)) 0) (< .cse673 0)))))) (< (select .cse12 .cse671) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436))))) (.cse119 (forall ((v_ArrVal_1436 Int)) (let ((.cse667 (+ v_ArrVal_1436 4))) (or (= .cse667 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (< v_ArrVal_1436 0) (< (select .cse11 .cse667) 0) (forall ((|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_ArrVal_1434 Int)) (let ((.cse670 (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse668 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse670))) (let ((.cse669 (select (select .cse668 .cse9) |c_ULTIMATE.start_l1_insert_~item~1#1.offset|))) (or (= (select (select .cse668 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) .cse669) 0) (< .cse669 0) (= (select (select .cse668 |c_ULTIMATE.start_l2_insert_~item~0#1.base|) (select .cse670 .cse667)) 0)))))) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436))))) (.cse1 (forall ((|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_ArrVal_1434 Int) (v_ArrVal_1436 Int) (v_arrayElimCell_118 Int)) (let ((.cse666 (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse664 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse666))) (let ((.cse665 (select (select .cse664 .cse9) |c_ULTIMATE.start_l1_insert_~item~1#1.offset|)) (.cse663 (+ v_ArrVal_1436 4))) (or (= .cse663 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (= (select (select .cse664 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) .cse665) 0) (= (select (select .cse664 v_arrayElimCell_118) (select .cse666 .cse663)) 0) (< v_ArrVal_1436 0) (= .cse663 |c_ULTIMATE.start_l2_insert_~list#1.offset|) (< .cse665 0) (< (select .cse12 .cse663) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436))))))) (.cse95 (or .cse37 (forall ((v_arrayElimCell_109 Int) (|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_arrayElimCell_110 Int) (v_arrayElimCell_115 Int) (v_ArrVal_1434 Int) (v_ArrVal_1436 Int)) (let ((.cse662 (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse659 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse662)) (.cse661 (+ v_arrayElimCell_109 4))) (let ((.cse658 (+ v_ArrVal_1436 4)) (.cse660 (select (select .cse659 .cse9) .cse661))) (or (= .cse658 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (< v_arrayElimCell_109 0) (< v_ArrVal_1436 0) (= (select (select .cse659 v_arrayElimCell_110) .cse660) 0) (= .cse658 |c_ULTIMATE.start_l2_insert_~list#1.offset|) (< .cse660 0) (= |c_ULTIMATE.start_l2_insert_~list#1.offset| .cse661) (< (select .cse12 .cse658) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436) (= (select (select .cse659 v_arrayElimCell_115) (select .cse662 .cse658)) 0) (= (select (select .cse659 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) .cse660) 0) (= v_ArrVal_1436 v_arrayElimCell_109)))))))) (.cse446 (or .cse21 (forall ((v_arrayElimCell_109 Int) (|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_arrayElimCell_110 Int) (v_ArrVal_1434 Int) (v_arrayElimCell_114 Int) (v_ArrVal_1436 Int)) (let ((.cse657 (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse654 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse657)) (.cse656 (+ v_arrayElimCell_109 4))) (let ((.cse653 (+ v_ArrVal_1436 4)) (.cse655 (select (select .cse654 .cse9) .cse656))) (or (= .cse653 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (< v_arrayElimCell_109 0) (< v_ArrVal_1436 0) (= (select (select .cse654 v_arrayElimCell_110) .cse655) 0) (= .cse653 |c_ULTIMATE.start_l2_insert_~list#1.offset|) (< .cse655 0) (= |c_ULTIMATE.start_l2_insert_~list#1.offset| .cse656) (< (select .cse12 .cse653) 0) (= (select (select .cse654 v_arrayElimCell_114) (select .cse657 .cse653)) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436) (= (select (select .cse654 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) .cse655) 0) (= v_ArrVal_1436 v_arrayElimCell_109)))))) .cse37)) (.cse105 (forall ((v_arrayElimCell_109 Int) (|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_arrayElimCell_110 Int) (v_ArrVal_1434 Int)) (let ((.cse651 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (.cse650 (+ v_arrayElimCell_109 4))) (let ((.cse652 (select (select .cse651 .cse9) .cse650))) (or (= |c_ULTIMATE.start_l1_insert_~item~1#1.offset| .cse650) (< v_arrayElimCell_109 0) (= (select (select .cse651 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) v_ArrVal_1434) 0) (= (select (select .cse651 v_arrayElimCell_110) .cse652) 0) (< v_ArrVal_1434 0) (< .cse652 0) (= |c_ULTIMATE.start_l2_insert_~list#1.offset| .cse650))))))) (and (or .cse0 .cse1 .cse2) (or .cse3 (and (or (and (forall ((v_ArrVal_1436 Int)) (let ((.cse4 (+ v_ArrVal_1436 4))) (or (= .cse4 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (< v_ArrVal_1436 0) (forall ((v_arrayElimCell_109 Int) (v_prenex_5 Int) (v_arrayElimCell_110 Int) (v_ArrVal_1434 Int)) (let ((.cse7 (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse6 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse7)) (.cse5 (+ v_arrayElimCell_109 4))) (let ((.cse8 (select (select .cse6 .cse9) .cse5))) (or (= |c_ULTIMATE.start_l1_insert_~item~1#1.offset| .cse5) (= (select (select .cse6 v_prenex_5) (select .cse7 .cse4)) 0) (< v_arrayElimCell_109 0) (= (select (select .cse6 v_arrayElimCell_110) .cse8) 0) (< .cse8 0) (= |c_ULTIMATE.start_l2_insert_~list#1.offset| .cse5) (= v_ArrVal_1436 v_arrayElimCell_109)))))) (< (select .cse12 .cse4) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436)))) (or .cse13 .cse14 .cse15) (forall ((v_ArrVal_1436 Int)) (let ((.cse16 (+ v_ArrVal_1436 4))) (or (= .cse16 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (< v_ArrVal_1436 0) (forall ((v_arrayElimCell_109 Int) (v_prenex_5 Int) (v_arrayElimCell_110 Int) (v_ArrVal_1434 Int)) (let ((.cse19 (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse18 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse19)) (.cse17 (+ v_arrayElimCell_109 4))) (let ((.cse20 (select (select .cse18 .cse9) .cse17))) (or (= |c_ULTIMATE.start_l1_insert_~item~1#1.offset| .cse17) (= (select (select .cse18 v_prenex_5) (select .cse19 .cse16)) 0) (< v_arrayElimCell_109 0) (= (select (select .cse18 v_arrayElimCell_110) .cse20) 0) (< .cse20 0) (= (select (select .cse18 |c_ULTIMATE.start_l2_insert_~item~0#1.base|) .cse20) 0) (= v_ArrVal_1436 v_arrayElimCell_109)))))) (< (select .cse12 .cse16) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436))))) .cse21) (forall ((v_ArrVal_1436 Int)) (let ((.cse22 (+ v_ArrVal_1436 4))) (or (= .cse22 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (< v_ArrVal_1436 0) (forall ((v_arrayElimCell_109 Int) (v_arrayElimCell_110 Int) (v_ArrVal_1434 Int) (v_arrayElimCell_118 Int)) (let ((.cse24 (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse23 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse24)) (.cse25 (+ v_arrayElimCell_109 4))) (let ((.cse26 (select (select .cse23 .cse9) .cse25))) (or (= (select (select .cse23 v_arrayElimCell_118) (select .cse24 .cse22)) 0) (= |c_ULTIMATE.start_l1_insert_~item~1#1.offset| .cse25) (< v_arrayElimCell_109 0) (= (select (select .cse23 v_arrayElimCell_110) .cse26) 0) (< .cse26 0) (= (select (select .cse23 |c_ULTIMATE.start_l2_insert_~item~0#1.base|) .cse26) 0) (= v_ArrVal_1436 v_arrayElimCell_109)))))) (= .cse22 |c_ULTIMATE.start_l2_insert_~list#1.offset|) (< (select .cse12 .cse22) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436)))) (or .cse13 .cse27 .cse15))) (forall ((v_ArrVal_1436 Int)) (or (< v_ArrVal_1436 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436) (forall ((v_arrayElimCell_109 Int)) (let ((.cse28 (+ v_arrayElimCell_109 4))) (or (= |c_ULTIMATE.start_l1_insert_~item~1#1.offset| .cse28) (< v_arrayElimCell_109 0) (= |c_ULTIMATE.start_l2_insert_~list#1.offset| .cse28) (forall ((v_arrayElimCell_110 Int) (v_ArrVal_1434 Int)) (let ((.cse32 (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse29 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse32))) (let ((.cse30 (select (select .cse29 .cse9) .cse28)) (.cse31 (select .cse32 (+ v_ArrVal_1436 4)))) (or (= (select (select .cse29 v_arrayElimCell_110) .cse30) 0) (< .cse30 0) (forall ((|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int)) (= (select (select .cse29 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) .cse31) 0)) (= (select (select .cse29 |c_ULTIMATE.start_l2_insert_~item~0#1.base|) .cse31) 0) (< .cse31 0)))))) (= v_ArrVal_1436 v_arrayElimCell_109)))))) (or .cse21 (forall ((v_arrayElimCell_109 Int) (|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_prenex_5 Int) (v_ArrVal_1434 Int) (v_ArrVal_1436 Int)) (let ((.cse35 (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse34 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse35))) (let ((.cse33 (+ v_ArrVal_1436 4)) (.cse36 (select (select .cse34 .cse9) (+ v_arrayElimCell_109 4)))) (or (= .cse33 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (= (select (select .cse34 v_prenex_5) (select .cse35 .cse33)) 0) (< v_arrayElimCell_109 0) (< v_ArrVal_1436 0) (< .cse36 0) (< (select .cse12 .cse33) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436) (= (select (select .cse34 |c_ULTIMATE.start_l2_insert_~item~0#1.base|) .cse36) 0) (= (select (select .cse34 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) .cse36) 0) (= v_ArrVal_1436 v_arrayElimCell_109)))))) .cse37) (or (forall ((v_arrayElimCell_109 Int) (|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_prenex_5 Int) (v_ArrVal_1434 Int) (v_ArrVal_1436 Int)) (let ((.cse40 (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse39 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse40)) (.cse42 (+ v_arrayElimCell_109 4))) (let ((.cse38 (+ v_ArrVal_1436 4)) (.cse41 (select (select .cse39 .cse9) .cse42))) (or (= .cse38 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (= (select (select .cse39 v_prenex_5) (select .cse40 .cse38)) 0) (< v_arrayElimCell_109 0) (< v_ArrVal_1436 0) (= .cse38 |c_ULTIMATE.start_l2_insert_~list#1.offset|) (< .cse41 0) (= |c_ULTIMATE.start_l2_insert_~list#1.offset| .cse42) (< (select .cse12 .cse38) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436) (= (select (select .cse39 |c_ULTIMATE.start_l2_insert_~item~0#1.base|) .cse41) 0) (= (select (select .cse39 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) .cse41) 0)))))) .cse21 .cse37) (or (and (or (forall ((v_prenex_6 Int) (v_ArrVal_1434 Int)) (or (= (select (select (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434)) v_prenex_6) v_ArrVal_1434) 0) (< v_ArrVal_1434 0))) .cse2) (forall ((v_ArrVal_1436 Int)) (or (forall ((v_ArrVal_1434 Int)) (let ((.cse45 (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse43 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse45)) (.cse44 (select .cse45 (+ v_ArrVal_1436 4)))) (or (forall ((v_prenex_6 Int)) (= (select (select .cse43 v_prenex_6) .cse44) 0)) (= (select (select .cse43 |c_ULTIMATE.start_l2_insert_~item~0#1.base|) .cse44) 0) (< .cse44 0))))) (< v_ArrVal_1436 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436))) (forall ((v_ArrVal_1436 Int)) (let ((.cse46 (+ v_ArrVal_1436 4))) (or (= .cse46 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (< v_ArrVal_1436 0) (= .cse46 |c_ULTIMATE.start_l2_insert_~list#1.offset|) (< (select .cse12 .cse46) 0) (forall ((v_arrayElimCell_124 Int) (v_ArrVal_1434 Int)) (= (let ((.cse47 (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (select (select (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse47) v_arrayElimCell_124) (select .cse47 .cse46))) 0)) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436)))) (forall ((v_ArrVal_1436 Int)) (let ((.cse48 (+ v_ArrVal_1436 4))) (or (= .cse48 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (forall ((v_ArrVal_1434 Int)) (= (let ((.cse49 (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (select (select (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse49) |c_ULTIMATE.start_l2_insert_~item~0#1.base|) (select .cse49 .cse48))) 0)) (< v_ArrVal_1436 0) (< (select .cse11 .cse48) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436)))) (or .cse21 (and (forall ((v_ArrVal_1436 Int)) (or (< v_ArrVal_1436 0) (forall ((|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_ArrVal_1434 Int)) (let ((.cse52 (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse50 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse52)) (.cse51 (select .cse52 (+ v_ArrVal_1436 4)))) (or (forall ((v_arrayElimCell_123 Int)) (= (select (select .cse50 v_arrayElimCell_123) .cse51) 0)) (< .cse51 0) (= (select (select .cse50 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) .cse51) 0))))) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436))) (or .cse53 .cse2) (forall ((v_ArrVal_1436 Int)) (let ((.cse54 (+ v_ArrVal_1436 4))) (or (= .cse54 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (forall ((v_arrayElimCell_123 Int) (v_ArrVal_1434 Int)) (= (let ((.cse55 (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (select (select (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse55) v_arrayElimCell_123) (select .cse55 .cse54))) 0)) (< v_ArrVal_1436 0) (< (select .cse12 .cse54) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436)))))) (forall ((v_ArrVal_1436 Int)) (let ((.cse56 (+ v_ArrVal_1436 4))) (or (< v_ArrVal_1436 0) (= .cse56 |c_ULTIMATE.start_l2_insert_~list#1.offset|) (forall ((v_prenex_6 Int) (v_ArrVal_1434 Int)) (let ((.cse59 (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse57 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse59)) (.cse58 (select .cse59 .cse56))) (or (= (select (select .cse57 v_prenex_6) .cse58) 0) (forall ((v_arrayElimCell_124 Int)) (= (select (select .cse57 v_arrayElimCell_124) .cse58) 0)) (< .cse58 0))))) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436))))) (not .cse60) (not .cse61)) (or .cse3 (and (forall ((v_ArrVal_1436 Int)) (let ((.cse62 (+ v_ArrVal_1436 4))) (or (= .cse62 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (forall ((v_arrayElimCell_109 Int) (|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_arrayElimCell_110 Int) (v_ArrVal_1434 Int) (v_arrayElimCell_118 Int)) (let ((.cse64 (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse63 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse64))) (let ((.cse65 (select (select .cse63 .cse9) (+ v_arrayElimCell_109 4)))) (or (= (select (select .cse63 v_arrayElimCell_118) (select .cse64 .cse62)) 0) (< v_arrayElimCell_109 0) (= (select (select .cse63 v_arrayElimCell_110) .cse65) 0) (< .cse65 0) (= (select (select .cse63 |c_ULTIMATE.start_l2_insert_~item~0#1.base|) .cse65) 0) (= (select (select .cse63 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) .cse65) 0) (= v_ArrVal_1436 v_arrayElimCell_109)))))) (< v_ArrVal_1436 0) (= .cse62 |c_ULTIMATE.start_l2_insert_~list#1.offset|) (< (select .cse12 .cse62) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436)))) (or .cse13 (forall ((|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_ArrVal_1434 Int) (v_ArrVal_1436 Int) (v_arrayElimCell_118 Int)) (let ((.cse69 (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse66 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse69))) (let ((.cse68 (+ v_ArrVal_1436 4)) (.cse67 (select (select .cse66 .cse9) |c_ULTIMATE.start_l2_insert_~list#1.offset|))) (or (= (select (select .cse66 |c_ULTIMATE.start_l2_insert_~item~0#1.base|) .cse67) 0) (= .cse68 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (= (select (select .cse66 v_arrayElimCell_118) (select .cse69 .cse68)) 0) (< v_ArrVal_1436 0) (< .cse67 0) (= .cse68 |c_ULTIMATE.start_l2_insert_~list#1.offset|) (< (select .cse12 .cse68) 0) (= (select (select .cse66 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) .cse67) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436))))))) (or (and (forall ((v_ArrVal_1436 Int)) (let ((.cse70 (+ v_ArrVal_1436 4))) (or (= .cse70 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (< v_ArrVal_1436 0) (< (select .cse12 .cse70) 0) (forall ((v_arrayElimCell_109 Int) (|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_prenex_5 Int) (v_arrayElimCell_110 Int) (v_ArrVal_1434 Int)) (let ((.cse72 (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse71 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse72)) (.cse74 (+ v_arrayElimCell_109 4))) (let ((.cse73 (select (select .cse71 .cse9) .cse74))) (or (= (select (select .cse71 v_prenex_5) (select .cse72 .cse70)) 0) (< v_arrayElimCell_109 0) (= (select (select .cse71 v_arrayElimCell_110) .cse73) 0) (< .cse73 0) (= |c_ULTIMATE.start_l2_insert_~list#1.offset| .cse74) (= (select (select .cse71 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) .cse73) 0) (= v_ArrVal_1436 v_arrayElimCell_109)))))) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436)))) (or (forall ((|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_prenex_5 Int) (v_ArrVal_1434 Int) (v_ArrVal_1436 Int)) (let ((.cse78 (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse75 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse78))) (let ((.cse77 (+ v_ArrVal_1436 4)) (.cse76 (select (select .cse75 .cse9) |c_ULTIMATE.start_l2_insert_~list#1.offset|))) (or (= (select (select .cse75 |c_ULTIMATE.start_l2_insert_~item~0#1.base|) .cse76) 0) (= .cse77 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (= (select (select .cse75 v_prenex_5) (select .cse78 .cse77)) 0) (< v_ArrVal_1436 0) (< .cse76 0) (= .cse77 |c_ULTIMATE.start_l2_insert_~list#1.offset|) (< (select .cse12 .cse77) 0) (= (select (select .cse75 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) .cse76) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436)))))) .cse13) (forall ((v_ArrVal_1436 Int)) (let ((.cse79 (+ v_ArrVal_1436 4))) (or (= .cse79 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (< v_ArrVal_1436 0) (forall ((v_arrayElimCell_109 Int) (|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_prenex_5 Int) (v_arrayElimCell_110 Int) (v_ArrVal_1434 Int)) (let ((.cse81 (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse80 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse81))) (let ((.cse82 (select (select .cse80 .cse9) (+ v_arrayElimCell_109 4)))) (or (= (select (select .cse80 v_prenex_5) (select .cse81 .cse79)) 0) (< v_arrayElimCell_109 0) (= (select (select .cse80 v_arrayElimCell_110) .cse82) 0) (< .cse82 0) (= (select (select .cse80 |c_ULTIMATE.start_l2_insert_~item~0#1.base|) .cse82) 0) (= (select (select .cse80 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) .cse82) 0) (= v_ArrVal_1436 v_arrayElimCell_109)))))) (< (select .cse12 .cse79) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436))))) .cse21))) (or (forall ((v_arrayElimCell_109 Int) (|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_prenex_5 Int) (v_ArrVal_1434 Int) (v_ArrVal_1436 Int)) (let ((.cse85 (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse84 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse85)) (.cse87 (+ v_arrayElimCell_109 4))) (let ((.cse83 (+ v_ArrVal_1436 4)) (.cse86 (select (select .cse84 .cse9) .cse87))) (or (= .cse83 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (= (select (select .cse84 v_prenex_5) (select .cse85 .cse83)) 0) (< v_arrayElimCell_109 0) (< v_ArrVal_1436 0) (< .cse86 0) (= |c_ULTIMATE.start_l2_insert_~list#1.offset| .cse87) (< (select .cse12 .cse83) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436) (= (select (select .cse84 |c_ULTIMATE.start_l2_insert_~item~0#1.base|) .cse86) 0) (= (select (select .cse84 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) .cse86) 0) (= v_ArrVal_1436 v_arrayElimCell_109)))))) .cse21 .cse37) (or .cse21 (forall ((v_arrayElimCell_109 Int) (v_prenex_5 Int) (v_ArrVal_1434 Int) (v_ArrVal_1436 Int)) (let ((.cse91 (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse90 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse91)) (.cse89 (+ v_arrayElimCell_109 4))) (let ((.cse88 (+ v_ArrVal_1436 4)) (.cse92 (select (select .cse90 .cse9) .cse89))) (or (= .cse88 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (= |c_ULTIMATE.start_l1_insert_~item~1#1.offset| .cse89) (= (select (select .cse90 v_prenex_5) (select .cse91 .cse88)) 0) (< v_arrayElimCell_109 0) (< v_ArrVal_1436 0) (= .cse88 |c_ULTIMATE.start_l2_insert_~list#1.offset|) (< .cse92 0) (< (select .cse12 .cse88) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436) (= (select (select .cse90 |c_ULTIMATE.start_l2_insert_~item~0#1.base|) .cse92) 0)))))) .cse37) (or .cse93 (and .cse94 .cse95)) (or .cse15 (forall ((v_arrayElimCell_109 Int) (|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_arrayElimCell_110 Int) (v_ArrVal_1434 Int)) (let ((.cse99 (+ v_arrayElimCell_109 4)) (.cse97 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434)))) (let ((.cse96 (select .cse97 |ULTIMATE.start_l1_insert_#t~mem13#1.base|)) (.cse98 (select (select .cse97 .cse9) .cse99))) (or (< v_arrayElimCell_109 0) (= (select .cse96 v_ArrVal_1434) 0) (= (select (select .cse97 v_arrayElimCell_110) .cse98) 0) (< v_ArrVal_1434 0) (< .cse98 0) (= |c_ULTIMATE.start_l2_insert_~list#1.offset| .cse99) (= (select .cse96 .cse98) 0))))) .cse2) (forall ((v_ArrVal_1436 Int)) (let ((.cse100 (+ v_ArrVal_1436 4))) (or (= .cse100 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (< v_ArrVal_1436 0) (< (select .cse11 .cse100) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436) (forall ((v_arrayElimCell_109 Int) (|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_arrayElimCell_110 Int) (v_ArrVal_1434 Int)) (let ((.cse104 (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse101 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse104)) (.cse103 (+ v_arrayElimCell_109 4))) (let ((.cse102 (select (select .cse101 .cse9) .cse103))) (or (< v_arrayElimCell_109 0) (= (select (select .cse101 v_arrayElimCell_110) .cse102) 0) (< .cse102 0) (= |c_ULTIMATE.start_l2_insert_~list#1.offset| .cse103) (= (select (select .cse101 |c_ULTIMATE.start_l2_insert_~item~0#1.base|) (select .cse104 .cse100)) 0) (= (select (select .cse101 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) .cse102) 0) (= v_ArrVal_1436 v_arrayElimCell_109))))))))) (or .cse105 .cse2) (forall ((v_ArrVal_1436 Int)) (let ((.cse106 (+ v_ArrVal_1436 4))) (or (= .cse106 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (forall ((v_arrayElimCell_109 Int) (v_ArrVal_1434 Int)) (let ((.cse110 (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse107 (+ v_arrayElimCell_109 4)) (.cse111 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse110))) (let ((.cse109 (select .cse111 |c_ULTIMATE.start_l2_insert_~item~0#1.base|)) (.cse108 (select (select .cse111 .cse9) .cse107))) (or (= |c_ULTIMATE.start_l1_insert_~item~1#1.offset| .cse107) (< v_arrayElimCell_109 0) (< .cse108 0) (= (select .cse109 (select .cse110 .cse106)) 0) (= (select .cse109 .cse108) 0)))))) (< v_ArrVal_1436 0) (< (select .cse11 .cse106) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436)))) (or .cse3 .cse21 .cse112) (or (and (forall ((|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_ArrVal_1434 Int)) (let ((.cse113 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434)))) (or (= (select (select .cse113 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) v_ArrVal_1434) 0) (< (select (select .cse113 .cse9) |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) 0)))) (forall ((v_ArrVal_1436 Int)) (or (< v_ArrVal_1436 0) (forall ((|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_ArrVal_1434 Int)) (let ((.cse118 (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse116 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse118))) (let ((.cse115 (select (select .cse116 .cse9) |c_ULTIMATE.start_l1_insert_~item~1#1.offset|)) (.cse114 (select .cse116 |ULTIMATE.start_l1_insert_#t~mem13#1.base|)) (.cse117 (select .cse118 (+ v_ArrVal_1436 4)))) (or (= (select .cse114 .cse115) 0) (< .cse115 0) (= (select (select .cse116 |c_ULTIMATE.start_l2_insert_~item~0#1.base|) .cse117) 0) (< .cse117 0) (= (select .cse114 .cse117) 0)))))) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436))) .cse119) .cse0 .cse2) (or (forall ((v_arrayElimCell_109 Int) (|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_ArrVal_1434 Int)) (let ((.cse121 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (.cse120 (+ v_arrayElimCell_109 4))) (let ((.cse122 (select (select .cse121 .cse9) .cse120))) (or (= |c_ULTIMATE.start_l1_insert_~item~1#1.offset| .cse120) (< v_arrayElimCell_109 0) (= (select (select .cse121 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) v_ArrVal_1434) 0) (< v_ArrVal_1434 0) (< .cse122 0) (= (select (select .cse121 |c_ULTIMATE.start_l2_insert_~item~0#1.base|) .cse122) 0))))) .cse2) (or (and (or .cse21 (forall ((v_arrayElimCell_109 Int) (v_arrayElimCell_110 Int) (v_ArrVal_1434 Int) (v_arrayElimCell_114 Int) (v_ArrVal_1436 Int)) (let ((.cse127 (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse125 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse127)) (.cse124 (+ v_arrayElimCell_109 4))) (let ((.cse126 (select (select .cse125 .cse9) .cse124)) (.cse123 (+ v_ArrVal_1436 4))) (or (= .cse123 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (= |c_ULTIMATE.start_l1_insert_~item~1#1.offset| .cse124) (< v_arrayElimCell_109 0) (< v_ArrVal_1436 0) (= (select (select .cse125 v_arrayElimCell_110) .cse126) 0) (< .cse126 0) (< (select .cse12 .cse123) 0) (= (select (select .cse125 v_arrayElimCell_114) (select .cse127 .cse123)) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436) (= v_ArrVal_1436 v_arrayElimCell_109)))))) .cse37) .cse128) .cse93) (forall ((v_ArrVal_1436 Int)) (let ((.cse129 (+ v_ArrVal_1436 4))) (or (= .cse129 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (< v_ArrVal_1436 0) (= .cse129 |c_ULTIMATE.start_l2_insert_~list#1.offset|) (forall ((v_arrayElimCell_109 Int) (v_arrayElimCell_110 Int) (v_ArrVal_1434 Int) (v_arrayElimCell_118 Int)) (let ((.cse131 (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse130 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse131)) (.cse132 (+ v_arrayElimCell_109 4))) (let ((.cse133 (select (select .cse130 .cse9) .cse132))) (or (= (select (select .cse130 v_arrayElimCell_118) (select .cse131 .cse129)) 0) (= |c_ULTIMATE.start_l1_insert_~item~1#1.offset| .cse132) (< v_arrayElimCell_109 0) (= (select (select .cse130 v_arrayElimCell_110) .cse133) 0) (< .cse133 0) (= |c_ULTIMATE.start_l2_insert_~list#1.offset| .cse132) (= v_ArrVal_1436 v_arrayElimCell_109)))))) (< (select .cse12 .cse129) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436)))) (or (and (or (and (or (forall ((v_arrayElimCell_109 Int) (v_arrayElimCell_110 Int) (v_ArrVal_1434 Int) (v_arrayElimCell_114 Int) (v_ArrVal_1436 Int)) (let ((.cse138 (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse136 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse138)) (.cse135 (+ v_arrayElimCell_109 4))) (let ((.cse137 (select (select .cse136 .cse9) .cse135)) (.cse134 (+ v_ArrVal_1436 4))) (or (= .cse134 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (= |c_ULTIMATE.start_l1_insert_~item~1#1.offset| .cse135) (< v_arrayElimCell_109 0) (< v_ArrVal_1436 0) (= (select (select .cse136 v_arrayElimCell_110) .cse137) 0) (< .cse137 0) (= |c_ULTIMATE.start_l2_insert_~list#1.offset| .cse135) (< (select .cse12 .cse134) 0) (= (select (select .cse136 v_arrayElimCell_114) (select .cse138 .cse134)) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436) (= v_ArrVal_1436 v_arrayElimCell_109)))))) .cse37) (forall ((v_ArrVal_1436 Int)) (let ((.cse139 (+ v_ArrVal_1436 4))) (or (= .cse139 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (forall ((v_arrayElimCell_109 Int) (v_arrayElimCell_110 Int) (v_ArrVal_1434 Int) (v_arrayElimCell_119 Int)) (let ((.cse143 (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse141 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse143)) (.cse140 (+ v_arrayElimCell_109 4))) (let ((.cse142 (select (select .cse141 .cse9) .cse140))) (or (= |c_ULTIMATE.start_l1_insert_~item~1#1.offset| .cse140) (< v_arrayElimCell_109 0) (= (select (select .cse141 v_arrayElimCell_110) .cse142) 0) (< .cse142 0) (= |c_ULTIMATE.start_l2_insert_~list#1.offset| .cse140) (= (select (select .cse141 v_arrayElimCell_119) (select .cse143 .cse139)) 0) (= v_ArrVal_1436 v_arrayElimCell_109)))))) (< v_ArrVal_1436 0) (< (select .cse12 .cse139) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436))))) .cse21) .cse144) .cse93) (or .cse93 (and (or .cse21 (forall ((v_arrayElimCell_109 Int) (|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_arrayElimCell_110 Int) (v_ArrVal_1434 Int) (v_arrayElimCell_114 Int) (v_ArrVal_1436 Int)) (let ((.cse149 (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse146 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse149)) (.cse148 (+ v_arrayElimCell_109 4))) (let ((.cse145 (+ v_ArrVal_1436 4)) (.cse147 (select (select .cse146 .cse9) .cse148))) (or (= .cse145 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (< v_arrayElimCell_109 0) (< v_ArrVal_1436 0) (= (select (select .cse146 v_arrayElimCell_110) .cse147) 0) (= .cse145 |c_ULTIMATE.start_l2_insert_~list#1.offset|) (< .cse147 0) (= |c_ULTIMATE.start_l2_insert_~list#1.offset| .cse148) (< (select .cse12 .cse145) 0) (= (select (select .cse146 v_arrayElimCell_114) (select .cse149 .cse145)) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436) (= (select (select .cse146 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) .cse147) 0)))))) .cse37) (or (forall ((v_arrayElimCell_109 Int) (|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_arrayElimCell_110 Int) (v_arrayElimCell_115 Int) (v_ArrVal_1434 Int) (v_ArrVal_1436 Int)) (let ((.cse154 (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse151 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse154)) (.cse153 (+ v_arrayElimCell_109 4))) (let ((.cse150 (+ v_ArrVal_1436 4)) (.cse152 (select (select .cse151 .cse9) .cse153))) (or (= .cse150 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (< v_arrayElimCell_109 0) (< v_ArrVal_1436 0) (= (select (select .cse151 v_arrayElimCell_110) .cse152) 0) (= .cse150 |c_ULTIMATE.start_l2_insert_~list#1.offset|) (< .cse152 0) (= |c_ULTIMATE.start_l2_insert_~list#1.offset| .cse153) (< (select .cse12 .cse150) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436) (= (select (select .cse151 v_arrayElimCell_115) (select .cse154 .cse150)) 0) (= (select (select .cse151 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) .cse152) 0)))))) .cse37))) (forall ((v_ArrVal_1436 Int)) (let ((.cse155 (+ v_ArrVal_1436 4))) (or (= .cse155 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (< v_ArrVal_1436 0) (= .cse155 |c_ULTIMATE.start_l2_insert_~list#1.offset|) (< (select .cse12 .cse155) 0) (forall ((v_arrayElimCell_109 Int) (|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_arrayElimCell_110 Int) (v_ArrVal_1434 Int)) (let ((.cse159 (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse158 (+ v_arrayElimCell_109 4)) (.cse160 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse159))) (let ((.cse156 (select .cse160 v_arrayElimCell_110)) (.cse157 (select (select .cse160 .cse9) .cse158))) (or (< v_arrayElimCell_109 0) (= (select .cse156 .cse157) 0) (< .cse157 0) (= |c_ULTIMATE.start_l2_insert_~list#1.offset| .cse158) (= (select .cse156 (select .cse159 .cse155)) 0) (= (select (select .cse160 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) .cse157) 0)))))) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436)))) (forall ((v_ArrVal_1436 Int)) (let ((.cse161 (+ v_ArrVal_1436 4))) (or (= .cse161 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (< v_ArrVal_1436 0) (= .cse161 |c_ULTIMATE.start_l2_insert_~list#1.offset|) (< (select .cse12 .cse161) 0) (forall ((v_arrayElimCell_109 Int) (|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_ArrVal_1434 Int) (v_arrayElimCell_118 Int)) (let ((.cse163 (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse162 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse163))) (let ((.cse164 (select (select .cse162 .cse9) (+ v_arrayElimCell_109 4)))) (or (= (select (select .cse162 v_arrayElimCell_118) (select .cse163 .cse161)) 0) (< v_arrayElimCell_109 0) (< .cse164 0) (= (select (select .cse162 |c_ULTIMATE.start_l2_insert_~item~0#1.base|) .cse164) 0) (= (select (select .cse162 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) .cse164) 0) (= v_ArrVal_1436 v_arrayElimCell_109)))))) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436)))) (or (forall ((v_arrayElimCell_109 Int) (|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_ArrVal_1434 Int)) (let ((.cse167 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434)))) (let ((.cse165 (select .cse167 |ULTIMATE.start_l1_insert_#t~mem13#1.base|)) (.cse166 (select (select .cse167 .cse9) (+ v_arrayElimCell_109 4)))) (or (< v_arrayElimCell_109 0) (= (select .cse165 v_ArrVal_1434) 0) (< v_ArrVal_1434 0) (< .cse166 0) (= (select (select .cse167 |c_ULTIMATE.start_l2_insert_~item~0#1.base|) .cse166) 0) (= (select .cse165 .cse166) 0))))) .cse2) (or (and .cse168 .cse169) .cse93) (or .cse13 .cse3 .cse15 (and (or .cse21 (forall ((v_prenex_5 Int) (v_ArrVal_1434 Int) (v_ArrVal_1436 Int)) (let ((.cse173 (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse170 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse173))) (let ((.cse171 (select (select .cse170 .cse9) |c_ULTIMATE.start_l2_insert_~list#1.offset|)) (.cse172 (+ v_ArrVal_1436 4))) (or (= (select (select .cse170 |c_ULTIMATE.start_l2_insert_~item~0#1.base|) .cse171) 0) (= .cse172 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (= (select (select .cse170 v_prenex_5) (select .cse173 .cse172)) 0) (< v_ArrVal_1436 0) (< .cse171 0) (< (select .cse12 .cse172) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436))))))) .cse174)) (or .cse21 .cse112 .cse37) (forall ((v_ArrVal_1436 Int)) (or (forall ((v_ArrVal_1434 Int)) (let ((.cse180 (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse175 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse180)) (.cse178 (select .cse180 (+ v_ArrVal_1436 4)))) (or (forall ((v_arrayElimCell_109 Int) (v_arrayElimCell_110 Int)) (let ((.cse179 (+ v_arrayElimCell_109 4))) (let ((.cse176 (select (select .cse175 .cse9) .cse179))) (or (< v_arrayElimCell_109 0) (= (select (select .cse175 v_arrayElimCell_110) .cse176) 0) (< .cse176 0) (forall ((|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int)) (let ((.cse177 (select .cse175 |ULTIMATE.start_l1_insert_#t~mem13#1.base|))) (or (= (select .cse177 .cse178) 0) (= (select .cse177 .cse176) 0)))) (= |c_ULTIMATE.start_l2_insert_~list#1.offset| .cse179) (= v_ArrVal_1436 v_arrayElimCell_109))))) (= (select (select .cse175 |c_ULTIMATE.start_l2_insert_~item~0#1.base|) .cse178) 0) (< .cse178 0))))) (< v_ArrVal_1436 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436))) (or .cse21 (forall ((v_arrayElimCell_109 Int) (v_prenex_5 Int) (v_ArrVal_1434 Int) (v_ArrVal_1436 Int)) (let ((.cse184 (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse183 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse184)) (.cse182 (+ v_arrayElimCell_109 4))) (let ((.cse181 (+ v_ArrVal_1436 4)) (.cse185 (select (select .cse183 .cse9) .cse182))) (or (= .cse181 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (= |c_ULTIMATE.start_l1_insert_~item~1#1.offset| .cse182) (= (select (select .cse183 v_prenex_5) (select .cse184 .cse181)) 0) (< v_arrayElimCell_109 0) (< v_ArrVal_1436 0) (= .cse181 |c_ULTIMATE.start_l2_insert_~list#1.offset|) (< .cse185 0) (< (select .cse12 .cse181) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436) (= (select (select .cse183 |c_ULTIMATE.start_l2_insert_~item~0#1.base|) .cse185) 0) (= v_ArrVal_1436 v_arrayElimCell_109)))))) .cse37) (or (and .cse186 .cse187) .cse93) (or .cse21 .cse37 (forall ((v_arrayElimCell_109 Int) (|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_prenex_5 Int) (v_arrayElimCell_110 Int) (v_ArrVal_1434 Int) (v_ArrVal_1436 Int)) (let ((.cse190 (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse189 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse190)) (.cse192 (+ v_arrayElimCell_109 4))) (let ((.cse188 (+ v_ArrVal_1436 4)) (.cse191 (select (select .cse189 .cse9) .cse192))) (or (= .cse188 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (= (select (select .cse189 v_prenex_5) (select .cse190 .cse188)) 0) (< v_arrayElimCell_109 0) (< v_ArrVal_1436 0) (= (select (select .cse189 v_arrayElimCell_110) .cse191) 0) (= .cse188 |c_ULTIMATE.start_l2_insert_~list#1.offset|) (< .cse191 0) (= |c_ULTIMATE.start_l2_insert_~list#1.offset| .cse192) (< (select .cse12 .cse188) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436) (= (select (select .cse189 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) .cse191) 0))))))) (or .cse21 (forall ((v_arrayElimCell_109 Int) (|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_prenex_5 Int) (v_ArrVal_1434 Int) (v_ArrVal_1436 Int)) (let ((.cse195 (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse194 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse195)) (.cse197 (+ v_arrayElimCell_109 4))) (let ((.cse193 (+ v_ArrVal_1436 4)) (.cse196 (select (select .cse194 .cse9) .cse197))) (or (= .cse193 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (= (select (select .cse194 v_prenex_5) (select .cse195 .cse193)) 0) (< v_arrayElimCell_109 0) (< v_ArrVal_1436 0) (= .cse193 |c_ULTIMATE.start_l2_insert_~list#1.offset|) (< .cse196 0) (= |c_ULTIMATE.start_l2_insert_~list#1.offset| .cse197) (< (select .cse12 .cse193) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436) (= (select (select .cse194 |c_ULTIMATE.start_l2_insert_~item~0#1.base|) .cse196) 0) (= (select (select .cse194 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) .cse196) 0) (= v_ArrVal_1436 v_arrayElimCell_109)))))) .cse37) (or (let ((.cse230 (forall ((v_ArrVal_1436 Int)) (let ((.cse370 (+ v_ArrVal_1436 4))) (or (= .cse370 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (< v_ArrVal_1436 0) (= .cse370 |c_ULTIMATE.start_l2_insert_~list#1.offset|) (forall ((v_arrayElimCell_109 Int) (v_arrayElimCell_110 Int) (v_arrayElimCell_115 Int) (v_ArrVal_1434 Int)) (let ((.cse373 (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse371 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse373))) (let ((.cse372 (select (select .cse371 .cse9) (+ v_arrayElimCell_109 4)))) (or (< v_arrayElimCell_109 0) (= (select (select .cse371 v_arrayElimCell_110) .cse372) 0) (< .cse372 0) (= (select (select .cse371 v_arrayElimCell_115) (select .cse373 .cse370)) 0) (= v_ArrVal_1436 v_arrayElimCell_109)))))) (< (select .cse12 .cse370) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436))))) (.cse198 (forall ((v_ArrVal_1436 Int)) (let ((.cse365 (+ v_ArrVal_1436 4))) (or (= .cse365 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (< v_ArrVal_1436 0) (= .cse365 |c_ULTIMATE.start_l2_insert_~list#1.offset|) (forall ((v_arrayElimCell_109 Int) (v_arrayElimCell_110 Int) (v_arrayElimCell_115 Int) (v_ArrVal_1434 Int)) (let ((.cse369 (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse366 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse369)) (.cse368 (+ v_arrayElimCell_109 4))) (let ((.cse367 (select (select .cse366 .cse9) .cse368))) (or (< v_arrayElimCell_109 0) (= (select (select .cse366 v_arrayElimCell_110) .cse367) 0) (< .cse367 0) (= |c_ULTIMATE.start_l2_insert_~list#1.offset| .cse368) (= (select (select .cse366 v_arrayElimCell_115) (select .cse369 .cse365)) 0) (= v_ArrVal_1436 v_arrayElimCell_109)))))) (< (select .cse12 .cse365) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436))))) (.cse315 (forall ((v_ArrVal_1436 Int)) (let ((.cse361 (+ v_ArrVal_1436 4))) (or (= .cse361 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (< v_ArrVal_1436 0) (= .cse361 |c_ULTIMATE.start_l2_insert_~list#1.offset|) (forall ((v_arrayElimCell_109 Int) (v_arrayElimCell_110 Int) (v_arrayElimCell_115 Int) (v_ArrVal_1434 Int)) (let ((.cse364 (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse362 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse364))) (let ((.cse363 (select (select .cse362 .cse9) (+ v_arrayElimCell_109 4)))) (or (< v_arrayElimCell_109 0) (= (select (select .cse362 v_arrayElimCell_110) .cse363) 0) (< .cse363 0) (= (select (select .cse362 v_arrayElimCell_115) (select .cse364 .cse361)) 0)))))) (< (select .cse12 .cse361) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436)))))) (and (or (and .cse198 (or (forall ((v_arrayElimCell_109 Int) (v_arrayElimCell_110 Int) (v_ArrVal_1434 Int) (v_arrayElimCell_114 Int) (v_ArrVal_1436 Int)) (let ((.cse203 (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse200 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse203)) (.cse202 (+ v_arrayElimCell_109 4))) (let ((.cse201 (select (select .cse200 .cse9) .cse202)) (.cse199 (+ v_ArrVal_1436 4))) (or (= .cse199 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (< v_arrayElimCell_109 0) (< v_ArrVal_1436 0) (= (select (select .cse200 v_arrayElimCell_110) .cse201) 0) (= .cse199 |c_ULTIMATE.start_l2_insert_~list#1.offset|) (< .cse201 0) (= |c_ULTIMATE.start_l2_insert_~list#1.offset| .cse202) (< (select .cse12 .cse199) 0) (= (select (select .cse200 v_arrayElimCell_114) (select .cse203 .cse199)) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436) (= v_ArrVal_1436 v_arrayElimCell_109)))))) .cse21)) .cse93) (or .cse15 (forall ((v_arrayElimCell_109 Int) (|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_arrayElimCell_110 Int) (v_ArrVal_1434 Int)) (let ((.cse204 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (.cse206 (+ v_arrayElimCell_109 4))) (let ((.cse205 (select (select .cse204 .cse9) .cse206))) (or (< v_arrayElimCell_109 0) (= (select (select .cse204 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) v_ArrVal_1434) 0) (= (select (select .cse204 v_arrayElimCell_110) .cse205) 0) (< v_ArrVal_1434 0) (< .cse205 0) (= |c_ULTIMATE.start_l2_insert_~list#1.offset| .cse206))))) .cse2) (forall ((v_ArrVal_1436 Int)) (let ((.cse207 (+ v_ArrVal_1436 4))) (or (= .cse207 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (< v_ArrVal_1436 0) (< (select .cse11 .cse207) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436) (forall ((v_arrayElimCell_109 Int) (v_arrayElimCell_110 Int) (v_ArrVal_1434 Int)) (let ((.cse211 (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse208 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse211)) (.cse210 (+ v_arrayElimCell_109 4))) (let ((.cse209 (select (select .cse208 .cse9) .cse210))) (or (< v_arrayElimCell_109 0) (= (select (select .cse208 v_arrayElimCell_110) .cse209) 0) (< .cse209 0) (= |c_ULTIMATE.start_l2_insert_~list#1.offset| .cse210) (= (select (select .cse208 |c_ULTIMATE.start_l2_insert_~item~0#1.base|) (select .cse211 .cse207)) 0) (= v_ArrVal_1436 v_arrayElimCell_109))))))))) (forall ((v_ArrVal_1436 Int)) (let ((.cse212 (+ v_ArrVal_1436 4))) (or (= .cse212 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (forall ((v_arrayElimCell_109 Int) (v_ArrVal_1434 Int) (v_arrayElimCell_118 Int)) (let ((.cse214 (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse213 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse214))) (let ((.cse215 (select (select .cse213 .cse9) (+ v_arrayElimCell_109 4)))) (or (= (select (select .cse213 v_arrayElimCell_118) (select .cse214 .cse212)) 0) (< v_arrayElimCell_109 0) (< .cse215 0) (= (select (select .cse213 |c_ULTIMATE.start_l2_insert_~item~0#1.base|) .cse215) 0) (= v_ArrVal_1436 v_arrayElimCell_109)))))) (< v_ArrVal_1436 0) (= .cse212 |c_ULTIMATE.start_l2_insert_~list#1.offset|) (< (select .cse12 .cse212) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436)))) (or .cse21 (forall ((v_arrayElimCell_109 Int) (v_prenex_5 Int) (v_ArrVal_1434 Int) (v_ArrVal_1436 Int)) (let ((.cse218 (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse217 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse218))) (let ((.cse216 (+ v_ArrVal_1436 4)) (.cse219 (select (select .cse217 .cse9) (+ v_arrayElimCell_109 4)))) (or (= .cse216 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (= (select (select .cse217 v_prenex_5) (select .cse218 .cse216)) 0) (< v_arrayElimCell_109 0) (< v_ArrVal_1436 0) (< .cse219 0) (< (select .cse12 .cse216) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436) (= (select (select .cse217 |c_ULTIMATE.start_l2_insert_~item~0#1.base|) .cse219) 0))))))) (forall ((v_ArrVal_1436 Int)) (let ((.cse220 (+ v_ArrVal_1436 4))) (or (= .cse220 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (< v_ArrVal_1436 0) (= .cse220 |c_ULTIMATE.start_l2_insert_~list#1.offset|) (forall ((v_arrayElimCell_109 Int) (v_arrayElimCell_110 Int) (v_ArrVal_1434 Int)) (let ((.cse224 (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse225 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse224)) (.cse223 (+ v_arrayElimCell_109 4))) (let ((.cse222 (select (select .cse225 .cse9) .cse223)) (.cse221 (select .cse225 v_arrayElimCell_110))) (or (< v_arrayElimCell_109 0) (= (select .cse221 .cse222) 0) (< .cse222 0) (= |c_ULTIMATE.start_l2_insert_~list#1.offset| .cse223) (= (select .cse221 (select .cse224 .cse220)) 0)))))) (< (select .cse12 .cse220) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436)))) (or .cse93 (and (or (forall ((v_arrayElimCell_109 Int) (v_arrayElimCell_110 Int) (v_ArrVal_1434 Int) (v_arrayElimCell_114 Int) (v_ArrVal_1436 Int)) (let ((.cse229 (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse227 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse229))) (let ((.cse228 (select (select .cse227 .cse9) (+ v_arrayElimCell_109 4))) (.cse226 (+ v_ArrVal_1436 4))) (or (= .cse226 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (< v_arrayElimCell_109 0) (< v_ArrVal_1436 0) (= (select (select .cse227 v_arrayElimCell_110) .cse228) 0) (< .cse228 0) (< (select .cse12 .cse226) 0) (= (select (select .cse227 v_arrayElimCell_114) (select .cse229 .cse226)) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436) (= v_ArrVal_1436 v_arrayElimCell_109)))))) .cse21) .cse230)) (or (forall ((v_arrayElimCell_109 Int) (v_prenex_5 Int) (v_ArrVal_1434 Int) (v_ArrVal_1436 Int)) (let ((.cse233 (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse232 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse233))) (let ((.cse231 (+ v_ArrVal_1436 4)) (.cse234 (select (select .cse232 .cse9) (+ v_arrayElimCell_109 4)))) (or (= .cse231 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (= (select (select .cse232 v_prenex_5) (select .cse233 .cse231)) 0) (< v_arrayElimCell_109 0) (< v_ArrVal_1436 0) (< .cse234 0) (< (select .cse12 .cse231) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436) (= (select (select .cse232 |c_ULTIMATE.start_l2_insert_~item~0#1.base|) .cse234) 0) (= v_ArrVal_1436 v_arrayElimCell_109)))))) .cse21) (or (forall ((v_arrayElimCell_109 Int) (v_prenex_5 Int) (v_ArrVal_1434 Int) (v_ArrVal_1436 Int)) (let ((.cse237 (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse236 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse237))) (let ((.cse235 (+ v_ArrVal_1436 4)) (.cse238 (select (select .cse236 .cse9) (+ v_arrayElimCell_109 4)))) (or (= .cse235 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (= (select (select .cse236 v_prenex_5) (select .cse237 .cse235)) 0) (< v_arrayElimCell_109 0) (< v_ArrVal_1436 0) (= .cse235 |c_ULTIMATE.start_l2_insert_~list#1.offset|) (< .cse238 0) (< (select .cse12 .cse235) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436) (= (select (select .cse236 |c_ULTIMATE.start_l2_insert_~item~0#1.base|) .cse238) 0) (= v_ArrVal_1436 v_arrayElimCell_109)))))) .cse21) (or .cse13 .cse3 (and (forall ((v_ArrVal_1436 Int)) (let ((.cse239 (+ v_ArrVal_1436 4))) (or (= .cse239 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (< v_ArrVal_1436 0) (< (select .cse12 .cse239) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436) (forall ((v_ArrVal_1434 Int)) (let ((.cse242 (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse243 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse242))) (let ((.cse241 (select (select .cse243 .cse9) |c_ULTIMATE.start_l2_insert_~list#1.offset|)) (.cse240 (select .cse243 |c_ULTIMATE.start_l2_insert_~item~0#1.base|))) (or (= (select .cse240 .cse241) 0) (< .cse241 0) (= (select .cse240 (select .cse242 .cse239)) 0))))))))) (forall ((v_ArrVal_1436 Int)) (or (< v_ArrVal_1436 0) (forall ((v_ArrVal_1434 Int)) (let ((.cse248 (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse246 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse248))) (let ((.cse245 (select (select .cse246 .cse9) |c_ULTIMATE.start_l2_insert_~list#1.offset|)) (.cse244 (select .cse246 |c_ULTIMATE.start_l2_insert_~item~0#1.base|)) (.cse247 (select .cse248 (+ v_ArrVal_1436 4)))) (or (= (select .cse244 .cse245) 0) (< .cse245 0) (forall ((|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int)) (= (select (select .cse246 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) .cse247) 0)) (= (select .cse244 .cse247) 0) (< .cse247 0)))))) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436))) (forall ((v_ArrVal_1436 Int)) (let ((.cse249 (+ v_ArrVal_1436 4))) (or (= .cse249 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (< v_ArrVal_1436 0) (forall ((v_prenex_5 Int) (v_ArrVal_1434 Int)) (let ((.cse252 (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse250 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse252))) (let ((.cse251 (select (select .cse250 .cse9) |c_ULTIMATE.start_l2_insert_~list#1.offset|))) (or (= (select (select .cse250 |c_ULTIMATE.start_l2_insert_~item~0#1.base|) .cse251) 0) (= (select (select .cse250 v_prenex_5) (select .cse252 .cse249)) 0) (< .cse251 0)))))) (< (select .cse12 .cse249) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436)))) .cse174)) (or .cse93 (and (or .cse21 (and (forall ((v_ArrVal_1436 Int)) (let ((.cse253 (+ v_ArrVal_1436 4))) (or (= .cse253 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (< v_ArrVal_1436 0) (= .cse253 |c_ULTIMATE.start_l2_insert_~list#1.offset|) (forall ((v_arrayElimCell_109 Int) (v_arrayElimCell_110 Int) (v_ArrVal_1434 Int) (v_arrayElimCell_114 Int)) (let ((.cse256 (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse254 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse256))) (let ((.cse255 (select (select .cse254 .cse9) (+ v_arrayElimCell_109 4)))) (or (< v_arrayElimCell_109 0) (= (select (select .cse254 v_arrayElimCell_110) .cse255) 0) (< .cse255 0) (= (select (select .cse254 v_arrayElimCell_114) (select .cse256 .cse253)) 0) (= v_ArrVal_1436 v_arrayElimCell_109)))))) (< (select .cse12 .cse253) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436)))) (forall ((v_ArrVal_1436 Int)) (let ((.cse257 (+ v_ArrVal_1436 4))) (or (= .cse257 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (< v_ArrVal_1436 0) (= .cse257 |c_ULTIMATE.start_l2_insert_~list#1.offset|) (< (select .cse12 .cse257) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436) (forall ((v_arrayElimCell_109 Int) (v_arrayElimCell_110 Int) (v_ArrVal_1434 Int) (v_arrayElimCell_118 Int)) (let ((.cse259 (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse258 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse259))) (let ((.cse260 (select (select .cse258 .cse9) (+ v_arrayElimCell_109 4)))) (or (= (select (select .cse258 v_arrayElimCell_118) (select .cse259 .cse257)) 0) (< v_arrayElimCell_109 0) (= (select (select .cse258 v_arrayElimCell_110) .cse260) 0) (< .cse260 0) (= v_ArrVal_1436 v_arrayElimCell_109))))))))))) .cse230)) (forall ((v_ArrVal_1436 Int)) (let ((.cse261 (+ v_ArrVal_1436 4))) (or (= .cse261 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (< v_ArrVal_1436 0) (= .cse261 |c_ULTIMATE.start_l2_insert_~list#1.offset|) (forall ((v_arrayElimCell_109 Int) (v_arrayElimCell_110 Int) (v_ArrVal_1434 Int) (v_arrayElimCell_118 Int)) (let ((.cse263 (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse262 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse263)) (.cse265 (+ v_arrayElimCell_109 4))) (let ((.cse264 (select (select .cse262 .cse9) .cse265))) (or (= (select (select .cse262 v_arrayElimCell_118) (select .cse263 .cse261)) 0) (< v_arrayElimCell_109 0) (= (select (select .cse262 v_arrayElimCell_110) .cse264) 0) (< .cse264 0) (= |c_ULTIMATE.start_l2_insert_~list#1.offset| .cse265) (= v_ArrVal_1436 v_arrayElimCell_109)))))) (< (select .cse12 .cse261) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436)))) (or (forall ((v_arrayElimCell_109 Int) (v_prenex_5 Int) (v_ArrVal_1434 Int) (v_ArrVal_1436 Int)) (let ((.cse268 (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse267 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse268))) (let ((.cse266 (+ v_ArrVal_1436 4)) (.cse269 (select (select .cse267 .cse9) (+ v_arrayElimCell_109 4)))) (or (= .cse266 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (= (select (select .cse267 v_prenex_5) (select .cse268 .cse266)) 0) (< v_arrayElimCell_109 0) (< v_ArrVal_1436 0) (= .cse266 |c_ULTIMATE.start_l2_insert_~list#1.offset|) (< .cse269 0) (< (select .cse12 .cse266) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436) (= (select (select .cse267 |c_ULTIMATE.start_l2_insert_~item~0#1.base|) .cse269) 0)))))) .cse21) (or (forall ((v_arrayElimCell_109 Int) (v_prenex_5 Int) (v_arrayElimCell_110 Int) (v_ArrVal_1434 Int) (v_ArrVal_1436 Int)) (let ((.cse272 (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse271 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse272)) (.cse274 (+ v_arrayElimCell_109 4))) (let ((.cse273 (select (select .cse271 .cse9) .cse274)) (.cse270 (+ v_ArrVal_1436 4))) (or (= .cse270 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (= (select (select .cse271 v_prenex_5) (select .cse272 .cse270)) 0) (< v_arrayElimCell_109 0) (< v_ArrVal_1436 0) (= (select (select .cse271 v_arrayElimCell_110) .cse273) 0) (< .cse273 0) (= |c_ULTIMATE.start_l2_insert_~list#1.offset| .cse274) (< (select .cse12 .cse270) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436) (= v_ArrVal_1436 v_arrayElimCell_109)))))) .cse21) (or (and (or .cse21 (and (forall ((v_ArrVal_1436 Int)) (let ((.cse275 (+ v_ArrVal_1436 4))) (or (= .cse275 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (< v_ArrVal_1436 0) (forall ((v_arrayElimCell_109 Int) (v_arrayElimCell_110 Int) (v_ArrVal_1434 Int) (v_arrayElimCell_114 Int)) (let ((.cse279 (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse276 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse279)) (.cse278 (+ v_arrayElimCell_109 4))) (let ((.cse277 (select (select .cse276 .cse9) .cse278))) (or (< v_arrayElimCell_109 0) (= (select (select .cse276 v_arrayElimCell_110) .cse277) 0) (< .cse277 0) (= |c_ULTIMATE.start_l2_insert_~list#1.offset| .cse278) (= (select (select .cse276 v_arrayElimCell_114) (select .cse279 .cse275)) 0) (= v_ArrVal_1436 v_arrayElimCell_109)))))) (< (select .cse12 .cse275) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436)))) (forall ((v_ArrVal_1436 Int)) (let ((.cse280 (+ v_ArrVal_1436 4))) (or (= .cse280 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (forall ((v_arrayElimCell_109 Int) (v_arrayElimCell_110 Int) (v_ArrVal_1434 Int) (v_arrayElimCell_119 Int)) (let ((.cse284 (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse281 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse284)) (.cse283 (+ v_arrayElimCell_109 4))) (let ((.cse282 (select (select .cse281 .cse9) .cse283))) (or (< v_arrayElimCell_109 0) (= (select (select .cse281 v_arrayElimCell_110) .cse282) 0) (< .cse282 0) (= |c_ULTIMATE.start_l2_insert_~list#1.offset| .cse283) (= (select (select .cse281 v_arrayElimCell_119) (select .cse284 .cse280)) 0) (= v_ArrVal_1436 v_arrayElimCell_109)))))) (< v_ArrVal_1436 0) (< (select .cse12 .cse280) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436)))))) .cse198) .cse93) (forall ((v_ArrVal_1436 Int)) (let ((.cse285 (+ v_ArrVal_1436 4))) (or (= .cse285 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (forall ((v_arrayElimCell_109 Int) (v_ArrVal_1434 Int)) (let ((.cse288 (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse289 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse288))) (let ((.cse287 (select .cse289 |c_ULTIMATE.start_l2_insert_~item~0#1.base|)) (.cse286 (select (select .cse289 .cse9) (+ v_arrayElimCell_109 4)))) (or (< v_arrayElimCell_109 0) (< .cse286 0) (= (select .cse287 (select .cse288 .cse285)) 0) (= (select .cse287 .cse286) 0)))))) (< v_ArrVal_1436 0) (< (select .cse11 .cse285) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436)))) (forall ((v_ArrVal_1436 Int)) (or (< v_ArrVal_1436 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436) (forall ((v_arrayElimCell_109 Int)) (or (< v_arrayElimCell_109 0) (forall ((v_ArrVal_1434 Int)) (let ((.cse294 (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse291 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse294))) (let ((.cse292 (select .cse294 (+ v_ArrVal_1436 4))) (.cse293 (select .cse291 |c_ULTIMATE.start_l2_insert_~item~0#1.base|)) (.cse290 (select (select .cse291 .cse9) (+ v_arrayElimCell_109 4)))) (or (< .cse290 0) (forall ((|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int)) (= (select (select .cse291 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) .cse292) 0)) (= (select .cse293 .cse292) 0) (< .cse292 0) (= (select .cse293 .cse290) 0)))))))))) (or .cse21 (forall ((v_arrayElimCell_109 Int) (v_prenex_5 Int) (v_arrayElimCell_110 Int) (v_ArrVal_1434 Int) (v_ArrVal_1436 Int)) (let ((.cse297 (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse296 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse297)) (.cse299 (+ v_arrayElimCell_109 4))) (let ((.cse298 (select (select .cse296 .cse9) .cse299)) (.cse295 (+ v_ArrVal_1436 4))) (or (= .cse295 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (= (select (select .cse296 v_prenex_5) (select .cse297 .cse295)) 0) (< v_arrayElimCell_109 0) (< v_ArrVal_1436 0) (= (select (select .cse296 v_arrayElimCell_110) .cse298) 0) (= .cse295 |c_ULTIMATE.start_l2_insert_~list#1.offset|) (< .cse298 0) (= |c_ULTIMATE.start_l2_insert_~list#1.offset| .cse299) (< (select .cse12 .cse295) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436))))))) (or .cse3 (and (or .cse13 .cse27) (forall ((v_ArrVal_1436 Int)) (let ((.cse300 (+ v_ArrVal_1436 4))) (or (= .cse300 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (< v_ArrVal_1436 0) (forall ((v_arrayElimCell_109 Int) (v_arrayElimCell_110 Int) (v_ArrVal_1434 Int) (v_arrayElimCell_118 Int)) (let ((.cse302 (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse301 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse302))) (let ((.cse303 (select (select .cse301 .cse9) (+ v_arrayElimCell_109 4)))) (or (= (select (select .cse301 v_arrayElimCell_118) (select .cse302 .cse300)) 0) (< v_arrayElimCell_109 0) (= (select (select .cse301 v_arrayElimCell_110) .cse303) 0) (< .cse303 0) (= (select (select .cse301 |c_ULTIMATE.start_l2_insert_~item~0#1.base|) .cse303) 0) (= v_ArrVal_1436 v_arrayElimCell_109)))))) (= .cse300 |c_ULTIMATE.start_l2_insert_~list#1.offset|) (< (select .cse12 .cse300) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436)))) (or .cse13 .cse14) (forall ((v_ArrVal_1436 Int)) (let ((.cse304 (+ v_ArrVal_1436 4))) (or (= .cse304 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (forall ((v_arrayElimCell_109 Int) (v_prenex_5 Int) (v_arrayElimCell_110 Int) (v_ArrVal_1434 Int)) (let ((.cse306 (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse305 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse306)) (.cse308 (+ v_arrayElimCell_109 4))) (let ((.cse307 (select (select .cse305 .cse9) .cse308))) (or (= (select (select .cse305 v_prenex_5) (select .cse306 .cse304)) 0) (< v_arrayElimCell_109 0) (= (select (select .cse305 v_arrayElimCell_110) .cse307) 0) (< .cse307 0) (= |c_ULTIMATE.start_l2_insert_~list#1.offset| .cse308) (= v_ArrVal_1436 v_arrayElimCell_109)))))) (< v_ArrVal_1436 0) (< (select .cse12 .cse304) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436)))) (forall ((v_ArrVal_1436 Int)) (let ((.cse309 (+ v_ArrVal_1436 4))) (or (= .cse309 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (< v_ArrVal_1436 0) (< (select .cse12 .cse309) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436) (forall ((v_arrayElimCell_109 Int) (v_prenex_5 Int) (v_arrayElimCell_110 Int) (v_ArrVal_1434 Int)) (let ((.cse311 (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse310 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse311))) (let ((.cse312 (select (select .cse310 .cse9) (+ v_arrayElimCell_109 4)))) (or (= (select (select .cse310 v_prenex_5) (select .cse311 .cse309)) 0) (< v_arrayElimCell_109 0) (= (select (select .cse310 v_arrayElimCell_110) .cse312) 0) (< .cse312 0) (= (select (select .cse310 |c_ULTIMATE.start_l2_insert_~item~0#1.base|) .cse312) 0) (= v_ArrVal_1436 v_arrayElimCell_109))))))))))) (or (forall ((v_arrayElimCell_109 Int) (|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_ArrVal_1434 Int)) (let ((.cse313 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434)))) (let ((.cse314 (select (select .cse313 .cse9) (+ v_arrayElimCell_109 4)))) (or (< v_arrayElimCell_109 0) (= (select (select .cse313 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) v_ArrVal_1434) 0) (< v_ArrVal_1434 0) (< .cse314 0) (= (select (select .cse313 |c_ULTIMATE.start_l2_insert_~item~0#1.base|) .cse314) 0))))) .cse2) (or (and .cse315 (forall ((v_ArrVal_1436 Int)) (let ((.cse320 (+ v_ArrVal_1436 4))) (or (forall ((v_arrayElimCell_109 Int) (|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_arrayElimCell_110 Int) (v_arrayElimCell_115 Int) (v_ArrVal_1434 Int)) (let ((.cse319 (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse316 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse319))) (let ((.cse317 (select (select .cse316 .cse9) (+ v_arrayElimCell_109 4))) (.cse318 (select .cse319 .cse320))) (or (< v_arrayElimCell_109 0) (= (select (select .cse316 v_arrayElimCell_110) .cse317) 0) (< .cse317 0) (= (select (select .cse316 v_arrayElimCell_115) .cse318) 0) (< .cse318 0) (= (select (select .cse316 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) .cse318) 0)))))) (< v_ArrVal_1436 0) (= .cse320 |c_ULTIMATE.start_l2_insert_~list#1.offset|) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436)))) (or (forall ((v_arrayElimCell_109 Int) (|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_arrayElimCell_110 Int) (v_ArrVal_1434 Int)) (let ((.cse321 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434)))) (let ((.cse322 (select (select .cse321 .cse9) (+ v_arrayElimCell_109 4)))) (or (< v_arrayElimCell_109 0) (= (select (select .cse321 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) v_ArrVal_1434) 0) (= (select (select .cse321 v_arrayElimCell_110) .cse322) 0) (< v_ArrVal_1434 0) (< .cse322 0))))) .cse2) (forall ((v_ArrVal_1436 Int)) (or (< v_ArrVal_1436 0) (forall ((v_arrayElimCell_109 Int)) (or (forall ((|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_arrayElimCell_110 Int) (v_ArrVal_1434 Int)) (let ((.cse326 (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse323 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse326))) (let ((.cse324 (select (select .cse323 .cse9) (+ v_arrayElimCell_109 4))) (.cse325 (select .cse326 (+ v_ArrVal_1436 4)))) (or (= (select (select .cse323 v_arrayElimCell_110) .cse324) 0) (< .cse324 0) (= (select (select .cse323 |c_ULTIMATE.start_l2_insert_~item~0#1.base|) .cse325) 0) (< .cse325 0) (= (select (select .cse323 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) .cse325) 0)))))) (< v_arrayElimCell_109 0))) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436))) (forall ((v_ArrVal_1436 Int)) (let ((.cse327 (+ v_ArrVal_1436 4))) (or (= .cse327 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (< v_ArrVal_1436 0) (< (select .cse11 .cse327) 0) (forall ((v_arrayElimCell_109 Int) (v_arrayElimCell_110 Int) (v_ArrVal_1434 Int)) (let ((.cse330 (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse328 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse330))) (let ((.cse329 (select (select .cse328 .cse9) (+ v_arrayElimCell_109 4)))) (or (< v_arrayElimCell_109 0) (= (select (select .cse328 v_arrayElimCell_110) .cse329) 0) (< .cse329 0) (= (select (select .cse328 |c_ULTIMATE.start_l2_insert_~item~0#1.base|) (select .cse330 .cse327)) 0)))))) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436)))) (or .cse21 (and (forall ((v_ArrVal_1436 Int)) (let ((.cse331 (+ v_ArrVal_1436 4))) (or (= .cse331 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (< v_ArrVal_1436 0) (forall ((v_arrayElimCell_109 Int) (v_arrayElimCell_110 Int) (v_ArrVal_1434 Int) (v_arrayElimCell_114 Int)) (let ((.cse334 (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse332 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse334))) (let ((.cse333 (select (select .cse332 .cse9) (+ v_arrayElimCell_109 4)))) (or (< v_arrayElimCell_109 0) (= (select (select .cse332 v_arrayElimCell_110) .cse333) 0) (< .cse333 0) (= (select (select .cse332 v_arrayElimCell_114) (select .cse334 .cse331)) 0)))))) (< (select .cse12 .cse331) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436)))) (forall ((v_ArrVal_1436 Int)) (let ((.cse335 (+ v_ArrVal_1436 4))) (or (= .cse335 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (< v_ArrVal_1436 0) (forall ((v_arrayElimCell_109 Int) (v_arrayElimCell_110 Int) (v_ArrVal_1434 Int)) (let ((.cse338 (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse339 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse338))) (let ((.cse337 (select (select .cse339 .cse9) (+ v_arrayElimCell_109 4))) (.cse336 (select .cse339 v_arrayElimCell_110))) (or (< v_arrayElimCell_109 0) (= (select .cse336 .cse337) 0) (< .cse337 0) (= (select .cse336 (select .cse338 .cse335)) 0)))))) (< (select .cse12 .cse335) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436)))) (forall ((v_ArrVal_1436 Int)) (or (< v_ArrVal_1436 0) (forall ((|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_ArrVal_1434 Int)) (let ((.cse344 (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse343 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse344)) (.cse342 (select .cse344 (+ v_ArrVal_1436 4)))) (or (forall ((v_arrayElimCell_109 Int)) (let ((.cse340 (select (select .cse343 .cse9) (+ v_arrayElimCell_109 4)))) (or (< v_arrayElimCell_109 0) (< .cse340 0) (forall ((v_arrayElimCell_110 Int)) (let ((.cse341 (select .cse343 v_arrayElimCell_110))) (or (= (select .cse341 .cse340) 0) (= (select .cse341 .cse342) 0))))))) (< .cse342 0) (= (select (select .cse343 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) .cse342) 0))))) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436)))))) .cse93) (forall ((v_ArrVal_1436 Int)) (or (< v_ArrVal_1436 0) (forall ((v_arrayElimCell_109 Int)) (let ((.cse345 (+ v_arrayElimCell_109 4))) (or (< v_arrayElimCell_109 0) (= |c_ULTIMATE.start_l2_insert_~list#1.offset| .cse345) (forall ((v_arrayElimCell_110 Int) (v_ArrVal_1434 Int)) (let ((.cse349 (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse346 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse349))) (let ((.cse347 (select (select .cse346 .cse9) .cse345)) (.cse348 (select .cse349 (+ v_ArrVal_1436 4)))) (or (= (select (select .cse346 v_arrayElimCell_110) .cse347) 0) (< .cse347 0) (forall ((|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int)) (= (select (select .cse346 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) .cse348) 0)) (= (select (select .cse346 |c_ULTIMATE.start_l2_insert_~item~0#1.base|) .cse348) 0) (< .cse348 0)))))) (= v_ArrVal_1436 v_arrayElimCell_109)))) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436))) (forall ((v_ArrVal_1436 Int)) (let ((.cse350 (+ v_ArrVal_1436 4))) (or (< v_ArrVal_1436 0) (= .cse350 |c_ULTIMATE.start_l2_insert_~list#1.offset|) (forall ((|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_ArrVal_1434 Int)) (let ((.cse356 (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse355 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse356)) (.cse354 (select .cse356 .cse350))) (or (forall ((v_arrayElimCell_109 Int)) (let ((.cse352 (+ v_arrayElimCell_109 4))) (let ((.cse351 (select (select .cse355 .cse9) .cse352))) (or (< v_arrayElimCell_109 0) (< .cse351 0) (= |c_ULTIMATE.start_l2_insert_~list#1.offset| .cse352) (forall ((v_arrayElimCell_110 Int)) (let ((.cse353 (select .cse355 v_arrayElimCell_110))) (or (= (select .cse353 .cse351) 0) (= (select .cse353 .cse354) 0)))))))) (< .cse354 0) (= (select (select .cse355 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) .cse354) 0))))) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436)))) (or (and .cse315 (or (forall ((v_arrayElimCell_109 Int) (v_arrayElimCell_110 Int) (v_ArrVal_1434 Int) (v_arrayElimCell_114 Int) (v_ArrVal_1436 Int)) (let ((.cse360 (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse358 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse360))) (let ((.cse359 (select (select .cse358 .cse9) (+ v_arrayElimCell_109 4))) (.cse357 (+ v_ArrVal_1436 4))) (or (= .cse357 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (< v_arrayElimCell_109 0) (< v_ArrVal_1436 0) (= (select (select .cse358 v_arrayElimCell_110) .cse359) 0) (= .cse357 |c_ULTIMATE.start_l2_insert_~list#1.offset|) (< .cse359 0) (< (select .cse12 .cse357) 0) (= (select (select .cse358 v_arrayElimCell_114) (select .cse360 .cse357)) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436)))))) .cse21)) .cse93))) .cse37) (forall ((v_ArrVal_1436 Int)) (let ((.cse374 (+ v_ArrVal_1436 4))) (or (= .cse374 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (< v_ArrVal_1436 0) (forall ((v_arrayElimCell_109 Int) (|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_ArrVal_1434 Int) (v_arrayElimCell_118 Int)) (let ((.cse376 (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse375 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse376)) (.cse378 (+ v_arrayElimCell_109 4))) (let ((.cse377 (select (select .cse375 .cse9) .cse378))) (or (= (select (select .cse375 v_arrayElimCell_118) (select .cse376 .cse374)) 0) (< v_arrayElimCell_109 0) (< .cse377 0) (= |c_ULTIMATE.start_l2_insert_~list#1.offset| .cse378) (= (select (select .cse375 |c_ULTIMATE.start_l2_insert_~item~0#1.base|) .cse377) 0) (= (select (select .cse375 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) .cse377) 0) (= v_ArrVal_1436 v_arrayElimCell_109)))))) (= .cse374 |c_ULTIMATE.start_l2_insert_~list#1.offset|) (< (select .cse12 .cse374) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436)))) (or (and .cse379 (forall ((v_arrayElimCell_109 Int)) (let ((.cse382 (+ v_arrayElimCell_109 4))) (or (forall ((v_ArrVal_1434 Int) (v_arrayElimCell_127 Int)) (let ((.cse381 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434)))) (let ((.cse380 (select (select .cse381 .cse9) .cse382))) (or (< .cse380 0) (= (select (select .cse381 v_arrayElimCell_127) .cse380) 0) (= (select (select .cse381 |c_ULTIMATE.start_l2_insert_~item~0#1.base|) .cse380) 0))))) (= |c_ULTIMATE.start_l1_insert_~item~1#1.offset| .cse382) (< v_arrayElimCell_109 0)))) (or .cse13 .cse383 .cse3 .cse37) (or (and (or .cse93 (forall ((v_arrayElimCell_109 Int) (v_ArrVal_1434 Int) (v_arrayElimCell_127 Int)) (let ((.cse385 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434)))) (let ((.cse384 (select (select .cse385 .cse9) (+ v_arrayElimCell_109 4)))) (or (< v_arrayElimCell_109 0) (< .cse384 0) (= (select (select .cse385 v_arrayElimCell_127) .cse384) 0)))))) (forall ((v_arrayElimCell_109 Int)) (let ((.cse386 (+ v_arrayElimCell_109 4))) (or (< v_arrayElimCell_109 0) (= |c_ULTIMATE.start_l2_insert_~list#1.offset| .cse386) (forall ((v_ArrVal_1434 Int) (v_arrayElimCell_127 Int)) (let ((.cse388 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434)))) (let ((.cse387 (select (select .cse388 .cse9) .cse386))) (or (< .cse387 0) (= (select (select .cse388 v_arrayElimCell_127) .cse387) 0)))))))) (forall ((v_arrayElimCell_109 Int)) (or (forall ((v_ArrVal_1434 Int)) (let ((.cse389 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434)))) (let ((.cse390 (select (select .cse389 .cse9) (+ v_arrayElimCell_109 4)))) (or (forall ((v_arrayElimCell_127 Int)) (= (select (select .cse389 v_arrayElimCell_127) .cse390) 0)) (< .cse390 0) (= (select (select .cse389 |c_ULTIMATE.start_l2_insert_~item~0#1.base|) .cse390) 0))))) (< v_arrayElimCell_109 0))) .cse391) .cse37) (or (forall ((v_arrayElimCell_109 Int) (v_ArrVal_1434 Int) (v_arrayElimCell_127 Int)) (let ((.cse394 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (.cse392 (+ v_arrayElimCell_109 4))) (let ((.cse393 (select (select .cse394 .cse9) .cse392))) (or (= |c_ULTIMATE.start_l1_insert_~item~1#1.offset| .cse392) (< v_arrayElimCell_109 0) (< .cse393 0) (= (select (select .cse394 v_arrayElimCell_127) .cse393) 0))))) .cse93) (forall ((v_arrayElimCell_109 Int)) (or (< v_arrayElimCell_109 0) (forall ((|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_ArrVal_1434 Int) (v_arrayElimCell_127 Int)) (let ((.cse396 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434)))) (let ((.cse395 (select (select .cse396 .cse9) (+ v_arrayElimCell_109 4)))) (or (< .cse395 0) (= (select (select .cse396 v_arrayElimCell_127) .cse395) 0) (= (select (select .cse396 |c_ULTIMATE.start_l2_insert_~item~0#1.base|) .cse395) 0) (= (select (select .cse396 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) .cse395) 0))))))) (forall ((v_arrayElimCell_109 Int)) (let ((.cse397 (+ v_arrayElimCell_109 4))) (or (< v_arrayElimCell_109 0) (= |c_ULTIMATE.start_l2_insert_~list#1.offset| .cse397) (forall ((|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_ArrVal_1434 Int) (v_arrayElimCell_127 Int)) (let ((.cse399 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434)))) (let ((.cse398 (select (select .cse399 .cse9) .cse397))) (or (< .cse398 0) (= (select (select .cse399 v_arrayElimCell_127) .cse398) 0) (= (select (select .cse399 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) .cse398) 0)))))))) (or (forall ((v_arrayElimCell_109 Int) (|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_ArrVal_1434 Int) (v_arrayElimCell_127 Int)) (let ((.cse401 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434)))) (let ((.cse400 (select (select .cse401 .cse9) (+ v_arrayElimCell_109 4)))) (or (< v_arrayElimCell_109 0) (< .cse400 0) (= (select (select .cse401 v_arrayElimCell_127) .cse400) 0) (= (select (select .cse401 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) .cse400) 0))))) .cse93) (forall ((v_arrayElimCell_109 Int)) (let ((.cse402 (+ v_arrayElimCell_109 4))) (or (= |c_ULTIMATE.start_l1_insert_~item~1#1.offset| .cse402) (< v_arrayElimCell_109 0) (= |c_ULTIMATE.start_l2_insert_~list#1.offset| .cse402) (forall ((v_ArrVal_1434 Int) (v_arrayElimCell_127 Int)) (let ((.cse404 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434)))) (let ((.cse403 (select (select .cse404 .cse9) .cse402))) (or (< .cse403 0) (= (select (select .cse404 v_arrayElimCell_127) .cse403) 0)))))))) .cse405 (or .cse406 .cse13 .cse3 .cse15 .cse37) (or .cse13 .cse383 .cse3 .cse15)) .cse60) (forall ((v_ArrVal_1436 Int)) (or (forall ((v_ArrVal_1434 Int)) (let ((.cse412 (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse411 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse412))) (let ((.cse408 (select .cse412 (+ v_ArrVal_1436 4))) (.cse407 (select .cse411 |c_ULTIMATE.start_l2_insert_~item~0#1.base|))) (or (= (select .cse407 .cse408) 0) (< .cse408 0) (forall ((v_arrayElimCell_109 Int)) (let ((.cse409 (select (select .cse411 .cse9) (+ v_arrayElimCell_109 4)))) (or (< v_arrayElimCell_109 0) (< .cse409 0) (forall ((|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int)) (let ((.cse410 (select .cse411 |ULTIMATE.start_l1_insert_#t~mem13#1.base|))) (or (= (select .cse410 .cse408) 0) (= (select .cse410 .cse409) 0)))) (= (select .cse407 .cse409) 0))))))))) (< v_ArrVal_1436 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436))) (or (and .cse95 (or .cse413 .cse21 .cse37)) .cse93) (or (and (or (forall ((v_arrayElimCell_109 Int) (v_arrayElimCell_110 Int) (v_ArrVal_1434 Int) (v_arrayElimCell_114 Int) (v_ArrVal_1436 Int)) (let ((.cse418 (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse416 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse418)) (.cse415 (+ v_arrayElimCell_109 4))) (let ((.cse417 (select (select .cse416 .cse9) .cse415)) (.cse414 (+ v_ArrVal_1436 4))) (or (= .cse414 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (= |c_ULTIMATE.start_l1_insert_~item~1#1.offset| .cse415) (< v_arrayElimCell_109 0) (< v_ArrVal_1436 0) (= (select (select .cse416 v_arrayElimCell_110) .cse417) 0) (= .cse414 |c_ULTIMATE.start_l2_insert_~list#1.offset|) (< .cse417 0) (= |c_ULTIMATE.start_l2_insert_~list#1.offset| .cse415) (< (select .cse12 .cse414) 0) (= (select (select .cse416 v_arrayElimCell_114) (select .cse418 .cse414)) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436) (= v_ArrVal_1436 v_arrayElimCell_109)))))) .cse21 .cse37) .cse144) .cse93) (or .cse21 (forall ((v_arrayElimCell_109 Int) (v_prenex_5 Int) (v_arrayElimCell_110 Int) (v_ArrVal_1434 Int) (v_ArrVal_1436 Int)) (let ((.cse422 (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse421 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse422)) (.cse420 (+ v_arrayElimCell_109 4))) (let ((.cse423 (select (select .cse421 .cse9) .cse420)) (.cse419 (+ v_ArrVal_1436 4))) (or (= .cse419 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (= |c_ULTIMATE.start_l1_insert_~item~1#1.offset| .cse420) (= (select (select .cse421 v_prenex_5) (select .cse422 .cse419)) 0) (< v_arrayElimCell_109 0) (< v_ArrVal_1436 0) (= (select (select .cse421 v_arrayElimCell_110) .cse423) 0) (< .cse423 0) (= |c_ULTIMATE.start_l2_insert_~list#1.offset| .cse420) (< (select .cse12 .cse419) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436) (= v_ArrVal_1436 v_arrayElimCell_109)))))) .cse37) (or (and .cse424 .cse425) .cse93) (or .cse21 (forall ((v_arrayElimCell_109 Int) (|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_prenex_5 Int) (v_ArrVal_1434 Int) (v_ArrVal_1436 Int)) (let ((.cse428 (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse427 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse428))) (let ((.cse426 (+ v_ArrVal_1436 4)) (.cse429 (select (select .cse427 .cse9) (+ v_arrayElimCell_109 4)))) (or (= .cse426 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (= (select (select .cse427 v_prenex_5) (select .cse428 .cse426)) 0) (< v_arrayElimCell_109 0) (< v_ArrVal_1436 0) (< .cse429 0) (< (select .cse12 .cse426) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436) (= (select (select .cse427 |c_ULTIMATE.start_l2_insert_~item~0#1.base|) .cse429) 0) (= (select (select .cse427 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) .cse429) 0)))))) .cse37) (or .cse93 (and .cse186 .cse168 .cse424 .cse425 .cse187 .cse169 .cse94 .cse430 .cse95 (or (and .cse431 (forall ((v_ArrVal_1436 Int)) (let ((.cse432 (+ v_ArrVal_1436 4))) (or (= .cse432 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (< v_ArrVal_1436 0) (forall ((|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_ArrVal_1434 Int)) (let ((.cse437 (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse435 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse437))) (let ((.cse434 (select (select .cse435 .cse9) |c_ULTIMATE.start_l1_insert_~item~1#1.offset|)) (.cse433 (select .cse435 |ULTIMATE.start_l1_insert_#t~mem13#1.base|)) (.cse436 (select .cse437 .cse432))) (or (= (select .cse433 .cse434) 0) (< .cse434 0) (= (select (select .cse435 |c_ULTIMATE.start_l2_insert_~item~0#1.base|) .cse436) 0) (= (select .cse433 .cse436) 0)))))) (< (select .cse12 .cse432) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436)))) (forall ((v_ArrVal_1436 Int)) (let ((.cse438 (+ v_ArrVal_1436 4))) (or (= .cse438 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (< v_ArrVal_1436 0) (forall ((|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_ArrVal_1434 Int)) (let ((.cse441 (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse439 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse441))) (let ((.cse440 (select (select .cse439 .cse9) |c_ULTIMATE.start_l1_insert_~item~1#1.offset|))) (or (= (select (select .cse439 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) .cse440) 0) (< .cse440 0) (= (select (select .cse439 |c_ULTIMATE.start_l2_insert_~item~0#1.base|) (select .cse441 .cse438)) 0)))))) (< (select .cse12 .cse438) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436)))) (forall ((v_ArrVal_1436 Int)) (let ((.cse442 (+ v_ArrVal_1436 4))) (or (= .cse442 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (forall ((|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_ArrVal_1434 Int) (v_arrayElimCell_119 Int)) (let ((.cse445 (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse443 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse445))) (let ((.cse444 (select (select .cse443 .cse9) |c_ULTIMATE.start_l1_insert_~item~1#1.offset|))) (or (= (select (select .cse443 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) .cse444) 0) (= (select (select .cse443 v_arrayElimCell_119) (select .cse445 .cse442)) 0) (< .cse444 0)))))) (< v_ArrVal_1436 0) (< (select .cse12 .cse442) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436))))) .cse0 .cse15 .cse2) .cse446)) (or (forall ((v_arrayElimCell_109 Int) (v_prenex_5 Int) (v_arrayElimCell_110 Int) (v_ArrVal_1434 Int) (v_ArrVal_1436 Int)) (let ((.cse450 (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse449 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse450)) (.cse448 (+ v_arrayElimCell_109 4))) (let ((.cse451 (select (select .cse449 .cse9) .cse448)) (.cse447 (+ v_ArrVal_1436 4))) (or (= .cse447 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (= |c_ULTIMATE.start_l1_insert_~item~1#1.offset| .cse448) (= (select (select .cse449 v_prenex_5) (select .cse450 .cse447)) 0) (< v_arrayElimCell_109 0) (< v_ArrVal_1436 0) (= (select (select .cse449 v_arrayElimCell_110) .cse451) 0) (= .cse447 |c_ULTIMATE.start_l2_insert_~list#1.offset|) (< .cse451 0) (= |c_ULTIMATE.start_l2_insert_~list#1.offset| .cse448) (< (select .cse12 .cse447) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436)))))) .cse21 .cse37) (or (let ((.cse468 (or (forall ((v_arrayElimCell_109 Int) (|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_arrayElimCell_110 Int) (v_ArrVal_1434 Int)) (let ((.cse492 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (.cse491 (+ v_arrayElimCell_109 4))) (let ((.cse493 (select (select .cse492 .cse9) .cse491))) (or (= |c_ULTIMATE.start_l1_insert_~item~1#1.offset| .cse491) (< v_arrayElimCell_109 0) (= (select (select .cse492 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) v_ArrVal_1434) 0) (= (select (select .cse492 v_arrayElimCell_110) .cse493) 0) (< v_ArrVal_1434 0) (< .cse493 0))))) .cse2))) (and (or (and (forall ((v_ArrVal_1436 Int)) (let ((.cse452 (+ v_ArrVal_1436 4))) (or (< v_ArrVal_1436 0) (= .cse452 |c_ULTIMATE.start_l2_insert_~list#1.offset|) (forall ((v_arrayElimCell_109 Int) (|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_arrayElimCell_110 Int) (v_arrayElimCell_115 Int) (v_ArrVal_1434 Int)) (let ((.cse457 (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse454 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse457)) (.cse453 (+ v_arrayElimCell_109 4))) (let ((.cse455 (select (select .cse454 .cse9) .cse453)) (.cse456 (select .cse457 .cse452))) (or (= |c_ULTIMATE.start_l1_insert_~item~1#1.offset| .cse453) (< v_arrayElimCell_109 0) (= (select (select .cse454 v_arrayElimCell_110) .cse455) 0) (< .cse455 0) (= (select (select .cse454 v_arrayElimCell_115) .cse456) 0) (< .cse456 0) (= (select (select .cse454 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) .cse456) 0)))))) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436)))) (forall ((v_ArrVal_1436 Int)) (let ((.cse458 (+ v_ArrVal_1436 4))) (or (= .cse458 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (< v_ArrVal_1436 0) (= .cse458 |c_ULTIMATE.start_l2_insert_~list#1.offset|) (< (select .cse12 .cse458) 0) (forall ((v_arrayElimCell_109 Int) (v_arrayElimCell_110 Int) (v_arrayElimCell_115 Int) (v_ArrVal_1434 Int)) (let ((.cse462 (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse460 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse462)) (.cse459 (+ v_arrayElimCell_109 4))) (let ((.cse461 (select (select .cse460 .cse9) .cse459))) (or (= |c_ULTIMATE.start_l1_insert_~item~1#1.offset| .cse459) (< v_arrayElimCell_109 0) (= (select (select .cse460 v_arrayElimCell_110) .cse461) 0) (< .cse461 0) (= (select (select .cse460 v_arrayElimCell_115) (select .cse462 .cse458)) 0)))))) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436)))) (forall ((v_ArrVal_1436 Int)) (or (< v_ArrVal_1436 0) (forall ((v_arrayElimCell_109 Int)) (let ((.cse467 (+ v_arrayElimCell_109 4))) (or (forall ((|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_arrayElimCell_110 Int) (v_ArrVal_1434 Int)) (let ((.cse466 (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse463 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse466))) (let ((.cse464 (select (select .cse463 .cse9) .cse467)) (.cse465 (select .cse466 (+ v_ArrVal_1436 4)))) (or (= (select (select .cse463 v_arrayElimCell_110) .cse464) 0) (< .cse464 0) (= (select (select .cse463 |c_ULTIMATE.start_l2_insert_~item~0#1.base|) .cse465) 0) (< .cse465 0) (= (select (select .cse463 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) .cse465) 0)))))) (= |c_ULTIMATE.start_l1_insert_~item~1#1.offset| .cse467) (< v_arrayElimCell_109 0)))) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436))) .cse468 (forall ((v_ArrVal_1436 Int)) (let ((.cse469 (+ v_ArrVal_1436 4))) (or (= .cse469 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (< v_ArrVal_1436 0) (< (select .cse11 .cse469) 0) (forall ((v_arrayElimCell_109 Int) (v_arrayElimCell_110 Int) (v_ArrVal_1434 Int)) (let ((.cse473 (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse471 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse473)) (.cse470 (+ v_arrayElimCell_109 4))) (let ((.cse472 (select (select .cse471 .cse9) .cse470))) (or (= |c_ULTIMATE.start_l1_insert_~item~1#1.offset| .cse470) (< v_arrayElimCell_109 0) (= (select (select .cse471 v_arrayElimCell_110) .cse472) 0) (< .cse472 0) (= (select (select .cse471 |c_ULTIMATE.start_l2_insert_~item~0#1.base|) (select .cse473 .cse469)) 0)))))) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436))))) .cse37) (or (and .cse468 (or (forall ((v_arrayElimCell_109 Int) (v_arrayElimCell_110 Int) (v_ArrVal_1434 Int) (v_arrayElimCell_114 Int) (v_ArrVal_1436 Int)) (let ((.cse478 (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse476 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse478)) (.cse475 (+ v_arrayElimCell_109 4))) (let ((.cse477 (select (select .cse476 .cse9) .cse475)) (.cse474 (+ v_ArrVal_1436 4))) (or (= .cse474 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (= |c_ULTIMATE.start_l1_insert_~item~1#1.offset| .cse475) (< v_arrayElimCell_109 0) (< v_ArrVal_1436 0) (= (select (select .cse476 v_arrayElimCell_110) .cse477) 0) (< .cse477 0) (< (select .cse12 .cse474) 0) (= (select (select .cse476 v_arrayElimCell_114) (select .cse478 .cse474)) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436)))))) .cse37) (forall ((v_ArrVal_1436 Int)) (let ((.cse479 (+ v_ArrVal_1436 4))) (or (= .cse479 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (forall ((v_arrayElimCell_109 Int) (v_arrayElimCell_110 Int) (v_ArrVal_1434 Int)) (let ((.cse483 (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse484 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse483)) (.cse480 (+ v_arrayElimCell_109 4))) (let ((.cse482 (select (select .cse484 .cse9) .cse480)) (.cse481 (select .cse484 v_arrayElimCell_110))) (or (= |c_ULTIMATE.start_l1_insert_~item~1#1.offset| .cse480) (< v_arrayElimCell_109 0) (= (select .cse481 .cse482) 0) (< .cse482 0) (= (select .cse481 (select .cse483 .cse479)) 0)))))) (< v_ArrVal_1436 0) (< (select .cse12 .cse479) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436)))) (forall ((v_ArrVal_1436 Int)) (or (forall ((|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_ArrVal_1434 Int)) (let ((.cse490 (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse489 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse490)) (.cse488 (select .cse490 (+ v_ArrVal_1436 4)))) (or (forall ((v_arrayElimCell_109 Int)) (let ((.cse485 (+ v_arrayElimCell_109 4))) (let ((.cse486 (select (select .cse489 .cse9) .cse485))) (or (= |c_ULTIMATE.start_l1_insert_~item~1#1.offset| .cse485) (< v_arrayElimCell_109 0) (< .cse486 0) (forall ((v_arrayElimCell_110 Int)) (let ((.cse487 (select .cse489 v_arrayElimCell_110))) (or (= (select .cse487 .cse486) 0) (= (select .cse487 .cse488) 0)))))))) (< .cse488 0) (= (select (select .cse489 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) .cse488) 0))))) (< v_ArrVal_1436 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436)))) .cse21))) .cse93) (or (and .cse187 .cse430) .cse93) (or .cse13 .cse3 (let ((.cse506 (not .cse15))) (and (or (forall ((|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_prenex_5 Int) (v_ArrVal_1434 Int) (v_ArrVal_1436 Int)) (let ((.cse497 (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse494 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse497))) (let ((.cse496 (+ v_ArrVal_1436 4)) (.cse495 (select (select .cse494 .cse9) |c_ULTIMATE.start_l2_insert_~list#1.offset|))) (or (= (select (select .cse494 |c_ULTIMATE.start_l2_insert_~item~0#1.base|) .cse495) 0) (= .cse496 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (= (select (select .cse494 v_prenex_5) (select .cse497 .cse496)) 0) (< v_ArrVal_1436 0) (< .cse495 0) (< (select .cse12 .cse496) 0) (= (select (select .cse494 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) .cse495) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436)))))) .cse21) (forall ((v_ArrVal_1436 Int)) (let ((.cse498 (+ v_ArrVal_1436 4))) (or (= .cse498 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (forall ((|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_ArrVal_1434 Int)) (let ((.cse501 (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse502 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse501))) (let ((.cse499 (select .cse502 |c_ULTIMATE.start_l2_insert_~item~0#1.base|)) (.cse500 (select (select .cse502 .cse9) |c_ULTIMATE.start_l2_insert_~list#1.offset|))) (or (= (select .cse499 .cse500) 0) (< .cse500 0) (= (select .cse499 (select .cse501 .cse498)) 0) (= (select (select .cse502 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) .cse500) 0)))))) (< v_ArrVal_1436 0) (< (select .cse11 .cse498) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436)))) (or (and (forall ((|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_ArrVal_1434 Int)) (let ((.cse503 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434)))) (let ((.cse505 (select .cse503 |ULTIMATE.start_l1_insert_#t~mem13#1.base|)) (.cse504 (select (select .cse503 .cse9) |c_ULTIMATE.start_l2_insert_~list#1.offset|))) (or (= (select (select .cse503 |c_ULTIMATE.start_l2_insert_~item~0#1.base|) .cse504) 0) (= (select .cse505 v_ArrVal_1434) 0) (< .cse504 0) (< v_ArrVal_1434 0) (= (select .cse505 .cse504) 0))))) (or .cse506 .cse0 .cse53)) .cse2) (forall ((v_ArrVal_1436 Int)) (or (< v_ArrVal_1436 0) (forall ((v_ArrVal_1434 Int)) (let ((.cse512 (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse511 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse512))) (let ((.cse508 (select (select .cse511 .cse9) |c_ULTIMATE.start_l2_insert_~list#1.offset|)) (.cse507 (select .cse511 |c_ULTIMATE.start_l2_insert_~item~0#1.base|)) (.cse510 (select .cse512 (+ v_ArrVal_1436 4)))) (or (= (select .cse507 .cse508) 0) (< .cse508 0) (forall ((|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int)) (let ((.cse509 (select .cse511 |ULTIMATE.start_l1_insert_#t~mem13#1.base|))) (or (= (select .cse509 .cse508) 0) (= (select .cse509 .cse510) 0)))) (= (select .cse507 .cse510) 0) (< .cse510 0)))))) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436))) (or .cse506 (and (forall ((v_ArrVal_1436 Int)) (let ((.cse513 (+ v_ArrVal_1436 4))) (or (= .cse513 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (forall ((|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_ArrVal_1434 Int)) (let ((.cse516 (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse515 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse516))) (let ((.cse514 (select (select .cse515 .cse9) |c_ULTIMATE.start_l2_insert_~list#1.offset|))) (or (< .cse514 0) (= (select (select .cse515 |c_ULTIMATE.start_l2_insert_~item~0#1.base|) (select .cse516 .cse513)) 0) (= (select (select .cse515 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) .cse514) 0)))))) (< v_ArrVal_1436 0) (< (select .cse12 .cse513) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436)))) (forall ((v_ArrVal_1436 Int)) (or (forall ((v_ArrVal_1434 Int)) (let ((.cse521 (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse520 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse521))) (let ((.cse517 (select (select .cse520 .cse9) |c_ULTIMATE.start_l2_insert_~list#1.offset|)) (.cse519 (select .cse521 (+ v_ArrVal_1436 4)))) (or (< .cse517 0) (forall ((|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int)) (let ((.cse518 (select .cse520 |ULTIMATE.start_l1_insert_#t~mem13#1.base|))) (or (= (select .cse518 .cse517) 0) (= (select .cse518 .cse519) 0)))) (= (select (select .cse520 |c_ULTIMATE.start_l2_insert_~item~0#1.base|) .cse519) 0) (< .cse519 0)))))) (< v_ArrVal_1436 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436)))) .cse0)))) (or .cse93 (and (or (and (forall ((v_ArrVal_1436 Int)) (let ((.cse522 (+ v_ArrVal_1436 4))) (or (= .cse522 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (< v_ArrVal_1436 0) (= .cse522 |c_ULTIMATE.start_l2_insert_~list#1.offset|) (< (select .cse12 .cse522) 0) (forall ((v_arrayElimCell_109 Int) (v_arrayElimCell_110 Int) (v_ArrVal_1434 Int) (v_arrayElimCell_118 Int)) (let ((.cse524 (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse523 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse524)) (.cse525 (+ v_arrayElimCell_109 4))) (let ((.cse526 (select (select .cse523 .cse9) .cse525))) (or (= (select (select .cse523 v_arrayElimCell_118) (select .cse524 .cse522)) 0) (= |c_ULTIMATE.start_l1_insert_~item~1#1.offset| .cse525) (< v_arrayElimCell_109 0) (= (select (select .cse523 v_arrayElimCell_110) .cse526) 0) (< .cse526 0) (= v_ArrVal_1436 v_arrayElimCell_109)))))) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436)))) (or (forall ((v_arrayElimCell_109 Int) (v_arrayElimCell_110 Int) (v_ArrVal_1434 Int) (v_arrayElimCell_114 Int) (v_ArrVal_1436 Int)) (let ((.cse531 (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse529 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse531)) (.cse528 (+ v_arrayElimCell_109 4))) (let ((.cse530 (select (select .cse529 .cse9) .cse528)) (.cse527 (+ v_ArrVal_1436 4))) (or (= .cse527 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (= |c_ULTIMATE.start_l1_insert_~item~1#1.offset| .cse528) (< v_arrayElimCell_109 0) (< v_ArrVal_1436 0) (= (select (select .cse529 v_arrayElimCell_110) .cse530) 0) (= .cse527 |c_ULTIMATE.start_l2_insert_~list#1.offset|) (< .cse530 0) (< (select .cse12 .cse527) 0) (= (select (select .cse529 v_arrayElimCell_114) (select .cse531 .cse527)) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436) (= v_ArrVal_1436 v_arrayElimCell_109)))))) .cse37)) .cse21) .cse128)) (or .cse61 (and .cse379 (or (forall ((v_arrayElimCell_109 Int) (v_arrayElimCell_126 Int) (v_ArrVal_1434 Int)) (let ((.cse534 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (.cse532 (+ v_arrayElimCell_109 4))) (let ((.cse533 (select (select .cse534 .cse9) .cse532))) (or (= |c_ULTIMATE.start_l1_insert_~item~1#1.offset| .cse532) (< v_arrayElimCell_109 0) (< .cse533 0) (= (select (select .cse534 v_arrayElimCell_126) .cse533) 0))))) .cse93) .cse405 (or (forall ((v_arrayElimCell_109 Int) (|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_arrayElimCell_126 Int) (v_ArrVal_1434 Int)) (let ((.cse536 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434)))) (let ((.cse535 (select (select .cse536 .cse9) (+ v_arrayElimCell_109 4)))) (or (< v_arrayElimCell_109 0) (< .cse535 0) (= (select (select .cse536 v_arrayElimCell_126) .cse535) 0) (= (select (select .cse536 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) .cse535) 0))))) .cse93) (or .cse13 .cse383 .cse3) (forall ((v_arrayElimCell_109 Int)) (let ((.cse537 (+ v_arrayElimCell_109 4))) (or (= |c_ULTIMATE.start_l1_insert_~item~1#1.offset| .cse537) (< v_arrayElimCell_109 0) (= |c_ULTIMATE.start_l2_insert_~list#1.offset| .cse537) (forall ((v_arrayElimCell_126 Int) (v_ArrVal_1434 Int)) (let ((.cse539 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434)))) (let ((.cse538 (select (select .cse539 .cse9) .cse537))) (or (< .cse538 0) (= (select (select .cse539 v_arrayElimCell_126) .cse538) 0)))))))) (forall ((v_arrayElimCell_109 Int)) (let ((.cse540 (+ v_arrayElimCell_109 4))) (or (< v_arrayElimCell_109 0) (= |c_ULTIMATE.start_l2_insert_~list#1.offset| .cse540) (forall ((|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_arrayElimCell_126 Int) (v_ArrVal_1434 Int)) (let ((.cse542 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434)))) (let ((.cse541 (select (select .cse542 .cse9) .cse540))) (or (< .cse541 0) (= (select (select .cse542 v_arrayElimCell_126) .cse541) 0) (= (select (select .cse542 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) .cse541) 0)))))))) (forall ((v_arrayElimCell_109 Int)) (let ((.cse545 (+ v_arrayElimCell_109 4))) (or (forall ((v_arrayElimCell_126 Int) (v_ArrVal_1434 Int)) (let ((.cse544 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434)))) (let ((.cse543 (select (select .cse544 .cse9) .cse545))) (or (< .cse543 0) (= (select (select .cse544 v_arrayElimCell_126) .cse543) 0) (= (select (select .cse544 |c_ULTIMATE.start_l2_insert_~item~0#1.base|) .cse543) 0))))) (= |c_ULTIMATE.start_l1_insert_~item~1#1.offset| .cse545) (< v_arrayElimCell_109 0)))) (forall ((v_arrayElimCell_109 Int)) (or (forall ((|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_arrayElimCell_126 Int) (v_ArrVal_1434 Int)) (let ((.cse547 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434)))) (let ((.cse546 (select (select .cse547 .cse9) (+ v_arrayElimCell_109 4)))) (or (< .cse546 0) (= (select (select .cse547 v_arrayElimCell_126) .cse546) 0) (= (select (select .cse547 |c_ULTIMATE.start_l2_insert_~item~0#1.base|) .cse546) 0) (= (select (select .cse547 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) .cse546) 0))))) (< v_arrayElimCell_109 0))) (or (and (forall ((v_arrayElimCell_109 Int)) (let ((.cse548 (+ v_arrayElimCell_109 4))) (or (< v_arrayElimCell_109 0) (= |c_ULTIMATE.start_l2_insert_~list#1.offset| .cse548) (forall ((v_arrayElimCell_126 Int) (v_ArrVal_1434 Int)) (let ((.cse550 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434)))) (let ((.cse549 (select (select .cse550 .cse9) .cse548))) (or (< .cse549 0) (= (select (select .cse550 v_arrayElimCell_126) .cse549) 0)))))))) (or .cse93 (forall ((v_arrayElimCell_109 Int) (v_arrayElimCell_126 Int) (v_ArrVal_1434 Int)) (let ((.cse552 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434)))) (let ((.cse551 (select (select .cse552 .cse9) (+ v_arrayElimCell_109 4)))) (or (< v_arrayElimCell_109 0) (< .cse551 0) (= (select (select .cse552 v_arrayElimCell_126) .cse551) 0)))))) (forall ((v_arrayElimCell_109 Int)) (or (forall ((v_arrayElimCell_126 Int) (v_ArrVal_1434 Int)) (let ((.cse554 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434)))) (let ((.cse553 (select (select .cse554 .cse9) (+ v_arrayElimCell_109 4)))) (or (< .cse553 0) (= (select (select .cse554 v_arrayElimCell_126) .cse553) 0) (= (select (select .cse554 |c_ULTIMATE.start_l2_insert_~item~0#1.base|) .cse553) 0))))) (< v_arrayElimCell_109 0))) .cse391) .cse37))) (or .cse21 (forall ((v_arrayElimCell_109 Int) (v_prenex_5 Int) (v_ArrVal_1434 Int) (v_ArrVal_1436 Int)) (let ((.cse558 (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse557 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse558)) (.cse556 (+ v_arrayElimCell_109 4))) (let ((.cse555 (+ v_ArrVal_1436 4)) (.cse559 (select (select .cse557 .cse9) .cse556))) (or (= .cse555 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (= |c_ULTIMATE.start_l1_insert_~item~1#1.offset| .cse556) (= (select (select .cse557 v_prenex_5) (select .cse558 .cse555)) 0) (< v_arrayElimCell_109 0) (< v_ArrVal_1436 0) (< .cse559 0) (< (select .cse12 .cse555) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436) (= (select (select .cse557 |c_ULTIMATE.start_l2_insert_~item~0#1.base|) .cse559) 0) (= v_ArrVal_1436 v_arrayElimCell_109)))))) .cse37) (or .cse21 .cse37 (forall ((v_arrayElimCell_109 Int) (|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_prenex_5 Int) (v_ArrVal_1434 Int) (v_ArrVal_1436 Int)) (let ((.cse562 (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse561 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse562))) (let ((.cse560 (+ v_ArrVal_1436 4)) (.cse563 (select (select .cse561 .cse9) (+ v_arrayElimCell_109 4)))) (or (= .cse560 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (= (select (select .cse561 v_prenex_5) (select .cse562 .cse560)) 0) (< v_arrayElimCell_109 0) (< v_ArrVal_1436 0) (= .cse560 |c_ULTIMATE.start_l2_insert_~list#1.offset|) (< .cse563 0) (< (select .cse12 .cse560) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436) (= (select (select .cse561 |c_ULTIMATE.start_l2_insert_~item~0#1.base|) .cse563) 0) (= (select (select .cse561 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) .cse563) 0) (= v_ArrVal_1436 v_arrayElimCell_109))))))) (forall ((v_ArrVal_1436 Int)) (let ((.cse569 (+ v_ArrVal_1436 4))) (or (forall ((v_arrayElimCell_109 Int)) (let ((.cse570 (+ v_arrayElimCell_109 4))) (or (forall ((v_arrayElimCell_110 Int) (v_ArrVal_1434 Int)) (let ((.cse568 (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse566 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse568))) (let ((.cse565 (select (select .cse566 .cse9) .cse570)) (.cse564 (select .cse566 v_arrayElimCell_110)) (.cse567 (select .cse568 .cse569))) (or (= (select .cse564 .cse565) 0) (< .cse565 0) (forall ((|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int)) (= (select (select .cse566 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) .cse567) 0)) (< .cse567 0) (= (select .cse564 .cse567) 0)))))) (= |c_ULTIMATE.start_l1_insert_~item~1#1.offset| .cse570) (< v_arrayElimCell_109 0) (= |c_ULTIMATE.start_l2_insert_~list#1.offset| .cse570)))) (< v_ArrVal_1436 0) (= .cse569 |c_ULTIMATE.start_l2_insert_~list#1.offset|) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436)))) (or .cse21 .cse37 (forall ((v_arrayElimCell_109 Int) (v_prenex_5 Int) (v_ArrVal_1434 Int) (v_ArrVal_1436 Int)) (let ((.cse574 (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse573 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse574)) (.cse572 (+ v_arrayElimCell_109 4))) (let ((.cse571 (+ v_ArrVal_1436 4)) (.cse575 (select (select .cse573 .cse9) .cse572))) (or (= .cse571 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (= |c_ULTIMATE.start_l1_insert_~item~1#1.offset| .cse572) (= (select (select .cse573 v_prenex_5) (select .cse574 .cse571)) 0) (< v_arrayElimCell_109 0) (< v_ArrVal_1436 0) (< .cse575 0) (< (select .cse12 .cse571) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436) (= (select (select .cse573 |c_ULTIMATE.start_l2_insert_~item~0#1.base|) .cse575) 0))))))) (forall ((v_ArrVal_1436 Int)) (let ((.cse576 (+ v_ArrVal_1436 4))) (or (= .cse576 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (< v_ArrVal_1436 0) (= .cse576 |c_ULTIMATE.start_l2_insert_~list#1.offset|) (forall ((v_arrayElimCell_109 Int) (|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_arrayElimCell_110 Int) (v_ArrVal_1434 Int) (v_arrayElimCell_118 Int)) (let ((.cse578 (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse577 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse578)) (.cse580 (+ v_arrayElimCell_109 4))) (let ((.cse579 (select (select .cse577 .cse9) .cse580))) (or (= (select (select .cse577 v_arrayElimCell_118) (select .cse578 .cse576)) 0) (< v_arrayElimCell_109 0) (= (select (select .cse577 v_arrayElimCell_110) .cse579) 0) (< .cse579 0) (= |c_ULTIMATE.start_l2_insert_~list#1.offset| .cse580) (= (select (select .cse577 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) .cse579) 0) (= v_ArrVal_1436 v_arrayElimCell_109)))))) (< (select .cse12 .cse576) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436)))) (or (and (or (forall ((|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_ArrVal_1434 Int) (v_ArrVal_1436 Int) (v_arrayElimCell_119 Int)) (let ((.cse584 (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse582 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse584))) (let ((.cse583 (select (select .cse582 .cse9) |c_ULTIMATE.start_l1_insert_~item~1#1.offset|)) (.cse581 (+ v_ArrVal_1436 4))) (or (= .cse581 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (= (select (select .cse582 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) .cse583) 0) (< v_ArrVal_1436 0) (= (select (select .cse582 v_arrayElimCell_119) (select .cse584 .cse581)) 0) (< .cse583 0) (< (select .cse12 .cse581) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436)))))) .cse93) .cse431 (forall ((v_ArrVal_1436 Int)) (let ((.cse585 (+ v_ArrVal_1436 4))) (or (= .cse585 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (< v_ArrVal_1436 0) (< (select .cse11 .cse585) 0) (forall ((|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_ArrVal_1434 Int)) (let ((.cse590 (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse588 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse590))) (let ((.cse587 (select (select .cse588 .cse9) |c_ULTIMATE.start_l1_insert_~item~1#1.offset|)) (.cse586 (select .cse588 |ULTIMATE.start_l1_insert_#t~mem13#1.base|)) (.cse589 (select .cse590 .cse585))) (or (= (select .cse586 .cse587) 0) (< .cse587 0) (= (select (select .cse588 |c_ULTIMATE.start_l2_insert_~item~0#1.base|) .cse589) 0) (= (select .cse586 .cse589) 0)))))) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436)))) .cse119) .cse0 .cse15 .cse2) (or (forall ((v_arrayElimCell_109 Int) (|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_arrayElimCell_110 Int) (v_ArrVal_1434 Int)) (let ((.cse591 (+ v_arrayElimCell_109 4)) (.cse593 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434)))) (let ((.cse592 (select .cse593 |ULTIMATE.start_l1_insert_#t~mem13#1.base|)) (.cse594 (select (select .cse593 .cse9) .cse591))) (or (= |c_ULTIMATE.start_l1_insert_~item~1#1.offset| .cse591) (< v_arrayElimCell_109 0) (= (select .cse592 v_ArrVal_1434) 0) (= (select (select .cse593 v_arrayElimCell_110) .cse594) 0) (< v_ArrVal_1434 0) (< .cse594 0) (= |c_ULTIMATE.start_l2_insert_~list#1.offset| .cse591) (= (select .cse592 .cse594) 0))))) .cse2) (forall ((v_ArrVal_1436 Int)) (let ((.cse602 (+ v_ArrVal_1436 4))) (or (forall ((v_ArrVal_1434 Int)) (let ((.cse601 (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse598 (select .cse601 .cse602))) (or (forall ((v_arrayElimCell_110 Int)) (let ((.cse599 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse601))) (let ((.cse595 (select .cse599 v_arrayElimCell_110))) (or (forall ((v_arrayElimCell_109 Int)) (let ((.cse600 (+ v_arrayElimCell_109 4))) (let ((.cse596 (select (select .cse599 .cse9) .cse600))) (or (< v_arrayElimCell_109 0) (= (select .cse595 .cse596) 0) (< .cse596 0) (forall ((|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int)) (let ((.cse597 (select .cse599 |ULTIMATE.start_l1_insert_#t~mem13#1.base|))) (or (= (select .cse597 .cse598) 0) (= (select .cse597 .cse596) 0)))) (= |c_ULTIMATE.start_l2_insert_~list#1.offset| .cse600))))) (= (select .cse595 .cse598) 0))))) (< .cse598 0))))) (< v_ArrVal_1436 0) (= .cse602 |c_ULTIMATE.start_l2_insert_~list#1.offset|) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436)))) (forall ((v_ArrVal_1436 Int)) (let ((.cse603 (+ v_ArrVal_1436 4))) (or (= .cse603 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (< v_ArrVal_1436 0) (= .cse603 |c_ULTIMATE.start_l2_insert_~list#1.offset|) (forall ((v_arrayElimCell_109 Int) (v_ArrVal_1434 Int) (v_arrayElimCell_118 Int)) (let ((.cse605 (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse604 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse605)) (.cse606 (+ v_arrayElimCell_109 4))) (let ((.cse607 (select (select .cse604 .cse9) .cse606))) (or (= (select (select .cse604 v_arrayElimCell_118) (select .cse605 .cse603)) 0) (= |c_ULTIMATE.start_l1_insert_~item~1#1.offset| .cse606) (< v_arrayElimCell_109 0) (< .cse607 0) (= (select (select .cse604 |c_ULTIMATE.start_l2_insert_~item~0#1.base|) .cse607) 0) (= v_ArrVal_1436 v_arrayElimCell_109)))))) (< (select .cse12 .cse603) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436)))) (or .cse0 .cse15 .cse1 .cse2) (forall ((v_ArrVal_1436 Int)) (let ((.cse608 (+ v_ArrVal_1436 4))) (or (= .cse608 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (forall ((v_arrayElimCell_109 Int) (v_arrayElimCell_110 Int) (v_ArrVal_1434 Int)) (let ((.cse612 (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse613 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse612)) (.cse609 (+ v_arrayElimCell_109 4))) (let ((.cse611 (select (select .cse613 .cse9) .cse609)) (.cse610 (select .cse613 v_arrayElimCell_110))) (or (= |c_ULTIMATE.start_l1_insert_~item~1#1.offset| .cse609) (< v_arrayElimCell_109 0) (= (select .cse610 .cse611) 0) (< .cse611 0) (= |c_ULTIMATE.start_l2_insert_~list#1.offset| .cse609) (= (select .cse610 (select .cse612 .cse608)) 0)))))) (< v_ArrVal_1436 0) (= .cse608 |c_ULTIMATE.start_l2_insert_~list#1.offset|) (< (select .cse12 .cse608) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436)))) (or (and .cse95 .cse446) .cse93) (or .cse93 (and (or (forall ((v_arrayElimCell_109 Int) (v_arrayElimCell_110 Int) (v_ArrVal_1434 Int) (v_arrayElimCell_114 Int) (v_ArrVal_1436 Int)) (let ((.cse618 (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse616 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse618)) (.cse615 (+ v_arrayElimCell_109 4))) (let ((.cse617 (select (select .cse616 .cse9) .cse615)) (.cse614 (+ v_ArrVal_1436 4))) (or (= .cse614 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (= |c_ULTIMATE.start_l1_insert_~item~1#1.offset| .cse615) (< v_arrayElimCell_109 0) (< v_ArrVal_1436 0) (= (select (select .cse616 v_arrayElimCell_110) .cse617) 0) (= .cse614 |c_ULTIMATE.start_l2_insert_~list#1.offset|) (< .cse617 0) (< (select .cse12 .cse614) 0) (= (select (select .cse616 v_arrayElimCell_114) (select .cse618 .cse614)) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436)))))) .cse21 .cse37) (or (forall ((v_arrayElimCell_109 Int) (v_arrayElimCell_110 Int) (v_arrayElimCell_115 Int) (v_ArrVal_1434 Int) (v_ArrVal_1436 Int)) (let ((.cse623 (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse621 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse623)) (.cse620 (+ v_arrayElimCell_109 4))) (let ((.cse622 (select (select .cse621 .cse9) .cse620)) (.cse619 (+ v_ArrVal_1436 4))) (or (= .cse619 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (= |c_ULTIMATE.start_l1_insert_~item~1#1.offset| .cse620) (< v_arrayElimCell_109 0) (< v_ArrVal_1436 0) (= (select (select .cse621 v_arrayElimCell_110) .cse622) 0) (= .cse619 |c_ULTIMATE.start_l2_insert_~list#1.offset|) (< .cse622 0) (< (select .cse12 .cse619) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436) (= (select (select .cse621 v_arrayElimCell_115) (select .cse623 .cse619)) 0)))))) .cse37))) (or .cse105 .cse15 .cse2) (forall ((v_ArrVal_1436 Int)) (or (< v_ArrVal_1436 0) (forall ((v_arrayElimCell_109 Int)) (let ((.cse624 (+ v_arrayElimCell_109 4))) (or (= |c_ULTIMATE.start_l1_insert_~item~1#1.offset| .cse624) (< v_arrayElimCell_109 0) (forall ((v_ArrVal_1434 Int)) (let ((.cse629 (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse626 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse629))) (let ((.cse627 (select .cse629 (+ v_ArrVal_1436 4))) (.cse628 (select .cse626 |c_ULTIMATE.start_l2_insert_~item~0#1.base|)) (.cse625 (select (select .cse626 .cse9) .cse624))) (or (< .cse625 0) (forall ((|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int)) (= (select (select .cse626 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) .cse627) 0)) (= (select .cse628 .cse627) 0) (< .cse627 0) (= (select .cse628 .cse625) 0))))))))) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436))) (forall ((v_ArrVal_1436 Int)) (let ((.cse630 (+ v_ArrVal_1436 4))) (or (= .cse630 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (< v_ArrVal_1436 0) (< (select .cse11 .cse630) 0) (forall ((v_arrayElimCell_109 Int) (v_arrayElimCell_110 Int) (v_ArrVal_1434 Int)) (let ((.cse634 (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse632 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse634)) (.cse631 (+ v_arrayElimCell_109 4))) (let ((.cse633 (select (select .cse632 .cse9) .cse631))) (or (= |c_ULTIMATE.start_l1_insert_~item~1#1.offset| .cse631) (< v_arrayElimCell_109 0) (= (select (select .cse632 v_arrayElimCell_110) .cse633) 0) (< .cse633 0) (= |c_ULTIMATE.start_l2_insert_~list#1.offset| .cse631) (= (select (select .cse632 |c_ULTIMATE.start_l2_insert_~item~0#1.base|) (select .cse634 .cse630)) 0) (= v_ArrVal_1436 v_arrayElimCell_109)))))) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436)))) (forall ((v_ArrVal_1436 Int)) (let ((.cse635 (+ v_ArrVal_1436 4))) (or (= .cse635 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (< v_ArrVal_1436 0) (< (select .cse11 .cse635) 0) (forall ((v_arrayElimCell_109 Int) (|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_ArrVal_1434 Int)) (let ((.cse638 (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse639 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse638))) (let ((.cse637 (select .cse639 |c_ULTIMATE.start_l2_insert_~item~0#1.base|)) (.cse636 (select (select .cse639 .cse9) (+ v_arrayElimCell_109 4)))) (or (< v_arrayElimCell_109 0) (< .cse636 0) (= (select .cse637 (select .cse638 .cse635)) 0) (= (select .cse637 .cse636) 0) (= (select (select .cse639 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) .cse636) 0)))))) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436)))) (or (and (forall ((v_ArrVal_1436 Int)) (let ((.cse645 (+ v_ArrVal_1436 4))) (or (forall ((v_arrayElimCell_110 Int) (v_ArrVal_1434 Int)) (let ((.cse644 (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse643 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse644))) (let ((.cse641 (select (select .cse643 .cse9) |c_ULTIMATE.start_l1_insert_~item~1#1.offset|)) (.cse642 (select .cse644 .cse645))) (or (forall ((|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int)) (let ((.cse640 (select .cse643 |ULTIMATE.start_l1_insert_#t~mem13#1.base|))) (or (= (select .cse640 .cse641) 0) (= (select .cse640 .cse642) 0)))) (< .cse641 0) (< .cse642 0) (= (select (select .cse643 v_arrayElimCell_110) .cse642) 0)))))) (< v_ArrVal_1436 0) (= .cse645 |c_ULTIMATE.start_l2_insert_~list#1.offset|) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436)))) (forall ((v_ArrVal_1436 Int)) (let ((.cse646 (+ v_ArrVal_1436 4))) (or (= .cse646 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (< v_ArrVal_1436 0) (= .cse646 |c_ULTIMATE.start_l2_insert_~list#1.offset|) (< (select .cse12 .cse646) 0) (forall ((|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_arrayElimCell_110 Int) (v_ArrVal_1434 Int)) (let ((.cse649 (store .cse11 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse647 (store .cse10 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse649))) (let ((.cse648 (select (select .cse647 .cse9) |c_ULTIMATE.start_l1_insert_~item~1#1.offset|))) (or (= (select (select .cse647 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) .cse648) 0) (< .cse648 0) (= (select (select .cse647 v_arrayElimCell_110) (select .cse649 .cse646)) 0)))))) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436))))) .cse0 .cse15 .cse2))))))) is different from true [2024-11-13 15:45:23,432 WARN L873 $PredicateComparison]: unable to prove that (or (let ((.cse8 (select (select |c_#memory_$Pointer$#2.base| |c_~#list~0.base|) |c_~#list~0.offset|))) (let ((.cse1 (= |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse8)) (.cse67 (= |c_ULTIMATE.start_l2_insert_~list#1.base| .cse8)) (.cse10 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base|)) (.cse11 (+ |c_ULTIMATE.start_l2_insert_~item~0#1.offset| 4))) (let ((.cse912 (forall ((v_ArrVal_1429 Int) (v_arrayElimCell_109 Int) (|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_arrayElimCell_110 Int) (v_ArrVal_1434 Int) (v_arrayElimCell_114 Int) (v_ArrVal_1436 Int)) (let ((.cse1149 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429)))) (let ((.cse1150 (store .cse1149 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse1149 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|)))) (let ((.cse1147 (store (select .cse1150 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse1145 (store .cse1150 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse1147)) (.cse1148 (+ v_arrayElimCell_109 4))) (let ((.cse1146 (select (select .cse1145 .cse8) .cse1148)) (.cse1144 (+ v_ArrVal_1436 4))) (or (= .cse1144 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (= (select (select .cse1145 v_arrayElimCell_110) .cse1146) 0) (< v_arrayElimCell_109 0) (< v_ArrVal_1436 0) (= (select (select .cse1145 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) .cse1146) 0) (< .cse1146 0) (= (select (select .cse1145 v_arrayElimCell_114) (select .cse1147 .cse1144)) 0) (= |c_ULTIMATE.start_l2_insert_~list#1.offset| .cse1148) (< (select (select .cse1149 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) .cse1144) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436) (= v_ArrVal_1436 v_arrayElimCell_109))))))))) (.cse31 (forall ((v_ArrVal_1429 Int) (|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_ArrVal_1434 Int)) (or (< v_ArrVal_1434 0) (= (select (select (let ((.cse1142 (let ((.cse1143 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429)))) (store .cse1143 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse1143 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|))))) (store .cse1142 |c_ULTIMATE.start_l1_insert_~item~1#1.base| (store (select .cse1142 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) |ULTIMATE.start_l1_insert_#t~mem13#1.base|) v_ArrVal_1434) 0)))) (.cse0 (= |c_ULTIMATE.start_l2_insert_~list#1.base| |c_ULTIMATE.start_l1_insert_~item~1#1.base|)) (.cse58 (= |c_ULTIMATE.start_l1_insert_~item~1#1.offset| |c_ULTIMATE.start_l2_insert_~list#1.offset|)) (.cse586 (forall ((v_ArrVal_1429 Int) (v_ArrVal_1434 Int)) (let ((.cse1139 (let ((.cse1140 (let ((.cse1141 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429)))) (store .cse1141 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse1141 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|))))) (store .cse1140 |c_ULTIMATE.start_l1_insert_~item~1#1.base| (store (select .cse1140 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))))) (let ((.cse1138 (select (select .cse1139 .cse8) |c_ULTIMATE.start_l2_insert_~list#1.offset|))) (or (< .cse1138 0) (= (select (select .cse1139 |c_ULTIMATE.start_l2_insert_~item~0#1.base|) .cse1138) 0)))))) (.cse12 (< |c_ULTIMATE.start_l2_insert_~list#1.offset| 4)) (.cse13 (not .cse67)) (.cse30 (not .cse1)) (.cse28 (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| 4))) (let ((.cse89 (or (forall ((v_ArrVal_1429 Int) (v_arrayElimCell_109 Int) (v_arrayElimCell_110 Int) (v_arrayElimCell_115 Int) (v_ArrVal_1434 Int) (v_ArrVal_1436 Int)) (let ((.cse1136 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429)))) (let ((.cse1137 (store .cse1136 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse1136 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|)))) (let ((.cse1132 (store (select .cse1137 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse1131 (store .cse1137 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse1132)) (.cse1135 (+ v_arrayElimCell_109 4))) (let ((.cse1134 (select (select .cse1131 .cse8) .cse1135)) (.cse1133 (+ v_ArrVal_1436 4))) (or (= (select (select .cse1131 v_arrayElimCell_115) (select .cse1132 .cse1133)) 0) (= .cse1133 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (= (select (select .cse1131 v_arrayElimCell_110) .cse1134) 0) (= |c_ULTIMATE.start_l1_insert_~item~1#1.offset| .cse1135) (< v_arrayElimCell_109 0) (< v_ArrVal_1436 0) (= .cse1133 |c_ULTIMATE.start_l2_insert_~list#1.offset|) (< .cse1134 0) (= |c_ULTIMATE.start_l2_insert_~list#1.offset| .cse1135) (< (select (select .cse1136 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) .cse1133) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436) (= v_ArrVal_1436 v_arrayElimCell_109)))))))) .cse1)) (.cse164 (or .cse30 (forall ((v_ArrVal_1429 Int) (|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_ArrVal_1434 Int)) (let ((.cse1128 (let ((.cse1129 (let ((.cse1130 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429)))) (store .cse1130 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse1130 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|))))) (store .cse1129 |c_ULTIMATE.start_l1_insert_~item~1#1.base| (store (select .cse1129 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))))) (let ((.cse1127 (select (select .cse1128 .cse8) |c_ULTIMATE.start_l1_insert_~item~1#1.offset|))) (or (< .cse1127 0) (= (select (select .cse1128 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) .cse1127) 0))))) .cse28)) (.cse194 (or .cse586 .cse12 .cse13)) (.cse169 (forall ((v_ArrVal_1429 Int) (|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_ArrVal_1434 Int)) (let ((.cse1124 (let ((.cse1125 (let ((.cse1126 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429)))) (store .cse1126 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse1126 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|))))) (store .cse1125 |c_ULTIMATE.start_l1_insert_~item~1#1.base| (store (select .cse1125 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))))) (let ((.cse1123 (select (select .cse1124 .cse8) |c_ULTIMATE.start_l2_insert_~list#1.offset|))) (or (< .cse1123 0) (= (select (select .cse1124 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) .cse1123) 0) (= (select (select .cse1124 |c_ULTIMATE.start_l2_insert_~item~0#1.base|) .cse1123) 0)))))) (.cse189 (or .cse586 .cse12 .cse13 .cse58)) (.cse521 (forall ((v_ArrVal_1429 Int) (|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_ArrVal_1434 Int) (v_ArrVal_1436 Int) (v_arrayElimCell_118 Int)) (let ((.cse1121 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429)))) (let ((.cse1122 (store .cse1121 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse1121 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|)))) (let ((.cse1120 (store (select .cse1122 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse1119 (store .cse1122 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse1120))) (let ((.cse1117 (select (select .cse1119 .cse8) |c_ULTIMATE.start_l1_insert_~item~1#1.offset|)) (.cse1118 (+ v_ArrVal_1436 4))) (or (< .cse1117 0) (= .cse1118 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (= (select (select .cse1119 v_arrayElimCell_118) (select .cse1120 .cse1118)) 0) (< v_ArrVal_1436 0) (= .cse1118 |c_ULTIMATE.start_l2_insert_~list#1.offset|) (= (select (select .cse1119 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) .cse1117) 0) (< (select (select .cse1121 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) .cse1118) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436))))))))) (.cse696 (or .cse0 (forall ((v_ArrVal_1429 Int) (v_arrayElimCell_109 Int) (|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_arrayElimCell_110 Int) (v_ArrVal_1434 Int) (v_arrayElimCell_114 Int) (v_ArrVal_1436 Int)) (let ((.cse1115 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429)))) (let ((.cse1116 (store .cse1115 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse1115 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|)))) (let ((.cse1113 (store (select .cse1116 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse1111 (store .cse1116 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse1113)) (.cse1114 (+ v_arrayElimCell_109 4))) (let ((.cse1112 (select (select .cse1111 .cse8) .cse1114)) (.cse1110 (+ v_ArrVal_1436 4))) (or (= .cse1110 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (= (select (select .cse1111 v_arrayElimCell_110) .cse1112) 0) (< v_arrayElimCell_109 0) (< v_ArrVal_1436 0) (= (select (select .cse1111 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) .cse1112) 0) (= .cse1110 |c_ULTIMATE.start_l2_insert_~list#1.offset|) (< .cse1112 0) (= (select (select .cse1111 v_arrayElimCell_114) (select .cse1113 .cse1110)) 0) (= |c_ULTIMATE.start_l2_insert_~list#1.offset| .cse1114) (< (select (select .cse1115 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) .cse1110) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436) (= v_ArrVal_1436 v_arrayElimCell_109)))))))) .cse1)) (.cse659 (or (and (forall ((v_ArrVal_1429 Int) (v_ArrVal_1436 Int)) (let ((.cse1103 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429))) (.cse1098 (+ v_ArrVal_1436 4))) (or (= .cse1098 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (forall ((v_arrayElimCell_109 Int) (|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_arrayElimCell_110 Int) (v_ArrVal_1434 Int) (v_arrayElimCell_118 Int)) (let ((.cse1102 (store .cse1103 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse1103 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|)))) (let ((.cse1101 (store (select .cse1102 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse1099 (store .cse1102 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse1101))) (let ((.cse1100 (select (select .cse1099 .cse8) (+ v_arrayElimCell_109 4)))) (or (= (select (select .cse1099 v_arrayElimCell_110) .cse1100) 0) (= (select (select .cse1099 v_arrayElimCell_118) (select .cse1101 .cse1098)) 0) (< v_arrayElimCell_109 0) (= (select (select .cse1099 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) .cse1100) 0) (< .cse1100 0) (= v_ArrVal_1436 v_arrayElimCell_109))))))) (< v_ArrVal_1436 0) (= .cse1098 |c_ULTIMATE.start_l2_insert_~list#1.offset|) (< (select (select .cse1103 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) .cse1098) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436)))) (or (forall ((v_ArrVal_1429 Int) (v_arrayElimCell_109 Int) (|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_arrayElimCell_110 Int) (v_ArrVal_1434 Int) (v_arrayElimCell_114 Int) (v_ArrVal_1436 Int)) (let ((.cse1108 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429)))) (let ((.cse1109 (store .cse1108 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse1108 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|)))) (let ((.cse1107 (store (select .cse1109 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse1105 (store .cse1109 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse1107))) (let ((.cse1106 (select (select .cse1105 .cse8) (+ v_arrayElimCell_109 4))) (.cse1104 (+ v_ArrVal_1436 4))) (or (= .cse1104 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (= (select (select .cse1105 v_arrayElimCell_110) .cse1106) 0) (< v_arrayElimCell_109 0) (< v_ArrVal_1436 0) (= (select (select .cse1105 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) .cse1106) 0) (= .cse1104 |c_ULTIMATE.start_l2_insert_~list#1.offset|) (< .cse1106 0) (= (select (select .cse1105 v_arrayElimCell_114) (select .cse1107 .cse1104)) 0) (< (select (select .cse1108 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) .cse1104) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436) (= v_ArrVal_1436 v_arrayElimCell_109)))))))) .cse1)) .cse0)) (.cse670 (forall ((v_ArrVal_1429 Int) (v_ArrVal_1436 Int)) (let ((.cse1097 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429))) (.cse1092 (+ v_ArrVal_1436 4))) (or (= .cse1092 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (< v_ArrVal_1436 0) (= .cse1092 |c_ULTIMATE.start_l2_insert_~list#1.offset|) (forall ((|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_ArrVal_1434 Int) (v_arrayElimCell_118 Int)) (let ((.cse1096 (store .cse1097 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse1097 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|)))) (let ((.cse1095 (store (select .cse1096 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse1094 (store .cse1096 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse1095))) (let ((.cse1093 (select (select .cse1094 .cse8) |c_ULTIMATE.start_l1_insert_~item~1#1.offset|))) (or (< .cse1093 0) (= (select (select .cse1094 v_arrayElimCell_118) (select .cse1095 .cse1092)) 0) (= (select (select .cse1094 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) .cse1093) 0))))))) (< (select (select .cse1097 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) .cse1092) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436))))) (.cse103 (or .cse0 (forall ((v_ArrVal_1429 Int) (v_arrayElimCell_109 Int) (|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_arrayElimCell_110 Int) (v_ArrVal_1434 Int) (v_arrayElimCell_114 Int) (v_ArrVal_1436 Int)) (let ((.cse1090 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429)))) (let ((.cse1091 (store .cse1090 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse1090 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|)))) (let ((.cse1089 (store (select .cse1091 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse1087 (store .cse1091 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse1089))) (let ((.cse1088 (select (select .cse1087 .cse8) (+ v_arrayElimCell_109 4))) (.cse1086 (+ v_ArrVal_1436 4))) (or (= .cse1086 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (= (select (select .cse1087 v_arrayElimCell_110) .cse1088) 0) (< v_arrayElimCell_109 0) (< v_ArrVal_1436 0) (= (select (select .cse1087 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) .cse1088) 0) (< .cse1088 0) (= (select (select .cse1087 v_arrayElimCell_114) (select .cse1089 .cse1086)) 0) (< (select (select .cse1090 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) .cse1086) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436) (= v_ArrVal_1436 v_arrayElimCell_109)))))))) .cse1)) (.cse640 (or .cse0 (and (or (and (forall ((v_ArrVal_1429 Int) (v_ArrVal_1434 Int)) (or (< v_ArrVal_1434 0) (forall ((|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int)) (let ((.cse1049 (let ((.cse1050 (let ((.cse1051 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429)))) (store .cse1051 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse1051 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|))))) (store .cse1050 |c_ULTIMATE.start_l1_insert_~item~1#1.base| (store (select .cse1050 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))))) (let ((.cse1047 (select .cse1049 |ULTIMATE.start_l1_insert_#t~mem13#1.base|))) (or (forall ((v_arrayElimCell_109 Int)) (let ((.cse1048 (select (select .cse1049 .cse8) (+ v_arrayElimCell_109 4)))) (or (< v_arrayElimCell_109 0) (= (select .cse1047 .cse1048) 0) (< .cse1048 0) (forall ((v_arrayElimCell_110 Int)) (= (select (select .cse1049 v_arrayElimCell_110) .cse1048) 0))))) (= (select .cse1047 v_ArrVal_1434) 0))))))) (or .cse30 .cse31)) .cse28) (forall ((v_ArrVal_1429 Int) (v_ArrVal_1436 Int)) (or (forall ((v_ArrVal_1434 Int)) (let ((.cse1057 (let ((.cse1059 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429)))) (store .cse1059 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse1059 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|))))) (let ((.cse1058 (store (select .cse1057 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse1055 (select .cse1058 (+ v_ArrVal_1436 4)))) (or (forall ((v_arrayElimCell_110 Int)) (let ((.cse1056 (store .cse1057 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse1058))) (let ((.cse1052 (select .cse1056 v_arrayElimCell_110))) (or (forall ((v_arrayElimCell_109 Int)) (let ((.cse1053 (select (select .cse1056 .cse8) (+ v_arrayElimCell_109 4)))) (or (= (select .cse1052 .cse1053) 0) (< v_arrayElimCell_109 0) (< .cse1053 0) (forall ((|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int)) (let ((.cse1054 (select .cse1056 |ULTIMATE.start_l1_insert_#t~mem13#1.base|))) (or (= (select .cse1054 .cse1053) 0) (= (select .cse1054 .cse1055) 0))))))) (= (select .cse1052 .cse1055) 0))))) (< .cse1055 0)))))) (< v_ArrVal_1436 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436))) (or (and (forall ((v_ArrVal_1429 Int) (v_ArrVal_1436 Int)) (let ((.cse1065 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429))) (.cse1060 (+ v_ArrVal_1436 4))) (or (= .cse1060 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (< v_ArrVal_1436 0) (forall ((|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_arrayElimCell_110 Int) (v_ArrVal_1434 Int)) (let ((.cse1064 (store .cse1065 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse1065 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|)))) (let ((.cse1063 (store (select .cse1064 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse1062 (store .cse1064 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse1063))) (let ((.cse1061 (select (select .cse1062 .cse8) |c_ULTIMATE.start_l1_insert_~item~1#1.offset|))) (or (< .cse1061 0) (= (select (select .cse1062 v_arrayElimCell_110) (select .cse1063 .cse1060)) 0) (= (select (select .cse1062 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) .cse1061) 0))))))) (< (select (select .cse1065 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) .cse1060) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436)))) (forall ((v_ArrVal_1429 Int) (v_ArrVal_1436 Int)) (or (< v_ArrVal_1436 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436) (forall ((v_arrayElimCell_110 Int) (v_ArrVal_1434 Int)) (let ((.cse1071 (let ((.cse1072 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429)))) (store .cse1072 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse1072 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|))))) (let ((.cse1070 (store (select .cse1071 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse1069 (store .cse1071 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse1070))) (let ((.cse1066 (select (select .cse1069 .cse8) |c_ULTIMATE.start_l1_insert_~item~1#1.offset|)) (.cse1068 (select .cse1070 (+ v_ArrVal_1436 4)))) (or (< .cse1066 0) (forall ((|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int)) (let ((.cse1067 (select .cse1069 |ULTIMATE.start_l1_insert_#t~mem13#1.base|))) (or (= (select .cse1067 .cse1066) 0) (= (select .cse1067 .cse1068) 0)))) (= (select (select .cse1069 v_arrayElimCell_110) .cse1068) 0) (< .cse1068 0)))))))))) .cse30 .cse28) (forall ((v_ArrVal_1429 Int) (v_ArrVal_1436 Int)) (let ((.cse1079 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429))) (.cse1073 (+ v_ArrVal_1436 4))) (or (= .cse1073 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (< v_ArrVal_1436 0) (forall ((v_arrayElimCell_109 Int) (|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_arrayElimCell_110 Int) (v_ArrVal_1434 Int)) (let ((.cse1078 (store .cse1079 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse1079 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|)))) (let ((.cse1077 (store (select .cse1078 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse1076 (store .cse1078 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse1077))) (let ((.cse1075 (select (select .cse1076 .cse8) (+ v_arrayElimCell_109 4))) (.cse1074 (select .cse1076 v_arrayElimCell_110))) (or (= (select .cse1074 .cse1075) 0) (< v_arrayElimCell_109 0) (= (select (select .cse1076 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) .cse1075) 0) (< .cse1075 0) (= (select .cse1074 (select .cse1077 .cse1073)) 0))))))) (< (select (select .cse1079 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) .cse1073) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436)))) (or (forall ((v_ArrVal_1429 Int) (v_arrayElimCell_109 Int) (|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_arrayElimCell_110 Int) (v_ArrVal_1434 Int) (v_arrayElimCell_114 Int) (v_ArrVal_1436 Int)) (let ((.cse1084 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429)))) (let ((.cse1085 (store .cse1084 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse1084 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|)))) (let ((.cse1083 (store (select .cse1085 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse1081 (store .cse1085 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse1083))) (let ((.cse1082 (select (select .cse1081 .cse8) (+ v_arrayElimCell_109 4))) (.cse1080 (+ v_ArrVal_1436 4))) (or (= .cse1080 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (= (select (select .cse1081 v_arrayElimCell_110) .cse1082) 0) (< v_arrayElimCell_109 0) (< v_ArrVal_1436 0) (= (select (select .cse1081 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) .cse1082) 0) (< .cse1082 0) (= (select (select .cse1081 v_arrayElimCell_114) (select .cse1083 .cse1080)) 0) (< (select (select .cse1084 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) .cse1080) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436)))))))) .cse1)))) (.cse641 (or (and (forall ((v_ArrVal_1429 Int) (v_ArrVal_1436 Int)) (let ((.cse1019 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429))) (.cse1014 (+ v_ArrVal_1436 4))) (or (= .cse1014 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (forall ((v_arrayElimCell_109 Int) (|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_arrayElimCell_110 Int) (v_arrayElimCell_115 Int) (v_ArrVal_1434 Int)) (let ((.cse1018 (store .cse1019 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse1019 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|)))) (let ((.cse1016 (store (select .cse1018 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse1015 (store .cse1018 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse1016))) (let ((.cse1017 (select (select .cse1015 .cse8) (+ v_arrayElimCell_109 4)))) (or (= (select (select .cse1015 v_arrayElimCell_115) (select .cse1016 .cse1014)) 0) (= (select (select .cse1015 v_arrayElimCell_110) .cse1017) 0) (< v_arrayElimCell_109 0) (= (select (select .cse1015 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) .cse1017) 0) (< .cse1017 0))))))) (< v_ArrVal_1436 0) (= .cse1014 |c_ULTIMATE.start_l2_insert_~list#1.offset|) (< (select (select .cse1019 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) .cse1014) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436)))) (forall ((v_ArrVal_1429 Int) (v_ArrVal_1436 Int)) (or (forall ((v_arrayElimCell_109 Int)) (or (< v_arrayElimCell_109 0) (forall ((|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_arrayElimCell_110 Int) (v_ArrVal_1434 Int)) (let ((.cse1025 (let ((.cse1026 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429)))) (store .cse1026 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse1026 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|))))) (let ((.cse1024 (store (select .cse1025 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse1020 (store .cse1025 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse1024))) (let ((.cse1021 (select (select .cse1020 .cse8) (+ v_arrayElimCell_109 4))) (.cse1022 (select .cse1020 |ULTIMATE.start_l1_insert_#t~mem13#1.base|)) (.cse1023 (select .cse1024 (+ v_ArrVal_1436 4)))) (or (= (select (select .cse1020 v_arrayElimCell_110) .cse1021) 0) (= (select .cse1022 .cse1021) 0) (< .cse1021 0) (= (select (select .cse1020 |c_ULTIMATE.start_l2_insert_~item~0#1.base|) .cse1023) 0) (= (select .cse1022 .cse1023) 0) (< .cse1023 0))))))))) (< v_ArrVal_1436 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436))) (forall ((v_ArrVal_1429 Int) (v_ArrVal_1436 Int)) (let ((.cse1032 (+ v_ArrVal_1436 4))) (or (forall ((v_arrayElimCell_109 Int) (|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_arrayElimCell_110 Int) (v_arrayElimCell_115 Int) (v_ArrVal_1434 Int)) (let ((.cse1033 (let ((.cse1034 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429)))) (store .cse1034 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse1034 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|))))) (let ((.cse1031 (store (select .cse1033 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse1027 (store .cse1033 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse1031))) (let ((.cse1029 (select (select .cse1027 .cse8) (+ v_arrayElimCell_109 4))) (.cse1030 (select .cse1027 |ULTIMATE.start_l1_insert_#t~mem13#1.base|)) (.cse1028 (select .cse1031 .cse1032))) (or (= (select (select .cse1027 v_arrayElimCell_115) .cse1028) 0) (= (select (select .cse1027 v_arrayElimCell_110) .cse1029) 0) (< v_arrayElimCell_109 0) (= (select .cse1030 .cse1029) 0) (< .cse1029 0) (= (select .cse1030 .cse1028) 0) (< .cse1028 0))))))) (< v_ArrVal_1436 0) (= .cse1032 |c_ULTIMATE.start_l2_insert_~list#1.offset|) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436)))) (or (forall ((v_ArrVal_1429 Int) (v_arrayElimCell_109 Int) (|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_arrayElimCell_110 Int) (v_ArrVal_1434 Int)) (let ((.cse1035 (let ((.cse1038 (let ((.cse1039 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429)))) (store .cse1039 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse1039 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|))))) (store .cse1038 |c_ULTIMATE.start_l1_insert_~item~1#1.base| (store (select .cse1038 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))))) (let ((.cse1036 (select (select .cse1035 .cse8) (+ v_arrayElimCell_109 4))) (.cse1037 (select .cse1035 |ULTIMATE.start_l1_insert_#t~mem13#1.base|))) (or (= (select (select .cse1035 v_arrayElimCell_110) .cse1036) 0) (< v_arrayElimCell_109 0) (= (select .cse1037 .cse1036) 0) (< v_ArrVal_1434 0) (< .cse1036 0) (= (select .cse1037 v_ArrVal_1434) 0))))) .cse28) (forall ((v_ArrVal_1429 Int) (v_ArrVal_1436 Int)) (let ((.cse1044 (let ((.cse1046 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429)))) (store .cse1046 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse1046 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|))))) (let ((.cse1045 (select .cse1044 |c_ULTIMATE.start_l1_insert_~item~1#1.base|)) (.cse1043 (+ v_ArrVal_1436 4))) (or (forall ((v_arrayElimCell_109 Int) (|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_arrayElimCell_110 Int) (v_ArrVal_1434 Int)) (let ((.cse1042 (store .cse1045 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse1040 (store .cse1044 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse1042))) (let ((.cse1041 (select (select .cse1040 .cse8) (+ v_arrayElimCell_109 4)))) (or (= (select (select .cse1040 v_arrayElimCell_110) .cse1041) 0) (< v_arrayElimCell_109 0) (= (select (select .cse1040 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) .cse1041) 0) (< .cse1041 0) (= (select (select .cse1040 |c_ULTIMATE.start_l2_insert_~item~0#1.base|) (select .cse1042 .cse1043)) 0)))))) (= .cse1043 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (< v_ArrVal_1436 0) (< (select .cse1045 .cse1043) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436)))))) .cse1)) (.cse140 (or (forall ((v_ArrVal_1429 Int) (v_arrayElimCell_109 Int) (|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_arrayElimCell_110 Int) (v_arrayElimCell_115 Int) (v_ArrVal_1434 Int) (v_ArrVal_1436 Int)) (let ((.cse1012 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429)))) (let ((.cse1013 (store .cse1012 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse1012 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|)))) (let ((.cse1009 (store (select .cse1013 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse1008 (store .cse1013 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse1009))) (let ((.cse1011 (select (select .cse1008 .cse8) (+ v_arrayElimCell_109 4))) (.cse1010 (+ v_ArrVal_1436 4))) (or (= (select (select .cse1008 v_arrayElimCell_115) (select .cse1009 .cse1010)) 0) (= .cse1010 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (= (select (select .cse1008 v_arrayElimCell_110) .cse1011) 0) (< v_arrayElimCell_109 0) (< v_ArrVal_1436 0) (= (select (select .cse1008 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) .cse1011) 0) (= .cse1010 |c_ULTIMATE.start_l2_insert_~list#1.offset|) (< .cse1011 0) (< (select (select .cse1012 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) .cse1010) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436)))))))) .cse1)) (.cse104 (or (forall ((v_ArrVal_1429 Int) (v_arrayElimCell_109 Int) (|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_arrayElimCell_110 Int) (v_arrayElimCell_115 Int) (v_ArrVal_1434 Int) (v_ArrVal_1436 Int)) (let ((.cse1006 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429)))) (let ((.cse1007 (store .cse1006 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse1006 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|)))) (let ((.cse1003 (store (select .cse1007 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse1002 (store .cse1007 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse1003))) (let ((.cse1005 (select (select .cse1002 .cse8) (+ v_arrayElimCell_109 4))) (.cse1004 (+ v_ArrVal_1436 4))) (or (= (select (select .cse1002 v_arrayElimCell_115) (select .cse1003 .cse1004)) 0) (= .cse1004 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (= (select (select .cse1002 v_arrayElimCell_110) .cse1005) 0) (< v_arrayElimCell_109 0) (< v_ArrVal_1436 0) (= (select (select .cse1002 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) .cse1005) 0) (= .cse1004 |c_ULTIMATE.start_l2_insert_~list#1.offset|) (< .cse1005 0) (< (select (select .cse1006 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) .cse1004) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436) (= v_ArrVal_1436 v_arrayElimCell_109)))))))) .cse1)) (.cse141 (or .cse0 .cse1 (forall ((v_ArrVal_1429 Int) (v_arrayElimCell_109 Int) (|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_arrayElimCell_110 Int) (v_ArrVal_1434 Int) (v_arrayElimCell_114 Int) (v_ArrVal_1436 Int)) (let ((.cse1000 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429)))) (let ((.cse1001 (store .cse1000 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse1000 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|)))) (let ((.cse999 (store (select .cse1001 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse997 (store .cse1001 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse999))) (let ((.cse998 (select (select .cse997 .cse8) (+ v_arrayElimCell_109 4))) (.cse996 (+ v_ArrVal_1436 4))) (or (= .cse996 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (= (select (select .cse997 v_arrayElimCell_110) .cse998) 0) (< v_arrayElimCell_109 0) (< v_ArrVal_1436 0) (= (select (select .cse997 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) .cse998) 0) (= .cse996 |c_ULTIMATE.start_l2_insert_~list#1.offset|) (< .cse998 0) (= (select (select .cse997 v_arrayElimCell_114) (select .cse999 .cse996)) 0) (< (select (select .cse1000 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) .cse996) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436)))))))))) (.cse642 (forall ((v_ArrVal_1429 Int) (v_arrayElimCell_109 Int) (|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_prenex_5 Int) (v_arrayElimCell_110 Int) (v_ArrVal_1434 Int) (v_ArrVal_1436 Int)) (let ((.cse994 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429)))) (let ((.cse995 (store .cse994 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse994 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|)))) (let ((.cse991 (store (select .cse995 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse990 (store .cse995 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse991)) (.cse993 (+ v_arrayElimCell_109 4))) (let ((.cse992 (select (select .cse990 .cse8) .cse993)) (.cse989 (+ v_ArrVal_1436 4))) (or (= .cse989 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (= (select (select .cse990 v_prenex_5) (select .cse991 .cse989)) 0) (= (select (select .cse990 v_arrayElimCell_110) .cse992) 0) (< v_arrayElimCell_109 0) (< v_ArrVal_1436 0) (= (select (select .cse990 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) .cse992) 0) (< .cse992 0) (= |c_ULTIMATE.start_l2_insert_~list#1.offset| .cse993) (< (select (select .cse994 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) .cse989) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436) (= v_ArrVal_1436 v_arrayElimCell_109))))))))) (.cse660 (forall ((v_ArrVal_1429 Int) (v_ArrVal_1436 Int)) (let ((.cse986 (let ((.cse988 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429)))) (store .cse988 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse988 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|))))) (let ((.cse987 (select .cse986 |c_ULTIMATE.start_l1_insert_~item~1#1.base|)) (.cse982 (+ v_ArrVal_1436 4))) (or (= .cse982 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (< v_ArrVal_1436 0) (forall ((|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_ArrVal_1434 Int)) (let ((.cse985 (store .cse987 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse984 (store .cse986 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse985))) (let ((.cse983 (select (select .cse984 .cse8) |c_ULTIMATE.start_l1_insert_~item~1#1.offset|))) (or (< .cse983 0) (= (select (select .cse984 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) .cse983) 0) (= (select (select .cse984 |c_ULTIMATE.start_l2_insert_~item~0#1.base|) (select .cse985 .cse982)) 0)))))) (< (select .cse987 .cse982) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436)))))) (.cse125 (or (forall ((v_ArrVal_1429 Int) (v_arrayElimCell_109 Int) (v_arrayElimCell_110 Int) (v_arrayElimCell_115 Int) (v_ArrVal_1434 Int) (v_ArrVal_1436 Int)) (let ((.cse980 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429)))) (let ((.cse981 (store .cse980 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse980 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|)))) (let ((.cse976 (store (select .cse981 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse975 (store .cse981 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse976)) (.cse979 (+ v_arrayElimCell_109 4))) (let ((.cse978 (select (select .cse975 .cse8) .cse979)) (.cse977 (+ v_ArrVal_1436 4))) (or (= (select (select .cse975 v_arrayElimCell_115) (select .cse976 .cse977)) 0) (= .cse977 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (= (select (select .cse975 v_arrayElimCell_110) .cse978) 0) (= |c_ULTIMATE.start_l1_insert_~item~1#1.offset| .cse979) (< v_arrayElimCell_109 0) (< v_ArrVal_1436 0) (= .cse977 |c_ULTIMATE.start_l2_insert_~list#1.offset|) (< .cse978 0) (< (select (select .cse980 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) .cse977) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436) (= v_ArrVal_1436 v_arrayElimCell_109)))))))) .cse1)) (.cse807 (or .cse0 (and (or .cse912 .cse1) (forall ((v_ArrVal_1429 Int) (v_ArrVal_1436 Int)) (let ((.cse974 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429))) (.cse968 (+ v_ArrVal_1436 4))) (or (= .cse968 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (forall ((v_arrayElimCell_109 Int) (|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_arrayElimCell_110 Int) (v_ArrVal_1434 Int) (v_arrayElimCell_119 Int)) (let ((.cse973 (store .cse974 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse974 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|)))) (let ((.cse971 (store (select .cse973 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse969 (store .cse973 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse971)) (.cse972 (+ v_arrayElimCell_109 4))) (let ((.cse970 (select (select .cse969 .cse8) .cse972))) (or (= (select (select .cse969 v_arrayElimCell_110) .cse970) 0) (< v_arrayElimCell_109 0) (= (select (select .cse969 v_arrayElimCell_119) (select .cse971 .cse968)) 0) (= (select (select .cse969 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) .cse970) 0) (< .cse970 0) (= |c_ULTIMATE.start_l2_insert_~list#1.offset| .cse972) (= v_ArrVal_1436 v_arrayElimCell_109))))))) (< v_ArrVal_1436 0) (< (select (select .cse974 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) .cse968) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436))))))) (.cse267 (or (forall ((v_ArrVal_1429 Int) (|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_ArrVal_1434 Int)) (let ((.cse964 (let ((.cse966 (let ((.cse967 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429)))) (store .cse967 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse967 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|))))) (store .cse966 |c_ULTIMATE.start_l1_insert_~item~1#1.base| (store (select .cse966 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))))) (let ((.cse965 (select (select .cse964 .cse8) |c_ULTIMATE.start_l2_insert_~list#1.offset|))) (or (< v_ArrVal_1434 0) (= (select (select .cse964 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) v_ArrVal_1434) 0) (< .cse965 0) (= (select (select .cse964 |c_ULTIMATE.start_l2_insert_~item~0#1.base|) .cse965) 0))))) .cse28)) (.cse544 (= |c_~#list~0.offset| |c_ULTIMATE.start_l1_insert_~list#1.offset|)) (.cse163 (= |c_~#list~0.base| |c_ULTIMATE.start_l1_insert_~list#1.base|)) (.cse779 (forall ((v_ArrVal_1429 Int) (v_arrayElimCell_109 Int) (|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_arrayElimCell_110 Int) (v_ArrVal_1434 Int)) (let ((.cse959 (let ((.cse962 (let ((.cse963 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429)))) (store .cse963 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse963 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|))))) (store .cse962 |c_ULTIMATE.start_l1_insert_~item~1#1.base| (store (select .cse962 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434)))) (.cse961 (+ v_arrayElimCell_109 4))) (let ((.cse960 (select (select .cse959 .cse8) .cse961))) (or (= (select (select .cse959 v_arrayElimCell_110) .cse960) 0) (= |c_ULTIMATE.start_l1_insert_~item~1#1.offset| .cse961) (< v_arrayElimCell_109 0) (< v_ArrVal_1434 0) (< .cse960 0) (= (select (select .cse959 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) v_ArrVal_1434) 0) (= |c_ULTIMATE.start_l2_insert_~list#1.offset| .cse961)))))) (.cse697 (or (forall ((v_ArrVal_1429 Int) (v_arrayElimCell_109 Int) (|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_arrayElimCell_110 Int) (v_arrayElimCell_115 Int) (v_ArrVal_1434 Int) (v_ArrVal_1436 Int)) (let ((.cse957 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429)))) (let ((.cse958 (store .cse957 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse957 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|)))) (let ((.cse953 (store (select .cse958 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse952 (store .cse958 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse953)) (.cse956 (+ v_arrayElimCell_109 4))) (let ((.cse955 (select (select .cse952 .cse8) .cse956)) (.cse954 (+ v_ArrVal_1436 4))) (or (= (select (select .cse952 v_arrayElimCell_115) (select .cse953 .cse954)) 0) (= .cse954 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (= (select (select .cse952 v_arrayElimCell_110) .cse955) 0) (< v_arrayElimCell_109 0) (< v_ArrVal_1436 0) (= (select (select .cse952 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) .cse955) 0) (= .cse954 |c_ULTIMATE.start_l2_insert_~list#1.offset|) (< .cse955 0) (= |c_ULTIMATE.start_l2_insert_~list#1.offset| .cse956) (< (select (select .cse957 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) .cse954) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436) (= v_ArrVal_1436 v_arrayElimCell_109)))))))) .cse1)) (.cse430 (forall ((v_ArrVal_1429 Int) (v_prenex_5 Int) (v_ArrVal_1434 Int) (v_ArrVal_1436 Int)) (let ((.cse950 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429)))) (let ((.cse951 (store .cse950 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse950 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|)))) (let ((.cse948 (store (select .cse951 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse947 (store .cse951 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse948))) (let ((.cse946 (+ v_ArrVal_1436 4)) (.cse949 (select (select .cse947 .cse8) |c_ULTIMATE.start_l2_insert_~list#1.offset|))) (or (= .cse946 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (= (select (select .cse947 v_prenex_5) (select .cse948 .cse946)) 0) (< v_ArrVal_1436 0) (= .cse946 |c_ULTIMATE.start_l2_insert_~list#1.offset|) (< .cse949 0) (< (select (select .cse950 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) .cse946) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436) (= (select (select .cse947 |c_ULTIMATE.start_l2_insert_~item~0#1.base|) .cse949) 0))))))))) (.cse429 (forall ((v_ArrVal_1429 Int) (v_ArrVal_1434 Int) (v_ArrVal_1436 Int) (v_arrayElimCell_118 Int)) (let ((.cse944 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429)))) (let ((.cse945 (store .cse944 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse944 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|)))) (let ((.cse942 (store (select .cse945 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse941 (store .cse945 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse942))) (let ((.cse940 (+ v_ArrVal_1436 4)) (.cse943 (select (select .cse941 .cse8) |c_ULTIMATE.start_l2_insert_~list#1.offset|))) (or (= .cse940 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (= (select (select .cse941 v_arrayElimCell_118) (select .cse942 .cse940)) 0) (< v_ArrVal_1436 0) (= .cse940 |c_ULTIMATE.start_l2_insert_~list#1.offset|) (< .cse943 0) (< (select (select .cse944 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) .cse940) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436) (= (select (select .cse941 |c_ULTIMATE.start_l2_insert_~item~0#1.base|) .cse943) 0)))))))))) (and (or .cse0 .cse1 (forall ((v_ArrVal_1429 Int) (v_arrayElimCell_109 Int) (|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_prenex_5 Int) (v_ArrVal_1434 Int) (v_ArrVal_1436 Int)) (let ((.cse7 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429)))) (let ((.cse9 (store .cse7 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse7 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|)))) (let ((.cse4 (store (select .cse9 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse3 (store .cse9 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse4)) (.cse6 (+ v_arrayElimCell_109 4))) (let ((.cse5 (select (select .cse3 .cse8) .cse6)) (.cse2 (+ v_ArrVal_1436 4))) (or (= .cse2 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (= (select (select .cse3 v_prenex_5) (select .cse4 .cse2)) 0) (< v_arrayElimCell_109 0) (< v_ArrVal_1436 0) (= (select (select .cse3 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) .cse5) 0) (= .cse2 |c_ULTIMATE.start_l2_insert_~list#1.offset|) (< .cse5 0) (= |c_ULTIMATE.start_l2_insert_~list#1.offset| .cse6) (= (select (select .cse3 |c_ULTIMATE.start_l2_insert_~item~0#1.base|) .cse5) 0) (< (select (select .cse7 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) .cse2) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436) (= v_ArrVal_1436 v_arrayElimCell_109))))))))) (or .cse12 .cse13 (let ((.cse29 (not .cse58))) (and (forall ((v_ArrVal_1429 Int) (v_ArrVal_1436 Int)) (or (< v_ArrVal_1436 0) (forall ((v_ArrVal_1434 Int)) (let ((.cse20 (let ((.cse21 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429)))) (store .cse21 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse21 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|))))) (let ((.cse19 (store (select .cse20 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse18 (store .cse20 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse19))) (let ((.cse16 (select .cse19 (+ v_ArrVal_1436 4))) (.cse15 (select .cse18 |c_ULTIMATE.start_l2_insert_~item~0#1.base|)) (.cse14 (select (select .cse18 .cse8) |c_ULTIMATE.start_l2_insert_~list#1.offset|))) (or (< .cse14 0) (= (select .cse15 .cse16) 0) (< .cse16 0) (forall ((|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int)) (let ((.cse17 (select .cse18 |ULTIMATE.start_l1_insert_#t~mem13#1.base|))) (or (= (select .cse17 .cse16) 0) (= (select .cse17 .cse14) 0)))) (= (select .cse15 .cse14) 0))))))) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436))) (or (forall ((v_ArrVal_1429 Int) (|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_prenex_5 Int) (v_ArrVal_1434 Int) (v_ArrVal_1436 Int)) (let ((.cse26 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429)))) (let ((.cse27 (store .cse26 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse26 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|)))) (let ((.cse24 (store (select .cse27 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse23 (store .cse27 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse24))) (let ((.cse22 (+ v_ArrVal_1436 4)) (.cse25 (select (select .cse23 .cse8) |c_ULTIMATE.start_l2_insert_~list#1.offset|))) (or (= .cse22 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (= (select (select .cse23 v_prenex_5) (select .cse24 .cse22)) 0) (< v_ArrVal_1436 0) (< .cse25 0) (< (select (select .cse26 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) .cse22) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436) (= (select (select .cse23 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) .cse25) 0) (= (select (select .cse23 |c_ULTIMATE.start_l2_insert_~item~0#1.base|) .cse25) 0)))))))) .cse0) (or .cse28 (and (or .cse29 .cse30 .cse31) (forall ((v_ArrVal_1429 Int) (|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_ArrVal_1434 Int)) (let ((.cse34 (let ((.cse35 (let ((.cse36 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429)))) (store .cse36 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse36 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|))))) (store .cse35 |c_ULTIMATE.start_l1_insert_~item~1#1.base| (store (select .cse35 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))))) (let ((.cse32 (select .cse34 |ULTIMATE.start_l1_insert_#t~mem13#1.base|)) (.cse33 (select (select .cse34 .cse8) |c_ULTIMATE.start_l2_insert_~list#1.offset|))) (or (< v_ArrVal_1434 0) (= (select .cse32 v_ArrVal_1434) 0) (< .cse33 0) (= (select .cse32 .cse33) 0) (= (select (select .cse34 |c_ULTIMATE.start_l2_insert_~item~0#1.base|) .cse33) 0))))))) (or .cse29 .cse30 (and (forall ((v_ArrVal_1429 Int) (v_ArrVal_1436 Int)) (or (< v_ArrVal_1436 0) (forall ((v_ArrVal_1434 Int)) (let ((.cse42 (let ((.cse43 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429)))) (store .cse43 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse43 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|))))) (let ((.cse41 (store (select .cse42 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse38 (store .cse42 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse41))) (let ((.cse39 (select .cse41 (+ v_ArrVal_1436 4))) (.cse37 (select (select .cse38 .cse8) |c_ULTIMATE.start_l2_insert_~list#1.offset|))) (or (< .cse37 0) (= (select (select .cse38 |c_ULTIMATE.start_l2_insert_~item~0#1.base|) .cse39) 0) (< .cse39 0) (forall ((|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int)) (let ((.cse40 (select .cse38 |ULTIMATE.start_l1_insert_#t~mem13#1.base|))) (or (= (select .cse40 .cse39) 0) (= (select .cse40 .cse37) 0)))))))))) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436))) (forall ((v_ArrVal_1429 Int) (v_ArrVal_1436 Int)) (let ((.cse49 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429))) (.cse44 (+ v_ArrVal_1436 4))) (or (= .cse44 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (< v_ArrVal_1436 0) (forall ((|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_ArrVal_1434 Int)) (let ((.cse48 (store .cse49 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse49 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|)))) (let ((.cse47 (store (select .cse48 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse46 (store .cse48 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse47))) (let ((.cse45 (select (select .cse46 .cse8) |c_ULTIMATE.start_l2_insert_~list#1.offset|))) (or (< .cse45 0) (= (select (select .cse46 |c_ULTIMATE.start_l2_insert_~item~0#1.base|) (select .cse47 .cse44)) 0) (= (select (select .cse46 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) .cse45) 0))))))) (< (select (select .cse49 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) .cse44) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436)))))) (forall ((v_ArrVal_1429 Int) (v_ArrVal_1436 Int)) (let ((.cse55 (let ((.cse57 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429)))) (store .cse57 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse57 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|))))) (let ((.cse56 (select .cse55 |c_ULTIMATE.start_l1_insert_~item~1#1.base|)) (.cse50 (+ v_ArrVal_1436 4))) (or (= .cse50 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (< v_ArrVal_1436 0) (forall ((|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_ArrVal_1434 Int)) (let ((.cse53 (store .cse56 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse54 (store .cse55 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse53))) (let ((.cse52 (select .cse54 |c_ULTIMATE.start_l2_insert_~item~0#1.base|)) (.cse51 (select (select .cse54 .cse8) |c_ULTIMATE.start_l2_insert_~list#1.offset|))) (or (< .cse51 0) (= (select .cse52 (select .cse53 .cse50)) 0) (= (select (select .cse54 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) .cse51) 0) (= (select .cse52 .cse51) 0)))))) (< (select .cse56 .cse50) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436)))))))) (forall ((v_ArrVal_1429 Int) (v_ArrVal_1436 Int)) (let ((.cse65 (let ((.cse66 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429)))) (store .cse66 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse66 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|))))) (let ((.cse59 (+ v_ArrVal_1436 4)) (.cse60 (select .cse65 |c_ULTIMATE.start_l1_insert_~item~1#1.base|))) (or (= .cse59 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (< v_ArrVal_1436 0) (< (select .cse60 .cse59) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436) (forall ((v_arrayElimCell_109 Int) (|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_ArrVal_1434 Int)) (let ((.cse64 (store .cse60 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse61 (store .cse65 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse64))) (let ((.cse63 (select .cse61 |c_ULTIMATE.start_l2_insert_~item~0#1.base|)) (.cse62 (select (select .cse61 .cse8) (+ v_arrayElimCell_109 4)))) (or (< v_arrayElimCell_109 0) (= (select (select .cse61 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) .cse62) 0) (< .cse62 0) (= (select .cse63 (select .cse64 .cse59)) 0) (= (select .cse63 .cse62) 0)))))))))) (or .cse67 (and (or (forall ((v_ArrVal_1429 Int) (v_arrayElimCell_109 Int) (v_arrayElimCell_110 Int) (v_arrayElimCell_115 Int) (v_ArrVal_1434 Int) (v_ArrVal_1436 Int)) (let ((.cse73 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429)))) (let ((.cse74 (store .cse73 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse73 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|)))) (let ((.cse69 (store (select .cse74 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse68 (store .cse74 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse69)) (.cse72 (+ v_arrayElimCell_109 4))) (let ((.cse71 (select (select .cse68 .cse8) .cse72)) (.cse70 (+ v_ArrVal_1436 4))) (or (= (select (select .cse68 v_arrayElimCell_115) (select .cse69 .cse70)) 0) (= .cse70 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (= (select (select .cse68 v_arrayElimCell_110) .cse71) 0) (= |c_ULTIMATE.start_l1_insert_~item~1#1.offset| .cse72) (< v_arrayElimCell_109 0) (< v_ArrVal_1436 0) (= .cse70 |c_ULTIMATE.start_l2_insert_~list#1.offset|) (< .cse71 0) (< (select (select .cse73 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) .cse70) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436)))))))) .cse1) (or .cse0 (forall ((v_ArrVal_1429 Int) (v_arrayElimCell_109 Int) (v_arrayElimCell_110 Int) (v_ArrVal_1434 Int) (v_arrayElimCell_114 Int) (v_ArrVal_1436 Int)) (let ((.cse80 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429)))) (let ((.cse81 (store .cse80 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse80 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|)))) (let ((.cse79 (store (select .cse81 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse76 (store .cse81 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse79)) (.cse78 (+ v_arrayElimCell_109 4))) (let ((.cse77 (select (select .cse76 .cse8) .cse78)) (.cse75 (+ v_ArrVal_1436 4))) (or (= .cse75 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (= (select (select .cse76 v_arrayElimCell_110) .cse77) 0) (= |c_ULTIMATE.start_l1_insert_~item~1#1.offset| .cse78) (< v_arrayElimCell_109 0) (< v_ArrVal_1436 0) (= .cse75 |c_ULTIMATE.start_l2_insert_~list#1.offset|) (< .cse77 0) (= (select (select .cse76 v_arrayElimCell_114) (select .cse79 .cse75)) 0) (< (select (select .cse80 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) .cse75) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436)))))))) .cse1))) (or (forall ((v_ArrVal_1429 Int) (v_arrayElimCell_109 Int) (v_prenex_5 Int) (v_ArrVal_1434 Int) (v_ArrVal_1436 Int)) (let ((.cse87 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429)))) (let ((.cse88 (store .cse87 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse87 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|)))) (let ((.cse84 (store (select .cse88 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse83 (store .cse88 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse84)) (.cse85 (+ v_arrayElimCell_109 4))) (let ((.cse86 (select (select .cse83 .cse8) .cse85)) (.cse82 (+ v_ArrVal_1436 4))) (or (= .cse82 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (= (select (select .cse83 v_prenex_5) (select .cse84 .cse82)) 0) (= |c_ULTIMATE.start_l1_insert_~item~1#1.offset| .cse85) (< v_arrayElimCell_109 0) (< v_ArrVal_1436 0) (= .cse82 |c_ULTIMATE.start_l2_insert_~list#1.offset|) (< .cse86 0) (= (select (select .cse83 |c_ULTIMATE.start_l2_insert_~item~0#1.base|) .cse86) 0) (< (select (select .cse87 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) .cse82) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436) (= v_ArrVal_1436 v_arrayElimCell_109)))))))) .cse0 .cse1) (or (and .cse89 (or .cse0 (forall ((v_ArrVal_1429 Int) (v_arrayElimCell_109 Int) (v_arrayElimCell_110 Int) (v_ArrVal_1434 Int) (v_arrayElimCell_114 Int) (v_ArrVal_1436 Int)) (let ((.cse95 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429)))) (let ((.cse96 (store .cse95 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse95 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|)))) (let ((.cse94 (store (select .cse96 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse91 (store .cse96 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse94)) (.cse93 (+ v_arrayElimCell_109 4))) (let ((.cse92 (select (select .cse91 .cse8) .cse93)) (.cse90 (+ v_ArrVal_1436 4))) (or (= .cse90 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (= (select (select .cse91 v_arrayElimCell_110) .cse92) 0) (= |c_ULTIMATE.start_l1_insert_~item~1#1.offset| .cse93) (< v_arrayElimCell_109 0) (< v_ArrVal_1436 0) (= .cse90 |c_ULTIMATE.start_l2_insert_~list#1.offset|) (< .cse92 0) (= (select (select .cse91 v_arrayElimCell_114) (select .cse94 .cse90)) 0) (= |c_ULTIMATE.start_l2_insert_~list#1.offset| .cse93) (< (select (select .cse95 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) .cse90) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436) (= v_ArrVal_1436 v_arrayElimCell_109)))))))) .cse1)) .cse67) (or .cse0 (forall ((v_ArrVal_1429 Int) (v_arrayElimCell_109 Int) (|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_prenex_5 Int) (v_ArrVal_1434 Int) (v_ArrVal_1436 Int)) (let ((.cse101 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429)))) (let ((.cse102 (store .cse101 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse101 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|)))) (let ((.cse99 (store (select .cse102 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse98 (store .cse102 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse99))) (let ((.cse100 (select (select .cse98 .cse8) (+ v_arrayElimCell_109 4))) (.cse97 (+ v_ArrVal_1436 4))) (or (= .cse97 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (= (select (select .cse98 v_prenex_5) (select .cse99 .cse97)) 0) (< v_arrayElimCell_109 0) (< v_ArrVal_1436 0) (= (select (select .cse98 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) .cse100) 0) (< .cse100 0) (= (select (select .cse98 |c_ULTIMATE.start_l2_insert_~item~0#1.base|) .cse100) 0) (< (select (select .cse101 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) .cse97) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436) (= v_ArrVal_1436 v_arrayElimCell_109)))))))) .cse1) (or (and .cse103 .cse104) .cse67) (forall ((v_ArrVal_1429 Int) (v_ArrVal_1436 Int)) (let ((.cse105 (+ v_ArrVal_1436 4)) (.cse106 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429)))) (or (= .cse105 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (< v_ArrVal_1436 0) (= .cse105 |c_ULTIMATE.start_l2_insert_~list#1.offset|) (< (select (select .cse106 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) .cse105) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436) (forall ((v_arrayElimCell_109 Int) (|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_ArrVal_1434 Int) (v_arrayElimCell_118 Int)) (let ((.cse110 (store .cse106 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse106 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|)))) (let ((.cse108 (store (select .cse110 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse107 (store .cse110 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse108))) (let ((.cse109 (select (select .cse107 .cse8) (+ v_arrayElimCell_109 4)))) (or (= (select (select .cse107 v_arrayElimCell_118) (select .cse108 .cse105)) 0) (< v_arrayElimCell_109 0) (= (select (select .cse107 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) .cse109) 0) (< .cse109 0) (= (select (select .cse107 |c_ULTIMATE.start_l2_insert_~item~0#1.base|) .cse109) 0) (= v_ArrVal_1436 v_arrayElimCell_109)))))))))) (or (and (forall ((v_ArrVal_1429 Int) (v_ArrVal_1436 Int)) (let ((.cse111 (+ v_ArrVal_1436 4))) (or (< v_ArrVal_1436 0) (= .cse111 |c_ULTIMATE.start_l2_insert_~list#1.offset|) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436) (forall ((v_arrayElimCell_110 Int) (v_ArrVal_1434 Int)) (let ((.cse117 (let ((.cse118 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429)))) (store .cse118 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse118 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|))))) (let ((.cse116 (store (select .cse117 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse115 (store .cse117 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse116))) (let ((.cse112 (select (select .cse115 .cse8) |c_ULTIMATE.start_l1_insert_~item~1#1.offset|)) (.cse114 (select .cse116 .cse111))) (or (< .cse112 0) (forall ((|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int)) (let ((.cse113 (select .cse115 |ULTIMATE.start_l1_insert_#t~mem13#1.base|))) (or (= (select .cse113 .cse112) 0) (= (select .cse113 .cse114) 0)))) (= (select (select .cse115 v_arrayElimCell_110) .cse114) 0) (< .cse114 0)))))))))) (forall ((v_ArrVal_1429 Int) (v_ArrVal_1436 Int)) (let ((.cse124 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429))) (.cse119 (+ v_ArrVal_1436 4))) (or (= .cse119 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (< v_ArrVal_1436 0) (forall ((|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_arrayElimCell_110 Int) (v_ArrVal_1434 Int)) (let ((.cse123 (store .cse124 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse124 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|)))) (let ((.cse122 (store (select .cse123 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse121 (store .cse123 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse122))) (let ((.cse120 (select (select .cse121 .cse8) |c_ULTIMATE.start_l1_insert_~item~1#1.offset|))) (or (< .cse120 0) (= (select (select .cse121 v_arrayElimCell_110) (select .cse122 .cse119)) 0) (= (select (select .cse121 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) .cse120) 0))))))) (= .cse119 |c_ULTIMATE.start_l2_insert_~list#1.offset|) (< (select (select .cse124 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) .cse119) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436))))) .cse30 .cse58 .cse28) (or .cse67 (and .cse125 (or (and (or (forall ((v_ArrVal_1429 Int) (v_arrayElimCell_109 Int) (v_arrayElimCell_110 Int) (v_ArrVal_1434 Int) (v_arrayElimCell_114 Int) (v_ArrVal_1436 Int)) (let ((.cse131 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429)))) (let ((.cse132 (store .cse131 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse131 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|)))) (let ((.cse130 (store (select .cse132 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse127 (store .cse132 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse130)) (.cse129 (+ v_arrayElimCell_109 4))) (let ((.cse128 (select (select .cse127 .cse8) .cse129)) (.cse126 (+ v_ArrVal_1436 4))) (or (= .cse126 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (= (select (select .cse127 v_arrayElimCell_110) .cse128) 0) (= |c_ULTIMATE.start_l1_insert_~item~1#1.offset| .cse129) (< v_arrayElimCell_109 0) (< v_ArrVal_1436 0) (= .cse126 |c_ULTIMATE.start_l2_insert_~list#1.offset|) (< .cse128 0) (= (select (select .cse127 v_arrayElimCell_114) (select .cse130 .cse126)) 0) (< (select (select .cse131 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) .cse126) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436) (= v_ArrVal_1436 v_arrayElimCell_109)))))))) .cse1) (forall ((v_ArrVal_1429 Int) (v_ArrVal_1436 Int)) (let ((.cse139 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429))) (.cse133 (+ v_ArrVal_1436 4))) (or (= .cse133 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (forall ((v_arrayElimCell_109 Int) (v_arrayElimCell_110 Int) (v_ArrVal_1434 Int) (v_arrayElimCell_118 Int)) (let ((.cse138 (store .cse139 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse139 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|)))) (let ((.cse136 (store (select .cse138 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse134 (store .cse138 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse136)) (.cse137 (+ v_arrayElimCell_109 4))) (let ((.cse135 (select (select .cse134 .cse8) .cse137))) (or (= (select (select .cse134 v_arrayElimCell_110) .cse135) 0) (= (select (select .cse134 v_arrayElimCell_118) (select .cse136 .cse133)) 0) (= |c_ULTIMATE.start_l1_insert_~item~1#1.offset| .cse137) (< v_arrayElimCell_109 0) (< .cse135 0) (= v_ArrVal_1436 v_arrayElimCell_109))))))) (< v_ArrVal_1436 0) (= .cse133 |c_ULTIMATE.start_l2_insert_~list#1.offset|) (< (select (select .cse139 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) .cse133) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436))))) .cse0))) (or .cse67 (and .cse140 .cse141)) (forall ((v_ArrVal_1429 Int) (v_ArrVal_1436 Int)) (let ((.cse148 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429))) (.cse142 (+ v_ArrVal_1436 4))) (or (= .cse142 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (forall ((v_arrayElimCell_109 Int) (|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_arrayElimCell_110 Int) (v_ArrVal_1434 Int) (v_arrayElimCell_118 Int)) (let ((.cse147 (store .cse148 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse148 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|)))) (let ((.cse145 (store (select .cse147 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse143 (store .cse147 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse145)) (.cse146 (+ v_arrayElimCell_109 4))) (let ((.cse144 (select (select .cse143 .cse8) .cse146))) (or (= (select (select .cse143 v_arrayElimCell_110) .cse144) 0) (= (select (select .cse143 v_arrayElimCell_118) (select .cse145 .cse142)) 0) (< v_arrayElimCell_109 0) (= (select (select .cse143 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) .cse144) 0) (< .cse144 0) (= |c_ULTIMATE.start_l2_insert_~list#1.offset| .cse146) (= v_ArrVal_1436 v_arrayElimCell_109))))))) (< v_ArrVal_1436 0) (= .cse142 |c_ULTIMATE.start_l2_insert_~list#1.offset|) (< (select (select .cse148 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) .cse142) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436)))) (or (and (or .cse0 (and (forall ((v_ArrVal_1429 Int) (v_ArrVal_1436 Int)) (let ((.cse155 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429))) (.cse149 (+ v_ArrVal_1436 4))) (or (= .cse149 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (forall ((v_arrayElimCell_109 Int) (v_arrayElimCell_110 Int) (v_ArrVal_1434 Int) (v_arrayElimCell_119 Int)) (let ((.cse154 (store .cse155 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse155 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|)))) (let ((.cse153 (store (select .cse154 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse150 (store .cse154 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse153)) (.cse152 (+ v_arrayElimCell_109 4))) (let ((.cse151 (select (select .cse150 .cse8) .cse152))) (or (= (select (select .cse150 v_arrayElimCell_110) .cse151) 0) (= |c_ULTIMATE.start_l1_insert_~item~1#1.offset| .cse152) (< v_arrayElimCell_109 0) (= (select (select .cse150 v_arrayElimCell_119) (select .cse153 .cse149)) 0) (< .cse151 0) (= |c_ULTIMATE.start_l2_insert_~list#1.offset| .cse152) (= v_ArrVal_1436 v_arrayElimCell_109))))))) (< v_ArrVal_1436 0) (< (select (select .cse155 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) .cse149) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436)))) (or (forall ((v_ArrVal_1429 Int) (v_arrayElimCell_109 Int) (v_arrayElimCell_110 Int) (v_ArrVal_1434 Int) (v_arrayElimCell_114 Int) (v_ArrVal_1436 Int)) (let ((.cse161 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429)))) (let ((.cse162 (store .cse161 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse161 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|)))) (let ((.cse160 (store (select .cse162 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse157 (store .cse162 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse160)) (.cse159 (+ v_arrayElimCell_109 4))) (let ((.cse158 (select (select .cse157 .cse8) .cse159)) (.cse156 (+ v_ArrVal_1436 4))) (or (= .cse156 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (= (select (select .cse157 v_arrayElimCell_110) .cse158) 0) (= |c_ULTIMATE.start_l1_insert_~item~1#1.offset| .cse159) (< v_arrayElimCell_109 0) (< v_ArrVal_1436 0) (< .cse158 0) (= (select (select .cse157 v_arrayElimCell_114) (select .cse160 .cse156)) 0) (= |c_ULTIMATE.start_l2_insert_~list#1.offset| .cse159) (< (select (select .cse161 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) .cse156) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436) (= v_ArrVal_1436 v_arrayElimCell_109)))))))) .cse1))) .cse89) .cse67) (or .cse163 (and .cse164 (or (forall ((v_ArrVal_1429 Int) (v_arrayElimCell_109 Int) (|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_arrayElimCell_126 Int) (v_ArrVal_1434 Int)) (let ((.cse165 (let ((.cse167 (let ((.cse168 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429)))) (store .cse168 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse168 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|))))) (store .cse167 |c_ULTIMATE.start_l1_insert_~item~1#1.base| (store (select .cse167 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))))) (let ((.cse166 (select (select .cse165 .cse8) (+ v_arrayElimCell_109 4)))) (or (< v_arrayElimCell_109 0) (= (select (select .cse165 v_arrayElimCell_126) .cse166) 0) (= (select (select .cse165 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) .cse166) 0) (< .cse166 0))))) .cse67) (or .cse12 .cse13 .cse169) (forall ((v_ArrVal_1429 Int) (v_arrayElimCell_109 Int)) (or (< v_arrayElimCell_109 0) (forall ((|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_arrayElimCell_126 Int) (v_ArrVal_1434 Int)) (let ((.cse170 (let ((.cse172 (let ((.cse173 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429)))) (store .cse173 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse173 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|))))) (store .cse172 |c_ULTIMATE.start_l1_insert_~item~1#1.base| (store (select .cse172 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))))) (let ((.cse171 (select (select .cse170 .cse8) (+ v_arrayElimCell_109 4)))) (or (= (select (select .cse170 v_arrayElimCell_126) .cse171) 0) (= (select (select .cse170 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) .cse171) 0) (< .cse171 0) (= (select (select .cse170 |c_ULTIMATE.start_l2_insert_~item~0#1.base|) .cse171) 0))))))) (forall ((v_ArrVal_1429 Int) (v_arrayElimCell_109 Int)) (let ((.cse176 (+ v_arrayElimCell_109 4))) (or (forall ((|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_arrayElimCell_126 Int) (v_ArrVal_1434 Int)) (let ((.cse174 (let ((.cse177 (let ((.cse178 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429)))) (store .cse178 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse178 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|))))) (store .cse177 |c_ULTIMATE.start_l1_insert_~item~1#1.base| (store (select .cse177 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))))) (let ((.cse175 (select (select .cse174 .cse8) .cse176))) (or (= (select (select .cse174 v_arrayElimCell_126) .cse175) 0) (= (select (select .cse174 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) .cse175) 0) (< .cse175 0))))) (< v_arrayElimCell_109 0) (= |c_ULTIMATE.start_l2_insert_~list#1.offset| .cse176)))) (forall ((v_ArrVal_1429 Int) (v_arrayElimCell_109 Int)) (let ((.cse181 (+ v_arrayElimCell_109 4))) (or (forall ((v_arrayElimCell_126 Int) (v_ArrVal_1434 Int)) (let ((.cse179 (let ((.cse182 (let ((.cse183 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429)))) (store .cse183 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse183 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|))))) (store .cse182 |c_ULTIMATE.start_l1_insert_~item~1#1.base| (store (select .cse182 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))))) (let ((.cse180 (select (select .cse179 .cse8) .cse181))) (or (= (select (select .cse179 v_arrayElimCell_126) .cse180) 0) (< .cse180 0))))) (= |c_ULTIMATE.start_l1_insert_~item~1#1.offset| .cse181) (< v_arrayElimCell_109 0) (= |c_ULTIMATE.start_l2_insert_~list#1.offset| .cse181)))) (or .cse67 (forall ((v_ArrVal_1429 Int) (v_arrayElimCell_109 Int) (v_arrayElimCell_126 Int) (v_ArrVal_1434 Int)) (let ((.cse185 (let ((.cse187 (let ((.cse188 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429)))) (store .cse188 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse188 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|))))) (store .cse187 |c_ULTIMATE.start_l1_insert_~item~1#1.base| (store (select .cse187 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434)))) (.cse184 (+ v_arrayElimCell_109 4))) (let ((.cse186 (select (select .cse185 .cse8) .cse184))) (or (= |c_ULTIMATE.start_l1_insert_~item~1#1.offset| .cse184) (< v_arrayElimCell_109 0) (= (select (select .cse185 v_arrayElimCell_126) .cse186) 0) (< .cse186 0)))))) .cse189 (or (and (forall ((v_ArrVal_1429 Int) (v_arrayElimCell_109 Int)) (or (< v_arrayElimCell_109 0) (forall ((v_arrayElimCell_126 Int) (v_ArrVal_1434 Int)) (let ((.cse190 (let ((.cse192 (let ((.cse193 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429)))) (store .cse193 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse193 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|))))) (store .cse192 |c_ULTIMATE.start_l1_insert_~item~1#1.base| (store (select .cse192 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))))) (let ((.cse191 (select (select .cse190 .cse8) (+ v_arrayElimCell_109 4)))) (or (= (select (select .cse190 v_arrayElimCell_126) .cse191) 0) (< .cse191 0) (= (select (select .cse190 |c_ULTIMATE.start_l2_insert_~item~0#1.base|) .cse191) 0))))))) .cse194 (forall ((v_ArrVal_1429 Int) (v_arrayElimCell_109 Int)) (let ((.cse197 (+ v_arrayElimCell_109 4))) (or (forall ((v_arrayElimCell_126 Int) (v_ArrVal_1434 Int)) (let ((.cse195 (let ((.cse198 (let ((.cse199 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429)))) (store .cse199 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse199 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|))))) (store .cse198 |c_ULTIMATE.start_l1_insert_~item~1#1.base| (store (select .cse198 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))))) (let ((.cse196 (select (select .cse195 .cse8) .cse197))) (or (= (select (select .cse195 v_arrayElimCell_126) .cse196) 0) (< .cse196 0))))) (< v_arrayElimCell_109 0) (= |c_ULTIMATE.start_l2_insert_~list#1.offset| .cse197)))) (or .cse67 (forall ((v_arrayElimCell_109 Int) (v_ArrVal_1429 Int) (v_arrayElimCell_126 Int) (v_ArrVal_1434 Int)) (let ((.cse200 (let ((.cse202 (let ((.cse203 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429)))) (store .cse203 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse203 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|))))) (store .cse202 |c_ULTIMATE.start_l1_insert_~item~1#1.base| (store (select .cse202 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))))) (let ((.cse201 (select (select .cse200 .cse8) (+ v_arrayElimCell_109 4)))) (or (< v_arrayElimCell_109 0) (= (select (select .cse200 v_arrayElimCell_126) .cse201) 0) (< .cse201 0))))))) .cse1) (forall ((v_ArrVal_1429 Int) (v_arrayElimCell_109 Int)) (let ((.cse204 (+ v_arrayElimCell_109 4))) (or (= |c_ULTIMATE.start_l1_insert_~item~1#1.offset| .cse204) (< v_arrayElimCell_109 0) (forall ((v_arrayElimCell_126 Int) (v_ArrVal_1434 Int)) (let ((.cse205 (let ((.cse207 (let ((.cse208 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429)))) (store .cse208 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse208 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|))))) (store .cse207 |c_ULTIMATE.start_l1_insert_~item~1#1.base| (store (select .cse207 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))))) (let ((.cse206 (select (select .cse205 .cse8) .cse204))) (or (= (select (select .cse205 v_arrayElimCell_126) .cse206) 0) (< .cse206 0) (= (select (select .cse205 |c_ULTIMATE.start_l2_insert_~item~0#1.base|) .cse206) 0)))))))))) (or .cse0 .cse1 (forall ((v_ArrVal_1429 Int) (v_arrayElimCell_109 Int) (v_prenex_5 Int) (v_ArrVal_1434 Int) (v_ArrVal_1436 Int)) (let ((.cse214 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429)))) (let ((.cse215 (store .cse214 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse214 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|)))) (let ((.cse211 (store (select .cse215 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse210 (store .cse215 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse211)) (.cse212 (+ v_arrayElimCell_109 4))) (let ((.cse213 (select (select .cse210 .cse8) .cse212)) (.cse209 (+ v_ArrVal_1436 4))) (or (= .cse209 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (= (select (select .cse210 v_prenex_5) (select .cse211 .cse209)) 0) (= |c_ULTIMATE.start_l1_insert_~item~1#1.offset| .cse212) (< v_arrayElimCell_109 0) (< v_ArrVal_1436 0) (= .cse209 |c_ULTIMATE.start_l2_insert_~list#1.offset|) (< .cse213 0) (= (select (select .cse210 |c_ULTIMATE.start_l2_insert_~item~0#1.base|) .cse213) 0) (< (select (select .cse214 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) .cse209) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436))))))))) (forall ((v_ArrVal_1429 Int) (v_ArrVal_1436 Int)) (or (forall ((v_arrayElimCell_109 Int)) (let ((.cse216 (+ v_arrayElimCell_109 4))) (or (= |c_ULTIMATE.start_l1_insert_~item~1#1.offset| .cse216) (< v_arrayElimCell_109 0) (forall ((v_ArrVal_1434 Int)) (let ((.cse222 (let ((.cse223 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429)))) (store .cse223 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse223 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|))))) (let ((.cse221 (store (select .cse222 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse218 (store .cse222 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse221))) (let ((.cse219 (select .cse221 (+ v_ArrVal_1436 4))) (.cse220 (select .cse218 |c_ULTIMATE.start_l2_insert_~item~0#1.base|)) (.cse217 (select (select .cse218 .cse8) .cse216))) (or (< .cse217 0) (forall ((|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int)) (= (select (select .cse218 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) .cse219) 0)) (= (select .cse220 .cse219) 0) (< .cse219 0) (= (select .cse220 .cse217) 0)))))))))) (< v_ArrVal_1436 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436))) (forall ((v_ArrVal_1429 Int) (v_ArrVal_1436 Int)) (let ((.cse229 (let ((.cse231 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429)))) (store .cse231 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse231 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|))))) (let ((.cse230 (select .cse229 |c_ULTIMATE.start_l1_insert_~item~1#1.base|)) (.cse224 (+ v_ArrVal_1436 4))) (or (= .cse224 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (< v_ArrVal_1436 0) (forall ((v_arrayElimCell_109 Int) (v_arrayElimCell_110 Int) (v_ArrVal_1434 Int)) (let ((.cse228 (store .cse230 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse225 (store .cse229 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse228)) (.cse227 (+ v_arrayElimCell_109 4))) (let ((.cse226 (select (select .cse225 .cse8) .cse227))) (or (= (select (select .cse225 v_arrayElimCell_110) .cse226) 0) (= |c_ULTIMATE.start_l1_insert_~item~1#1.offset| .cse227) (< v_arrayElimCell_109 0) (< .cse226 0) (= |c_ULTIMATE.start_l2_insert_~list#1.offset| .cse227) (= (select (select .cse225 |c_ULTIMATE.start_l2_insert_~item~0#1.base|) (select .cse228 .cse224)) 0) (= v_ArrVal_1436 v_arrayElimCell_109)))))) (< (select .cse230 .cse224) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436))))) (or (forall ((v_ArrVal_1429 Int) (v_arrayElimCell_109 Int) (|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_prenex_5 Int) (v_ArrVal_1434 Int) (v_ArrVal_1436 Int)) (let ((.cse237 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429)))) (let ((.cse238 (store .cse237 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse237 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|)))) (let ((.cse234 (store (select .cse238 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse233 (store .cse238 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse234)) (.cse236 (+ v_arrayElimCell_109 4))) (let ((.cse235 (select (select .cse233 .cse8) .cse236)) (.cse232 (+ v_ArrVal_1436 4))) (or (= .cse232 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (= (select (select .cse233 v_prenex_5) (select .cse234 .cse232)) 0) (< v_arrayElimCell_109 0) (< v_ArrVal_1436 0) (= (select (select .cse233 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) .cse235) 0) (= .cse232 |c_ULTIMATE.start_l2_insert_~list#1.offset|) (< .cse235 0) (= |c_ULTIMATE.start_l2_insert_~list#1.offset| .cse236) (= (select (select .cse233 |c_ULTIMATE.start_l2_insert_~item~0#1.base|) .cse235) 0) (< (select (select .cse237 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) .cse232) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436)))))))) .cse0 .cse1) (forall ((v_ArrVal_1429 Int) (v_ArrVal_1436 Int)) (or (forall ((v_ArrVal_1434 Int)) (let ((.cse245 (let ((.cse246 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429)))) (store .cse246 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse246 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|))))) (let ((.cse244 (store (select .cse245 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse242 (store .cse245 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse244))) (let ((.cse243 (select .cse242 |c_ULTIMATE.start_l2_insert_~item~0#1.base|)) (.cse241 (select .cse244 (+ v_ArrVal_1436 4)))) (or (forall ((v_arrayElimCell_109 Int)) (let ((.cse239 (select (select .cse242 .cse8) (+ v_arrayElimCell_109 4)))) (or (< v_arrayElimCell_109 0) (< .cse239 0) (forall ((|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int)) (let ((.cse240 (select .cse242 |ULTIMATE.start_l1_insert_#t~mem13#1.base|))) (or (= (select .cse240 .cse239) 0) (= (select .cse240 .cse241) 0)))) (= (select .cse243 .cse239) 0)))) (= (select .cse243 .cse241) 0) (< .cse241 0))))))) (< v_ArrVal_1436 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436))) (forall ((v_ArrVal_1429 Int) (v_ArrVal_1436 Int)) (let ((.cse247 (+ v_ArrVal_1436 4)) (.cse248 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429)))) (or (= .cse247 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (< v_ArrVal_1436 0) (= .cse247 |c_ULTIMATE.start_l2_insert_~list#1.offset|) (< (select (select .cse248 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) .cse247) 0) (forall ((v_arrayElimCell_109 Int) (|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_ArrVal_1434 Int) (v_arrayElimCell_118 Int)) (let ((.cse253 (store .cse248 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse248 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|)))) (let ((.cse250 (store (select .cse253 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse249 (store .cse253 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse250)) (.cse252 (+ v_arrayElimCell_109 4))) (let ((.cse251 (select (select .cse249 .cse8) .cse252))) (or (= (select (select .cse249 v_arrayElimCell_118) (select .cse250 .cse247)) 0) (< v_arrayElimCell_109 0) (= (select (select .cse249 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) .cse251) 0) (< .cse251 0) (= |c_ULTIMATE.start_l2_insert_~list#1.offset| .cse252) (= (select (select .cse249 |c_ULTIMATE.start_l2_insert_~item~0#1.base|) .cse251) 0) (= v_ArrVal_1436 v_arrayElimCell_109))))))) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436)))) (or (let ((.cse388 (forall ((v_ArrVal_1429 Int) (v_ArrVal_1436 Int)) (let ((.cse513 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429))) (.cse507 (+ v_ArrVal_1436 4))) (or (= .cse507 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (< v_ArrVal_1436 0) (= .cse507 |c_ULTIMATE.start_l2_insert_~list#1.offset|) (forall ((v_arrayElimCell_109 Int) (v_arrayElimCell_110 Int) (v_arrayElimCell_115 Int) (v_ArrVal_1434 Int)) (let ((.cse512 (store .cse513 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse513 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|)))) (let ((.cse509 (store (select .cse512 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse508 (store .cse512 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse509)) (.cse511 (+ v_arrayElimCell_109 4))) (let ((.cse510 (select (select .cse508 .cse8) .cse511))) (or (= (select (select .cse508 v_arrayElimCell_115) (select .cse509 .cse507)) 0) (= (select (select .cse508 v_arrayElimCell_110) .cse510) 0) (< v_arrayElimCell_109 0) (< .cse510 0) (= |c_ULTIMATE.start_l2_insert_~list#1.offset| .cse511) (= v_ArrVal_1436 v_arrayElimCell_109))))))) (< (select (select .cse513 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) .cse507) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436))))) (.cse373 (forall ((v_ArrVal_1429 Int) (v_ArrVal_1436 Int)) (let ((.cse501 (+ v_ArrVal_1436 4)) (.cse502 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429)))) (or (= .cse501 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (< v_ArrVal_1436 0) (= .cse501 |c_ULTIMATE.start_l2_insert_~list#1.offset|) (< (select (select .cse502 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) .cse501) 0) (forall ((v_arrayElimCell_109 Int) (v_arrayElimCell_110 Int) (v_arrayElimCell_115 Int) (v_ArrVal_1434 Int)) (let ((.cse506 (store .cse502 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse502 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|)))) (let ((.cse504 (store (select .cse506 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse503 (store .cse506 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse504))) (let ((.cse505 (select (select .cse503 .cse8) (+ v_arrayElimCell_109 4)))) (or (= (select (select .cse503 v_arrayElimCell_115) (select .cse504 .cse501)) 0) (= (select (select .cse503 v_arrayElimCell_110) .cse505) 0) (< v_arrayElimCell_109 0) (< .cse505 0) (= v_ArrVal_1436 v_arrayElimCell_109))))))) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436))))) (.cse334 (forall ((v_ArrVal_1429 Int) (v_ArrVal_1436 Int)) (let ((.cse495 (+ v_ArrVal_1436 4)) (.cse496 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429)))) (or (= .cse495 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (< v_ArrVal_1436 0) (= .cse495 |c_ULTIMATE.start_l2_insert_~list#1.offset|) (< (select (select .cse496 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) .cse495) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436) (forall ((v_arrayElimCell_109 Int) (v_arrayElimCell_110 Int) (v_arrayElimCell_115 Int) (v_ArrVal_1434 Int)) (let ((.cse500 (store .cse496 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse496 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|)))) (let ((.cse498 (store (select .cse500 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse497 (store .cse500 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse498))) (let ((.cse499 (select (select .cse497 .cse8) (+ v_arrayElimCell_109 4)))) (or (= (select (select .cse497 v_arrayElimCell_115) (select .cse498 .cse495)) 0) (= (select (select .cse497 v_arrayElimCell_110) .cse499) 0) (< v_arrayElimCell_109 0) (< .cse499 0)))))))))))) (and (or .cse12 .cse13 (and (forall ((v_ArrVal_1429 Int) (v_ArrVal_1436 Int)) (let ((.cse254 (+ v_ArrVal_1436 4)) (.cse255 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429)))) (or (= .cse254 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (< v_ArrVal_1436 0) (< (select (select .cse255 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) .cse254) 0) (forall ((v_prenex_5 Int) (v_ArrVal_1434 Int)) (let ((.cse259 (store .cse255 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse255 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|)))) (let ((.cse257 (store (select .cse259 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse256 (store .cse259 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse257))) (let ((.cse258 (select (select .cse256 .cse8) |c_ULTIMATE.start_l2_insert_~list#1.offset|))) (or (= (select (select .cse256 v_prenex_5) (select .cse257 .cse254)) 0) (< .cse258 0) (= (select (select .cse256 |c_ULTIMATE.start_l2_insert_~item~0#1.base|) .cse258) 0))))))) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436)))) (forall ((v_ArrVal_1429 Int) (v_ArrVal_1436 Int)) (or (< v_ArrVal_1436 0) (forall ((v_ArrVal_1434 Int)) (let ((.cse265 (let ((.cse266 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429)))) (store .cse266 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse266 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|))))) (let ((.cse264 (store (select .cse265 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse260 (store .cse265 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse264))) (let ((.cse261 (select .cse264 (+ v_ArrVal_1436 4))) (.cse263 (select .cse260 |c_ULTIMATE.start_l2_insert_~item~0#1.base|)) (.cse262 (select (select .cse260 .cse8) |c_ULTIMATE.start_l2_insert_~list#1.offset|))) (or (forall ((|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int)) (= (select (select .cse260 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) .cse261) 0)) (< .cse262 0) (= (select .cse263 .cse261) 0) (< .cse261 0) (= (select .cse263 .cse262) 0))))))) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436))) .cse267 (forall ((v_ArrVal_1429 Int) (v_ArrVal_1436 Int)) (let ((.cse274 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429))) (.cse268 (+ v_ArrVal_1436 4))) (or (= .cse268 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (forall ((v_ArrVal_1434 Int)) (let ((.cse273 (store .cse274 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse274 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|)))) (let ((.cse271 (store (select .cse273 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse272 (store .cse273 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse271))) (let ((.cse270 (select .cse272 |c_ULTIMATE.start_l2_insert_~item~0#1.base|)) (.cse269 (select (select .cse272 .cse8) |c_ULTIMATE.start_l2_insert_~list#1.offset|))) (or (< .cse269 0) (= (select .cse270 (select .cse271 .cse268)) 0) (= (select .cse270 .cse269) 0))))))) (< v_ArrVal_1436 0) (< (select (select .cse274 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) .cse268) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436)))))) (forall ((v_ArrVal_1429 Int) (v_ArrVal_1436 Int)) (let ((.cse280 (let ((.cse282 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429)))) (store .cse282 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse282 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|))))) (let ((.cse281 (select .cse280 |c_ULTIMATE.start_l1_insert_~item~1#1.base|)) (.cse275 (+ v_ArrVal_1436 4))) (or (= .cse275 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (< v_ArrVal_1436 0) (forall ((v_arrayElimCell_109 Int) (v_arrayElimCell_110 Int) (v_ArrVal_1434 Int)) (let ((.cse279 (store .cse281 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse276 (store .cse280 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse279)) (.cse278 (+ v_arrayElimCell_109 4))) (let ((.cse277 (select (select .cse276 .cse8) .cse278))) (or (= (select (select .cse276 v_arrayElimCell_110) .cse277) 0) (< v_arrayElimCell_109 0) (< .cse277 0) (= |c_ULTIMATE.start_l2_insert_~list#1.offset| .cse278) (= (select (select .cse276 |c_ULTIMATE.start_l2_insert_~item~0#1.base|) (select .cse279 .cse275)) 0) (= v_ArrVal_1436 v_arrayElimCell_109)))))) (< (select .cse281 .cse275) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436))))) (or (forall ((v_ArrVal_1429 Int) (v_arrayElimCell_109 Int) (v_prenex_5 Int) (v_arrayElimCell_110 Int) (v_ArrVal_1434 Int) (v_ArrVal_1436 Int)) (let ((.cse288 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429)))) (let ((.cse289 (store .cse288 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse288 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|)))) (let ((.cse285 (store (select .cse289 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse284 (store .cse289 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse285)) (.cse287 (+ v_arrayElimCell_109 4))) (let ((.cse286 (select (select .cse284 .cse8) .cse287)) (.cse283 (+ v_ArrVal_1436 4))) (or (= .cse283 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (= (select (select .cse284 v_prenex_5) (select .cse285 .cse283)) 0) (= (select (select .cse284 v_arrayElimCell_110) .cse286) 0) (< v_arrayElimCell_109 0) (< v_ArrVal_1436 0) (< .cse286 0) (= |c_ULTIMATE.start_l2_insert_~list#1.offset| .cse287) (< (select (select .cse288 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) .cse283) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436) (= v_ArrVal_1436 v_arrayElimCell_109)))))))) .cse0) (or .cse67 (and (forall ((v_ArrVal_1429 Int) (v_ArrVal_1436 Int)) (let ((.cse294 (let ((.cse296 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429)))) (store .cse296 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse296 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|))))) (let ((.cse295 (select .cse294 |c_ULTIMATE.start_l1_insert_~item~1#1.base|)) (.cse290 (+ v_ArrVal_1436 4))) (or (= .cse290 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (< v_ArrVal_1436 0) (forall ((v_arrayElimCell_109 Int) (v_arrayElimCell_110 Int) (v_ArrVal_1434 Int)) (let ((.cse293 (store .cse295 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse291 (store .cse294 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse293))) (let ((.cse292 (select (select .cse291 .cse8) (+ v_arrayElimCell_109 4)))) (or (= (select (select .cse291 v_arrayElimCell_110) .cse292) 0) (< v_arrayElimCell_109 0) (< .cse292 0) (= (select (select .cse291 |c_ULTIMATE.start_l2_insert_~item~0#1.base|) (select .cse293 .cse290)) 0)))))) (< (select .cse295 .cse290) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436))))) (forall ((v_ArrVal_1429 Int) (v_ArrVal_1436 Int)) (or (< v_ArrVal_1436 0) (forall ((v_arrayElimCell_109 Int)) (or (< v_arrayElimCell_109 0) (forall ((|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_arrayElimCell_110 Int) (v_ArrVal_1434 Int)) (let ((.cse301 (let ((.cse302 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429)))) (store .cse302 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse302 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|))))) (let ((.cse300 (store (select .cse301 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse297 (store .cse301 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse300))) (let ((.cse298 (select (select .cse297 .cse8) (+ v_arrayElimCell_109 4))) (.cse299 (select .cse300 (+ v_ArrVal_1436 4)))) (or (= (select (select .cse297 v_arrayElimCell_110) .cse298) 0) (< .cse298 0) (= (select (select .cse297 |c_ULTIMATE.start_l2_insert_~item~0#1.base|) .cse299) 0) (= (select (select .cse297 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) .cse299) 0) (< .cse299 0))))))))) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436))) (or (forall ((v_ArrVal_1429 Int) (v_arrayElimCell_109 Int) (|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_arrayElimCell_110 Int) (v_ArrVal_1434 Int)) (let ((.cse303 (let ((.cse305 (let ((.cse306 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429)))) (store .cse306 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse306 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|))))) (store .cse305 |c_ULTIMATE.start_l1_insert_~item~1#1.base| (store (select .cse305 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))))) (let ((.cse304 (select (select .cse303 .cse8) (+ v_arrayElimCell_109 4)))) (or (= (select (select .cse303 v_arrayElimCell_110) .cse304) 0) (< v_arrayElimCell_109 0) (< v_ArrVal_1434 0) (< .cse304 0) (= (select (select .cse303 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) v_ArrVal_1434) 0))))) .cse28) (forall ((v_ArrVal_1429 Int) (v_ArrVal_1436 Int)) (let ((.cse311 (+ v_ArrVal_1436 4))) (or (forall ((v_arrayElimCell_109 Int) (|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_arrayElimCell_110 Int) (v_arrayElimCell_115 Int) (v_ArrVal_1434 Int)) (let ((.cse312 (let ((.cse313 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429)))) (store .cse313 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse313 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|))))) (let ((.cse310 (store (select .cse312 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse307 (store .cse312 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse310))) (let ((.cse309 (select (select .cse307 .cse8) (+ v_arrayElimCell_109 4))) (.cse308 (select .cse310 .cse311))) (or (= (select (select .cse307 v_arrayElimCell_115) .cse308) 0) (= (select (select .cse307 v_arrayElimCell_110) .cse309) 0) (< v_arrayElimCell_109 0) (< .cse309 0) (= (select (select .cse307 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) .cse308) 0) (< .cse308 0))))))) (< v_ArrVal_1436 0) (= .cse311 |c_ULTIMATE.start_l2_insert_~list#1.offset|) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436)))) (or .cse0 (and (forall ((v_ArrVal_1429 Int) (v_ArrVal_1436 Int)) (or (< v_ArrVal_1436 0) (forall ((|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_ArrVal_1434 Int)) (let ((.cse319 (let ((.cse320 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429)))) (store .cse320 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse320 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|))))) (let ((.cse318 (store (select .cse319 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse317 (store .cse319 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse318)) (.cse316 (select .cse318 (+ v_ArrVal_1436 4)))) (or (forall ((v_arrayElimCell_109 Int)) (let ((.cse315 (select (select .cse317 .cse8) (+ v_arrayElimCell_109 4)))) (or (forall ((v_arrayElimCell_110 Int)) (let ((.cse314 (select .cse317 v_arrayElimCell_110))) (or (= (select .cse314 .cse315) 0) (= (select .cse314 .cse316) 0)))) (< v_arrayElimCell_109 0) (< .cse315 0)))) (= (select (select .cse317 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) .cse316) 0) (< .cse316 0)))))) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436))) (forall ((v_ArrVal_1429 Int) (v_ArrVal_1436 Int)) (let ((.cse326 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429))) (.cse321 (+ v_ArrVal_1436 4))) (or (= .cse321 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (< v_ArrVal_1436 0) (forall ((v_arrayElimCell_109 Int) (v_arrayElimCell_110 Int) (v_ArrVal_1434 Int) (v_arrayElimCell_114 Int)) (let ((.cse325 (store .cse326 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse326 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|)))) (let ((.cse324 (store (select .cse325 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse322 (store .cse325 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse324))) (let ((.cse323 (select (select .cse322 .cse8) (+ v_arrayElimCell_109 4)))) (or (= (select (select .cse322 v_arrayElimCell_110) .cse323) 0) (< v_arrayElimCell_109 0) (< .cse323 0) (= (select (select .cse322 v_arrayElimCell_114) (select .cse324 .cse321)) 0))))))) (< (select (select .cse326 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) .cse321) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436)))) (forall ((v_ArrVal_1429 Int) (v_ArrVal_1436 Int)) (let ((.cse333 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429))) (.cse330 (+ v_ArrVal_1436 4))) (or (forall ((v_arrayElimCell_109 Int) (v_arrayElimCell_110 Int) (v_ArrVal_1434 Int)) (let ((.cse332 (store .cse333 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse333 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|)))) (let ((.cse329 (store (select .cse332 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse331 (store .cse332 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse329))) (let ((.cse328 (select (select .cse331 .cse8) (+ v_arrayElimCell_109 4))) (.cse327 (select .cse331 v_arrayElimCell_110))) (or (= (select .cse327 .cse328) 0) (< v_arrayElimCell_109 0) (< .cse328 0) (= (select .cse327 (select .cse329 .cse330)) 0))))))) (= .cse330 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (< v_ArrVal_1436 0) (< (select (select .cse333 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) .cse330) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436)))))) .cse334)) (forall ((v_ArrVal_1429 Int) (v_ArrVal_1436 Int)) (let ((.cse341 (let ((.cse342 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429)))) (store .cse342 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse342 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|))))) (let ((.cse335 (+ v_ArrVal_1436 4)) (.cse336 (select .cse341 |c_ULTIMATE.start_l1_insert_~item~1#1.base|))) (or (= .cse335 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (< v_ArrVal_1436 0) (< (select .cse336 .cse335) 0) (forall ((v_arrayElimCell_109 Int) (v_ArrVal_1434 Int)) (let ((.cse339 (store .cse336 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse340 (store .cse341 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse339))) (let ((.cse338 (select .cse340 |c_ULTIMATE.start_l2_insert_~item~0#1.base|)) (.cse337 (select (select .cse340 .cse8) (+ v_arrayElimCell_109 4)))) (or (< v_arrayElimCell_109 0) (< .cse337 0) (= (select .cse338 (select .cse339 .cse335)) 0) (= (select .cse338 .cse337) 0)))))) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436))))) (or (forall ((v_ArrVal_1429 Int) (v_arrayElimCell_109 Int) (|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_arrayElimCell_110 Int) (v_ArrVal_1434 Int)) (let ((.cse343 (let ((.cse346 (let ((.cse347 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429)))) (store .cse347 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse347 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|))))) (store .cse346 |c_ULTIMATE.start_l1_insert_~item~1#1.base| (store (select .cse346 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434)))) (.cse345 (+ v_arrayElimCell_109 4))) (let ((.cse344 (select (select .cse343 .cse8) .cse345))) (or (= (select (select .cse343 v_arrayElimCell_110) .cse344) 0) (< v_arrayElimCell_109 0) (< v_ArrVal_1434 0) (< .cse344 0) (= (select (select .cse343 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) v_ArrVal_1434) 0) (= |c_ULTIMATE.start_l2_insert_~list#1.offset| .cse345))))) .cse58 .cse28) (forall ((v_ArrVal_1429 Int) (v_ArrVal_1436 Int)) (or (< v_ArrVal_1436 0) (forall ((v_arrayElimCell_109 Int)) (or (< v_arrayElimCell_109 0) (forall ((v_ArrVal_1434 Int)) (let ((.cse353 (let ((.cse354 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429)))) (store .cse354 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse354 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|))))) (let ((.cse352 (store (select .cse353 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse349 (store .cse353 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse352))) (let ((.cse350 (select .cse352 (+ v_ArrVal_1436 4))) (.cse351 (select .cse349 |c_ULTIMATE.start_l2_insert_~item~0#1.base|)) (.cse348 (select (select .cse349 .cse8) (+ v_arrayElimCell_109 4)))) (or (< .cse348 0) (forall ((|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int)) (= (select (select .cse349 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) .cse350) 0)) (= (select .cse351 .cse350) 0) (< .cse350 0) (= (select .cse351 .cse348) 0))))))))) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436))) (or .cse0 (forall ((v_ArrVal_1429 Int) (v_arrayElimCell_109 Int) (v_prenex_5 Int) (v_ArrVal_1434 Int) (v_ArrVal_1436 Int)) (let ((.cse359 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429)))) (let ((.cse360 (store .cse359 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse359 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|)))) (let ((.cse357 (store (select .cse360 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse356 (store .cse360 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse357))) (let ((.cse358 (select (select .cse356 .cse8) (+ v_arrayElimCell_109 4))) (.cse355 (+ v_ArrVal_1436 4))) (or (= .cse355 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (= (select (select .cse356 v_prenex_5) (select .cse357 .cse355)) 0) (< v_arrayElimCell_109 0) (< v_ArrVal_1436 0) (< .cse358 0) (= (select (select .cse356 |c_ULTIMATE.start_l2_insert_~item~0#1.base|) .cse358) 0) (< (select (select .cse359 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) .cse355) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436) (= v_ArrVal_1436 v_arrayElimCell_109))))))))) (or .cse67 (and (or .cse0 (and (forall ((v_ArrVal_1429 Int) (v_ArrVal_1436 Int)) (let ((.cse361 (+ v_ArrVal_1436 4)) (.cse362 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429)))) (or (= .cse361 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (< v_ArrVal_1436 0) (= .cse361 |c_ULTIMATE.start_l2_insert_~list#1.offset|) (< (select (select .cse362 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) .cse361) 0) (forall ((v_arrayElimCell_109 Int) (v_arrayElimCell_110 Int) (v_ArrVal_1434 Int) (v_arrayElimCell_114 Int)) (let ((.cse366 (store .cse362 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse362 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|)))) (let ((.cse365 (store (select .cse366 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse363 (store .cse366 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse365))) (let ((.cse364 (select (select .cse363 .cse8) (+ v_arrayElimCell_109 4)))) (or (= (select (select .cse363 v_arrayElimCell_110) .cse364) 0) (< v_arrayElimCell_109 0) (< .cse364 0) (= (select (select .cse363 v_arrayElimCell_114) (select .cse365 .cse361)) 0) (= v_ArrVal_1436 v_arrayElimCell_109))))))) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436)))) (forall ((v_ArrVal_1429 Int) (v_ArrVal_1436 Int)) (let ((.cse367 (+ v_ArrVal_1436 4)) (.cse368 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429)))) (or (= .cse367 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (< v_ArrVal_1436 0) (= .cse367 |c_ULTIMATE.start_l2_insert_~list#1.offset|) (< (select (select .cse368 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) .cse367) 0) (forall ((v_arrayElimCell_109 Int) (v_arrayElimCell_110 Int) (v_ArrVal_1434 Int) (v_arrayElimCell_118 Int)) (let ((.cse372 (store .cse368 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse368 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|)))) (let ((.cse371 (store (select .cse372 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse369 (store .cse372 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse371))) (let ((.cse370 (select (select .cse369 .cse8) (+ v_arrayElimCell_109 4)))) (or (= (select (select .cse369 v_arrayElimCell_110) .cse370) 0) (= (select (select .cse369 v_arrayElimCell_118) (select .cse371 .cse367)) 0) (< v_arrayElimCell_109 0) (< .cse370 0) (= v_ArrVal_1436 v_arrayElimCell_109))))))) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436)))))) .cse373)) (forall ((v_ArrVal_1429 Int) (v_ArrVal_1436 Int)) (let ((.cse380 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429))) (.cse374 (+ v_ArrVal_1436 4))) (or (= .cse374 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (forall ((v_arrayElimCell_109 Int) (v_arrayElimCell_110 Int) (v_ArrVal_1434 Int) (v_arrayElimCell_118 Int)) (let ((.cse379 (store .cse380 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse380 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|)))) (let ((.cse377 (store (select .cse379 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse375 (store .cse379 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse377)) (.cse378 (+ v_arrayElimCell_109 4))) (let ((.cse376 (select (select .cse375 .cse8) .cse378))) (or (= (select (select .cse375 v_arrayElimCell_110) .cse376) 0) (= (select (select .cse375 v_arrayElimCell_118) (select .cse377 .cse374)) 0) (< v_arrayElimCell_109 0) (< .cse376 0) (= |c_ULTIMATE.start_l2_insert_~list#1.offset| .cse378) (= v_ArrVal_1436 v_arrayElimCell_109))))))) (< v_ArrVal_1436 0) (= .cse374 |c_ULTIMATE.start_l2_insert_~list#1.offset|) (< (select (select .cse380 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) .cse374) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436)))) (or .cse67 (and (or (forall ((v_ArrVal_1429 Int) (v_arrayElimCell_109 Int) (v_arrayElimCell_110 Int) (v_ArrVal_1434 Int) (v_arrayElimCell_114 Int) (v_ArrVal_1436 Int)) (let ((.cse386 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429)))) (let ((.cse387 (store .cse386 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse386 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|)))) (let ((.cse384 (store (select .cse387 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse382 (store .cse387 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse384)) (.cse385 (+ v_arrayElimCell_109 4))) (let ((.cse383 (select (select .cse382 .cse8) .cse385)) (.cse381 (+ v_ArrVal_1436 4))) (or (= .cse381 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (= (select (select .cse382 v_arrayElimCell_110) .cse383) 0) (< v_arrayElimCell_109 0) (< v_ArrVal_1436 0) (= .cse381 |c_ULTIMATE.start_l2_insert_~list#1.offset|) (< .cse383 0) (= (select (select .cse382 v_arrayElimCell_114) (select .cse384 .cse381)) 0) (= |c_ULTIMATE.start_l2_insert_~list#1.offset| .cse385) (< (select (select .cse386 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) .cse381) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436) (= v_ArrVal_1436 v_arrayElimCell_109)))))))) .cse0) .cse388)) (forall ((v_ArrVal_1429 Int) (v_ArrVal_1436 Int)) (or (< v_ArrVal_1436 0) (forall ((v_arrayElimCell_109 Int)) (let ((.cse389 (+ v_arrayElimCell_109 4))) (or (< v_arrayElimCell_109 0) (= |c_ULTIMATE.start_l2_insert_~list#1.offset| .cse389) (forall ((v_arrayElimCell_110 Int) (v_ArrVal_1434 Int)) (let ((.cse394 (let ((.cse395 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429)))) (store .cse395 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse395 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|))))) (let ((.cse393 (store (select .cse394 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse390 (store .cse394 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse393))) (let ((.cse391 (select (select .cse390 .cse8) .cse389)) (.cse392 (select .cse393 (+ v_ArrVal_1436 4)))) (or (= (select (select .cse390 v_arrayElimCell_110) .cse391) 0) (< .cse391 0) (forall ((|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int)) (= (select (select .cse390 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) .cse392) 0)) (= (select (select .cse390 |c_ULTIMATE.start_l2_insert_~item~0#1.base|) .cse392) 0) (< .cse392 0))))))) (= v_ArrVal_1436 v_arrayElimCell_109)))) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436))) (or .cse67 (and .cse388 (or (and (forall ((v_ArrVal_1429 Int) (v_ArrVal_1436 Int)) (let ((.cse402 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429))) (.cse396 (+ v_ArrVal_1436 4))) (or (= .cse396 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (< v_ArrVal_1436 0) (forall ((v_arrayElimCell_109 Int) (v_arrayElimCell_110 Int) (v_ArrVal_1434 Int) (v_arrayElimCell_114 Int)) (let ((.cse401 (store .cse402 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse402 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|)))) (let ((.cse399 (store (select .cse401 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse397 (store .cse401 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse399)) (.cse400 (+ v_arrayElimCell_109 4))) (let ((.cse398 (select (select .cse397 .cse8) .cse400))) (or (= (select (select .cse397 v_arrayElimCell_110) .cse398) 0) (< v_arrayElimCell_109 0) (< .cse398 0) (= (select (select .cse397 v_arrayElimCell_114) (select .cse399 .cse396)) 0) (= |c_ULTIMATE.start_l2_insert_~list#1.offset| .cse400) (= v_ArrVal_1436 v_arrayElimCell_109))))))) (< (select (select .cse402 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) .cse396) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436)))) (forall ((v_ArrVal_1429 Int) (v_ArrVal_1436 Int)) (let ((.cse409 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429))) (.cse403 (+ v_ArrVal_1436 4))) (or (= .cse403 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (< v_ArrVal_1436 0) (forall ((v_arrayElimCell_109 Int) (v_arrayElimCell_110 Int) (v_ArrVal_1434 Int) (v_arrayElimCell_119 Int)) (let ((.cse408 (store .cse409 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse409 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|)))) (let ((.cse406 (store (select .cse408 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse404 (store .cse408 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse406)) (.cse407 (+ v_arrayElimCell_109 4))) (let ((.cse405 (select (select .cse404 .cse8) .cse407))) (or (= (select (select .cse404 v_arrayElimCell_110) .cse405) 0) (< v_arrayElimCell_109 0) (= (select (select .cse404 v_arrayElimCell_119) (select .cse406 .cse403)) 0) (< .cse405 0) (= |c_ULTIMATE.start_l2_insert_~list#1.offset| .cse407) (= v_ArrVal_1436 v_arrayElimCell_109))))))) (< (select (select .cse409 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) .cse403) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436))))) .cse0))) (or (forall ((v_ArrVal_1429 Int) (v_arrayElimCell_109 Int) (v_prenex_5 Int) (v_arrayElimCell_110 Int) (v_ArrVal_1434 Int) (v_ArrVal_1436 Int)) (let ((.cse415 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429)))) (let ((.cse416 (store .cse415 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse415 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|)))) (let ((.cse412 (store (select .cse416 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse411 (store .cse416 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse412)) (.cse414 (+ v_arrayElimCell_109 4))) (let ((.cse413 (select (select .cse411 .cse8) .cse414)) (.cse410 (+ v_ArrVal_1436 4))) (or (= .cse410 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (= (select (select .cse411 v_prenex_5) (select .cse412 .cse410)) 0) (= (select (select .cse411 v_arrayElimCell_110) .cse413) 0) (< v_arrayElimCell_109 0) (< v_ArrVal_1436 0) (= .cse410 |c_ULTIMATE.start_l2_insert_~list#1.offset|) (< .cse413 0) (= |c_ULTIMATE.start_l2_insert_~list#1.offset| .cse414) (< (select (select .cse415 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) .cse410) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436)))))))) .cse0) (or (and .cse373 (or (forall ((v_ArrVal_1429 Int) (v_arrayElimCell_109 Int) (v_arrayElimCell_110 Int) (v_ArrVal_1434 Int) (v_arrayElimCell_114 Int) (v_ArrVal_1436 Int)) (let ((.cse421 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429)))) (let ((.cse422 (store .cse421 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse421 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|)))) (let ((.cse420 (store (select .cse422 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse418 (store .cse422 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse420))) (let ((.cse419 (select (select .cse418 .cse8) (+ v_arrayElimCell_109 4))) (.cse417 (+ v_ArrVal_1436 4))) (or (= .cse417 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (= (select (select .cse418 v_arrayElimCell_110) .cse419) 0) (< v_arrayElimCell_109 0) (< v_ArrVal_1436 0) (< .cse419 0) (= (select (select .cse418 v_arrayElimCell_114) (select .cse420 .cse417)) 0) (< (select (select .cse421 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) .cse417) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436) (= v_ArrVal_1436 v_arrayElimCell_109)))))))) .cse0)) .cse67) (or (and (forall ((v_ArrVal_1429 Int) (v_ArrVal_1436 Int)) (let ((.cse428 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429))) (.cse423 (+ v_ArrVal_1436 4))) (or (= .cse423 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (< v_ArrVal_1436 0) (= .cse423 |c_ULTIMATE.start_l2_insert_~list#1.offset|) (forall ((v_arrayElimCell_109 Int) (v_arrayElimCell_110 Int) (v_ArrVal_1434 Int) (v_arrayElimCell_118 Int)) (let ((.cse427 (store .cse428 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse428 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|)))) (let ((.cse426 (store (select .cse427 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse424 (store .cse427 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse426))) (let ((.cse425 (select (select .cse424 .cse8) (+ v_arrayElimCell_109 4)))) (or (= (select (select .cse424 v_arrayElimCell_110) .cse425) 0) (= (select (select .cse424 v_arrayElimCell_118) (select .cse426 .cse423)) 0) (< v_arrayElimCell_109 0) (< .cse425 0) (= (select (select .cse424 |c_ULTIMATE.start_l2_insert_~item~0#1.base|) .cse425) 0) (= v_ArrVal_1436 v_arrayElimCell_109))))))) (< (select (select .cse428 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) .cse423) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436)))) (or .cse429 .cse12) (or .cse12 .cse430) (forall ((v_ArrVal_1429 Int) (v_ArrVal_1436 Int)) (let ((.cse437 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429))) (.cse431 (+ v_ArrVal_1436 4))) (or (= .cse431 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (< v_ArrVal_1436 0) (forall ((v_arrayElimCell_109 Int) (v_prenex_5 Int) (v_arrayElimCell_110 Int) (v_ArrVal_1434 Int)) (let ((.cse436 (store .cse437 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse437 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|)))) (let ((.cse433 (store (select .cse436 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse432 (store .cse436 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse433)) (.cse435 (+ v_arrayElimCell_109 4))) (let ((.cse434 (select (select .cse432 .cse8) .cse435))) (or (= (select (select .cse432 v_prenex_5) (select .cse433 .cse431)) 0) (= (select (select .cse432 v_arrayElimCell_110) .cse434) 0) (< v_arrayElimCell_109 0) (< .cse434 0) (= |c_ULTIMATE.start_l2_insert_~list#1.offset| .cse435) (= v_ArrVal_1436 v_arrayElimCell_109))))))) (< (select (select .cse437 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) .cse431) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436)))) (forall ((v_ArrVal_1429 Int) (v_ArrVal_1436 Int)) (let ((.cse443 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429))) (.cse438 (+ v_ArrVal_1436 4))) (or (= .cse438 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (< v_ArrVal_1436 0) (forall ((v_arrayElimCell_109 Int) (v_prenex_5 Int) (v_arrayElimCell_110 Int) (v_ArrVal_1434 Int)) (let ((.cse442 (store .cse443 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse443 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|)))) (let ((.cse440 (store (select .cse442 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse439 (store .cse442 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse440))) (let ((.cse441 (select (select .cse439 .cse8) (+ v_arrayElimCell_109 4)))) (or (= (select (select .cse439 v_prenex_5) (select .cse440 .cse438)) 0) (= (select (select .cse439 v_arrayElimCell_110) .cse441) 0) (< v_arrayElimCell_109 0) (< .cse441 0) (= (select (select .cse439 |c_ULTIMATE.start_l2_insert_~item~0#1.base|) .cse441) 0) (= v_ArrVal_1436 v_arrayElimCell_109))))))) (< (select (select .cse443 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) .cse438) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436))))) .cse13) (forall ((v_ArrVal_1429 Int) (v_ArrVal_1436 Int)) (let ((.cse444 (+ v_ArrVal_1436 4)) (.cse445 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429)))) (or (= .cse444 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (< v_ArrVal_1436 0) (= .cse444 |c_ULTIMATE.start_l2_insert_~list#1.offset|) (< (select (select .cse445 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) .cse444) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436) (forall ((v_arrayElimCell_109 Int) (v_arrayElimCell_110 Int) (v_ArrVal_1434 Int)) (let ((.cse451 (store .cse445 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse445 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|)))) (let ((.cse448 (store (select .cse451 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse450 (store .cse451 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse448)) (.cse449 (+ v_arrayElimCell_109 4))) (let ((.cse447 (select (select .cse450 .cse8) .cse449)) (.cse446 (select .cse450 v_arrayElimCell_110))) (or (= (select .cse446 .cse447) 0) (< v_arrayElimCell_109 0) (< .cse447 0) (= (select .cse446 (select .cse448 .cse444)) 0) (= |c_ULTIMATE.start_l2_insert_~list#1.offset| .cse449)))))))))) (or .cse0 (forall ((v_ArrVal_1429 Int) (v_arrayElimCell_109 Int) (v_prenex_5 Int) (v_ArrVal_1434 Int) (v_ArrVal_1436 Int)) (let ((.cse456 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429)))) (let ((.cse457 (store .cse456 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse456 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|)))) (let ((.cse454 (store (select .cse457 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse453 (store .cse457 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse454))) (let ((.cse455 (select (select .cse453 .cse8) (+ v_arrayElimCell_109 4))) (.cse452 (+ v_ArrVal_1436 4))) (or (= .cse452 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (= (select (select .cse453 v_prenex_5) (select .cse454 .cse452)) 0) (< v_arrayElimCell_109 0) (< v_ArrVal_1436 0) (< .cse455 0) (= (select (select .cse453 |c_ULTIMATE.start_l2_insert_~item~0#1.base|) .cse455) 0) (< (select (select .cse456 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) .cse452) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436))))))))) (or (forall ((v_ArrVal_1429 Int) (v_arrayElimCell_109 Int) (v_prenex_5 Int) (v_ArrVal_1434 Int) (v_ArrVal_1436 Int)) (let ((.cse462 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429)))) (let ((.cse463 (store .cse462 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse462 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|)))) (let ((.cse460 (store (select .cse463 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse459 (store .cse463 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse460))) (let ((.cse461 (select (select .cse459 .cse8) (+ v_arrayElimCell_109 4))) (.cse458 (+ v_ArrVal_1436 4))) (or (= .cse458 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (= (select (select .cse459 v_prenex_5) (select .cse460 .cse458)) 0) (< v_arrayElimCell_109 0) (< v_ArrVal_1436 0) (= .cse458 |c_ULTIMATE.start_l2_insert_~list#1.offset|) (< .cse461 0) (= (select (select .cse459 |c_ULTIMATE.start_l2_insert_~item~0#1.base|) .cse461) 0) (< (select (select .cse462 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) .cse458) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436)))))))) .cse0) (forall ((v_ArrVal_1429 Int) (v_ArrVal_1436 Int)) (let ((.cse464 (+ v_ArrVal_1436 4))) (or (< v_ArrVal_1436 0) (= .cse464 |c_ULTIMATE.start_l2_insert_~list#1.offset|) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436) (forall ((|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_ArrVal_1434 Int)) (let ((.cse471 (let ((.cse472 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429)))) (store .cse472 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse472 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|))))) (let ((.cse470 (store (select .cse471 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse468 (store .cse471 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse470)) (.cse467 (select .cse470 .cse464))) (or (forall ((v_arrayElimCell_109 Int)) (let ((.cse469 (+ v_arrayElimCell_109 4))) (let ((.cse466 (select (select .cse468 .cse8) .cse469))) (or (forall ((v_arrayElimCell_110 Int)) (let ((.cse465 (select .cse468 v_arrayElimCell_110))) (or (= (select .cse465 .cse466) 0) (= (select .cse465 .cse467) 0)))) (< v_arrayElimCell_109 0) (< .cse466 0) (= |c_ULTIMATE.start_l2_insert_~list#1.offset| .cse469))))) (= (select (select .cse468 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) .cse467) 0) (< .cse467 0))))))))) (or (forall ((v_ArrVal_1429 Int) (v_arrayElimCell_109 Int) (|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_ArrVal_1434 Int)) (let ((.cse474 (let ((.cse475 (let ((.cse476 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429)))) (store .cse476 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse476 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|))))) (store .cse475 |c_ULTIMATE.start_l1_insert_~item~1#1.base| (store (select .cse475 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))))) (let ((.cse473 (select (select .cse474 .cse8) (+ v_arrayElimCell_109 4)))) (or (< v_arrayElimCell_109 0) (< v_ArrVal_1434 0) (< .cse473 0) (= (select (select .cse474 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) v_ArrVal_1434) 0) (= (select (select .cse474 |c_ULTIMATE.start_l2_insert_~item~0#1.base|) .cse473) 0))))) .cse28) (or (and (or (forall ((v_ArrVal_1429 Int) (v_arrayElimCell_109 Int) (v_arrayElimCell_110 Int) (v_ArrVal_1434 Int) (v_arrayElimCell_114 Int) (v_ArrVal_1436 Int)) (let ((.cse481 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429)))) (let ((.cse482 (store .cse481 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse481 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|)))) (let ((.cse480 (store (select .cse482 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse478 (store .cse482 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse480))) (let ((.cse479 (select (select .cse478 .cse8) (+ v_arrayElimCell_109 4))) (.cse477 (+ v_ArrVal_1436 4))) (or (= .cse477 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (= (select (select .cse478 v_arrayElimCell_110) .cse479) 0) (< v_arrayElimCell_109 0) (< v_ArrVal_1436 0) (= .cse477 |c_ULTIMATE.start_l2_insert_~list#1.offset|) (< .cse479 0) (= (select (select .cse478 v_arrayElimCell_114) (select .cse480 .cse477)) 0) (< (select (select .cse481 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) .cse477) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436)))))))) .cse0) .cse334) .cse67) (or (forall ((v_ArrVal_1429 Int) (v_arrayElimCell_109 Int) (v_prenex_5 Int) (v_ArrVal_1434 Int) (v_ArrVal_1436 Int)) (let ((.cse487 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429)))) (let ((.cse488 (store .cse487 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse487 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|)))) (let ((.cse485 (store (select .cse488 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse484 (store .cse488 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse485))) (let ((.cse486 (select (select .cse484 .cse8) (+ v_arrayElimCell_109 4))) (.cse483 (+ v_ArrVal_1436 4))) (or (= .cse483 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (= (select (select .cse484 v_prenex_5) (select .cse485 .cse483)) 0) (< v_arrayElimCell_109 0) (< v_ArrVal_1436 0) (= .cse483 |c_ULTIMATE.start_l2_insert_~list#1.offset|) (< .cse486 0) (= (select (select .cse484 |c_ULTIMATE.start_l2_insert_~item~0#1.base|) .cse486) 0) (< (select (select .cse487 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) .cse483) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436) (= v_ArrVal_1436 v_arrayElimCell_109)))))))) .cse0) (forall ((v_ArrVal_1429 Int) (v_ArrVal_1436 Int)) (let ((.cse494 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429))) (.cse489 (+ v_ArrVal_1436 4))) (or (= .cse489 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (< v_ArrVal_1436 0) (forall ((v_arrayElimCell_109 Int) (v_ArrVal_1434 Int) (v_arrayElimCell_118 Int)) (let ((.cse493 (store .cse494 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse494 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|)))) (let ((.cse491 (store (select .cse493 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse490 (store .cse493 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse491))) (let ((.cse492 (select (select .cse490 .cse8) (+ v_arrayElimCell_109 4)))) (or (= (select (select .cse490 v_arrayElimCell_118) (select .cse491 .cse489)) 0) (< v_arrayElimCell_109 0) (< .cse492 0) (= (select (select .cse490 |c_ULTIMATE.start_l2_insert_~item~0#1.base|) .cse492) 0) (= v_ArrVal_1436 v_arrayElimCell_109))))))) (= .cse489 |c_ULTIMATE.start_l2_insert_~list#1.offset|) (< (select (select .cse494 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) .cse489) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436)))))) .cse1) (or .cse0 .cse1 (forall ((v_ArrVal_1429 Int) (v_arrayElimCell_109 Int) (|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_prenex_5 Int) (v_arrayElimCell_110 Int) (v_ArrVal_1434 Int) (v_ArrVal_1436 Int)) (let ((.cse519 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429)))) (let ((.cse520 (store .cse519 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse519 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|)))) (let ((.cse516 (store (select .cse520 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse515 (store .cse520 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse516)) (.cse518 (+ v_arrayElimCell_109 4))) (let ((.cse517 (select (select .cse515 .cse8) .cse518)) (.cse514 (+ v_ArrVal_1436 4))) (or (= .cse514 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (= (select (select .cse515 v_prenex_5) (select .cse516 .cse514)) 0) (= (select (select .cse515 v_arrayElimCell_110) .cse517) 0) (< v_arrayElimCell_109 0) (< v_ArrVal_1436 0) (= (select (select .cse515 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) .cse517) 0) (= .cse514 |c_ULTIMATE.start_l2_insert_~list#1.offset|) (< .cse517 0) (= |c_ULTIMATE.start_l2_insert_~list#1.offset| .cse518) (< (select (select .cse519 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) .cse514) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436))))))))) (or .cse521 .cse30 .cse58 .cse28) (forall ((v_ArrVal_1429 Int) (v_ArrVal_1436 Int)) (let ((.cse528 (+ v_ArrVal_1436 4))) (or (forall ((v_arrayElimCell_109 Int)) (let ((.cse522 (+ v_arrayElimCell_109 4))) (or (= |c_ULTIMATE.start_l1_insert_~item~1#1.offset| .cse522) (< v_arrayElimCell_109 0) (= |c_ULTIMATE.start_l2_insert_~list#1.offset| .cse522) (forall ((v_arrayElimCell_110 Int) (v_ArrVal_1434 Int)) (let ((.cse529 (let ((.cse530 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429)))) (store .cse530 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse530 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|))))) (let ((.cse527 (store (select .cse529 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse525 (store .cse529 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse527))) (let ((.cse524 (select (select .cse525 .cse8) .cse522)) (.cse523 (select .cse525 v_arrayElimCell_110)) (.cse526 (select .cse527 .cse528))) (or (= (select .cse523 .cse524) 0) (< .cse524 0) (forall ((|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int)) (= (select (select .cse525 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) .cse526) 0)) (= (select .cse523 .cse526) 0) (< .cse526 0)))))))))) (< v_ArrVal_1436 0) (= .cse528 |c_ULTIMATE.start_l2_insert_~list#1.offset|) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436)))) (or (forall ((v_ArrVal_1429 Int) (v_arrayElimCell_109 Int) (|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_prenex_5 Int) (v_ArrVal_1434 Int) (v_ArrVal_1436 Int)) (let ((.cse535 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429)))) (let ((.cse536 (store .cse535 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse535 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|)))) (let ((.cse533 (store (select .cse536 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse532 (store .cse536 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse533))) (let ((.cse534 (select (select .cse532 .cse8) (+ v_arrayElimCell_109 4))) (.cse531 (+ v_ArrVal_1436 4))) (or (= .cse531 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (= (select (select .cse532 v_prenex_5) (select .cse533 .cse531)) 0) (< v_arrayElimCell_109 0) (< v_ArrVal_1436 0) (= (select (select .cse532 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) .cse534) 0) (< .cse534 0) (= (select (select .cse532 |c_ULTIMATE.start_l2_insert_~item~0#1.base|) .cse534) 0) (< (select (select .cse535 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) .cse531) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436)))))))) .cse0 .cse1) (forall ((v_ArrVal_1429 Int) (v_ArrVal_1436 Int)) (let ((.cse543 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429))) (.cse537 (+ v_ArrVal_1436 4))) (or (= .cse537 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (forall ((v_arrayElimCell_109 Int) (v_ArrVal_1434 Int) (v_arrayElimCell_118 Int)) (let ((.cse542 (store .cse543 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse543 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|)))) (let ((.cse539 (store (select .cse542 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse538 (store .cse542 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse539)) (.cse540 (+ v_arrayElimCell_109 4))) (let ((.cse541 (select (select .cse538 .cse8) .cse540))) (or (= (select (select .cse538 v_arrayElimCell_118) (select .cse539 .cse537)) 0) (= |c_ULTIMATE.start_l1_insert_~item~1#1.offset| .cse540) (< v_arrayElimCell_109 0) (< .cse541 0) (= (select (select .cse538 |c_ULTIMATE.start_l2_insert_~item~0#1.base|) .cse541) 0) (= v_ArrVal_1436 v_arrayElimCell_109))))))) (< v_ArrVal_1436 0) (= .cse537 |c_ULTIMATE.start_l2_insert_~list#1.offset|) (< (select (select .cse543 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) .cse537) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436)))) (or .cse544 (and .cse164 (or (and (forall ((v_ArrVal_1429 Int) (v_arrayElimCell_109 Int)) (let ((.cse547 (+ v_arrayElimCell_109 4))) (or (< v_arrayElimCell_109 0) (forall ((v_ArrVal_1434 Int) (v_arrayElimCell_127 Int)) (let ((.cse546 (let ((.cse548 (let ((.cse549 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429)))) (store .cse549 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse549 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|))))) (store .cse548 |c_ULTIMATE.start_l1_insert_~item~1#1.base| (store (select .cse548 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))))) (let ((.cse545 (select (select .cse546 .cse8) .cse547))) (or (< .cse545 0) (= (select (select .cse546 v_arrayElimCell_127) .cse545) 0))))) (= |c_ULTIMATE.start_l2_insert_~list#1.offset| .cse547)))) .cse194 (forall ((v_ArrVal_1429 Int) (v_arrayElimCell_109 Int)) (or (< v_arrayElimCell_109 0) (forall ((v_ArrVal_1434 Int)) (let ((.cse551 (let ((.cse552 (let ((.cse553 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429)))) (store .cse553 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse553 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|))))) (store .cse552 |c_ULTIMATE.start_l1_insert_~item~1#1.base| (store (select .cse552 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))))) (let ((.cse550 (select (select .cse551 .cse8) (+ v_arrayElimCell_109 4)))) (or (< .cse550 0) (= (select (select .cse551 |c_ULTIMATE.start_l2_insert_~item~0#1.base|) .cse550) 0) (forall ((v_arrayElimCell_127 Int)) (= (select (select .cse551 v_arrayElimCell_127) .cse550) 0)))))))) (or (forall ((v_arrayElimCell_109 Int) (v_ArrVal_1429 Int) (v_ArrVal_1434 Int) (v_arrayElimCell_127 Int)) (let ((.cse555 (let ((.cse556 (let ((.cse557 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429)))) (store .cse557 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse557 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|))))) (store .cse556 |c_ULTIMATE.start_l1_insert_~item~1#1.base| (store (select .cse556 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))))) (let ((.cse554 (select (select .cse555 .cse8) (+ v_arrayElimCell_109 4)))) (or (< v_arrayElimCell_109 0) (< .cse554 0) (= (select (select .cse555 v_arrayElimCell_127) .cse554) 0))))) .cse67)) .cse1) (forall ((v_ArrVal_1429 Int) (v_arrayElimCell_109 Int)) (let ((.cse558 (+ v_arrayElimCell_109 4))) (or (= |c_ULTIMATE.start_l1_insert_~item~1#1.offset| .cse558) (< v_arrayElimCell_109 0) (forall ((v_ArrVal_1434 Int) (v_arrayElimCell_127 Int)) (let ((.cse560 (let ((.cse561 (let ((.cse562 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429)))) (store .cse562 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse562 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|))))) (store .cse561 |c_ULTIMATE.start_l1_insert_~item~1#1.base| (store (select .cse561 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))))) (let ((.cse559 (select (select .cse560 .cse8) .cse558))) (or (< .cse559 0) (= (select (select .cse560 |c_ULTIMATE.start_l2_insert_~item~0#1.base|) .cse559) 0) (= (select (select .cse560 v_arrayElimCell_127) .cse559) 0)))))))) (or .cse12 .cse13 .cse169 .cse1) (or .cse67 (forall ((v_ArrVal_1429 Int) (v_arrayElimCell_109 Int) (|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_ArrVal_1434 Int) (v_arrayElimCell_127 Int)) (let ((.cse563 (let ((.cse565 (let ((.cse566 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429)))) (store .cse566 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse566 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|))))) (store .cse565 |c_ULTIMATE.start_l1_insert_~item~1#1.base| (store (select .cse565 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))))) (let ((.cse564 (select (select .cse563 .cse8) (+ v_arrayElimCell_109 4)))) (or (< v_arrayElimCell_109 0) (= (select (select .cse563 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) .cse564) 0) (< .cse564 0) (= (select (select .cse563 v_arrayElimCell_127) .cse564) 0)))))) (forall ((v_ArrVal_1429 Int) (v_arrayElimCell_109 Int)) (let ((.cse567 (+ v_arrayElimCell_109 4))) (or (= |c_ULTIMATE.start_l1_insert_~item~1#1.offset| .cse567) (< v_arrayElimCell_109 0) (forall ((v_ArrVal_1434 Int) (v_arrayElimCell_127 Int)) (let ((.cse569 (let ((.cse570 (let ((.cse571 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429)))) (store .cse571 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse571 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|))))) (store .cse570 |c_ULTIMATE.start_l1_insert_~item~1#1.base| (store (select .cse570 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))))) (let ((.cse568 (select (select .cse569 .cse8) .cse567))) (or (< .cse568 0) (= (select (select .cse569 v_arrayElimCell_127) .cse568) 0))))) (= |c_ULTIMATE.start_l2_insert_~list#1.offset| .cse567)))) (or .cse12 .cse13 .cse58 .cse169) .cse189 (or .cse67 (forall ((v_ArrVal_1429 Int) (v_arrayElimCell_109 Int) (v_ArrVal_1434 Int) (v_arrayElimCell_127 Int)) (let ((.cse574 (let ((.cse575 (let ((.cse576 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429)))) (store .cse576 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse576 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|))))) (store .cse575 |c_ULTIMATE.start_l1_insert_~item~1#1.base| (store (select .cse575 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434)))) (.cse572 (+ v_arrayElimCell_109 4))) (let ((.cse573 (select (select .cse574 .cse8) .cse572))) (or (= |c_ULTIMATE.start_l1_insert_~item~1#1.offset| .cse572) (< v_arrayElimCell_109 0) (< .cse573 0) (= (select (select .cse574 v_arrayElimCell_127) .cse573) 0)))))) (forall ((v_ArrVal_1429 Int) (v_arrayElimCell_109 Int)) (let ((.cse577 (+ v_arrayElimCell_109 4))) (or (< v_arrayElimCell_109 0) (= |c_ULTIMATE.start_l2_insert_~list#1.offset| .cse577) (forall ((|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_ArrVal_1434 Int) (v_arrayElimCell_127 Int)) (let ((.cse578 (let ((.cse580 (let ((.cse581 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429)))) (store .cse581 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse581 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|))))) (store .cse580 |c_ULTIMATE.start_l1_insert_~item~1#1.base| (store (select .cse580 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))))) (let ((.cse579 (select (select .cse578 .cse8) .cse577))) (or (= (select (select .cse578 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) .cse579) 0) (< .cse579 0) (= (select (select .cse578 v_arrayElimCell_127) .cse579) 0)))))))) (forall ((v_ArrVal_1429 Int) (v_arrayElimCell_109 Int)) (or (forall ((|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_ArrVal_1434 Int) (v_arrayElimCell_127 Int)) (let ((.cse582 (let ((.cse584 (let ((.cse585 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429)))) (store .cse585 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse585 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|))))) (store .cse584 |c_ULTIMATE.start_l1_insert_~item~1#1.base| (store (select .cse584 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))))) (let ((.cse583 (select (select .cse582 .cse8) (+ v_arrayElimCell_109 4)))) (or (= (select (select .cse582 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) .cse583) 0) (< .cse583 0) (= (select (select .cse582 |c_ULTIMATE.start_l2_insert_~item~0#1.base|) .cse583) 0) (= (select (select .cse582 v_arrayElimCell_127) .cse583) 0))))) (< v_arrayElimCell_109 0))) (or .cse586 .cse12 .cse13 .cse58 .cse1))) (forall ((v_ArrVal_1429 Int) (v_ArrVal_1436 Int)) (let ((.cse587 (+ v_ArrVal_1436 4)) (.cse588 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429)))) (or (= .cse587 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (< v_ArrVal_1436 0) (= .cse587 |c_ULTIMATE.start_l2_insert_~list#1.offset|) (< (select (select .cse588 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) .cse587) 0) (forall ((v_arrayElimCell_109 Int) (v_arrayElimCell_110 Int) (v_ArrVal_1434 Int) (v_arrayElimCell_118 Int)) (let ((.cse593 (store .cse588 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse588 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|)))) (let ((.cse591 (store (select .cse593 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse589 (store .cse593 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse591)) (.cse592 (+ v_arrayElimCell_109 4))) (let ((.cse590 (select (select .cse589 .cse8) .cse592))) (or (= (select (select .cse589 v_arrayElimCell_110) .cse590) 0) (= (select (select .cse589 v_arrayElimCell_118) (select .cse591 .cse587)) 0) (= |c_ULTIMATE.start_l1_insert_~item~1#1.offset| .cse592) (< v_arrayElimCell_109 0) (< .cse590 0) (= |c_ULTIMATE.start_l2_insert_~list#1.offset| .cse592) (= v_ArrVal_1436 v_arrayElimCell_109))))))) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436)))) (forall ((v_ArrVal_1429 Int) (v_ArrVal_1436 Int)) (let ((.cse601 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429))) (.cse594 (+ v_ArrVal_1436 4))) (or (= .cse594 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (< v_ArrVal_1436 0) (forall ((v_arrayElimCell_109 Int) (v_arrayElimCell_110 Int) (v_ArrVal_1434 Int)) (let ((.cse600 (store .cse601 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse601 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|)))) (let ((.cse598 (store (select .cse600 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse599 (store .cse600 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse598)) (.cse597 (+ v_arrayElimCell_109 4))) (let ((.cse596 (select (select .cse599 .cse8) .cse597)) (.cse595 (select .cse599 v_arrayElimCell_110))) (or (= (select .cse595 .cse596) 0) (= |c_ULTIMATE.start_l1_insert_~item~1#1.offset| .cse597) (< v_arrayElimCell_109 0) (< .cse596 0) (= (select .cse595 (select .cse598 .cse594)) 0) (= |c_ULTIMATE.start_l2_insert_~list#1.offset| .cse597))))))) (= .cse594 |c_ULTIMATE.start_l2_insert_~list#1.offset|) (< (select (select .cse601 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) .cse594) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436)))) (or (and (or (and (forall ((v_ArrVal_1429 Int) (v_ArrVal_1436 Int)) (let ((.cse607 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429))) (.cse602 (+ v_ArrVal_1436 4))) (or (= .cse602 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (< v_ArrVal_1436 0) (forall ((v_arrayElimCell_109 Int) (|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_prenex_5 Int) (v_arrayElimCell_110 Int) (v_ArrVal_1434 Int)) (let ((.cse606 (store .cse607 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse607 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|)))) (let ((.cse604 (store (select .cse606 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse603 (store .cse606 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse604))) (let ((.cse605 (select (select .cse603 .cse8) (+ v_arrayElimCell_109 4)))) (or (= (select (select .cse603 v_prenex_5) (select .cse604 .cse602)) 0) (= (select (select .cse603 v_arrayElimCell_110) .cse605) 0) (< v_arrayElimCell_109 0) (= (select (select .cse603 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) .cse605) 0) (< .cse605 0) (= (select (select .cse603 |c_ULTIMATE.start_l2_insert_~item~0#1.base|) .cse605) 0) (= v_ArrVal_1436 v_arrayElimCell_109))))))) (< (select (select .cse607 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) .cse602) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436)))) (forall ((v_ArrVal_1429 Int) (v_ArrVal_1436 Int)) (let ((.cse614 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429))) (.cse608 (+ v_ArrVal_1436 4))) (or (= .cse608 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (< v_ArrVal_1436 0) (forall ((v_arrayElimCell_109 Int) (|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_prenex_5 Int) (v_arrayElimCell_110 Int) (v_ArrVal_1434 Int)) (let ((.cse613 (store .cse614 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse614 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|)))) (let ((.cse610 (store (select .cse613 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse609 (store .cse613 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse610)) (.cse612 (+ v_arrayElimCell_109 4))) (let ((.cse611 (select (select .cse609 .cse8) .cse612))) (or (= (select (select .cse609 v_prenex_5) (select .cse610 .cse608)) 0) (= (select (select .cse609 v_arrayElimCell_110) .cse611) 0) (< v_arrayElimCell_109 0) (= (select (select .cse609 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) .cse611) 0) (< .cse611 0) (= |c_ULTIMATE.start_l2_insert_~list#1.offset| .cse612) (= v_ArrVal_1436 v_arrayElimCell_109))))))) (< (select (select .cse614 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) .cse608) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436)))) (or .cse12 (forall ((v_ArrVal_1429 Int) (|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_prenex_5 Int) (v_ArrVal_1434 Int) (v_ArrVal_1436 Int)) (let ((.cse619 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429)))) (let ((.cse620 (store .cse619 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse619 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|)))) (let ((.cse617 (store (select .cse620 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse616 (store .cse620 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse617))) (let ((.cse615 (+ v_ArrVal_1436 4)) (.cse618 (select (select .cse616 .cse8) |c_ULTIMATE.start_l2_insert_~list#1.offset|))) (or (= .cse615 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (= (select (select .cse616 v_prenex_5) (select .cse617 .cse615)) 0) (< v_ArrVal_1436 0) (= .cse615 |c_ULTIMATE.start_l2_insert_~list#1.offset|) (< .cse618 0) (< (select (select .cse619 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) .cse615) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436) (= (select (select .cse616 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) .cse618) 0) (= (select (select .cse616 |c_ULTIMATE.start_l2_insert_~item~0#1.base|) .cse618) 0)))))))))) .cse0) (forall ((v_ArrVal_1429 Int) (v_ArrVal_1436 Int)) (let ((.cse626 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429))) (.cse621 (+ v_ArrVal_1436 4))) (or (= .cse621 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (< v_ArrVal_1436 0) (= .cse621 |c_ULTIMATE.start_l2_insert_~list#1.offset|) (forall ((v_arrayElimCell_109 Int) (|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_arrayElimCell_110 Int) (v_ArrVal_1434 Int) (v_arrayElimCell_118 Int)) (let ((.cse625 (store .cse626 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse626 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|)))) (let ((.cse624 (store (select .cse625 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse622 (store .cse625 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse624))) (let ((.cse623 (select (select .cse622 .cse8) (+ v_arrayElimCell_109 4)))) (or (= (select (select .cse622 v_arrayElimCell_110) .cse623) 0) (= (select (select .cse622 v_arrayElimCell_118) (select .cse624 .cse621)) 0) (< v_arrayElimCell_109 0) (= (select (select .cse622 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) .cse623) 0) (< .cse623 0) (= (select (select .cse622 |c_ULTIMATE.start_l2_insert_~item~0#1.base|) .cse623) 0) (= v_ArrVal_1436 v_arrayElimCell_109))))))) (< (select (select .cse626 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) .cse621) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436)))) (or .cse12 (forall ((v_ArrVal_1429 Int) (|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_ArrVal_1434 Int) (v_ArrVal_1436 Int) (v_arrayElimCell_118 Int)) (let ((.cse631 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429)))) (let ((.cse632 (store .cse631 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse631 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|)))) (let ((.cse629 (store (select .cse632 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse628 (store .cse632 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse629))) (let ((.cse627 (+ v_ArrVal_1436 4)) (.cse630 (select (select .cse628 .cse8) |c_ULTIMATE.start_l2_insert_~list#1.offset|))) (or (= .cse627 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (= (select (select .cse628 v_arrayElimCell_118) (select .cse629 .cse627)) 0) (< v_ArrVal_1436 0) (= .cse627 |c_ULTIMATE.start_l2_insert_~list#1.offset|) (< .cse630 0) (< (select (select .cse631 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) .cse627) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436) (= (select (select .cse628 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) .cse630) 0) (= (select (select .cse628 |c_ULTIMATE.start_l2_insert_~item~0#1.base|) .cse630) 0)))))))))) .cse13) (or (forall ((v_ArrVal_1429 Int) (v_arrayElimCell_109 Int) (v_prenex_5 Int) (v_arrayElimCell_110 Int) (v_ArrVal_1434 Int) (v_ArrVal_1436 Int)) (let ((.cse638 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429)))) (let ((.cse639 (store .cse638 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse638 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|)))) (let ((.cse635 (store (select .cse639 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse634 (store .cse639 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse635)) (.cse637 (+ v_arrayElimCell_109 4))) (let ((.cse636 (select (select .cse634 .cse8) .cse637)) (.cse633 (+ v_ArrVal_1436 4))) (or (= .cse633 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (= (select (select .cse634 v_prenex_5) (select .cse635 .cse633)) 0) (= (select (select .cse634 v_arrayElimCell_110) .cse636) 0) (= |c_ULTIMATE.start_l1_insert_~item~1#1.offset| .cse637) (< v_arrayElimCell_109 0) (< v_ArrVal_1436 0) (= .cse633 |c_ULTIMATE.start_l2_insert_~list#1.offset|) (< .cse636 0) (= |c_ULTIMATE.start_l2_insert_~list#1.offset| .cse637) (< (select (select .cse638 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) .cse633) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436)))))))) .cse0 .cse1) (or (and .cse640 .cse641) .cse67) (or .cse642 .cse13 .cse0) (or .cse0 (forall ((v_ArrVal_1429 Int) (v_arrayElimCell_109 Int) (v_prenex_5 Int) (v_ArrVal_1434 Int) (v_ArrVal_1436 Int)) (let ((.cse648 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429)))) (let ((.cse649 (store .cse648 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse648 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|)))) (let ((.cse645 (store (select .cse649 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse644 (store .cse649 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse645)) (.cse646 (+ v_arrayElimCell_109 4))) (let ((.cse647 (select (select .cse644 .cse8) .cse646)) (.cse643 (+ v_ArrVal_1436 4))) (or (= .cse643 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (= (select (select .cse644 v_prenex_5) (select .cse645 .cse643)) 0) (= |c_ULTIMATE.start_l1_insert_~item~1#1.offset| .cse646) (< v_arrayElimCell_109 0) (< v_ArrVal_1436 0) (< .cse647 0) (= (select (select .cse644 |c_ULTIMATE.start_l2_insert_~item~0#1.base|) .cse647) 0) (< (select (select .cse648 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) .cse643) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436)))))))) .cse1) (forall ((v_ArrVal_1429 Int) (v_ArrVal_1436 Int)) (let ((.cse656 (let ((.cse658 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429)))) (store .cse658 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse658 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|))))) (let ((.cse657 (select .cse656 |c_ULTIMATE.start_l1_insert_~item~1#1.base|)) (.cse650 (+ v_ArrVal_1436 4))) (or (= .cse650 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (forall ((v_arrayElimCell_109 Int) (v_ArrVal_1434 Int)) (let ((.cse654 (store .cse657 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse651 (+ v_arrayElimCell_109 4)) (.cse655 (store .cse656 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse654))) (let ((.cse653 (select .cse655 |c_ULTIMATE.start_l2_insert_~item~0#1.base|)) (.cse652 (select (select .cse655 .cse8) .cse651))) (or (= |c_ULTIMATE.start_l1_insert_~item~1#1.offset| .cse651) (< v_arrayElimCell_109 0) (< .cse652 0) (= (select .cse653 (select .cse654 .cse650)) 0) (= (select .cse653 .cse652) 0)))))) (< v_ArrVal_1436 0) (< (select .cse657 .cse650) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436))))) (or .cse67 (and .cse659 .cse104)) (or .cse30 .cse58 (and .cse660 (forall ((v_ArrVal_1429 Int) (v_ArrVal_1436 Int)) (let ((.cse667 (let ((.cse669 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429)))) (store .cse669 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse669 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|))))) (let ((.cse668 (select .cse667 |c_ULTIMATE.start_l1_insert_~item~1#1.base|)) (.cse661 (+ v_ArrVal_1436 4))) (or (= .cse661 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (< v_ArrVal_1436 0) (forall ((|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_ArrVal_1434 Int)) (let ((.cse666 (store .cse668 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse664 (store .cse667 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse666))) (let ((.cse662 (select (select .cse664 .cse8) |c_ULTIMATE.start_l1_insert_~item~1#1.offset|)) (.cse663 (select .cse664 |ULTIMATE.start_l1_insert_#t~mem13#1.base|)) (.cse665 (select .cse666 .cse661))) (or (< .cse662 0) (= (select .cse663 .cse662) 0) (= (select (select .cse664 |c_ULTIMATE.start_l2_insert_~item~0#1.base|) .cse665) 0) (= (select .cse663 .cse665) 0)))))) (< (select .cse668 .cse661) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436))))) .cse670 (or (forall ((v_ArrVal_1429 Int) (|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_ArrVal_1434 Int) (v_ArrVal_1436 Int) (v_arrayElimCell_119 Int)) (let ((.cse675 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429)))) (let ((.cse676 (store .cse675 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse675 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|)))) (let ((.cse674 (store (select .cse676 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse673 (store .cse676 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse674))) (let ((.cse671 (select (select .cse673 .cse8) |c_ULTIMATE.start_l1_insert_~item~1#1.offset|)) (.cse672 (+ v_ArrVal_1436 4))) (or (< .cse671 0) (= .cse672 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (< v_ArrVal_1436 0) (= (select (select .cse673 v_arrayElimCell_119) (select .cse674 .cse672)) 0) (= (select (select .cse673 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) .cse671) 0) (< (select (select .cse675 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) .cse672) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436)))))))) .cse67)) .cse28) (or .cse521 .cse30 .cse28) (or (forall ((v_ArrVal_1429 Int) (v_arrayElimCell_109 Int) (|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_ArrVal_1434 Int)) (let ((.cse679 (let ((.cse680 (let ((.cse681 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429)))) (store .cse681 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse681 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|))))) (store .cse680 |c_ULTIMATE.start_l1_insert_~item~1#1.base| (store (select .cse680 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434)))) (.cse677 (+ v_arrayElimCell_109 4))) (let ((.cse678 (select (select .cse679 .cse8) .cse677))) (or (= |c_ULTIMATE.start_l1_insert_~item~1#1.offset| .cse677) (< v_arrayElimCell_109 0) (< v_ArrVal_1434 0) (< .cse678 0) (= (select (select .cse679 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) v_ArrVal_1434) 0) (= (select (select .cse679 |c_ULTIMATE.start_l2_insert_~item~0#1.base|) .cse678) 0))))) .cse28) (or (forall ((v_ArrVal_1429 Int) (v_arrayElimCell_109 Int) (|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_prenex_5 Int) (v_ArrVal_1434 Int) (v_ArrVal_1436 Int)) (let ((.cse686 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429)))) (let ((.cse687 (store .cse686 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse686 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|)))) (let ((.cse684 (store (select .cse687 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse683 (store .cse687 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse684))) (let ((.cse685 (select (select .cse683 .cse8) (+ v_arrayElimCell_109 4))) (.cse682 (+ v_ArrVal_1436 4))) (or (= .cse682 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (= (select (select .cse683 v_prenex_5) (select .cse684 .cse682)) 0) (< v_arrayElimCell_109 0) (< v_ArrVal_1436 0) (= (select (select .cse683 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) .cse685) 0) (= .cse682 |c_ULTIMATE.start_l2_insert_~list#1.offset|) (< .cse685 0) (= (select (select .cse683 |c_ULTIMATE.start_l2_insert_~item~0#1.base|) .cse685) 0) (< (select (select .cse686 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) .cse682) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436) (= v_ArrVal_1436 v_arrayElimCell_109)))))))) .cse0 .cse1) (forall ((v_ArrVal_1429 Int) (v_ArrVal_1436 Int)) (let ((.cse693 (let ((.cse695 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429)))) (store .cse695 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse695 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|))))) (let ((.cse694 (select .cse693 |c_ULTIMATE.start_l1_insert_~item~1#1.base|)) (.cse688 (+ v_ArrVal_1436 4))) (or (= .cse688 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (< v_ArrVal_1436 0) (forall ((v_arrayElimCell_109 Int) (|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_arrayElimCell_110 Int) (v_ArrVal_1434 Int)) (let ((.cse692 (store .cse694 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse689 (store .cse693 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse692)) (.cse691 (+ v_arrayElimCell_109 4))) (let ((.cse690 (select (select .cse689 .cse8) .cse691))) (or (= (select (select .cse689 v_arrayElimCell_110) .cse690) 0) (< v_arrayElimCell_109 0) (= (select (select .cse689 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) .cse690) 0) (< .cse690 0) (= |c_ULTIMATE.start_l2_insert_~list#1.offset| .cse691) (= (select (select .cse689 |c_ULTIMATE.start_l2_insert_~item~0#1.base|) (select .cse692 .cse688)) 0) (= v_ArrVal_1436 v_arrayElimCell_109)))))) (< (select .cse694 .cse688) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436))))) (or (and .cse696 .cse697) .cse67) (or (let ((.cse714 (or (forall ((v_ArrVal_1429 Int) (v_arrayElimCell_109 Int) (|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_arrayElimCell_110 Int) (v_ArrVal_1434 Int)) (let ((.cse752 (let ((.cse755 (let ((.cse756 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429)))) (store .cse756 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse756 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|))))) (store .cse755 |c_ULTIMATE.start_l1_insert_~item~1#1.base| (store (select .cse755 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434)))) (.cse754 (+ v_arrayElimCell_109 4))) (let ((.cse753 (select (select .cse752 .cse8) .cse754))) (or (= (select (select .cse752 v_arrayElimCell_110) .cse753) 0) (= |c_ULTIMATE.start_l1_insert_~item~1#1.offset| .cse754) (< v_arrayElimCell_109 0) (< v_ArrVal_1434 0) (< .cse753 0) (= (select (select .cse752 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) v_ArrVal_1434) 0))))) .cse28))) (and (or (and (forall ((v_ArrVal_1429 Int) (v_ArrVal_1436 Int)) (or (< v_ArrVal_1436 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436) (forall ((|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_ArrVal_1434 Int)) (let ((.cse703 (let ((.cse705 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429)))) (store .cse705 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse705 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|))))) (let ((.cse704 (store (select .cse703 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse699 (select .cse704 (+ v_ArrVal_1436 4))) (.cse698 (store .cse703 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse704))) (or (= (select (select .cse698 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) .cse699) 0) (< .cse699 0) (forall ((v_arrayElimCell_109 Int)) (let ((.cse700 (+ v_arrayElimCell_109 4))) (let ((.cse702 (select (select .cse698 .cse8) .cse700))) (or (= |c_ULTIMATE.start_l1_insert_~item~1#1.offset| .cse700) (forall ((v_arrayElimCell_110 Int)) (let ((.cse701 (select .cse698 v_arrayElimCell_110))) (or (= (select .cse701 .cse702) 0) (= (select .cse701 .cse699) 0)))) (< v_arrayElimCell_109 0) (< .cse702 0)))))))))))) (forall ((v_ArrVal_1429 Int) (v_ArrVal_1436 Int)) (let ((.cse713 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429))) (.cse706 (+ v_ArrVal_1436 4))) (or (= .cse706 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (forall ((v_arrayElimCell_109 Int) (v_arrayElimCell_110 Int) (v_ArrVal_1434 Int)) (let ((.cse712 (store .cse713 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse713 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|)))) (let ((.cse710 (store (select .cse712 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse711 (store .cse712 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse710)) (.cse709 (+ v_arrayElimCell_109 4))) (let ((.cse708 (select (select .cse711 .cse8) .cse709)) (.cse707 (select .cse711 v_arrayElimCell_110))) (or (= (select .cse707 .cse708) 0) (= |c_ULTIMATE.start_l1_insert_~item~1#1.offset| .cse709) (< v_arrayElimCell_109 0) (< .cse708 0) (= (select .cse707 (select .cse710 .cse706)) 0))))))) (< v_ArrVal_1436 0) (< (select (select .cse713 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) .cse706) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436)))) .cse714 (or (forall ((v_ArrVal_1429 Int) (v_arrayElimCell_109 Int) (v_arrayElimCell_110 Int) (v_ArrVal_1434 Int) (v_arrayElimCell_114 Int) (v_ArrVal_1436 Int)) (let ((.cse720 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429)))) (let ((.cse721 (store .cse720 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse720 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|)))) (let ((.cse719 (store (select .cse721 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse716 (store .cse721 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse719)) (.cse718 (+ v_arrayElimCell_109 4))) (let ((.cse717 (select (select .cse716 .cse8) .cse718)) (.cse715 (+ v_ArrVal_1436 4))) (or (= .cse715 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (= (select (select .cse716 v_arrayElimCell_110) .cse717) 0) (= |c_ULTIMATE.start_l1_insert_~item~1#1.offset| .cse718) (< v_arrayElimCell_109 0) (< v_ArrVal_1436 0) (< .cse717 0) (= (select (select .cse716 v_arrayElimCell_114) (select .cse719 .cse715)) 0) (< (select (select .cse720 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) .cse715) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436)))))))) .cse1)) .cse0) (or (and (forall ((v_ArrVal_1429 Int) (v_ArrVal_1436 Int)) (let ((.cse728 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429))) (.cse722 (+ v_ArrVal_1436 4))) (or (= .cse722 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (< v_ArrVal_1436 0) (= .cse722 |c_ULTIMATE.start_l2_insert_~list#1.offset|) (forall ((v_arrayElimCell_109 Int) (v_arrayElimCell_110 Int) (v_arrayElimCell_115 Int) (v_ArrVal_1434 Int)) (let ((.cse727 (store .cse728 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse728 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|)))) (let ((.cse724 (store (select .cse727 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse723 (store .cse727 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse724)) (.cse726 (+ v_arrayElimCell_109 4))) (let ((.cse725 (select (select .cse723 .cse8) .cse726))) (or (= (select (select .cse723 v_arrayElimCell_115) (select .cse724 .cse722)) 0) (= (select (select .cse723 v_arrayElimCell_110) .cse725) 0) (= |c_ULTIMATE.start_l1_insert_~item~1#1.offset| .cse726) (< v_arrayElimCell_109 0) (< .cse725 0))))))) (< (select (select .cse728 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) .cse722) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436)))) (forall ((v_ArrVal_1429 Int) (v_ArrVal_1436 Int)) (let ((.cse734 (let ((.cse736 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429)))) (store .cse736 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse736 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|))))) (let ((.cse735 (select .cse734 |c_ULTIMATE.start_l1_insert_~item~1#1.base|)) (.cse729 (+ v_ArrVal_1436 4))) (or (= .cse729 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (forall ((v_arrayElimCell_109 Int) (v_arrayElimCell_110 Int) (v_ArrVal_1434 Int)) (let ((.cse733 (store .cse735 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse730 (store .cse734 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse733)) (.cse732 (+ v_arrayElimCell_109 4))) (let ((.cse731 (select (select .cse730 .cse8) .cse732))) (or (= (select (select .cse730 v_arrayElimCell_110) .cse731) 0) (= |c_ULTIMATE.start_l1_insert_~item~1#1.offset| .cse732) (< v_arrayElimCell_109 0) (< .cse731 0) (= (select (select .cse730 |c_ULTIMATE.start_l2_insert_~item~0#1.base|) (select .cse733 .cse729)) 0)))))) (< v_ArrVal_1436 0) (< (select .cse735 .cse729) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436))))) (forall ((v_ArrVal_1429 Int) (v_ArrVal_1436 Int)) (let ((.cse737 (+ v_ArrVal_1436 4))) (or (< v_ArrVal_1436 0) (= .cse737 |c_ULTIMATE.start_l2_insert_~list#1.offset|) (forall ((v_arrayElimCell_109 Int) (|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_arrayElimCell_110 Int) (v_arrayElimCell_115 Int) (v_ArrVal_1434 Int)) (let ((.cse743 (let ((.cse744 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429)))) (store .cse744 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse744 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|))))) (let ((.cse742 (store (select .cse743 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse738 (store .cse743 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse742)) (.cse741 (+ v_arrayElimCell_109 4))) (let ((.cse740 (select (select .cse738 .cse8) .cse741)) (.cse739 (select .cse742 .cse737))) (or (= (select (select .cse738 v_arrayElimCell_115) .cse739) 0) (= (select (select .cse738 v_arrayElimCell_110) .cse740) 0) (= |c_ULTIMATE.start_l1_insert_~item~1#1.offset| .cse741) (< v_arrayElimCell_109 0) (< .cse740 0) (= (select (select .cse738 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) .cse739) 0) (< .cse739 0))))))) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436)))) .cse714 (forall ((v_ArrVal_1429 Int) (v_ArrVal_1436 Int)) (or (forall ((v_arrayElimCell_109 Int)) (let ((.cse745 (+ v_arrayElimCell_109 4))) (or (= |c_ULTIMATE.start_l1_insert_~item~1#1.offset| .cse745) (< v_arrayElimCell_109 0) (forall ((|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_arrayElimCell_110 Int) (v_ArrVal_1434 Int)) (let ((.cse750 (let ((.cse751 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429)))) (store .cse751 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse751 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|))))) (let ((.cse749 (store (select .cse750 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse746 (store .cse750 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse749))) (let ((.cse747 (select (select .cse746 .cse8) .cse745)) (.cse748 (select .cse749 (+ v_ArrVal_1436 4)))) (or (= (select (select .cse746 v_arrayElimCell_110) .cse747) 0) (< .cse747 0) (= (select (select .cse746 |c_ULTIMATE.start_l2_insert_~item~0#1.base|) .cse748) 0) (= (select (select .cse746 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) .cse748) 0) (< .cse748 0)))))))))) (< v_ArrVal_1436 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436)))) .cse1))) .cse67) (or .cse67 (and (or (forall ((v_ArrVal_1429 Int) (v_arrayElimCell_109 Int) (|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_arrayElimCell_110 Int) (v_arrayElimCell_115 Int) (v_ArrVal_1434 Int) (v_ArrVal_1436 Int)) (let ((.cse762 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429)))) (let ((.cse763 (store .cse762 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse762 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|)))) (let ((.cse758 (store (select .cse763 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse757 (store .cse763 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse758)) (.cse761 (+ v_arrayElimCell_109 4))) (let ((.cse760 (select (select .cse757 .cse8) .cse761)) (.cse759 (+ v_ArrVal_1436 4))) (or (= (select (select .cse757 v_arrayElimCell_115) (select .cse758 .cse759)) 0) (= .cse759 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (= (select (select .cse757 v_arrayElimCell_110) .cse760) 0) (< v_arrayElimCell_109 0) (< v_ArrVal_1436 0) (= (select (select .cse757 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) .cse760) 0) (= .cse759 |c_ULTIMATE.start_l2_insert_~list#1.offset|) (< .cse760 0) (= |c_ULTIMATE.start_l2_insert_~list#1.offset| .cse761) (< (select (select .cse762 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) .cse759) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436)))))))) .cse1) (or (forall ((v_ArrVal_1429 Int) (v_arrayElimCell_109 Int) (|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_arrayElimCell_110 Int) (v_ArrVal_1434 Int) (v_arrayElimCell_114 Int) (v_ArrVal_1436 Int)) (let ((.cse769 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429)))) (let ((.cse770 (store .cse769 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse769 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|)))) (let ((.cse767 (store (select .cse770 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse765 (store .cse770 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse767)) (.cse768 (+ v_arrayElimCell_109 4))) (let ((.cse766 (select (select .cse765 .cse8) .cse768)) (.cse764 (+ v_ArrVal_1436 4))) (or (= .cse764 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (= (select (select .cse765 v_arrayElimCell_110) .cse766) 0) (< v_arrayElimCell_109 0) (< v_ArrVal_1436 0) (= (select (select .cse765 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) .cse766) 0) (= .cse764 |c_ULTIMATE.start_l2_insert_~list#1.offset|) (< .cse766 0) (= (select (select .cse765 v_arrayElimCell_114) (select .cse767 .cse764)) 0) (= |c_ULTIMATE.start_l2_insert_~list#1.offset| .cse768) (< (select (select .cse769 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) .cse764) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436)))))))) .cse0 .cse1))) (forall ((v_ArrVal_1429 Int) (v_ArrVal_1436 Int)) (let ((.cse778 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429))) (.cse775 (+ v_ArrVal_1436 4))) (or (forall ((v_arrayElimCell_109 Int) (|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_arrayElimCell_110 Int) (v_ArrVal_1434 Int)) (let ((.cse777 (store .cse778 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse778 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|)))) (let ((.cse774 (store (select .cse777 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse773 (store .cse777 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse774)) (.cse776 (+ v_arrayElimCell_109 4))) (let ((.cse772 (select (select .cse773 .cse8) .cse776)) (.cse771 (select .cse773 v_arrayElimCell_110))) (or (= (select .cse771 .cse772) 0) (< v_arrayElimCell_109 0) (= (select (select .cse773 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) .cse772) 0) (< .cse772 0) (= (select .cse771 (select .cse774 .cse775)) 0) (= |c_ULTIMATE.start_l2_insert_~list#1.offset| .cse776))))))) (= .cse775 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (< v_ArrVal_1436 0) (= .cse775 |c_ULTIMATE.start_l2_insert_~list#1.offset|) (< (select (select .cse778 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) .cse775) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436)))) (or .cse779 .cse58 .cse28) (or (forall ((v_ArrVal_1429 Int) (v_arrayElimCell_109 Int) (v_prenex_5 Int) (v_arrayElimCell_110 Int) (v_ArrVal_1434 Int) (v_ArrVal_1436 Int)) (let ((.cse785 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429)))) (let ((.cse786 (store .cse785 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse785 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|)))) (let ((.cse782 (store (select .cse786 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse781 (store .cse786 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse782)) (.cse784 (+ v_arrayElimCell_109 4))) (let ((.cse783 (select (select .cse781 .cse8) .cse784)) (.cse780 (+ v_ArrVal_1436 4))) (or (= .cse780 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (= (select (select .cse781 v_prenex_5) (select .cse782 .cse780)) 0) (= (select (select .cse781 v_arrayElimCell_110) .cse783) 0) (= |c_ULTIMATE.start_l1_insert_~item~1#1.offset| .cse784) (< v_arrayElimCell_109 0) (< v_ArrVal_1436 0) (< .cse783 0) (= |c_ULTIMATE.start_l2_insert_~list#1.offset| .cse784) (< (select (select .cse785 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) .cse780) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436) (= v_ArrVal_1436 v_arrayElimCell_109)))))))) .cse0 .cse1) (or .cse67 (and .cse696 .cse659 (or (and (forall ((v_ArrVal_1429 Int) (v_ArrVal_1436 Int)) (let ((.cse792 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429))) (.cse787 (+ v_ArrVal_1436 4))) (or (= .cse787 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (< v_ArrVal_1436 0) (forall ((|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_ArrVal_1434 Int)) (let ((.cse791 (store .cse792 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse792 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|)))) (let ((.cse790 (store (select .cse791 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse789 (store .cse791 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse790))) (let ((.cse788 (select (select .cse789 .cse8) |c_ULTIMATE.start_l1_insert_~item~1#1.offset|))) (or (< .cse788 0) (= (select (select .cse789 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) .cse788) 0) (= (select (select .cse789 |c_ULTIMATE.start_l2_insert_~item~0#1.base|) (select .cse790 .cse787)) 0))))))) (< (select (select .cse792 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) .cse787) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436)))) .cse670 (forall ((v_ArrVal_1429 Int) (v_ArrVal_1436 Int)) (let ((.cse798 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429))) (.cse793 (+ v_ArrVal_1436 4))) (or (= .cse793 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (< v_ArrVal_1436 0) (forall ((|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_ArrVal_1434 Int) (v_arrayElimCell_119 Int)) (let ((.cse797 (store .cse798 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse798 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|)))) (let ((.cse796 (store (select .cse797 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse795 (store .cse797 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse796))) (let ((.cse794 (select (select .cse795 .cse8) |c_ULTIMATE.start_l1_insert_~item~1#1.offset|))) (or (< .cse794 0) (= (select (select .cse795 v_arrayElimCell_119) (select .cse796 .cse793)) 0) (= (select (select .cse795 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) .cse794) 0))))))) (< (select (select .cse798 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) .cse793) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436)))) (forall ((v_ArrVal_1429 Int) (v_ArrVal_1436 Int)) (let ((.cse806 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429))) (.cse799 (+ v_ArrVal_1436 4))) (or (= .cse799 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (< v_ArrVal_1436 0) (forall ((|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_ArrVal_1434 Int)) (let ((.cse805 (store .cse806 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse806 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|)))) (let ((.cse804 (store (select .cse805 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse802 (store .cse805 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse804))) (let ((.cse800 (select (select .cse802 .cse8) |c_ULTIMATE.start_l1_insert_~item~1#1.offset|)) (.cse801 (select .cse802 |ULTIMATE.start_l1_insert_#t~mem13#1.base|)) (.cse803 (select .cse804 .cse799))) (or (< .cse800 0) (= (select .cse801 .cse800) 0) (= (select (select .cse802 |c_ULTIMATE.start_l2_insert_~item~0#1.base|) .cse803) 0) (= (select .cse801 .cse803) 0))))))) (< (select (select .cse806 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) .cse799) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436))))) .cse30 .cse58 .cse28) .cse103 .cse640 .cse807 .cse641 .cse140 .cse104 .cse697 .cse141)) (or (forall ((v_ArrVal_1429 Int) (v_arrayElimCell_109 Int) (|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_ArrVal_1434 Int)) (let ((.cse810 (let ((.cse811 (let ((.cse812 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429)))) (store .cse812 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse812 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|))))) (store .cse811 |c_ULTIMATE.start_l1_insert_~item~1#1.base| (store (select .cse811 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))))) (let ((.cse808 (select .cse810 |ULTIMATE.start_l1_insert_#t~mem13#1.base|)) (.cse809 (select (select .cse810 .cse8) (+ v_arrayElimCell_109 4)))) (or (< v_arrayElimCell_109 0) (= (select .cse808 .cse809) 0) (< v_ArrVal_1434 0) (< .cse809 0) (= (select .cse808 v_ArrVal_1434) 0) (= (select (select .cse810 |c_ULTIMATE.start_l2_insert_~item~0#1.base|) .cse809) 0))))) .cse28) (or .cse642 .cse0 .cse1) (or (and (forall ((v_ArrVal_1429 Int) (v_ArrVal_1436 Int)) (or (< v_ArrVal_1436 0) (forall ((|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_ArrVal_1434 Int)) (let ((.cse818 (let ((.cse819 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429)))) (store .cse819 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse819 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|))))) (let ((.cse817 (store (select .cse818 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse815 (store .cse818 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse817))) (let ((.cse813 (select (select .cse815 .cse8) |c_ULTIMATE.start_l1_insert_~item~1#1.offset|)) (.cse814 (select .cse815 |ULTIMATE.start_l1_insert_#t~mem13#1.base|)) (.cse816 (select .cse817 (+ v_ArrVal_1436 4)))) (or (< .cse813 0) (= (select .cse814 .cse813) 0) (= (select (select .cse815 |c_ULTIMATE.start_l2_insert_~item~0#1.base|) .cse816) 0) (= (select .cse814 .cse816) 0) (< .cse816 0))))))) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436))) .cse660 (forall ((v_ArrVal_1429 Int) (|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_ArrVal_1434 Int)) (let ((.cse820 (let ((.cse821 (let ((.cse822 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429)))) (store .cse822 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse822 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|))))) (store .cse821 |c_ULTIMATE.start_l1_insert_~item~1#1.base| (store (select .cse821 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))))) (or (< (select (select .cse820 .cse8) |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) 0) (= (select (select .cse820 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) v_ArrVal_1434) 0))))) .cse30 .cse28) (or (forall ((v_ArrVal_1429 Int) (v_arrayElimCell_109 Int) (|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_arrayElimCell_110 Int) (v_ArrVal_1434 Int)) (let ((.cse823 (let ((.cse827 (let ((.cse828 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429)))) (store .cse828 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse828 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|))))) (store .cse827 |c_ULTIMATE.start_l1_insert_~item~1#1.base| (store (select .cse827 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434)))) (.cse826 (+ v_arrayElimCell_109 4))) (let ((.cse824 (select (select .cse823 .cse8) .cse826)) (.cse825 (select .cse823 |ULTIMATE.start_l1_insert_#t~mem13#1.base|))) (or (= (select (select .cse823 v_arrayElimCell_110) .cse824) 0) (< v_arrayElimCell_109 0) (= (select .cse825 .cse824) 0) (< v_ArrVal_1434 0) (< .cse824 0) (= (select .cse825 v_ArrVal_1434) 0) (= |c_ULTIMATE.start_l2_insert_~list#1.offset| .cse826))))) .cse58 .cse28) (forall ((v_ArrVal_1429 Int) (v_ArrVal_1436 Int)) (or (< v_ArrVal_1436 0) (forall ((v_arrayElimCell_109 Int)) (let ((.cse829 (+ v_arrayElimCell_109 4))) (or (= |c_ULTIMATE.start_l1_insert_~item~1#1.offset| .cse829) (< v_arrayElimCell_109 0) (= |c_ULTIMATE.start_l2_insert_~list#1.offset| .cse829) (forall ((v_arrayElimCell_110 Int) (v_ArrVal_1434 Int)) (let ((.cse834 (let ((.cse835 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429)))) (store .cse835 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse835 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|))))) (let ((.cse833 (store (select .cse834 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse830 (store .cse834 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse833))) (let ((.cse831 (select (select .cse830 .cse8) .cse829)) (.cse832 (select .cse833 (+ v_ArrVal_1436 4)))) (or (= (select (select .cse830 v_arrayElimCell_110) .cse831) 0) (< .cse831 0) (forall ((|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int)) (= (select (select .cse830 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) .cse832) 0)) (= (select (select .cse830 |c_ULTIMATE.start_l2_insert_~item~0#1.base|) .cse832) 0) (< .cse832 0))))))) (= v_ArrVal_1436 v_arrayElimCell_109)))) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436))) (or .cse0 (forall ((v_ArrVal_1429 Int) (v_arrayElimCell_109 Int) (|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_prenex_5 Int) (v_ArrVal_1434 Int) (v_ArrVal_1436 Int)) (let ((.cse841 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429)))) (let ((.cse842 (store .cse841 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse841 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|)))) (let ((.cse838 (store (select .cse842 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse837 (store .cse842 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse838)) (.cse840 (+ v_arrayElimCell_109 4))) (let ((.cse839 (select (select .cse837 .cse8) .cse840)) (.cse836 (+ v_ArrVal_1436 4))) (or (= .cse836 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (= (select (select .cse837 v_prenex_5) (select .cse838 .cse836)) 0) (< v_arrayElimCell_109 0) (< v_ArrVal_1436 0) (= (select (select .cse837 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) .cse839) 0) (< .cse839 0) (= |c_ULTIMATE.start_l2_insert_~list#1.offset| .cse840) (= (select (select .cse837 |c_ULTIMATE.start_l2_insert_~item~0#1.base|) .cse839) 0) (< (select (select .cse841 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) .cse836) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436) (= v_ArrVal_1436 v_arrayElimCell_109)))))))) .cse1) (or (forall ((v_ArrVal_1429 Int) (v_arrayElimCell_109 Int) (v_prenex_5 Int) (v_ArrVal_1434 Int) (v_ArrVal_1436 Int)) (let ((.cse848 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429)))) (let ((.cse849 (store .cse848 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse848 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|)))) (let ((.cse845 (store (select .cse849 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse844 (store .cse849 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse845)) (.cse846 (+ v_arrayElimCell_109 4))) (let ((.cse847 (select (select .cse844 .cse8) .cse846)) (.cse843 (+ v_ArrVal_1436 4))) (or (= .cse843 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (= (select (select .cse844 v_prenex_5) (select .cse845 .cse843)) 0) (= |c_ULTIMATE.start_l1_insert_~item~1#1.offset| .cse846) (< v_arrayElimCell_109 0) (< v_ArrVal_1436 0) (< .cse847 0) (= (select (select .cse844 |c_ULTIMATE.start_l2_insert_~item~0#1.base|) .cse847) 0) (< (select (select .cse848 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) .cse843) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436) (= v_ArrVal_1436 v_arrayElimCell_109)))))))) .cse0 .cse1) (or (and .cse125 (or (forall ((v_ArrVal_1429 Int) (v_arrayElimCell_109 Int) (v_arrayElimCell_110 Int) (v_ArrVal_1434 Int) (v_arrayElimCell_114 Int) (v_ArrVal_1436 Int)) (let ((.cse855 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429)))) (let ((.cse856 (store .cse855 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse855 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|)))) (let ((.cse854 (store (select .cse856 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse851 (store .cse856 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse854)) (.cse853 (+ v_arrayElimCell_109 4))) (let ((.cse852 (select (select .cse851 .cse8) .cse853)) (.cse850 (+ v_ArrVal_1436 4))) (or (= .cse850 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (= (select (select .cse851 v_arrayElimCell_110) .cse852) 0) (= |c_ULTIMATE.start_l1_insert_~item~1#1.offset| .cse853) (< v_arrayElimCell_109 0) (< v_ArrVal_1436 0) (< .cse852 0) (= (select (select .cse851 v_arrayElimCell_114) (select .cse854 .cse850)) 0) (< (select (select .cse855 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) .cse850) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436) (= v_ArrVal_1436 v_arrayElimCell_109)))))))) .cse0 .cse1)) .cse67) (or .cse67 (and .cse807 .cse697)) (or .cse12 (and (or .cse0 (forall ((v_ArrVal_1429 Int) (v_prenex_5 Int) (v_ArrVal_1434 Int) (v_ArrVal_1436 Int)) (let ((.cse861 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429)))) (let ((.cse862 (store .cse861 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse861 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|)))) (let ((.cse859 (store (select .cse862 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse858 (store .cse862 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse859))) (let ((.cse857 (+ v_ArrVal_1436 4)) (.cse860 (select (select .cse858 .cse8) |c_ULTIMATE.start_l2_insert_~list#1.offset|))) (or (= .cse857 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (= (select (select .cse858 v_prenex_5) (select .cse859 .cse857)) 0) (< v_ArrVal_1436 0) (< .cse860 0) (< (select (select .cse861 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) .cse857) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436) (= (select (select .cse858 |c_ULTIMATE.start_l2_insert_~item~0#1.base|) .cse860) 0))))))))) .cse267) .cse13 .cse58) (or (and (forall ((v_ArrVal_1429 Int) (v_ArrVal_1436 Int)) (let ((.cse866 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429))) (.cse863 (+ v_ArrVal_1436 4))) (or (= .cse863 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (forall ((v_arrayElimCell_124 Int) (v_ArrVal_1434 Int)) (= (let ((.cse864 (store .cse866 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse866 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|)))) (let ((.cse865 (store (select .cse864 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (select (select (store .cse864 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse865) v_arrayElimCell_124) (select .cse865 .cse863)))) 0)) (< v_ArrVal_1436 0) (= .cse863 |c_ULTIMATE.start_l2_insert_~list#1.offset|) (< (select (select .cse866 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) .cse863) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436)))) (forall ((v_ArrVal_1429 Int) (v_ArrVal_1436 Int)) (or (forall ((v_ArrVal_1434 Int)) (let ((.cse870 (let ((.cse871 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429)))) (store .cse871 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse871 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|))))) (let ((.cse869 (store (select .cse870 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse867 (store .cse870 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse869)) (.cse868 (select .cse869 (+ v_ArrVal_1436 4)))) (or (forall ((v_prenex_6 Int)) (= (select (select .cse867 v_prenex_6) .cse868) 0)) (= (select (select .cse867 |c_ULTIMATE.start_l2_insert_~item~0#1.base|) .cse868) 0) (< .cse868 0)))))) (< v_ArrVal_1436 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436))) (forall ((v_ArrVal_1429 Int) (v_ArrVal_1436 Int)) (let ((.cse873 (let ((.cse876 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429)))) (store .cse876 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse876 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|))))) (let ((.cse875 (select .cse873 |c_ULTIMATE.start_l1_insert_~item~1#1.base|)) (.cse872 (+ v_ArrVal_1436 4))) (or (= .cse872 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (< v_ArrVal_1436 0) (forall ((v_ArrVal_1434 Int)) (= (let ((.cse874 (store .cse875 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (select (select (store .cse873 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse874) |c_ULTIMATE.start_l2_insert_~item~0#1.base|) (select .cse874 .cse872))) 0)) (< (select .cse875 .cse872) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436))))) (forall ((v_ArrVal_1429 Int) (v_ArrVal_1436 Int)) (let ((.cse877 (+ v_ArrVal_1436 4))) (or (< v_ArrVal_1436 0) (= .cse877 |c_ULTIMATE.start_l2_insert_~list#1.offset|) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436) (forall ((v_prenex_6 Int) (v_ArrVal_1434 Int)) (let ((.cse881 (let ((.cse882 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429)))) (store .cse882 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse882 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|))))) (let ((.cse880 (store (select .cse881 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse878 (store .cse881 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse880)) (.cse879 (select .cse880 .cse877))) (or (= (select (select .cse878 v_prenex_6) .cse879) 0) (< .cse879 0) (forall ((v_arrayElimCell_124 Int)) (= (select (select .cse878 v_arrayElimCell_124) .cse879) 0)))))))))) (or .cse0 (and (forall ((v_ArrVal_1429 Int) (v_ArrVal_1436 Int)) (let ((.cse886 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429))) (.cse883 (+ v_ArrVal_1436 4))) (or (= .cse883 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (< v_ArrVal_1436 0) (forall ((v_arrayElimCell_123 Int) (v_ArrVal_1434 Int)) (= (let ((.cse884 (store .cse886 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse886 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|)))) (let ((.cse885 (store (select .cse884 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (select (select (store .cse884 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse885) v_arrayElimCell_123) (select .cse885 .cse883)))) 0)) (< (select (select .cse886 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) .cse883) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436)))) (or .cse31 .cse28) (forall ((v_ArrVal_1429 Int) (v_ArrVal_1436 Int)) (or (< v_ArrVal_1436 0) (forall ((|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_ArrVal_1434 Int)) (let ((.cse890 (let ((.cse891 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429)))) (store .cse891 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse891 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|))))) (let ((.cse889 (store (select .cse890 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse887 (store .cse890 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse889)) (.cse888 (select .cse889 (+ v_ArrVal_1436 4)))) (or (forall ((v_arrayElimCell_123 Int)) (= (select (select .cse887 v_arrayElimCell_123) .cse888) 0)) (= (select (select .cse887 |ULTIMATE.start_l1_insert_#t~mem13#1.base|) .cse888) 0) (< .cse888 0)))))) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436))))) (or (forall ((v_prenex_6 Int) (v_ArrVal_1429 Int) (v_ArrVal_1434 Int)) (or (= (select (select (let ((.cse892 (let ((.cse893 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429)))) (store .cse893 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse893 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|))))) (store .cse892 |c_ULTIMATE.start_l1_insert_~item~1#1.base| (store (select .cse892 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) v_prenex_6) v_ArrVal_1434) 0) (< v_ArrVal_1434 0))) .cse28)) (not .cse544) (not .cse163)) (forall ((v_ArrVal_1429 Int) (v_ArrVal_1436 Int)) (or (< v_ArrVal_1436 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436) (forall ((v_ArrVal_1434 Int)) (let ((.cse900 (let ((.cse901 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429)))) (store .cse901 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse901 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|))))) (let ((.cse899 (store (select .cse900 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse894 (store .cse900 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse899)) (.cse897 (select .cse899 (+ v_ArrVal_1436 4)))) (or (forall ((v_arrayElimCell_109 Int) (v_arrayElimCell_110 Int)) (let ((.cse898 (+ v_arrayElimCell_109 4))) (let ((.cse895 (select (select .cse894 .cse8) .cse898))) (or (= (select (select .cse894 v_arrayElimCell_110) .cse895) 0) (< v_arrayElimCell_109 0) (< .cse895 0) (forall ((|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int)) (let ((.cse896 (select .cse894 |ULTIMATE.start_l1_insert_#t~mem13#1.base|))) (or (= (select .cse896 .cse895) 0) (= (select .cse896 .cse897) 0)))) (= |c_ULTIMATE.start_l2_insert_~list#1.offset| .cse898) (= v_ArrVal_1436 v_arrayElimCell_109))))) (= (select (select .cse894 |c_ULTIMATE.start_l2_insert_~item~0#1.base|) .cse897) 0) (< .cse897 0)))))))) (or .cse779 .cse28) (forall ((v_ArrVal_1429 Int) (v_ArrVal_1436 Int)) (let ((.cse902 (+ v_ArrVal_1436 4))) (or (< v_ArrVal_1436 0) (= .cse902 |c_ULTIMATE.start_l2_insert_~list#1.offset|) (forall ((v_ArrVal_1434 Int)) (let ((.cse909 (let ((.cse911 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429)))) (store .cse911 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse911 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|))))) (let ((.cse910 (store (select .cse909 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse903 (select .cse910 .cse902))) (or (< .cse903 0) (forall ((v_arrayElimCell_110 Int)) (let ((.cse907 (store .cse909 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse910))) (let ((.cse904 (select .cse907 v_arrayElimCell_110))) (or (= (select .cse904 .cse903) 0) (forall ((v_arrayElimCell_109 Int)) (let ((.cse908 (+ v_arrayElimCell_109 4))) (let ((.cse905 (select (select .cse907 .cse8) .cse908))) (or (= (select .cse904 .cse905) 0) (< v_arrayElimCell_109 0) (< .cse905 0) (forall ((|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int)) (let ((.cse906 (select .cse907 |ULTIMATE.start_l1_insert_#t~mem13#1.base|))) (or (= (select .cse906 .cse905) 0) (= (select .cse906 .cse903) 0)))) (= |c_ULTIMATE.start_l2_insert_~list#1.offset| .cse908)))))))))))))) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436)))) (or .cse67 (and .cse697 (or .cse912 .cse0 .cse1))) (or (forall ((v_ArrVal_1429 Int) (v_arrayElimCell_109 Int) (|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_arrayElimCell_110 Int) (v_ArrVal_1434 Int)) (let ((.cse913 (let ((.cse917 (let ((.cse918 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429)))) (store .cse918 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse918 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|))))) (store .cse917 |c_ULTIMATE.start_l1_insert_~item~1#1.base| (store (select .cse917 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434)))) (.cse915 (+ v_arrayElimCell_109 4))) (let ((.cse914 (select (select .cse913 .cse8) .cse915)) (.cse916 (select .cse913 |ULTIMATE.start_l1_insert_#t~mem13#1.base|))) (or (= (select (select .cse913 v_arrayElimCell_110) .cse914) 0) (= |c_ULTIMATE.start_l1_insert_~item~1#1.offset| .cse915) (< v_arrayElimCell_109 0) (= (select .cse916 .cse914) 0) (< v_ArrVal_1434 0) (< .cse914 0) (= (select .cse916 v_ArrVal_1434) 0) (= |c_ULTIMATE.start_l2_insert_~list#1.offset| .cse915))))) .cse28) (or (and (or .cse0 (and (forall ((v_ArrVal_1429 Int) (v_ArrVal_1436 Int)) (let ((.cse919 (+ v_ArrVal_1436 4)) (.cse920 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429)))) (or (= .cse919 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (< v_ArrVal_1436 0) (< (select (select .cse920 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) .cse919) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436) (forall ((v_arrayElimCell_109 Int) (v_prenex_5 Int) (v_arrayElimCell_110 Int) (v_ArrVal_1434 Int)) (let ((.cse925 (store .cse920 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse920 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|)))) (let ((.cse922 (store (select .cse925 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse921 (store .cse925 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse922)) (.cse924 (+ v_arrayElimCell_109 4))) (let ((.cse923 (select (select .cse921 .cse8) .cse924))) (or (= (select (select .cse921 v_prenex_5) (select .cse922 .cse919)) 0) (= (select (select .cse921 v_arrayElimCell_110) .cse923) 0) (= |c_ULTIMATE.start_l1_insert_~item~1#1.offset| .cse924) (< v_arrayElimCell_109 0) (< .cse923 0) (= |c_ULTIMATE.start_l2_insert_~list#1.offset| .cse924) (= v_ArrVal_1436 v_arrayElimCell_109)))))))))) (or .cse12 .cse58 .cse430) (forall ((v_ArrVal_1429 Int) (v_ArrVal_1436 Int)) (let ((.cse932 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429))) (.cse926 (+ v_ArrVal_1436 4))) (or (= .cse926 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (< v_ArrVal_1436 0) (forall ((v_arrayElimCell_109 Int) (v_prenex_5 Int) (v_arrayElimCell_110 Int) (v_ArrVal_1434 Int)) (let ((.cse931 (store .cse932 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse932 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|)))) (let ((.cse928 (store (select .cse931 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse927 (store .cse931 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse928)) (.cse930 (+ v_arrayElimCell_109 4))) (let ((.cse929 (select (select .cse927 .cse8) .cse930))) (or (= (select (select .cse927 v_prenex_5) (select .cse928 .cse926)) 0) (= (select (select .cse927 v_arrayElimCell_110) .cse929) 0) (= |c_ULTIMATE.start_l1_insert_~item~1#1.offset| .cse930) (< v_arrayElimCell_109 0) (< .cse929 0) (= (select (select .cse927 |c_ULTIMATE.start_l2_insert_~item~0#1.base|) .cse929) 0) (= v_ArrVal_1436 v_arrayElimCell_109))))))) (< (select (select .cse932 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) .cse926) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436)))))) (forall ((v_ArrVal_1429 Int) (v_ArrVal_1436 Int)) (let ((.cse939 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.base| (store .cse10 .cse11 v_ArrVal_1429))) (.cse933 (+ v_ArrVal_1436 4))) (or (= .cse933 |c_ULTIMATE.start_l1_insert_~item~1#1.offset|) (< v_ArrVal_1436 0) (forall ((v_arrayElimCell_109 Int) (v_arrayElimCell_110 Int) (v_ArrVal_1434 Int) (v_arrayElimCell_118 Int)) (let ((.cse938 (store .cse939 |c_ULTIMATE.start_l2_insert_~list#1.base| (store (select .cse939 |c_ULTIMATE.start_l2_insert_~list#1.base|) |c_ULTIMATE.start_l2_insert_~list#1.offset| |c_ULTIMATE.start_l2_insert_~item~0#1.offset|)))) (let ((.cse936 (store (select .cse938 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1434))) (let ((.cse934 (store .cse938 |c_ULTIMATE.start_l1_insert_~item~1#1.base| .cse936)) (.cse937 (+ v_arrayElimCell_109 4))) (let ((.cse935 (select (select .cse934 .cse8) .cse937))) (or (= (select (select .cse934 v_arrayElimCell_110) .cse935) 0) (= (select (select .cse934 v_arrayElimCell_118) (select .cse936 .cse933)) 0) (= |c_ULTIMATE.start_l1_insert_~item~1#1.offset| .cse937) (< v_arrayElimCell_109 0) (< .cse935 0) (= (select (select .cse934 |c_ULTIMATE.start_l2_insert_~item~0#1.base|) .cse935) 0) (= v_ArrVal_1436 v_arrayElimCell_109))))))) (= .cse933 |c_ULTIMATE.start_l2_insert_~list#1.offset|) (< (select (select .cse939 |c_ULTIMATE.start_l1_insert_~item~1#1.base|) .cse933) 0) (< |c_ULTIMATE.start_l1_insert_~item~1#1.offset| v_ArrVal_1436)))) (or .cse429 .cse12 .cse58)) .cse13)))))) (< |c_ULTIMATE.start_l1_insert_~list#1.offset| 0)) is different from true [2024-11-13 15:49:01,420 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 15:49:08,562 WARN L286 SmtUtils]: Spent 6.92s on a formula simplification. DAG size of input: 266 DAG size of output: 204 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-13 15:49:08,562 INFO L349 Elim1Store]: treesize reduction 485, result has 50.2 percent of original size [2024-11-13 15:49:08,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 4 disjoint index pairs (out of 21 index pairs), introduced 10 new quantified variables, introduced 30 case distinctions, treesize of input 1008276 treesize of output 958041 [2024-11-13 15:49:56,432 WARN L286 SmtUtils]: Spent 47.86s on a formula simplification. DAG size of input: 1244 DAG size of output: 746 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 15:49:59,368 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:49:59,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 1179 treesize of output 1137 [2024-11-13 15:50:02,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-13 15:50:26,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-13 15:50:27,516 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:50:27,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 43 [2024-11-13 15:50:28,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-13 15:50:33,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 10 treesize of output 4 [2024-11-13 15:50:33,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 10 treesize of output 4 [2024-11-13 15:50:33,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 10 treesize of output 4 [2024-11-13 15:50:33,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 9 treesize of output 3 [2024-11-13 15:50:33,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-13 15:50:33,916 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2024-11-13 15:50:34,035 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2024-11-13 15:50:34,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-13 15:50:40,085 INFO L349 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2024-11-13 15:50:40,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 226 treesize of output 174 [2024-11-13 15:50:42,174 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:50:42,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 971 treesize of output 897 [2024-11-13 15:50:51,215 INFO L349 Elim1Store]: treesize reduction 14, result has 62.2 percent of original size [2024-11-13 15:50:51,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1004 treesize of output 936 [2024-11-13 15:50:59,201 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 15:50:59,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 242 treesize of output 204 [2024-11-13 15:51:07,640 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 10 treesize of output 4 [2024-11-13 15:51:07,830 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 10 treesize of output 4 [2024-11-13 15:51:08,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 10 treesize of output 4 [2024-11-13 15:51:08,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 9 treesize of output 3 [2024-11-13 15:51:08,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-13 15:51:08,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2024-11-13 15:51:08,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2024-11-13 15:51:08,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-13 15:51:19,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 284 treesize of output 240 [2024-11-13 15:51:21,066 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 15:51:21,230 INFO L224 Elim1Store]: Index analysis took 410 ms [2024-11-13 15:51:23,692 INFO L349 Elim1Store]: treesize reduction 24, result has 89.4 percent of original size [2024-11-13 15:51:23,693 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 3 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 25 case distinctions, treesize of input 323 treesize of output 485 [2024-11-13 15:52:18,021 WARN L249 Executor]: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2024-11-13 15:52:18,022 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 101 [2024-11-13 15:52:18,022 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-11-13 15:52:18,038 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-13 15:52:18,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-13 15:52:18,224 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.checkRedundancy(SimplifyDDA2.java:275) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convertForPreprocessedInputTerms(SimplifyDDA2.java:499) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:484) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.simplify(SimplifyDDA2.java:590) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:245) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:318) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify(QuantifierPusher.java:728) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:234) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:395) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:267) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:324) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:180) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:159) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:276) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 77 more [2024-11-13 15:52:18,231 INFO L158 Benchmark]: Toolchain (without parser) took 756057.45ms. Allocated memory was 117.4MB in the beginning and 838.9MB in the end (delta: 721.4MB). Free memory was 91.3MB in the beginning and 292.7MB in the end (delta: -201.3MB). Peak memory consumption was 529.6MB. Max. memory is 16.1GB. [2024-11-13 15:52:18,231 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 117.4MB. Free memory is still 73.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 15:52:18,232 INFO L158 Benchmark]: CACSL2BoogieTranslator took 630.37ms. Allocated memory is still 117.4MB. Free memory was 91.3MB in the beginning and 70.8MB in the end (delta: 20.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 15:52:18,232 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.87ms. Allocated memory is still 117.4MB. Free memory was 70.8MB in the beginning and 68.8MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 15:52:18,232 INFO L158 Benchmark]: Boogie Preprocessor took 62.57ms. Allocated memory is still 117.4MB. Free memory was 68.8MB in the beginning and 66.2MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 15:52:18,232 INFO L158 Benchmark]: RCFGBuilder took 618.51ms. Allocated memory is still 117.4MB. Free memory was 66.2MB in the beginning and 44.1MB in the end (delta: 22.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-13 15:52:18,233 INFO L158 Benchmark]: TraceAbstraction took 754669.71ms. Allocated memory was 117.4MB in the beginning and 838.9MB in the end (delta: 721.4MB). Free memory was 43.5MB in the beginning and 292.7MB in the end (delta: -249.2MB). Peak memory consumption was 487.6MB. Max. memory is 16.1GB. [2024-11-13 15:52:18,234 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27ms. Allocated memory is still 117.4MB. Free memory is still 73.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 630.37ms. Allocated memory is still 117.4MB. Free memory was 91.3MB in the beginning and 70.8MB in the end (delta: 20.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.87ms. Allocated memory is still 117.4MB. Free memory was 70.8MB in the beginning and 68.8MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 62.57ms. Allocated memory is still 117.4MB. Free memory was 68.8MB in the beginning and 66.2MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 618.51ms. Allocated memory is still 117.4MB. Free memory was 66.2MB in the beginning and 44.1MB in the end (delta: 22.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 754669.71ms. Allocated memory was 117.4MB in the beginning and 838.9MB in the end (delta: 721.4MB). Free memory was 43.5MB in the beginning and 292.7MB in the end (delta: -249.2MB). Peak memory consumption was 487.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety/test-0219.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4a489d3e73f8fa53a32414f65b592ba5db703c103e5e16e188592c7c2dfeab95 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 15:52:20,634 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 15:52:20,756 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-13 15:52:20,767 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 15:52:20,767 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 15:52:20,804 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 15:52:20,806 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 15:52:20,807 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 15:52:20,807 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 15:52:20,807 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 15:52:20,807 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 15:52:20,807 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 15:52:20,808 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 15:52:20,808 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 15:52:20,808 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 15:52:20,808 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 15:52:20,808 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 15:52:20,808 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 15:52:20,808 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 15:52:20,808 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 15:52:20,809 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-13 15:52:20,809 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-13 15:52:20,811 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-13 15:52:20,811 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 15:52:20,811 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-13 15:52:20,811 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-13 15:52:20,811 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 15:52:20,811 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-13 15:52:20,812 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-13 15:52:20,812 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 15:52:20,812 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 15:52:20,812 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 15:52:20,812 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 15:52:20,813 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 15:52:20,813 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 15:52:20,814 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 15:52:20,814 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 15:52:20,814 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 15:52:20,814 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-13 15:52:20,814 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-13 15:52:20,814 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 15:52:20,814 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 15:52:20,815 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 15:52:20,815 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 15:52:20,815 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4a489d3e73f8fa53a32414f65b592ba5db703c103e5e16e188592c7c2dfeab95 [2024-11-13 15:52:21,126 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 15:52:21,134 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 15:52:21,136 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 15:52:21,137 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 15:52:21,137 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 15:52:21,138 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/memsafety/test-0219.i Unable to find full path for "g++" [2024-11-13 15:52:23,169 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 15:52:23,446 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 15:52:23,449 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/sv-benchmarks/c/memsafety/test-0219.i [2024-11-13 15:52:23,470 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd/data/9ff199544/1a6718b5cfad4fb094af69bbdb4d5331/FLAGcd9900718 [2024-11-13 15:52:23,495 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd/data/9ff199544/1a6718b5cfad4fb094af69bbdb4d5331 [2024-11-13 15:52:23,500 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 15:52:23,502 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 15:52:23,503 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 15:52:23,504 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 15:52:23,509 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 15:52:23,510 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 03:52:23" (1/1) ... [2024-11-13 15:52:23,511 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3877fa28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:52:23, skipping insertion in model container [2024-11-13 15:52:23,511 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 03:52:23" (1/1) ... [2024-11-13 15:52:23,546 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 15:52:23,981 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 15:52:23,994 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 15:52:24,040 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 15:52:24,083 INFO L204 MainTranslator]: Completed translation [2024-11-13 15:52:24,083 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:52:24 WrapperNode [2024-11-13 15:52:24,083 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 15:52:24,084 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 15:52:24,084 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 15:52:24,085 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 15:52:24,090 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:52:24" (1/1) ... [2024-11-13 15:52:24,110 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:52:24" (1/1) ... [2024-11-13 15:52:24,137 INFO L138 Inliner]: procedures = 181, calls = 36, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 112 [2024-11-13 15:52:24,138 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 15:52:24,138 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 15:52:24,138 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 15:52:24,138 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 15:52:24,147 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:52:24" (1/1) ... [2024-11-13 15:52:24,147 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:52:24" (1/1) ... [2024-11-13 15:52:24,151 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:52:24" (1/1) ... [2024-11-13 15:52:24,172 INFO L175 MemorySlicer]: Split 22 memory accesses to 3 slices as follows [2, 8, 12]. 55 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 8 writes are split as follows [0, 2, 6]. [2024-11-13 15:52:24,175 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:52:24" (1/1) ... [2024-11-13 15:52:24,175 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:52:24" (1/1) ... [2024-11-13 15:52:24,193 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:52:24" (1/1) ... [2024-11-13 15:52:24,200 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:52:24" (1/1) ... [2024-11-13 15:52:24,202 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:52:24" (1/1) ... [2024-11-13 15:52:24,207 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:52:24" (1/1) ... [2024-11-13 15:52:24,210 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 15:52:24,215 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 15:52:24,215 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 15:52:24,219 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 15:52:24,220 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:52:24" (1/1) ... [2024-11-13 15:52:24,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 15:52:24,254 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:52:24,265 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 15:52:24,274 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 15:52:24,290 INFO L130 BoogieDeclarations]: Found specification of procedure calloc_model [2024-11-13 15:52:24,290 INFO L138 BoogieDeclarations]: Found implementation of procedure calloc_model [2024-11-13 15:52:24,291 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-13 15:52:24,291 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 15:52:24,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-13 15:52:24,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-13 15:52:24,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-13 15:52:24,291 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-13 15:52:24,291 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-13 15:52:24,291 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-13 15:52:24,291 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-13 15:52:24,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-13 15:52:24,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-13 15:52:24,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-13 15:52:24,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-13 15:52:24,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-13 15:52:24,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-13 15:52:24,292 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 15:52:24,292 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 15:52:24,457 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 15:52:24,459 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 15:52:25,014 INFO L? ?]: Removed 94 outVars from TransFormulas that were not future-live. [2024-11-13 15:52:25,014 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 15:52:25,025 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 15:52:25,026 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-13 15:52:25,026 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 03:52:25 BoogieIcfgContainer [2024-11-13 15:52:25,026 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 15:52:25,029 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 15:52:25,029 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 15:52:25,034 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 15:52:25,034 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 03:52:23" (1/3) ... [2024-11-13 15:52:25,035 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67ee4e70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 03:52:25, skipping insertion in model container [2024-11-13 15:52:25,035 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:52:24" (2/3) ... [2024-11-13 15:52:25,036 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67ee4e70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 03:52:25, skipping insertion in model container [2024-11-13 15:52:25,036 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 03:52:25" (3/3) ... [2024-11-13 15:52:25,037 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0219.i [2024-11-13 15:52:25,053 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 15:52:25,055 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG test-0219.i that has 2 procedures, 108 locations, 1 initial locations, 5 loop locations, and 46 error locations. [2024-11-13 15:52:25,095 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 15:52:25,106 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@7ecbcce3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 15:52:25,106 INFO L334 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2024-11-13 15:52:25,111 INFO L276 IsEmpty]: Start isEmpty. Operand has 108 states, 58 states have (on average 2.0) internal successors, (116), 104 states have internal predecessors, (116), 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) [2024-11-13 15:52:25,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-13 15:52:25,119 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:52:25,120 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-13 15:52:25,120 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [calloc_modelErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, calloc_modelErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-13 15:52:25,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:52:25,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1358920, now seen corresponding path program 1 times [2024-11-13 15:52:25,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:52:25,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1714030173] [2024-11-13 15:52:25,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:52:25,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:52:25,140 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:52:25,142 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:52:25,145 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-13 15:52:25,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:52:25,267 INFO L255 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-13 15:52:25,270 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:52:25,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:52:25,290 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 15:52:25,291 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:52:25,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1714030173] [2024-11-13 15:52:25,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1714030173] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:52:25,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:52:25,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 15:52:25,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196479627] [2024-11-13 15:52:25,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:52:25,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 15:52:25,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:52:25,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 15:52:25,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 15:52:25,329 INFO L87 Difference]: Start difference. First operand has 108 states, 58 states have (on average 2.0) internal successors, (116), 104 states have internal predecessors, (116), 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 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:52:25,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:52:25,353 INFO L93 Difference]: Finished difference Result 108 states and 113 transitions. [2024-11-13 15:52:25,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 15:52:25,356 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-13 15:52:25,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:52:25,363 INFO L225 Difference]: With dead ends: 108 [2024-11-13 15:52:25,363 INFO L226 Difference]: Without dead ends: 106 [2024-11-13 15:52:25,365 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 15:52:25,368 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 15:52:25,371 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 15:52:25,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-13 15:52:25,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2024-11-13 15:52:25,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 57 states have (on average 1.8771929824561404) internal successors, (107), 102 states have internal predecessors, (107), 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) [2024-11-13 15:52:25,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 111 transitions. [2024-11-13 15:52:25,425 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 111 transitions. Word has length 4 [2024-11-13 15:52:25,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:52:25,427 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 111 transitions. [2024-11-13 15:52:25,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:52:25,427 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 111 transitions. [2024-11-13 15:52:25,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-13 15:52:25,428 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:52:25,428 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-13 15:52:25,449 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-13 15:52:25,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:52:25,629 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting calloc_modelErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [calloc_modelErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, calloc_modelErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-13 15:52:25,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:52:25,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1303845400, now seen corresponding path program 1 times [2024-11-13 15:52:25,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:52:25,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [964434823] [2024-11-13 15:52:25,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:52:25,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:52:25,631 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:52:25,634 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:52:25,650 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-13 15:52:25,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:52:25,753 INFO L255 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-13 15:52:25,755 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:52:25,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-13 15:52:25,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:52:25,832 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 15:52:25,832 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:52:25,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [964434823] [2024-11-13 15:52:25,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [964434823] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:52:25,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:52:25,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 15:52:25,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9112434] [2024-11-13 15:52:25,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:52:25,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 15:52:25,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:52:25,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 15:52:25,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:52:25,836 INFO L87 Difference]: Start difference. First operand 106 states and 111 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:52:26,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:52:26,039 INFO L93 Difference]: Finished difference Result 105 states and 110 transitions. [2024-11-13 15:52:26,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 15:52:26,040 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-13 15:52:26,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:52:26,041 INFO L225 Difference]: With dead ends: 105 [2024-11-13 15:52:26,042 INFO L226 Difference]: Without dead ends: 105 [2024-11-13 15:52:26,043 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:52:26,043 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 4 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 15:52:26,044 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 164 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 15:52:26,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-13 15:52:26,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2024-11-13 15:52:26,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 57 states have (on average 1.8596491228070176) internal successors, (106), 101 states have internal predecessors, (106), 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) [2024-11-13 15:52:26,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 110 transitions. [2024-11-13 15:52:26,059 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 110 transitions. Word has length 6 [2024-11-13 15:52:26,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:52:26,060 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 110 transitions. [2024-11-13 15:52:26,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:52:26,060 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 110 transitions. [2024-11-13 15:52:26,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-13 15:52:26,061 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:52:26,061 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:52:26,081 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-13 15:52:26,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:52:26,261 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting calloc_modelErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [calloc_modelErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, calloc_modelErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-13 15:52:26,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:52:26,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1764501770, now seen corresponding path program 1 times [2024-11-13 15:52:26,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:52:26,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [359942399] [2024-11-13 15:52:26,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:52:26,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:52:26,263 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:52:26,265 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:52:26,266 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-13 15:52:26,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:52:26,376 INFO L255 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-13 15:52:26,380 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:52:26,459 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-13 15:52:26,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:52:26,500 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 15:52:26,500 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:52:26,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [359942399] [2024-11-13 15:52:26,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [359942399] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:52:26,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:52:26,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 15:52:26,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111189119] [2024-11-13 15:52:26,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:52:26,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 15:52:26,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:52:26,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 15:52:26,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:52:26,501 INFO L87 Difference]: Start difference. First operand 105 states and 110 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:52:26,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:52:26,824 INFO L93 Difference]: Finished difference Result 104 states and 109 transitions. [2024-11-13 15:52:26,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 15:52:26,825 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-13 15:52:26,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:52:26,826 INFO L225 Difference]: With dead ends: 104 [2024-11-13 15:52:26,826 INFO L226 Difference]: Without dead ends: 104 [2024-11-13 15:52:26,826 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 15:52:26,827 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 9 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 15:52:26,828 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 265 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 15:52:26,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-13 15:52:26,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2024-11-13 15:52:26,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 57 states have (on average 1.8421052631578947) internal successors, (105), 100 states have internal predecessors, (105), 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) [2024-11-13 15:52:26,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 109 transitions. [2024-11-13 15:52:26,835 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 109 transitions. Word has length 7 [2024-11-13 15:52:26,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:52:26,835 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 109 transitions. [2024-11-13 15:52:26,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 15:52:26,835 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 109 transitions. [2024-11-13 15:52:26,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-13 15:52:26,836 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:52:26,836 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:52:26,854 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-13 15:52:27,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:52:27,037 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [calloc_modelErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, calloc_modelErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-13 15:52:27,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:52:27,038 INFO L85 PathProgramCache]: Analyzing trace with hash 1543504784, now seen corresponding path program 1 times [2024-11-13 15:52:27,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:52:27,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [444479719] [2024-11-13 15:52:27,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:52:27,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:52:27,038 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:52:27,040 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:52:27,042 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-13 15:52:27,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:52:27,175 INFO L255 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-13 15:52:27,178 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:52:27,606 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:52:27,607 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 15:52:27,607 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:52:27,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [444479719] [2024-11-13 15:52:27,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [444479719] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:52:27,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:52:27,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 15:52:27,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132355999] [2024-11-13 15:52:27,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:52:27,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 15:52:27,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:52:27,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 15:52:27,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-13 15:52:27,610 INFO L87 Difference]: Start difference. First operand 104 states and 109 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 15:52:27,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:52:27,779 INFO L93 Difference]: Finished difference Result 108 states and 113 transitions. [2024-11-13 15:52:27,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 15:52:27,780 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2024-11-13 15:52:27,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:52:27,781 INFO L225 Difference]: With dead ends: 108 [2024-11-13 15:52:27,783 INFO L226 Difference]: Without dead ends: 105 [2024-11-13 15:52:27,783 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-13 15:52:27,784 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 2 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 15:52:27,784 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 311 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 15:52:27,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-13 15:52:27,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2024-11-13 15:52:27,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 58 states have (on average 1.8275862068965518) internal successors, (106), 101 states have internal predecessors, (106), 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) [2024-11-13 15:52:27,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 110 transitions. [2024-11-13 15:52:27,798 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 110 transitions. Word has length 26 [2024-11-13 15:52:27,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:52:27,800 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 110 transitions. [2024-11-13 15:52:27,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 15:52:27,800 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 110 transitions. [2024-11-13 15:52:27,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-13 15:52:27,801 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:52:27,801 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:52:27,823 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-13 15:52:28,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:52:28,002 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [calloc_modelErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, calloc_modelErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-13 15:52:28,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:52:28,006 INFO L85 PathProgramCache]: Analyzing trace with hash -1384801864, now seen corresponding path program 1 times [2024-11-13 15:52:28,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:52:28,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [333788930] [2024-11-13 15:52:28,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:52:28,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:52:28,007 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:52:28,013 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:52:28,015 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-13 15:52:28,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:52:28,141 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-13 15:52:28,144 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:52:32,938 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 15:52:32,938 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:52:33,525 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 15:52:33,526 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:52:33,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [333788930] [2024-11-13 15:52:33,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [333788930] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 15:52:33,526 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 15:52:33,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2024-11-13 15:52:33,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560424042] [2024-11-13 15:52:33,526 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 15:52:33,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-13 15:52:33,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:52:33,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-13 15:52:33,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=57, Unknown=1, NotChecked=0, Total=90 [2024-11-13 15:52:33,528 INFO L87 Difference]: Start difference. First operand 105 states and 110 transitions. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-13 15:52:42,032 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:52:50,293 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:52:54,344 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:52:58,632 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:52:58,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:52:58,763 INFO L93 Difference]: Finished difference Result 114 states and 120 transitions. [2024-11-13 15:52:58,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 15:52:58,768 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2024-11-13 15:52:58,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:52:58,769 INFO L225 Difference]: With dead ends: 114 [2024-11-13 15:52:58,771 INFO L226 Difference]: Without dead ends: 108 [2024-11-13 15:52:58,771 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=46, Invalid=83, Unknown=3, NotChecked=0, Total=132 [2024-11-13 15:52:58,772 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 4 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 619 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.8s IncrementalHoareTripleChecker+Time [2024-11-13 15:52:58,774 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 619 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 4 Unknown, 0 Unchecked, 16.8s Time] [2024-11-13 15:52:58,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-13 15:52:58,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2024-11-13 15:52:58,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 61 states have (on average 1.7868852459016393) internal successors, (109), 104 states have internal predecessors, (109), 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) [2024-11-13 15:52:58,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 113 transitions. [2024-11-13 15:52:58,787 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 113 transitions. Word has length 28 [2024-11-13 15:52:58,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:52:58,787 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 113 transitions. [2024-11-13 15:52:58,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-13 15:52:58,788 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 113 transitions. [2024-11-13 15:52:58,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-13 15:52:58,788 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:52:58,788 INFO L215 NwaCegarLoop]: trace histogram [8, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:52:58,810 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-13 15:52:58,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:52:58,989 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [calloc_modelErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, calloc_modelErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-13 15:52:58,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:52:58,990 INFO L85 PathProgramCache]: Analyzing trace with hash -221383536, now seen corresponding path program 2 times [2024-11-13 15:52:58,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:52:58,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1396280785] [2024-11-13 15:52:58,990 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 15:52:58,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:52:58,991 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:52:58,993 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:52:58,994 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-13 15:52:59,112 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-13 15:52:59,112 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 15:52:59,115 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-13 15:52:59,123 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:52:59,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-13 15:52:59,577 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-11-13 15:52:59,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 20 [2024-11-13 15:52:59,596 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-13 15:52:59,597 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 15:52:59,597 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:52:59,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1396280785] [2024-11-13 15:52:59,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1396280785] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:52:59,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:52:59,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 15:52:59,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63503661] [2024-11-13 15:52:59,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:52:59,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 15:52:59,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:52:59,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 15:52:59,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 15:52:59,599 INFO L87 Difference]: Start difference. First operand 108 states and 113 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-13 15:53:00,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:53:00,886 INFO L93 Difference]: Finished difference Result 105 states and 110 transitions. [2024-11-13 15:53:00,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 15:53:00,887 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 34 [2024-11-13 15:53:00,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:53:00,889 INFO L225 Difference]: With dead ends: 105 [2024-11-13 15:53:00,889 INFO L226 Difference]: Without dead ends: 105 [2024-11-13 15:53:00,889 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 15:53:00,890 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 11 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-13 15:53:00,891 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 294 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-13 15:53:00,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-13 15:53:00,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2024-11-13 15:53:00,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 61 states have (on average 1.7377049180327868) internal successors, (106), 101 states have internal predecessors, (106), 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) [2024-11-13 15:53:00,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 110 transitions. [2024-11-13 15:53:00,898 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 110 transitions. Word has length 34 [2024-11-13 15:53:00,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:53:00,903 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 110 transitions. [2024-11-13 15:53:00,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-13 15:53:00,903 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 110 transitions. [2024-11-13 15:53:00,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-13 15:53:00,904 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:53:00,904 INFO L215 NwaCegarLoop]: trace histogram [8, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:53:00,924 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-13 15:53:01,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:53:01,105 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [calloc_modelErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, calloc_modelErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-13 15:53:01,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:53:01,106 INFO L85 PathProgramCache]: Analyzing trace with hash -221383535, now seen corresponding path program 1 times [2024-11-13 15:53:01,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:53:01,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1773401144] [2024-11-13 15:53:01,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:53:01,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:53:01,106 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:53:01,108 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:53:01,109 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-13 15:53:01,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:53:01,270 INFO L255 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-13 15:53:01,272 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:53:03,218 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 31 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-13 15:53:03,218 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:53:04,951 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-13 15:53:04,951 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:53:04,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1773401144] [2024-11-13 15:53:04,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1773401144] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 15:53:04,952 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 15:53:04,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2024-11-13 15:53:04,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300962485] [2024-11-13 15:53:04,952 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 15:53:04,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-13 15:53:04,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:53:04,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-13 15:53:04,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2024-11-13 15:53:04,953 INFO L87 Difference]: Start difference. First operand 105 states and 110 transitions. Second operand has 16 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-13 15:53:07,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:53:07,466 INFO L93 Difference]: Finished difference Result 117 states and 126 transitions. [2024-11-13 15:53:07,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-13 15:53:07,467 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 34 [2024-11-13 15:53:07,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:53:07,468 INFO L225 Difference]: With dead ends: 117 [2024-11-13 15:53:07,468 INFO L226 Difference]: Without dead ends: 111 [2024-11-13 15:53:07,468 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=138, Invalid=282, Unknown=0, NotChecked=0, Total=420 [2024-11-13 15:53:07,469 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 14 mSDsluCounter, 601 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 704 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-13 15:53:07,469 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 704 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-13 15:53:07,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-13 15:53:07,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2024-11-13 15:53:07,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 67 states have (on average 1.6865671641791045) internal successors, (113), 107 states have internal predecessors, (113), 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) [2024-11-13 15:53:07,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 117 transitions. [2024-11-13 15:53:07,475 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 117 transitions. Word has length 34 [2024-11-13 15:53:07,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:53:07,475 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 117 transitions. [2024-11-13 15:53:07,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-13 15:53:07,476 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 117 transitions. [2024-11-13 15:53:07,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-13 15:53:07,476 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:53:07,477 INFO L215 NwaCegarLoop]: trace histogram [16, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:53:07,494 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-13 15:53:07,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:53:07,681 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [calloc_modelErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, calloc_modelErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-13 15:53:07,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:53:07,682 INFO L85 PathProgramCache]: Analyzing trace with hash -543693423, now seen corresponding path program 2 times [2024-11-13 15:53:07,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:53:07,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [880364486] [2024-11-13 15:53:07,682 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 15:53:07,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:53:07,682 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:53:07,685 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:53:07,686 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-13 15:53:07,885 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-13 15:53:07,885 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 15:53:07,895 INFO L255 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-13 15:53:07,898 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:53:07,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-11-13 15:53:08,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-13 15:53:09,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:53:09,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-13 15:53:09,715 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-13 15:53:09,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-13 15:53:09,822 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2024-11-13 15:53:09,822 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 15:53:09,823 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:53:09,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [880364486] [2024-11-13 15:53:09,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [880364486] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:53:09,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:53:09,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 15:53:09,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347845940] [2024-11-13 15:53:09,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:53:09,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 15:53:09,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:53:09,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 15:53:09,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-13 15:53:09,824 INFO L87 Difference]: Start difference. First operand 111 states and 117 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-13 15:53:13,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:53:13,024 INFO L93 Difference]: Finished difference Result 108 states and 114 transitions. [2024-11-13 15:53:13,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 15:53:13,026 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 42 [2024-11-13 15:53:13,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:53:13,027 INFO L225 Difference]: With dead ends: 108 [2024-11-13 15:53:13,027 INFO L226 Difference]: Without dead ends: 108 [2024-11-13 15:53:13,027 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-13 15:53:13,028 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 11 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-11-13 15:53:13,028 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 287 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-11-13 15:53:13,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-13 15:53:13,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2024-11-13 15:53:13,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 67 states have (on average 1.6417910447761195) internal successors, (110), 104 states have internal predecessors, (110), 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) [2024-11-13 15:53:13,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 114 transitions. [2024-11-13 15:53:13,037 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 114 transitions. Word has length 42 [2024-11-13 15:53:13,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:53:13,037 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 114 transitions. [2024-11-13 15:53:13,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-13 15:53:13,037 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 114 transitions. [2024-11-13 15:53:13,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-13 15:53:13,038 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:53:13,038 INFO L215 NwaCegarLoop]: trace histogram [16, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:53:13,056 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-13 15:53:13,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:53:13,242 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [calloc_modelErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, calloc_modelErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-13 15:53:13,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:53:13,242 INFO L85 PathProgramCache]: Analyzing trace with hash -552520237, now seen corresponding path program 1 times [2024-11-13 15:53:13,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:53:13,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2054816707] [2024-11-13 15:53:13,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:53:13,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:53:13,243 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:53:13,246 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:53:13,248 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-13 15:53:13,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:53:13,451 INFO L255 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-13 15:53:13,454 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:53:13,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-13 15:53:13,963 WARN L873 $PredicateComparison]: unable to prove that (exists ((|calloc_model_#Ultimate.C_memset_#ptr#1.base| (_ BitVec 32))) (and (= |c_#valid| (store |c_old(#valid)| |calloc_model_#Ultimate.C_memset_#ptr#1.base| (select |c_#valid| |calloc_model_#Ultimate.C_memset_#ptr#1.base|))) (= (_ bv0 1) (select |c_old(#valid)| |calloc_model_#Ultimate.C_memset_#ptr#1.base|)))) is different from true [2024-11-13 15:53:14,441 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-11-13 15:53:14,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 20 [2024-11-13 15:53:14,610 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-11-13 15:53:14,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 20 [2024-11-13 15:53:14,670 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 86 not checked. [2024-11-13 15:53:14,670 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:53:16,013 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 1 proven. 86 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-11-13 15:53:16,013 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:53:16,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2054816707] [2024-11-13 15:53:16,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2054816707] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 15:53:16,014 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 15:53:16,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 9 [2024-11-13 15:53:16,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864720282] [2024-11-13 15:53:16,014 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 15:53:16,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-13 15:53:16,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:53:16,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-13 15:53:16,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=57, Unknown=1, NotChecked=14, Total=90 [2024-11-13 15:53:16,015 INFO L87 Difference]: Start difference. First operand 108 states and 114 transitions. Second operand has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-13 15:53:17,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:53:17,929 INFO L93 Difference]: Finished difference Result 105 states and 111 transitions. [2024-11-13 15:53:17,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 15:53:17,929 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 46 [2024-11-13 15:53:17,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:53:17,930 INFO L225 Difference]: With dead ends: 105 [2024-11-13 15:53:17,931 INFO L226 Difference]: Without dead ends: 105 [2024-11-13 15:53:17,931 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 79 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=30, Invalid=105, Unknown=1, NotChecked=20, Total=156 [2024-11-13 15:53:17,932 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 26 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 93 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-13 15:53:17,932 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 347 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 304 Invalid, 0 Unknown, 93 Unchecked, 1.7s Time] [2024-11-13 15:53:17,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-13 15:53:17,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2024-11-13 15:53:17,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 67 states have (on average 1.5970149253731343) internal successors, (107), 101 states have internal predecessors, (107), 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) [2024-11-13 15:53:17,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 111 transitions. [2024-11-13 15:53:17,941 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 111 transitions. Word has length 46 [2024-11-13 15:53:17,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:53:17,941 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 111 transitions. [2024-11-13 15:53:17,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-13 15:53:17,945 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 111 transitions. [2024-11-13 15:53:17,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-13 15:53:17,946 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:53:17,946 INFO L215 NwaCegarLoop]: trace histogram [16, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:53:17,964 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-13 15:53:18,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:53:18,147 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [calloc_modelErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, calloc_modelErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-13 15:53:18,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:53:18,147 INFO L85 PathProgramCache]: Analyzing trace with hash -552520236, now seen corresponding path program 1 times [2024-11-13 15:53:18,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:53:18,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [993198188] [2024-11-13 15:53:18,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:53:18,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:53:18,148 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:53:18,150 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:53:18,153 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-13 15:53:18,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:53:18,369 INFO L255 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-13 15:53:18,373 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:53:18,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-11-13 15:53:21,814 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-13 15:53:21,815 INFO L378 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 14 treesize of output 13 [2024-11-13 15:53:21,946 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-13 15:53:21,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-11-13 15:53:22,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:53:22,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 9 [2024-11-13 15:53:22,763 INFO L349 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2024-11-13 15:53:22,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2024-11-13 15:53:23,061 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 1 proven. 86 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-11-13 15:53:23,062 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:53:34,592 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:53:34,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [993198188] [2024-11-13 15:53:34,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [993198188] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:53:34,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1472256267] [2024-11-13 15:53:34,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:53:34,592 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-13 15:53:34,593 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd/cvc4 [2024-11-13 15:53:34,602 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-13 15:53:34,604 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd/cvc4 --incremental --print-success --lang smt (12)] Waiting until timeout for monitored process [2024-11-13 15:53:35,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:53:35,350 INFO L255 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-13 15:53:35,354 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:53:35,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-11-13 15:53:35,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-13 15:53:36,883 WARN L873 $PredicateComparison]: unable to prove that (exists ((|calloc_model_#Ultimate.C_memset_#ptr#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |calloc_model_#Ultimate.C_memset_#ptr#1.base|)) (= (store |c_old(#length)| |calloc_model_#Ultimate.C_memset_#ptr#1.base| (select |c_#length| |calloc_model_#Ultimate.C_memset_#ptr#1.base|)) |c_#length|))) is different from true [2024-11-13 15:53:37,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 15:53:37,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-13 15:53:37,274 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-13 15:53:37,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-13 15:53:37,408 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2024-11-13 15:53:37,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2024-11-13 15:53:37,841 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 86 not checked. [2024-11-13 15:53:37,841 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:53:48,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1472256267] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:53:48,544 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 15:53:48,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 16 [2024-11-13 15:53:48,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982605380] [2024-11-13 15:53:48,544 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 15:53:48,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-13 15:53:48,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:53:48,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-13 15:53:48,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=349, Unknown=5, NotChecked=38, Total=462 [2024-11-13 15:53:48,546 INFO L87 Difference]: Start difference. First operand 105 states and 111 transitions. Second operand has 17 states, 15 states have (on average 3.0) internal successors, (45), 14 states have internal predecessors, (45), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-13 15:53:55,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:53:55,591 INFO L93 Difference]: Finished difference Result 102 states and 108 transitions. [2024-11-13 15:53:55,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-13 15:53:55,591 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 3.0) internal successors, (45), 14 states have internal predecessors, (45), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 46 [2024-11-13 15:53:55,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:53:55,592 INFO L225 Difference]: With dead ends: 102 [2024-11-13 15:53:55,592 INFO L226 Difference]: Without dead ends: 102 [2024-11-13 15:53:55,593 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 25.2s TimeCoverageRelationStatistics Valid=130, Invalid=571, Unknown=5, NotChecked=50, Total=756 [2024-11-13 15:53:55,594 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 49 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 614 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 90 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2024-11-13 15:53:55,594 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 490 Invalid, 712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 614 Invalid, 0 Unknown, 90 Unchecked, 5.2s Time] [2024-11-13 15:53:55,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-13 15:53:55,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2024-11-13 15:53:55,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 67 states have (on average 1.5522388059701493) internal successors, (104), 98 states have internal predecessors, (104), 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) [2024-11-13 15:53:55,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 108 transitions. [2024-11-13 15:53:55,599 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 108 transitions. Word has length 46 [2024-11-13 15:53:55,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:53:55,600 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 108 transitions. [2024-11-13 15:53:55,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 3.0) internal successors, (45), 14 states have internal predecessors, (45), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-13 15:53:55,600 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 108 transitions. [2024-11-13 15:53:55,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-13 15:53:55,601 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:53:55,601 INFO L215 NwaCegarLoop]: trace histogram [16, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:53:55,608 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd/cvc4 --incremental --print-success --lang smt (12)] Ended with exit code 0 [2024-11-13 15:53:55,820 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-13 15:53:56,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd/cvc4 --incremental --print-success --lang smt,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:53:56,005 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [calloc_modelErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, calloc_modelErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-13 15:53:56,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:53:56,005 INFO L85 PathProgramCache]: Analyzing trace with hash 35685664, now seen corresponding path program 1 times [2024-11-13 15:53:56,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:53:56,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [803063716] [2024-11-13 15:53:56,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:53:56,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:53:56,006 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:53:56,007 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:53:56,009 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-13 15:53:56,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:53:56,241 INFO L255 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-13 15:53:56,243 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:53:56,477 WARN L873 $PredicateComparison]: unable to prove that (exists ((|calloc_model_#Ultimate.C_memset_#ptr#1.base| (_ BitVec 32))) (= |c_#valid| (store |c_old(#valid)| |calloc_model_#Ultimate.C_memset_#ptr#1.base| (_ bv1 1)))) is different from true [2024-11-13 15:53:56,690 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-13 15:53:56,690 INFO L378 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 14 treesize of output 20 [2024-11-13 15:53:57,052 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-13 15:53:57,052 INFO L378 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 14 treesize of output 20 [2024-11-13 15:53:57,227 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-11-13 15:53:57,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 20 [2024-11-13 15:53:57,495 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2024-11-13 15:53:57,495 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 15:53:57,495 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:53:57,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [803063716] [2024-11-13 15:53:57,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [803063716] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:53:57,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:53:57,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 15:53:57,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198197812] [2024-11-13 15:53:57,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:53:57,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 15:53:57,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:53:57,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 15:53:57,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=21, Unknown=1, NotChecked=8, Total=42 [2024-11-13 15:53:57,498 INFO L87 Difference]: Start difference. First operand 102 states and 108 transitions. Second operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 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) [2024-11-13 15:53:58,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:53:58,765 INFO L93 Difference]: Finished difference Result 125 states and 131 transitions. [2024-11-13 15:53:58,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 15:53:58,766 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 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 52 [2024-11-13 15:53:58,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:53:58,767 INFO L225 Difference]: With dead ends: 125 [2024-11-13 15:53:58,767 INFO L226 Difference]: Without dead ends: 125 [2024-11-13 15:53:58,767 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=37, Invalid=75, Unknown=2, NotChecked=18, Total=132 [2024-11-13 15:53:58,768 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 64 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 114 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-13 15:53:58,768 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 163 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 152 Invalid, 0 Unknown, 114 Unchecked, 0.9s Time] [2024-11-13 15:53:58,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-11-13 15:53:58,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 104. [2024-11-13 15:53:58,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 71 states have (on average 1.5492957746478873) internal successors, (110), 100 states have internal predecessors, (110), 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) [2024-11-13 15:53:58,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 114 transitions. [2024-11-13 15:53:58,773 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 114 transitions. Word has length 52 [2024-11-13 15:53:58,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:53:58,773 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 114 transitions. [2024-11-13 15:53:58,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 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) [2024-11-13 15:53:58,774 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 114 transitions. [2024-11-13 15:53:58,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-13 15:53:58,774 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:53:58,775 INFO L215 NwaCegarLoop]: trace histogram [16, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:53:58,797 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-13 15:53:58,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:53:58,975 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [calloc_modelErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, calloc_modelErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-13 15:53:58,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:53:58,976 INFO L85 PathProgramCache]: Analyzing trace with hash 35685665, now seen corresponding path program 1 times [2024-11-13 15:53:58,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:53:58,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [59710551] [2024-11-13 15:53:58,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:53:58,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:53:58,976 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:53:58,979 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:53:58,980 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dc7a4ef-71c7-44e4-8065-14f13510eed7/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-13 15:53:59,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:53:59,215 INFO L255 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-13 15:53:59,219 INFO L278 TraceCheckSpWp]: Computing forward predicates...