./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/dll2n_prepend_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4ae0f48-b9d0-476b-9506-5443330d709b/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4ae0f48-b9d0-476b-9506-5443330d709b/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4ae0f48-b9d0-476b-9506-5443330d709b/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4ae0f48-b9d0-476b-9506-5443330d709b/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/dll2n_prepend_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4ae0f48-b9d0-476b-9506-5443330d709b/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4ae0f48-b9d0-476b-9506-5443330d709b/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 46bbe683d8965e9a855fbd780578b958a816bbdd25bc1fa0d6151e1b826f8669 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:59:33,542 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:59:33,613 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4ae0f48-b9d0-476b-9506-5443330d709b/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-06 22:59:33,619 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:59:33,619 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:59:33,645 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:59:33,646 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:59:33,646 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:59:33,647 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:59:33,648 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:59:33,649 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:59:33,649 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:59:33,650 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:59:33,651 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:59:33,651 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:59:33,652 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:59:33,652 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:59:33,653 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:59:33,654 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-06 22:59:33,654 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-06 22:59:33,655 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-06 22:59:33,655 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:59:33,656 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 22:59:33,657 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 22:59:33,657 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:59:33,658 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:59:33,658 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:59:33,659 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:59:33,659 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:59:33,660 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:59:33,673 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:59:33,674 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:59:33,675 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:59:33,675 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:59:33,675 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:59:33,676 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:59:33,676 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:59:33,676 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:59:33,677 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4ae0f48-b9d0-476b-9506-5443330d709b/bin/uautomizer-verify-WvqO1wxjHP/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4ae0f48-b9d0-476b-9506-5443330d709b/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 46bbe683d8965e9a855fbd780578b958a816bbdd25bc1fa0d6151e1b826f8669 [2023-11-06 22:59:33,958 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:59:33,993 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:59:33,996 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:59:33,998 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:59:33,999 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:59:34,000 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4ae0f48-b9d0-476b-9506-5443330d709b/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/list-simple/dll2n_prepend_equal.i [2023-11-06 22:59:37,178 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:59:37,480 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:59:37,480 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4ae0f48-b9d0-476b-9506-5443330d709b/sv-benchmarks/c/list-simple/dll2n_prepend_equal.i [2023-11-06 22:59:37,496 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4ae0f48-b9d0-476b-9506-5443330d709b/bin/uautomizer-verify-WvqO1wxjHP/data/28168866a/d86db3f8a4cd4000b00b12aa0afce85c/FLAG4b2ac9424 [2023-11-06 22:59:37,511 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4ae0f48-b9d0-476b-9506-5443330d709b/bin/uautomizer-verify-WvqO1wxjHP/data/28168866a/d86db3f8a4cd4000b00b12aa0afce85c [2023-11-06 22:59:37,514 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:59:37,515 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:59:37,517 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:59:37,518 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:59:37,524 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:59:37,525 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:59:37" (1/1) ... [2023-11-06 22:59:37,526 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e25d67b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:59:37, skipping insertion in model container [2023-11-06 22:59:37,526 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:59:37" (1/1) ... [2023-11-06 22:59:37,576 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:59:38,037 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:59:38,049 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:59:38,095 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:59:38,132 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:59:38,133 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:59:38 WrapperNode [2023-11-06 22:59:38,133 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:59:38,134 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:59:38,135 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:59:38,135 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:59:38,143 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:59:38" (1/1) ... [2023-11-06 22:59:38,159 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:59:38" (1/1) ... [2023-11-06 22:59:38,190 INFO L138 Inliner]: procedures = 127, calls = 39, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 122 [2023-11-06 22:59:38,191 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:59:38,191 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:59:38,192 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:59:38,192 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:59:38,202 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:59:38" (1/1) ... [2023-11-06 22:59:38,203 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:59:38" (1/1) ... [2023-11-06 22:59:38,207 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:59:38" (1/1) ... [2023-11-06 22:59:38,208 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:59:38" (1/1) ... [2023-11-06 22:59:38,222 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:59:38" (1/1) ... [2023-11-06 22:59:38,233 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:59:38" (1/1) ... [2023-11-06 22:59:38,235 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:59:38" (1/1) ... [2023-11-06 22:59:38,237 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:59:38" (1/1) ... [2023-11-06 22:59:38,242 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:59:38,243 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:59:38,243 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:59:38,244 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:59:38,245 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:59:38" (1/1) ... [2023-11-06 22:59:38,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:59:38,272 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4ae0f48-b9d0-476b-9506-5443330d709b/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:59:38,310 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4ae0f48-b9d0-476b-9506-5443330d709b/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:59:38,328 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4ae0f48-b9d0-476b-9506-5443330d709b/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:59:38,362 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2023-11-06 22:59:38,363 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2023-11-06 22:59:38,364 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-06 22:59:38,364 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 22:59:38,364 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-06 22:59:38,364 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:59:38,365 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 22:59:38,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-06 22:59:38,366 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-06 22:59:38,366 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 22:59:38,368 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-06 22:59:38,368 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:59:38,368 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:59:38,369 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:59:38,584 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:59:38,586 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:59:38,632 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2023-11-06 22:59:39,153 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:59:39,162 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:59:39,163 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-11-06 22:59:39,165 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:59:39 BoogieIcfgContainer [2023-11-06 22:59:39,166 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:59:39,169 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:59:39,170 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:59:39,174 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:59:39,174 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:59:37" (1/3) ... [2023-11-06 22:59:39,175 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b463316 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:59:39, skipping insertion in model container [2023-11-06 22:59:39,175 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:59:38" (2/3) ... [2023-11-06 22:59:39,176 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b463316 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:59:39, skipping insertion in model container [2023-11-06 22:59:39,176 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:59:39" (3/3) ... [2023-11-06 22:59:39,178 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_prepend_equal.i [2023-11-06 22:59:39,230 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:59:39,230 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 41 error locations. [2023-11-06 22:59:39,297 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:59:39,309 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3994c4e1, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:59:39,309 INFO L358 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2023-11-06 22:59:39,316 INFO L276 IsEmpty]: Start isEmpty. Operand has 97 states, 53 states have (on average 2.018867924528302) internal successors, (107), 95 states have internal predecessors, (107), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:59:39,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-06 22:59:39,326 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:59:39,327 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-06 22:59:39,328 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-06 22:59:39,334 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:59:39,335 INFO L85 PathProgramCache]: Analyzing trace with hash 33471376, now seen corresponding path program 1 times [2023-11-06 22:59:39,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:59:39,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853512376] [2023-11-06 22:59:39,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:59:39,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:59:39,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:39,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:59:39,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:59:39,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853512376] [2023-11-06 22:59:39,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853512376] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:59:39,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:59:39,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:59:39,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992323916] [2023-11-06 22:59:39,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:59:39,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:59:39,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:59:39,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:59:39,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:59:39,759 INFO L87 Difference]: Start difference. First operand has 97 states, 53 states have (on average 2.018867924528302) internal successors, (107), 95 states have internal predecessors, (107), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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) [2023-11-06 22:59:39,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:59:39,894 INFO L93 Difference]: Finished difference Result 93 states and 100 transitions. [2023-11-06 22:59:39,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:59:39,897 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), 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 5 [2023-11-06 22:59:39,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:59:39,906 INFO L225 Difference]: With dead ends: 93 [2023-11-06 22:59:39,907 INFO L226 Difference]: Without dead ends: 87 [2023-11-06 22:59:39,909 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:59:39,913 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 12 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:59:39,914 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 137 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:59:39,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2023-11-06 22:59:39,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2023-11-06 22:59:39,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 49 states have (on average 1.8775510204081634) internal successors, (92), 86 states have internal predecessors, (92), 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) [2023-11-06 22:59:39,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 92 transitions. [2023-11-06 22:59:39,956 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 92 transitions. Word has length 5 [2023-11-06 22:59:39,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:59:39,958 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 92 transitions. [2023-11-06 22:59:39,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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) [2023-11-06 22:59:39,958 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 92 transitions. [2023-11-06 22:59:39,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-06 22:59:39,959 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:59:39,959 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-06 22:59:39,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:59:39,960 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-06 22:59:39,960 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:59:39,961 INFO L85 PathProgramCache]: Analyzing trace with hash 33471377, now seen corresponding path program 1 times [2023-11-06 22:59:39,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:59:39,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390391684] [2023-11-06 22:59:39,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:59:39,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:59:39,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:40,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:59:40,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:59:40,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390391684] [2023-11-06 22:59:40,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390391684] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:59:40,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:59:40,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:59:40,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891047646] [2023-11-06 22:59:40,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:59:40,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:59:40,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:59:40,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:59:40,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:59:40,148 INFO L87 Difference]: Start difference. First operand 87 states and 92 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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) [2023-11-06 22:59:40,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:59:40,229 INFO L93 Difference]: Finished difference Result 84 states and 89 transitions. [2023-11-06 22:59:40,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:59:40,230 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), 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 5 [2023-11-06 22:59:40,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:59:40,232 INFO L225 Difference]: With dead ends: 84 [2023-11-06 22:59:40,232 INFO L226 Difference]: Without dead ends: 84 [2023-11-06 22:59:40,232 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:59:40,234 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 8 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:59:40,235 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 129 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:59:40,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2023-11-06 22:59:40,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2023-11-06 22:59:40,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 49 states have (on average 1.816326530612245) internal successors, (89), 83 states have internal predecessors, (89), 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) [2023-11-06 22:59:40,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2023-11-06 22:59:40,244 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 5 [2023-11-06 22:59:40,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:59:40,245 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions. [2023-11-06 22:59:40,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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) [2023-11-06 22:59:40,246 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2023-11-06 22:59:40,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-06 22:59:40,246 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:59:40,247 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:59:40,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:59:40,247 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-06 22:59:40,248 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:59:40,248 INFO L85 PathProgramCache]: Analyzing trace with hash 2100113040, now seen corresponding path program 1 times [2023-11-06 22:59:40,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:59:40,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465683614] [2023-11-06 22:59:40,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:59:40,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:59:40,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:40,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:59:40,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:59:40,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465683614] [2023-11-06 22:59:40,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465683614] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:59:40,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:59:40,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:59:40,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105004900] [2023-11-06 22:59:40,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:59:40,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:59:40,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:59:40,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:59:40,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:59:40,322 INFO L87 Difference]: Start difference. First operand 84 states and 89 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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) [2023-11-06 22:59:40,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:59:40,341 INFO L93 Difference]: Finished difference Result 94 states and 100 transitions. [2023-11-06 22:59:40,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:59:40,342 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 7 [2023-11-06 22:59:40,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:59:40,343 INFO L225 Difference]: With dead ends: 94 [2023-11-06 22:59:40,343 INFO L226 Difference]: Without dead ends: 94 [2023-11-06 22:59:40,344 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:59:40,346 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 10 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:59:40,346 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 171 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:59:40,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2023-11-06 22:59:40,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 85. [2023-11-06 22:59:40,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 50 states have (on average 1.8) internal successors, (90), 84 states have internal predecessors, (90), 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) [2023-11-06 22:59:40,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 90 transitions. [2023-11-06 22:59:40,358 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 90 transitions. Word has length 7 [2023-11-06 22:59:40,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:59:40,359 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 90 transitions. [2023-11-06 22:59:40,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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) [2023-11-06 22:59:40,359 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 90 transitions. [2023-11-06 22:59:40,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-06 22:59:40,360 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:59:40,360 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:59:40,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:59:40,361 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-06 22:59:40,361 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:59:40,362 INFO L85 PathProgramCache]: Analyzing trace with hash 638916372, now seen corresponding path program 1 times [2023-11-06 22:59:40,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:59:40,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658144860] [2023-11-06 22:59:40,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:59:40,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:59:40,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:40,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:59:40,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:59:40,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658144860] [2023-11-06 22:59:40,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658144860] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:59:40,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:59:40,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:59:40,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868291444] [2023-11-06 22:59:40,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:59:40,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:59:40,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:59:40,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:59:40,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:59:40,444 INFO L87 Difference]: Start difference. First operand 85 states and 90 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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) [2023-11-06 22:59:40,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:59:40,468 INFO L93 Difference]: Finished difference Result 91 states and 96 transitions. [2023-11-06 22:59:40,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:59:40,469 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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 9 [2023-11-06 22:59:40,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:59:40,471 INFO L225 Difference]: With dead ends: 91 [2023-11-06 22:59:40,471 INFO L226 Difference]: Without dead ends: 91 [2023-11-06 22:59:40,471 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:59:40,473 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 1 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:59:40,474 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 166 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:59:40,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2023-11-06 22:59:40,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2023-11-06 22:59:40,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 55 states have (on average 1.7272727272727273) internal successors, (95), 89 states have internal predecessors, (95), 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) [2023-11-06 22:59:40,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 95 transitions. [2023-11-06 22:59:40,483 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 95 transitions. Word has length 9 [2023-11-06 22:59:40,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:59:40,483 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 95 transitions. [2023-11-06 22:59:40,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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) [2023-11-06 22:59:40,484 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 95 transitions. [2023-11-06 22:59:40,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-06 22:59:40,485 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:59:40,485 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:59:40,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 22:59:40,486 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-06 22:59:40,486 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:59:40,486 INFO L85 PathProgramCache]: Analyzing trace with hash -763066913, now seen corresponding path program 1 times [2023-11-06 22:59:40,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:59:40,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715485700] [2023-11-06 22:59:40,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:59:40,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:59:40,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:40,647 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:59:40,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:59:40,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715485700] [2023-11-06 22:59:40,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715485700] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:59:40,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1528592830] [2023-11-06 22:59:40,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:59:40,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:59:40,650 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4ae0f48-b9d0-476b-9506-5443330d709b/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:59:40,656 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4ae0f48-b9d0-476b-9506-5443330d709b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:59:40,660 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4ae0f48-b9d0-476b-9506-5443330d709b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-06 22:59:40,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:40,859 INFO L262 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 22:59:40,867 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:59:41,010 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:59:41,011 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:59:41,068 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:59:41,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1528592830] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:59:41,069 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:59:41,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-11-06 22:59:41,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083956043] [2023-11-06 22:59:41,070 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:59:41,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:59:41,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:59:41,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:59:41,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:59:41,072 INFO L87 Difference]: Start difference. First operand 90 states and 95 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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) [2023-11-06 22:59:41,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:59:41,098 INFO L93 Difference]: Finished difference Result 92 states and 97 transitions. [2023-11-06 22:59:41,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:59:41,099 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), 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 14 [2023-11-06 22:59:41,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:59:41,101 INFO L225 Difference]: With dead ends: 92 [2023-11-06 22:59:41,101 INFO L226 Difference]: Without dead ends: 92 [2023-11-06 22:59:41,102 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:59:41,104 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 10 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:59:41,104 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 246 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:59:41,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2023-11-06 22:59:41,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2023-11-06 22:59:41,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 57 states have (on average 1.7017543859649122) internal successors, (97), 91 states have internal predecessors, (97), 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) [2023-11-06 22:59:41,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 97 transitions. [2023-11-06 22:59:41,114 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 97 transitions. Word has length 14 [2023-11-06 22:59:41,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:59:41,114 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 97 transitions. [2023-11-06 22:59:41,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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) [2023-11-06 22:59:41,115 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 97 transitions. [2023-11-06 22:59:41,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-06 22:59:41,116 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:59:41,116 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-11-06 22:59:41,124 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4ae0f48-b9d0-476b-9506-5443330d709b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-06 22:59:41,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4ae0f48-b9d0-476b-9506-5443330d709b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:59:41,323 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-06 22:59:41,324 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:59:41,324 INFO L85 PathProgramCache]: Analyzing trace with hash -2097949021, now seen corresponding path program 1 times [2023-11-06 22:59:41,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:59:41,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202403990] [2023-11-06 22:59:41,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:59:41,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:59:41,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:41,652 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:59:41,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:59:41,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202403990] [2023-11-06 22:59:41,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202403990] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:59:41,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [660748216] [2023-11-06 22:59:41,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:59:41,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:59:41,658 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4ae0f48-b9d0-476b-9506-5443330d709b/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:59:41,660 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4ae0f48-b9d0-476b-9506-5443330d709b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:59:41,686 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4ae0f48-b9d0-476b-9506-5443330d709b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-06 22:59:41,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:41,797 INFO L262 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-06 22:59:41,801 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:59:41,847 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-06 22:59:41,911 INFO L322 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-06 22:59:41,911 INFO L351 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 [2023-11-06 22:59:41,933 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:59:41,933 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:59:42,100 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:59:42,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [660748216] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:59:42,101 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:59:42,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 6 [2023-11-06 22:59:42,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075602623] [2023-11-06 22:59:42,102 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:59:42,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:59:42,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:59:42,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:59:42,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:59:42,104 INFO L87 Difference]: Start difference. First operand 92 states and 97 transitions. Second operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 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) [2023-11-06 22:59:42,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:59:42,290 INFO L93 Difference]: Finished difference Result 91 states and 96 transitions. [2023-11-06 22:59:42,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:59:42,291 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 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 16 [2023-11-06 22:59:42,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:59:42,292 INFO L225 Difference]: With dead ends: 91 [2023-11-06 22:59:42,292 INFO L226 Difference]: Without dead ends: 91 [2023-11-06 22:59:42,292 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:59:42,293 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 16 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:59:42,294 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 202 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:59:42,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2023-11-06 22:59:42,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2023-11-06 22:59:42,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 57 states have (on average 1.6842105263157894) internal successors, (96), 90 states have internal predecessors, (96), 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) [2023-11-06 22:59:42,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 96 transitions. [2023-11-06 22:59:42,301 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 96 transitions. Word has length 16 [2023-11-06 22:59:42,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:59:42,302 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 96 transitions. [2023-11-06 22:59:42,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 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) [2023-11-06 22:59:42,302 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 96 transitions. [2023-11-06 22:59:42,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-06 22:59:42,303 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:59:42,303 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-11-06 22:59:42,314 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4ae0f48-b9d0-476b-9506-5443330d709b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-06 22:59:42,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4ae0f48-b9d0-476b-9506-5443330d709b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-11-06 22:59:42,509 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-06 22:59:42,509 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:59:42,509 INFO L85 PathProgramCache]: Analyzing trace with hash -2097949020, now seen corresponding path program 1 times [2023-11-06 22:59:42,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:59:42,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948979934] [2023-11-06 22:59:42,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:59:42,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:59:42,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:42,801 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:59:42,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:59:42,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948979934] [2023-11-06 22:59:42,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948979934] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:59:42,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [284902687] [2023-11-06 22:59:42,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:59:42,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:59:42,825 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4ae0f48-b9d0-476b-9506-5443330d709b/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:59:42,828 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4ae0f48-b9d0-476b-9506-5443330d709b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:59:42,852 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4ae0f48-b9d0-476b-9506-5443330d709b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-06 22:59:42,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:42,993 INFO L262 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 15 conjunts are in the unsatisfiable core [2023-11-06 22:59:42,997 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:59:43,019 INFO L351 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 [2023-11-06 22:59:43,023 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-06 22:59:43,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:59:43,142 INFO L351 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 [2023-11-06 22:59:43,160 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-06 22:59:43,161 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-06 22:59:43,191 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:59:43,191 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:59:43,521 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:59:43,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [284902687] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:59:43,521 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:59:43,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 9 [2023-11-06 22:59:43,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564015193] [2023-11-06 22:59:43,522 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:59:43,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-06 22:59:43,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:59:43,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-06 22:59:43,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:59:43,523 INFO L87 Difference]: Start difference. First operand 91 states and 96 transitions. Second operand has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 10 states have internal predecessors, (35), 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) [2023-11-06 22:59:43,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:59:43,910 INFO L93 Difference]: Finished difference Result 90 states and 95 transitions. [2023-11-06 22:59:43,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:59:43,910 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 10 states have internal predecessors, (35), 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 16 [2023-11-06 22:59:43,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:59:43,911 INFO L225 Difference]: With dead ends: 90 [2023-11-06 22:59:43,912 INFO L226 Difference]: Without dead ends: 90 [2023-11-06 22:59:43,912 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:59:43,913 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 11 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:59:43,914 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 353 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 22:59:43,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2023-11-06 22:59:43,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2023-11-06 22:59:43,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 57 states have (on average 1.6666666666666667) internal successors, (95), 89 states have internal predecessors, (95), 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) [2023-11-06 22:59:43,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 95 transitions. [2023-11-06 22:59:43,920 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 95 transitions. Word has length 16 [2023-11-06 22:59:43,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:59:43,921 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 95 transitions. [2023-11-06 22:59:43,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 10 states have internal predecessors, (35), 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) [2023-11-06 22:59:43,921 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 95 transitions. [2023-11-06 22:59:43,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-06 22:59:43,922 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:59:43,922 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:59:43,934 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4ae0f48-b9d0-476b-9506-5443330d709b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-06 22:59:44,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4ae0f48-b9d0-476b-9506-5443330d709b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-11-06 22:59:44,129 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-06 22:59:44,130 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:59:44,130 INFO L85 PathProgramCache]: Analyzing trace with hash -1307957328, now seen corresponding path program 2 times [2023-11-06 22:59:44,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:59:44,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889125117] [2023-11-06 22:59:44,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:59:44,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:59:44,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:44,216 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:59:44,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:59:44,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889125117] [2023-11-06 22:59:44,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889125117] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:59:44,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1025547563] [2023-11-06 22:59:44,217 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 22:59:44,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:59:44,217 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4ae0f48-b9d0-476b-9506-5443330d709b/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:59:44,218 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4ae0f48-b9d0-476b-9506-5443330d709b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:59:44,244 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4ae0f48-b9d0-476b-9506-5443330d709b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-06 22:59:44,338 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-06 22:59:44,338 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:59:44,340 INFO L262 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-06 22:59:44,342 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:59:44,347 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-06 22:59:44,355 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-06 22:59:44,355 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:59:44,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1025547563] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:59:44,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:59:44,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2023-11-06 22:59:44,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451907575] [2023-11-06 22:59:44,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:59:44,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:59:44,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:59:44,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:59:44,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:59:44,357 INFO L87 Difference]: Start difference. First operand 90 states and 95 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 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) [2023-11-06 22:59:44,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:59:44,426 INFO L93 Difference]: Finished difference Result 87 states and 92 transitions. [2023-11-06 22:59:44,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:59:44,426 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 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 21 [2023-11-06 22:59:44,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:59:44,428 INFO L225 Difference]: With dead ends: 87 [2023-11-06 22:59:44,428 INFO L226 Difference]: Without dead ends: 87 [2023-11-06 22:59:44,428 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:59:44,429 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 7 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:59:44,430 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 117 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:59:44,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2023-11-06 22:59:44,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2023-11-06 22:59:44,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 57 states have (on average 1.6140350877192982) internal successors, (92), 86 states have internal predecessors, (92), 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) [2023-11-06 22:59:44,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 92 transitions. [2023-11-06 22:59:44,440 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 92 transitions. Word has length 21 [2023-11-06 22:59:44,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:59:44,441 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 92 transitions. [2023-11-06 22:59:44,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 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) [2023-11-06 22:59:44,441 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 92 transitions. [2023-11-06 22:59:44,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-06 22:59:44,442 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:59:44,442 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:59:44,450 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4ae0f48-b9d0-476b-9506-5443330d709b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-06 22:59:44,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4ae0f48-b9d0-476b-9506-5443330d709b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2023-11-06 22:59:44,650 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-06 22:59:44,651 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:59:44,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1307957327, now seen corresponding path program 1 times [2023-11-06 22:59:44,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:59:44,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214913633] [2023-11-06 22:59:44,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:59:44,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:59:44,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:44,755 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:59:44,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:59:44,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214913633] [2023-11-06 22:59:44,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214913633] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:59:44,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1724262151] [2023-11-06 22:59:44,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:59:44,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:59:44,757 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4ae0f48-b9d0-476b-9506-5443330d709b/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:59:44,758 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4ae0f48-b9d0-476b-9506-5443330d709b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:59:44,795 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4ae0f48-b9d0-476b-9506-5443330d709b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-06 22:59:44,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:44,915 INFO L262 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 22:59:44,917 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:59:44,938 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:59:44,938 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:59:44,968 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:59:44,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1724262151] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:59:44,969 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:59:44,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2023-11-06 22:59:44,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718829708] [2023-11-06 22:59:44,969 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:59:44,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:59:44,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:59:44,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:59:44,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:59:44,971 INFO L87 Difference]: Start difference. First operand 87 states and 92 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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) [2023-11-06 22:59:45,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:59:45,013 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2023-11-06 22:59:45,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:59:45,014 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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 21 [2023-11-06 22:59:45,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:59:45,015 INFO L225 Difference]: With dead ends: 87 [2023-11-06 22:59:45,015 INFO L226 Difference]: Without dead ends: 87 [2023-11-06 22:59:45,015 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:59:45,016 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 6 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:59:45,016 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 221 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:59:45,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2023-11-06 22:59:45,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2023-11-06 22:59:45,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 57 states have (on average 1.5964912280701755) internal successors, (91), 86 states have internal predecessors, (91), 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) [2023-11-06 22:59:45,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 91 transitions. [2023-11-06 22:59:45,021 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 91 transitions. Word has length 21 [2023-11-06 22:59:45,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:59:45,021 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 91 transitions. [2023-11-06 22:59:45,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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) [2023-11-06 22:59:45,022 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 91 transitions. [2023-11-06 22:59:45,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-11-06 22:59:45,022 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:59:45,022 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:59:45,034 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4ae0f48-b9d0-476b-9506-5443330d709b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-06 22:59:45,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4ae0f48-b9d0-476b-9506-5443330d709b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:59:45,230 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-06 22:59:45,230 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:59:45,230 INFO L85 PathProgramCache]: Analyzing trace with hash 2020822092, now seen corresponding path program 1 times [2023-11-06 22:59:45,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:59:45,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648149916] [2023-11-06 22:59:45,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:59:45,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:59:45,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:45,343 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-06 22:59:45,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:59:45,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648149916] [2023-11-06 22:59:45,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648149916] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:59:45,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:59:45,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:59:45,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544470169] [2023-11-06 22:59:45,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:59:45,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:59:45,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:59:45,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:59:45,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:59:45,345 INFO L87 Difference]: Start difference. First operand 87 states and 91 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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) [2023-11-06 22:59:45,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:59:45,419 INFO L93 Difference]: Finished difference Result 84 states and 88 transitions. [2023-11-06 22:59:45,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:59:45,419 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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 22 [2023-11-06 22:59:45,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:59:45,420 INFO L225 Difference]: With dead ends: 84 [2023-11-06 22:59:45,420 INFO L226 Difference]: Without dead ends: 84 [2023-11-06 22:59:45,420 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:59:45,421 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 4 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:59:45,422 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 121 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:59:45,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2023-11-06 22:59:45,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2023-11-06 22:59:45,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 57 states have (on average 1.543859649122807) internal successors, (88), 83 states have internal predecessors, (88), 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) [2023-11-06 22:59:45,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 88 transitions. [2023-11-06 22:59:45,425 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 88 transitions. Word has length 22 [2023-11-06 22:59:45,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:59:45,426 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 88 transitions. [2023-11-06 22:59:45,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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) [2023-11-06 22:59:45,426 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 88 transitions. [2023-11-06 22:59:45,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-06 22:59:45,427 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:59:45,427 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:59:45,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-06 22:59:45,427 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-06 22:59:45,428 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:59:45,428 INFO L85 PathProgramCache]: Analyzing trace with hash 157247510, now seen corresponding path program 1 times [2023-11-06 22:59:45,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:59:45,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390741553] [2023-11-06 22:59:45,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:59:45,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:59:45,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:45,847 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 22:59:45,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:59:45,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390741553] [2023-11-06 22:59:45,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390741553] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:59:45,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [349976013] [2023-11-06 22:59:45,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:59:45,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:59:45,849 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4ae0f48-b9d0-476b-9506-5443330d709b/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:59:45,850 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4ae0f48-b9d0-476b-9506-5443330d709b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:59:45,854 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4ae0f48-b9d0-476b-9506-5443330d709b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-06 22:59:46,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:46,037 INFO L262 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 19 conjunts are in the unsatisfiable core [2023-11-06 22:59:46,040 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:59:46,050 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-06 22:59:46,076 INFO L322 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-06 22:59:46,077 INFO L351 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 [2023-11-06 22:59:46,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:59:46,188 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-06 22:59:46,263 INFO L322 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-06 22:59:46,264 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2023-11-06 22:59:46,289 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:59:46,289 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:59:50,610 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_621 Int) (v_ArrVal_620 Int) (|v_ULTIMATE.start_dll_create_~new_head~0#1.base_33| Int) (|v_ULTIMATE.start_dll_create_~new_head~0#1.base_34| Int)) (let ((.cse0 (store (store |c_#valid| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_34| v_ArrVal_620) |v_ULTIMATE.start_dll_create_~new_head~0#1.base_33| v_ArrVal_621))) (or (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_dll_create_~new_head~0#1.base_33| 1)) (not (= (select .cse0 |v_ULTIMATE.start_dll_create_~new_head~0#1.base_34|) 1))))) is different from false [2023-11-06 22:59:50,627 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-11-06 22:59:50,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [349976013] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:59:50,627 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:59:50,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2023-11-06 22:59:50,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570898382] [2023-11-06 22:59:50,628 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:59:50,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-06 22:59:50,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:59:50,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-06 22:59:50,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=130, Unknown=2, NotChecked=24, Total=210 [2023-11-06 22:59:50,630 INFO L87 Difference]: Start difference. First operand 84 states and 88 transitions. Second operand has 15 states, 14 states have (on average 4.285714285714286) internal successors, (60), 15 states have internal predecessors, (60), 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) [2023-11-06 22:59:50,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:59:50,812 INFO L93 Difference]: Finished difference Result 90 states and 95 transitions. [2023-11-06 22:59:50,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:59:50,813 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.285714285714286) internal successors, (60), 15 states have internal predecessors, (60), 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 27 [2023-11-06 22:59:50,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:59:50,814 INFO L225 Difference]: With dead ends: 90 [2023-11-06 22:59:50,814 INFO L226 Difference]: Without dead ends: 90 [2023-11-06 22:59:50,814 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 46 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=66, Invalid=146, Unknown=2, NotChecked=26, Total=240 [2023-11-06 22:59:50,815 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 216 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 81 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:59:50,815 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 159 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 162 Invalid, 0 Unknown, 81 Unchecked, 0.2s Time] [2023-11-06 22:59:50,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2023-11-06 22:59:50,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 78. [2023-11-06 22:59:50,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 57 states have (on average 1.4385964912280702) internal successors, (82), 77 states have internal predecessors, (82), 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) [2023-11-06 22:59:50,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 82 transitions. [2023-11-06 22:59:50,819 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 82 transitions. Word has length 27 [2023-11-06 22:59:50,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:59:50,819 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 82 transitions. [2023-11-06 22:59:50,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.285714285714286) internal successors, (60), 15 states have internal predecessors, (60), 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) [2023-11-06 22:59:50,819 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2023-11-06 22:59:50,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-06 22:59:50,820 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:59:50,820 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:59:50,828 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4ae0f48-b9d0-476b-9506-5443330d709b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-06 22:59:51,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4ae0f48-b9d0-476b-9506-5443330d709b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:59:51,027 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-06 22:59:51,027 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:59:51,027 INFO L85 PathProgramCache]: Analyzing trace with hash 157247511, now seen corresponding path program 1 times [2023-11-06 22:59:51,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:59:51,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694651367] [2023-11-06 22:59:51,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:59:51,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:59:51,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:51,598 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:59:51,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:59:51,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694651367] [2023-11-06 22:59:51,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694651367] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:59:51,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [805339108] [2023-11-06 22:59:51,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:59:51,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:59:51,600 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4ae0f48-b9d0-476b-9506-5443330d709b/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:59:51,615 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4ae0f48-b9d0-476b-9506-5443330d709b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:59:51,636 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4ae0f48-b9d0-476b-9506-5443330d709b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-06 22:59:51,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:51,798 INFO L262 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 20 conjunts are in the unsatisfiable core [2023-11-06 22:59:51,802 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:59:51,811 INFO L351 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 [2023-11-06 22:59:51,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:59:51,830 INFO L351 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 [2023-11-06 22:59:51,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:59:51,915 INFO L351 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 [2023-11-06 22:59:52,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:59:52,022 INFO L351 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 [2023-11-06 22:59:52,055 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-06 22:59:52,055 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:59:52,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [805339108] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:59:52,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:59:52,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 7 [2023-11-06 22:59:52,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623746241] [2023-11-06 22:59:52,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:59:52,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:59:52,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:59:52,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:59:52,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:59:52,058 INFO L87 Difference]: Start difference. First operand 78 states and 82 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 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) [2023-11-06 22:59:52,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:59:52,160 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2023-11-06 22:59:52,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:59:52,161 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 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 27 [2023-11-06 22:59:52,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:59:52,162 INFO L225 Difference]: With dead ends: 72 [2023-11-06 22:59:52,162 INFO L226 Difference]: Without dead ends: 72 [2023-11-06 22:59:52,162 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:59:52,163 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 67 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:59:52,163 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 71 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:59:52,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2023-11-06 22:59:52,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2023-11-06 22:59:52,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 57 states have (on average 1.3333333333333333) internal successors, (76), 71 states have internal predecessors, (76), 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) [2023-11-06 22:59:52,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2023-11-06 22:59:52,166 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 27 [2023-11-06 22:59:52,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:59:52,167 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 76 transitions. [2023-11-06 22:59:52,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 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) [2023-11-06 22:59:52,167 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2023-11-06 22:59:52,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-06 22:59:52,168 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:59:52,168 INFO L195 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] [2023-11-06 22:59:52,182 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4ae0f48-b9d0-476b-9506-5443330d709b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-11-06 22:59:52,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4ae0f48-b9d0-476b-9506-5443330d709b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-11-06 22:59:52,376 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-06 22:59:52,376 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:59:52,376 INFO L85 PathProgramCache]: Analyzing trace with hash 579705555, now seen corresponding path program 1 times [2023-11-06 22:59:52,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:59:52,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895504361] [2023-11-06 22:59:52,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:59:52,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:59:52,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:52,504 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-06 22:59:52,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:59:52,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895504361] [2023-11-06 22:59:52,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895504361] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:59:52,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:59:52,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:59:52,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559205867] [2023-11-06 22:59:52,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:59:52,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:59:52,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:59:52,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:59:52,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:59:52,506 INFO L87 Difference]: Start difference. First operand 72 states and 76 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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) [2023-11-06 22:59:52,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:59:52,615 INFO L93 Difference]: Finished difference Result 83 states and 88 transitions. [2023-11-06 22:59:52,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:59:52,615 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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 28 [2023-11-06 22:59:52,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:59:52,616 INFO L225 Difference]: With dead ends: 83 [2023-11-06 22:59:52,616 INFO L226 Difference]: Without dead ends: 83 [2023-11-06 22:59:52,617 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:59:52,617 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 60 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:59:52,617 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 119 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:59:52,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2023-11-06 22:59:52,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 71. [2023-11-06 22:59:52,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 57 states have (on average 1.3157894736842106) internal successors, (75), 70 states have internal predecessors, (75), 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) [2023-11-06 22:59:52,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2023-11-06 22:59:52,620 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 28 [2023-11-06 22:59:52,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:59:52,620 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2023-11-06 22:59:52,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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) [2023-11-06 22:59:52,621 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2023-11-06 22:59:52,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-06 22:59:52,622 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:59:52,622 INFO L195 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] [2023-11-06 22:59:52,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-06 22:59:52,622 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-06 22:59:52,622 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:59:52,622 INFO L85 PathProgramCache]: Analyzing trace with hash 579705556, now seen corresponding path program 1 times [2023-11-06 22:59:52,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:59:52,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685650041] [2023-11-06 22:59:52,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:59:52,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:59:52,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:52,804 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-06 22:59:52,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:59:52,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685650041] [2023-11-06 22:59:52,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685650041] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:59:52,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:59:52,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:59:52,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343707913] [2023-11-06 22:59:52,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:59:52,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:59:52,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:59:52,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:59:52,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:59:52,806 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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) [2023-11-06 22:59:52,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:59:52,934 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2023-11-06 22:59:52,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:59:52,934 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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 28 [2023-11-06 22:59:52,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:59:52,935 INFO L225 Difference]: With dead ends: 70 [2023-11-06 22:59:52,935 INFO L226 Difference]: Without dead ends: 70 [2023-11-06 22:59:52,935 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:59:52,936 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 60 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:59:52,936 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 122 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:59:52,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2023-11-06 22:59:52,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2023-11-06 22:59:52,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 57 states have (on average 1.2982456140350878) internal successors, (74), 69 states have internal predecessors, (74), 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) [2023-11-06 22:59:52,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 74 transitions. [2023-11-06 22:59:52,939 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 74 transitions. Word has length 28 [2023-11-06 22:59:52,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:59:52,939 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 74 transitions. [2023-11-06 22:59:52,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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) [2023-11-06 22:59:52,940 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2023-11-06 22:59:52,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-11-06 22:59:52,941 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:59:52,941 INFO L195 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, 1, 1] [2023-11-06 22:59:52,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-06 22:59:52,941 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-06 22:59:52,941 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:59:52,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1569558015, now seen corresponding path program 1 times [2023-11-06 22:59:52,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:59:52,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035561283] [2023-11-06 22:59:52,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:59:52,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:59:52,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:53,459 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 22:59:53,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:59:53,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035561283] [2023-11-06 22:59:53,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035561283] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:59:53,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:59:53,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-06 22:59:53,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031825511] [2023-11-06 22:59:53,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:59:53,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-06 22:59:53,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:59:53,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-06 22:59:53,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2023-11-06 22:59:53,462 INFO L87 Difference]: Start difference. First operand 70 states and 74 transitions. Second operand has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 12 states have internal predecessors, (31), 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) [2023-11-06 22:59:53,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:59:53,843 INFO L93 Difference]: Finished difference Result 82 states and 87 transitions. [2023-11-06 22:59:53,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-06 22:59:53,844 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 12 states have internal predecessors, (31), 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 33 [2023-11-06 22:59:53,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:59:53,845 INFO L225 Difference]: With dead ends: 82 [2023-11-06 22:59:53,845 INFO L226 Difference]: Without dead ends: 82 [2023-11-06 22:59:53,845 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2023-11-06 22:59:53,846 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 146 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:59:53,846 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 164 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 22:59:53,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2023-11-06 22:59:53,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 69. [2023-11-06 22:59:53,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 57 states have (on average 1.280701754385965) internal successors, (73), 68 states have internal predecessors, (73), 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) [2023-11-06 22:59:53,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2023-11-06 22:59:53,850 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 33 [2023-11-06 22:59:53,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:59:53,850 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2023-11-06 22:59:53,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 12 states have internal predecessors, (31), 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) [2023-11-06 22:59:53,851 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2023-11-06 22:59:53,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-11-06 22:59:53,851 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:59:53,851 INFO L195 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, 1, 1] [2023-11-06 22:59:53,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-06 22:59:53,852 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-06 22:59:53,852 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:59:53,853 INFO L85 PathProgramCache]: Analyzing trace with hash -1569558014, now seen corresponding path program 1 times [2023-11-06 22:59:53,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:59:53,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702626936] [2023-11-06 22:59:53,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:59:53,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:59:53,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:54,647 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 22:59:54,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:59:54,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702626936] [2023-11-06 22:59:54,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702626936] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:59:54,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:59:54,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-06 22:59:54,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192654637] [2023-11-06 22:59:54,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:59:54,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-06 22:59:54,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:59:54,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-06 22:59:54,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:59:54,650 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand has 11 states, 10 states have (on average 3.3) internal successors, (33), 11 states have internal predecessors, (33), 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) [2023-11-06 22:59:55,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:59:55,217 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2023-11-06 22:59:55,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-06 22:59:55,218 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.3) internal successors, (33), 11 states have internal predecessors, (33), 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 33 [2023-11-06 22:59:55,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:59:55,219 INFO L225 Difference]: With dead ends: 69 [2023-11-06 22:59:55,219 INFO L226 Difference]: Without dead ends: 69 [2023-11-06 22:59:55,220 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2023-11-06 22:59:55,221 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 72 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:59:55,221 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 227 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 22:59:55,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2023-11-06 22:59:55,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2023-11-06 22:59:55,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 57 states have (on average 1.263157894736842) internal successors, (72), 67 states have internal predecessors, (72), 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) [2023-11-06 22:59:55,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2023-11-06 22:59:55,228 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 33 [2023-11-06 22:59:55,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:59:55,228 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2023-11-06 22:59:55,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.3) internal successors, (33), 11 states have internal predecessors, (33), 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) [2023-11-06 22:59:55,229 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2023-11-06 22:59:55,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-11-06 22:59:55,231 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:59:55,231 INFO L195 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, 1, 1, 1, 1, 1, 1] [2023-11-06 22:59:55,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-06 22:59:55,231 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-06 22:59:55,233 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:59:55,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1306141903, now seen corresponding path program 1 times [2023-11-06 22:59:55,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:59:55,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118000990] [2023-11-06 22:59:55,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:59:55,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:59:55,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:55,610 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-06 22:59:55,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:59:55,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118000990] [2023-11-06 22:59:55,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118000990] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:59:55,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:59:55,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 22:59:55,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109653320] [2023-11-06 22:59:55,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:59:55,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 22:59:55,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:59:55,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 22:59:55,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:59:55,615 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand has 9 states, 8 states have (on average 3.875) internal successors, (31), 9 states have internal predecessors, (31), 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) [2023-11-06 22:59:55,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:59:55,825 INFO L93 Difference]: Finished difference Result 101 states and 108 transitions. [2023-11-06 22:59:55,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 22:59:55,826 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.875) internal successors, (31), 9 states have internal predecessors, (31), 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 37 [2023-11-06 22:59:55,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:59:55,827 INFO L225 Difference]: With dead ends: 101 [2023-11-06 22:59:55,827 INFO L226 Difference]: Without dead ends: 101 [2023-11-06 22:59:55,827 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2023-11-06 22:59:55,828 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 100 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:59:55,828 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 142 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:59:55,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2023-11-06 22:59:55,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 69. [2023-11-06 22:59:55,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 59 states have (on average 1.271186440677966) internal successors, (75), 68 states have internal predecessors, (75), 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) [2023-11-06 22:59:55,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 75 transitions. [2023-11-06 22:59:55,832 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 75 transitions. Word has length 37 [2023-11-06 22:59:55,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:59:55,834 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 75 transitions. [2023-11-06 22:59:55,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.875) internal successors, (31), 9 states have internal predecessors, (31), 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) [2023-11-06 22:59:55,834 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 75 transitions. [2023-11-06 22:59:55,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-11-06 22:59:55,836 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:59:55,836 INFO L195 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, 1, 1, 1, 1, 1, 1] [2023-11-06 22:59:55,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-06 22:59:55,837 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-06 22:59:55,837 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:59:55,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1306141904, now seen corresponding path program 1 times [2023-11-06 22:59:55,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:59:55,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739229288] [2023-11-06 22:59:55,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:59:55,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:59:55,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:56,398 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-06 22:59:56,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:59:56,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739229288] [2023-11-06 22:59:56,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739229288] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:59:56,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:59:56,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 22:59:56,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241857097] [2023-11-06 22:59:56,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:59:56,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:59:56,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:59:56,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:59:56,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:59:56,401 INFO L87 Difference]: Start difference. First operand 69 states and 75 transitions. Second operand has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 8 states have internal predecessors, (31), 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) [2023-11-06 22:59:56,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:59:56,775 INFO L93 Difference]: Finished difference Result 93 states and 99 transitions. [2023-11-06 22:59:56,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 22:59:56,776 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 8 states have internal predecessors, (31), 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 37 [2023-11-06 22:59:56,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:59:56,777 INFO L225 Difference]: With dead ends: 93 [2023-11-06 22:59:56,777 INFO L226 Difference]: Without dead ends: 93 [2023-11-06 22:59:56,777 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2023-11-06 22:59:56,778 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 100 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:59:56,778 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 198 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:59:56,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2023-11-06 22:59:56,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 71. [2023-11-06 22:59:56,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 61 states have (on average 1.2459016393442623) internal successors, (76), 70 states have internal predecessors, (76), 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) [2023-11-06 22:59:56,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 76 transitions. [2023-11-06 22:59:56,782 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 76 transitions. Word has length 37 [2023-11-06 22:59:56,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:59:56,783 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 76 transitions. [2023-11-06 22:59:56,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 8 states have internal predecessors, (31), 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) [2023-11-06 22:59:56,783 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 76 transitions. [2023-11-06 22:59:56,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-11-06 22:59:56,783 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:59:56,784 INFO L195 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:59:56,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-06 22:59:56,784 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-06 22:59:56,785 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:59:56,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1131483811, now seen corresponding path program 1 times [2023-11-06 22:59:56,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:59:56,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798436222] [2023-11-06 22:59:56,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:59:56,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:59:56,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:57,113 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-06 22:59:57,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:59:57,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798436222] [2023-11-06 22:59:57,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798436222] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:59:57,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:59:57,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 22:59:57,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977052317] [2023-11-06 22:59:57,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:59:57,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:59:57,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:59:57,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:59:57,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:59:57,119 INFO L87 Difference]: Start difference. First operand 71 states and 76 transitions. Second operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 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) [2023-11-06 22:59:57,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:59:57,356 INFO L93 Difference]: Finished difference Result 76 states and 80 transitions. [2023-11-06 22:59:57,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 22:59:57,357 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 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 40 [2023-11-06 22:59:57,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:59:57,358 INFO L225 Difference]: With dead ends: 76 [2023-11-06 22:59:57,358 INFO L226 Difference]: Without dead ends: 76 [2023-11-06 22:59:57,358 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2023-11-06 22:59:57,359 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 65 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:59:57,359 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 253 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:59:57,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2023-11-06 22:59:57,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 71. [2023-11-06 22:59:57,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 61 states have (on average 1.2295081967213115) internal successors, (75), 70 states have internal predecessors, (75), 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) [2023-11-06 22:59:57,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2023-11-06 22:59:57,364 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 40 [2023-11-06 22:59:57,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:59:57,364 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2023-11-06 22:59:57,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 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) [2023-11-06 22:59:57,365 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2023-11-06 22:59:57,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-11-06 22:59:57,365 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:59:57,365 INFO L195 NwaCegarLoop]: trace histogram [2, 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] [2023-11-06 22:59:57,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-06 22:59:57,366 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-06 22:59:57,367 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:59:57,367 INFO L85 PathProgramCache]: Analyzing trace with hash 516039243, now seen corresponding path program 1 times [2023-11-06 22:59:57,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:59:57,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461098461] [2023-11-06 22:59:57,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:59:57,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:59:57,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:59:57,988 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 22:59:57,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:59:57,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461098461] [2023-11-06 22:59:57,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461098461] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:59:57,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:59:57,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-06 22:59:57,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996666761] [2023-11-06 22:59:57,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:59:57,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-06 22:59:57,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:59:57,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-06 22:59:57,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:59:57,991 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 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) [2023-11-06 22:59:58,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:59:58,384 INFO L93 Difference]: Finished difference Result 71 states and 74 transitions. [2023-11-06 22:59:58,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-06 22:59:58,385 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 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 42 [2023-11-06 22:59:58,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:59:58,386 INFO L225 Difference]: With dead ends: 71 [2023-11-06 22:59:58,386 INFO L226 Difference]: Without dead ends: 71 [2023-11-06 22:59:58,387 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2023-11-06 22:59:58,387 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 68 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:59:58,388 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 199 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:59:58,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2023-11-06 22:59:58,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2023-11-06 22:59:58,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 61 states have (on average 1.2131147540983607) internal successors, (74), 70 states have internal predecessors, (74), 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) [2023-11-06 22:59:58,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 74 transitions. [2023-11-06 22:59:58,391 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 74 transitions. Word has length 42 [2023-11-06 22:59:58,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:59:58,391 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 74 transitions. [2023-11-06 22:59:58,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 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) [2023-11-06 22:59:58,392 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 74 transitions. [2023-11-06 22:59:58,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-11-06 22:59:58,392 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:59:58,392 INFO L195 NwaCegarLoop]: trace histogram [2, 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] [2023-11-06 22:59:58,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-06 22:59:58,393 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-06 22:59:58,393 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:59:58,393 INFO L85 PathProgramCache]: Analyzing trace with hash -377366918, now seen corresponding path program 1 times [2023-11-06 22:59:58,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:59:58,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365793998] [2023-11-06 22:59:58,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:59:58,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:59:58,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:00:00,404 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 23:00:00,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:00:00,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365793998] [2023-11-06 23:00:00,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365793998] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 23:00:00,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1329570410] [2023-11-06 23:00:00,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:00:00,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:00:00,405 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4ae0f48-b9d0-476b-9506-5443330d709b/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:00:00,406 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4ae0f48-b9d0-476b-9506-5443330d709b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:00:00,460 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4ae0f48-b9d0-476b-9506-5443330d709b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-06 23:00:00,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:00:00,742 INFO L262 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 67 conjunts are in the unsatisfiable core [2023-11-06 23:00:00,747 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:00:00,818 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-06 23:00:01,034 INFO L322 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-06 23:00:01,034 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-11-06 23:00:01,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:00:01,130 INFO L351 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 17 treesize of output 12 [2023-11-06 23:00:01,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:00:01,159 INFO L351 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 17 treesize of output 12 [2023-11-06 23:00:01,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:00:01,184 INFO L351 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 17 treesize of output 12 [2023-11-06 23:00:01,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:00:01,450 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2023-11-06 23:00:01,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:00:01,720 INFO L322 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2023-11-06 23:00:01,721 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 49 [2023-11-06 23:00:01,732 INFO L351 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 22 treesize of output 16 [2023-11-06 23:00:01,905 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-06 23:00:01,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:00:01,936 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 39 [2023-11-06 23:00:02,042 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-06 23:00:02,250 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 23:00:02,251 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 21 [2023-11-06 23:00:02,357 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 23:00:02,357 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 23:00:02,506 INFO L351 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 111 treesize of output 103 [2023-11-06 23:00:02,837 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 23:00:02,837 INFO L351 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 114 treesize of output 208 [2023-11-06 23:00:03,175 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_dll_prepend_~head#1.offset|)) (.cse0 (= |c_ULTIMATE.start_dll_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (or (let ((.cse5 (+ |c_ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4))) (let ((.cse1 (forall ((v_ArrVal_1544 (Array Int Int)) (v_arrayElimCell_26 Int)) (let ((.cse27 (let ((.cse28 (let ((.cse29 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_prepend_#t~mem10#1.base| v_ArrVal_1544))) (store .cse29 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse29 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|))))) (select .cse28 (select (select .cse28 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (let ((.cse26 (select .cse27 (+ 4 v_arrayElimCell_26)))) (or (= .cse26 |c_ULTIMATE.start_dll_prepend_#t~mem10#1.base|) (< v_arrayElimCell_26 0) (= (select .cse27 .cse5) .cse26)))))) (.cse8 (not .cse2)) (.cse9 (not .cse0))) (and (or .cse0 .cse1) (or .cse2 .cse1) (or (forall ((v_ArrVal_1544 (Array Int Int)) (v_arrayElimCell_26 Int)) (let ((.cse4 (let ((.cse6 (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_prepend_#t~mem10#1.base| v_ArrVal_1544))) (store .cse7 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse7 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|))))) (select .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (let ((.cse3 (select .cse4 .cse5))) (or (= .cse3 |c_ULTIMATE.start_dll_prepend_#t~mem10#1.base|) (= .cse3 (select .cse4 (+ 4 v_arrayElimCell_26))))))) .cse8 .cse9) (or (forall ((v_ArrVal_1544 (Array Int Int)) (v_arrayElimCell_26 Int)) (let ((.cse10 (let ((.cse11 (let ((.cse12 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_prepend_#t~mem10#1.base| v_ArrVal_1544))) (store .cse12 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse12 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|))))) (select .cse11 (select (select .cse11 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse10 (+ 4 v_arrayElimCell_26)) |c_ULTIMATE.start_dll_prepend_#t~mem10#1.base|) (= (select .cse10 .cse5) |c_ULTIMATE.start_dll_prepend_#t~mem10#1.base|)))) .cse8 .cse9) (forall ((v_ArrVal_1544 (Array Int Int))) (let ((.cse15 (let ((.cse16 (let ((.cse17 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_prepend_#t~mem10#1.base| v_ArrVal_1544))) (store .cse17 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse17 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|))))) (select .cse16 (select (select .cse16 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (let ((.cse14 (select .cse15 .cse5))) (or (forall ((v_arrayElimCell_26 Int)) (let ((.cse13 (select .cse15 (+ 4 v_arrayElimCell_26)))) (or (= .cse13 |c_ULTIMATE.start_dll_prepend_#t~mem10#1.base|) (< v_arrayElimCell_26 0) (= .cse14 .cse13)))) (= .cse14 |c_ULTIMATE.start_dll_prepend_#t~mem10#1.base|))))) (or .cse8 .cse9 (forall ((v_ArrVal_1544 (Array Int Int)) (v_arrayElimCell_26 Int)) (let ((.cse20 (let ((.cse21 (let ((.cse22 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_prepend_#t~mem10#1.base| v_ArrVal_1544))) (store .cse22 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse22 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|))))) (select .cse21 (select (select .cse21 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (let ((.cse19 (select .cse20 .cse5)) (.cse18 (select .cse20 (+ 4 v_arrayElimCell_26)))) (or (= .cse18 |c_ULTIMATE.start_dll_prepend_#t~mem10#1.base|) (= .cse19 |c_ULTIMATE.start_dll_prepend_#t~mem10#1.base|) (= .cse19 .cse18)))))) (forall ((v_ArrVal_1544 (Array Int Int))) (let ((.cse23 (let ((.cse24 (let ((.cse25 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_prepend_#t~mem10#1.base| v_ArrVal_1544))) (store .cse25 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse25 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|))))) (select .cse24 (select (select .cse24 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse23 .cse5) |c_ULTIMATE.start_dll_prepend_#t~mem10#1.base|) (forall ((v_arrayElimCell_26 Int)) (or (= (select .cse23 (+ 4 v_arrayElimCell_26)) |c_ULTIMATE.start_dll_prepend_#t~mem10#1.base|) (< v_arrayElimCell_26 0))))))))) (and .cse2 (<= (+ |c_ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 1) 0) .cse0))) is different from false [2023-11-06 23:00:03,387 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse10 (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_dll_prepend_~head#1.offset|)) (.cse0 (= |c_ULTIMATE.start_dll_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (or (let ((.cse5 (+ |c_ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4)) (.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|))) (let ((.cse1 (forall ((v_ArrVal_1544 (Array Int Int)) (v_arrayElimCell_26 Int)) (let ((.cse27 (let ((.cse29 (let ((.cse30 (store |c_#memory_$Pointer$.base| .cse4 v_ArrVal_1544))) (store .cse30 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse30 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|))))) (select .cse29 (select (select .cse29 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (let ((.cse28 (select .cse27 (+ 4 v_arrayElimCell_26)))) (or (= (select .cse27 .cse5) .cse28) (< v_arrayElimCell_26 0) (= .cse4 .cse28)))))) (.cse8 (not .cse10)) (.cse9 (not .cse0))) (and (or .cse0 .cse1) (or (forall ((v_ArrVal_1544 (Array Int Int)) (v_arrayElimCell_26 Int)) (let ((.cse3 (let ((.cse6 (let ((.cse7 (store |c_#memory_$Pointer$.base| .cse4 v_ArrVal_1544))) (store .cse7 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse7 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|))))) (select .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (let ((.cse2 (select .cse3 .cse5))) (or (= .cse2 (select .cse3 (+ 4 v_arrayElimCell_26))) (= .cse2 .cse4))))) .cse8 .cse9) (or .cse10 .cse1) (or (forall ((v_ArrVal_1544 (Array Int Int)) (v_arrayElimCell_26 Int)) (let ((.cse13 (let ((.cse14 (let ((.cse15 (store |c_#memory_$Pointer$.base| .cse4 v_ArrVal_1544))) (store .cse15 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse15 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|))))) (select .cse14 (select (select .cse14 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (let ((.cse12 (select .cse13 (+ 4 v_arrayElimCell_26))) (.cse11 (select .cse13 .cse5))) (or (= .cse11 .cse12) (= .cse4 .cse12) (= .cse11 .cse4))))) .cse8 .cse9) (forall ((v_ArrVal_1544 (Array Int Int))) (let ((.cse18 (let ((.cse19 (let ((.cse20 (store |c_#memory_$Pointer$.base| .cse4 v_ArrVal_1544))) (store .cse20 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse20 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|))))) (select .cse19 (select (select .cse19 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (let ((.cse16 (select .cse18 .cse5))) (or (= .cse16 .cse4) (forall ((v_arrayElimCell_26 Int)) (let ((.cse17 (select .cse18 (+ 4 v_arrayElimCell_26)))) (or (= .cse16 .cse17) (< v_arrayElimCell_26 0) (= .cse4 .cse17)))))))) (forall ((v_ArrVal_1544 (Array Int Int))) (let ((.cse21 (let ((.cse22 (let ((.cse23 (store |c_#memory_$Pointer$.base| .cse4 v_ArrVal_1544))) (store .cse23 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse23 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|))))) (select .cse22 (select (select .cse22 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (forall ((v_arrayElimCell_26 Int)) (or (< v_arrayElimCell_26 0) (= .cse4 (select .cse21 (+ 4 v_arrayElimCell_26))))) (= (select .cse21 .cse5) .cse4)))) (or (forall ((v_ArrVal_1544 (Array Int Int)) (v_arrayElimCell_26 Int)) (let ((.cse24 (let ((.cse25 (let ((.cse26 (store |c_#memory_$Pointer$.base| .cse4 v_ArrVal_1544))) (store .cse26 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse26 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|))))) (select .cse25 (select (select .cse25 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= .cse4 (select .cse24 (+ 4 v_arrayElimCell_26))) (= (select .cse24 .cse5) .cse4)))) .cse8 .cse9)))) (and .cse10 (<= (+ |c_ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 1) 0) .cse0))) is different from false [2023-11-06 23:00:07,157 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse25 (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_dll_prepend_~head#1.offset|)) (.cse27 (= |c_ULTIMATE.start_dll_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (or (let ((.cse2 (+ 4 |c_ULTIMATE.start_node_create_~temp~0#1.offset|))) (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base|) .cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|))))) (let ((.cse0 (select (select .cse5 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|))) (let ((.cse6 (not .cse25)) (.cse7 (not .cse27)) (.cse26 (forall ((v_ArrVal_1544 (Array Int Int)) (v_arrayElimCell_26 Int)) (let ((.cse29 (let ((.cse30 (let ((.cse31 (store .cse5 .cse0 v_ArrVal_1544))) (store .cse31 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse31 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base|))))) (select .cse30 (select (select .cse30 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (let ((.cse28 (select .cse29 (+ 4 v_arrayElimCell_26)))) (or (= .cse28 (select .cse29 .cse2)) (< v_arrayElimCell_26 0) (= .cse28 .cse0))))))) (and (or (forall ((v_ArrVal_1544 (Array Int Int)) (v_arrayElimCell_26 Int)) (let ((.cse1 (let ((.cse3 (let ((.cse4 (store .cse5 .cse0 v_ArrVal_1544))) (store .cse4 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse4 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base|))))) (select .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= .cse0 (select .cse1 .cse2)) (= (select .cse1 (+ 4 v_arrayElimCell_26)) .cse0)))) .cse6 .cse7) (forall ((v_ArrVal_1544 (Array Int Int))) (let ((.cse8 (let ((.cse9 (let ((.cse10 (store .cse5 .cse0 v_ArrVal_1544))) (store .cse10 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse10 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base|))))) (select .cse9 (select (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= .cse0 (select .cse8 .cse2)) (forall ((v_arrayElimCell_26 Int)) (or (< v_arrayElimCell_26 0) (= (select .cse8 (+ 4 v_arrayElimCell_26)) .cse0)))))) (or (forall ((v_ArrVal_1544 (Array Int Int)) (v_arrayElimCell_26 Int)) (let ((.cse13 (let ((.cse14 (let ((.cse15 (store .cse5 .cse0 v_ArrVal_1544))) (store .cse15 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse15 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base|))))) (select .cse14 (select (select .cse14 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (let ((.cse11 (select .cse13 .cse2)) (.cse12 (select .cse13 (+ 4 v_arrayElimCell_26)))) (or (= .cse0 .cse11) (= .cse12 .cse11) (= .cse12 .cse0))))) .cse6 .cse7) (or (forall ((v_ArrVal_1544 (Array Int Int)) (v_arrayElimCell_26 Int)) (let ((.cse17 (let ((.cse18 (let ((.cse19 (store .cse5 .cse0 v_ArrVal_1544))) (store .cse19 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse19 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base|))))) (select .cse18 (select (select .cse18 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (let ((.cse16 (select .cse17 .cse2))) (or (= .cse0 .cse16) (= (select .cse17 (+ 4 v_arrayElimCell_26)) .cse16))))) .cse6 .cse7) (forall ((v_ArrVal_1544 (Array Int Int))) (let ((.cse22 (let ((.cse23 (let ((.cse24 (store .cse5 .cse0 v_ArrVal_1544))) (store .cse24 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse24 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base|))))) (select .cse23 (select (select .cse23 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (let ((.cse21 (select .cse22 .cse2))) (or (forall ((v_arrayElimCell_26 Int)) (let ((.cse20 (select .cse22 (+ 4 v_arrayElimCell_26)))) (or (= .cse20 .cse21) (< v_arrayElimCell_26 0) (= .cse20 .cse0)))) (= .cse0 .cse21))))) (or .cse25 .cse26) (or .cse27 .cse26)))))) (and .cse25 .cse27 (<= (+ |c_ULTIMATE.start_node_create_~temp~0#1.offset| 1) 0)))) is different from false [2023-11-06 23:00:07,393 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_ULTIMATE.start_dll_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse0 (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_dll_prepend_~head#1.offset|))) (or (and .cse0 .cse1 (<= (+ |c_ULTIMATE.start_node_create_~temp~0#1.offset| 1) 0)) (let ((.cse6 (+ 4 |c_ULTIMATE.start_node_create_~temp~0#1.offset|))) (let ((.cse22 (forall ((v_ArrVal_1544 (Array Int Int)) (v_ArrVal_1542 (Array Int Int)) (v_arrayElimCell_26 Int)) (let ((.cse41 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| (store v_ArrVal_1542 .cse6 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_1542) |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|))))) (let ((.cse38 (select (select .cse41 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|))) (let ((.cse37 (let ((.cse39 (let ((.cse40 (store .cse41 .cse38 v_ArrVal_1544))) (store .cse40 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse40 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base|))))) (select .cse39 (select (select .cse39 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (let ((.cse36 (select .cse37 (+ 4 v_arrayElimCell_26)))) (or (= .cse36 (select .cse37 .cse6)) (< v_arrayElimCell_26 0) (= .cse38 .cse36)))))))) (.cse10 (not .cse0)) (.cse11 (not .cse1))) (and (or (forall ((v_ArrVal_1544 (Array Int Int)) (v_ArrVal_1542 (Array Int Int)) (v_arrayElimCell_26 Int)) (let ((.cse9 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| (store v_ArrVal_1542 .cse6 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_1542) |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|))))) (let ((.cse4 (select (select .cse9 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|))) (let ((.cse5 (let ((.cse7 (let ((.cse8 (store .cse9 .cse4 v_ArrVal_1544))) (store .cse8 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse8 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base|))))) (select .cse7 (select (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (let ((.cse3 (select .cse5 .cse6)) (.cse2 (select .cse5 (+ 4 v_arrayElimCell_26)))) (or (= .cse2 .cse3) (= .cse4 .cse3) (= .cse4 .cse2))))))) .cse10 .cse11) (or .cse10 (forall ((v_ArrVal_1544 (Array Int Int)) (v_ArrVal_1542 (Array Int Int)) (v_arrayElimCell_26 Int)) (let ((.cse16 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| (store v_ArrVal_1542 .cse6 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_1542) |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|))))) (let ((.cse12 (select (select .cse16 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|))) (let ((.cse13 (let ((.cse14 (let ((.cse15 (store .cse16 .cse12 v_ArrVal_1544))) (store .cse15 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse15 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base|))))) (select .cse14 (select (select .cse14 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= .cse12 (select .cse13 .cse6)) (= .cse12 (select .cse13 (+ 4 v_arrayElimCell_26)))))))) .cse11) (forall ((v_ArrVal_1544 (Array Int Int)) (v_ArrVal_1542 (Array Int Int))) (let ((.cse21 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| (store v_ArrVal_1542 .cse6 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_1542) |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|))))) (let ((.cse17 (select (select .cse21 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|))) (let ((.cse18 (let ((.cse19 (let ((.cse20 (store .cse21 .cse17 v_ArrVal_1544))) (store .cse20 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse20 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base|))))) (select .cse19 (select (select .cse19 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (forall ((v_arrayElimCell_26 Int)) (or (< v_arrayElimCell_26 0) (= .cse17 (select .cse18 (+ 4 v_arrayElimCell_26))))) (= .cse17 (select .cse18 .cse6))))))) (or .cse1 .cse22) (or .cse0 .cse22) (forall ((v_ArrVal_1544 (Array Int Int)) (v_ArrVal_1542 (Array Int Int))) (let ((.cse29 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| (store v_ArrVal_1542 .cse6 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_1542) |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|))))) (let ((.cse25 (select (select .cse29 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|))) (let ((.cse26 (let ((.cse27 (let ((.cse28 (store .cse29 .cse25 v_ArrVal_1544))) (store .cse28 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse28 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base|))))) (select .cse27 (select (select .cse27 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (let ((.cse24 (select .cse26 .cse6))) (or (forall ((v_arrayElimCell_26 Int)) (let ((.cse23 (select .cse26 (+ 4 v_arrayElimCell_26)))) (or (= .cse23 .cse24) (< v_arrayElimCell_26 0) (= .cse25 .cse23)))) (= .cse25 .cse24))))))) (or .cse10 (forall ((v_ArrVal_1544 (Array Int Int)) (v_ArrVal_1542 (Array Int Int)) (v_arrayElimCell_26 Int)) (let ((.cse35 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| (store v_ArrVal_1542 .cse6 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_1542) |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|))))) (let ((.cse32 (select (select .cse35 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|))) (let ((.cse30 (let ((.cse33 (let ((.cse34 (store .cse35 .cse32 v_ArrVal_1544))) (store .cse34 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse34 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base|))))) (select .cse33 (select (select .cse33 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (let ((.cse31 (select .cse30 .cse6))) (or (= (select .cse30 (+ 4 v_arrayElimCell_26)) .cse31) (= .cse32 .cse31))))))) .cse11)))))) is different from false [2023-11-06 23:00:08,579 INFO L351 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 36573 treesize of output 32991 [2023-11-06 23:00:08,864 INFO L351 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 2719 treesize of output 2501 [2023-11-06 23:00:08,963 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 23:00:08,964 INFO L351 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 2572 treesize of output 2557 [2023-11-06 23:00:09,061 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 23:00:09,062 INFO L351 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 2490 treesize of output 2449 [2023-11-06 23:00:09,153 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 23:00:09,154 INFO L351 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 2651 treesize of output 2558 [2023-11-06 23:00:09,248 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 23:00:09,249 INFO L351 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 2290 treesize of output 2255 [2023-11-06 23:00:09,379 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 23:00:09,380 INFO L351 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 2372 treesize of output 2321 [2023-11-06 23:00:09,511 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 23:00:09,512 INFO L351 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 2388 treesize of output 2283 [2023-11-06 23:00:09,645 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 23:00:09,646 INFO L351 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 2174 treesize of output 2123 [2023-11-06 23:00:09,838 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 23:00:09,839 INFO L351 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 2542 treesize of output 2397 [2023-11-06 23:00:10,100 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 23:00:10,103 INFO L351 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 1910 treesize of output 1895 [2023-11-06 23:00:10,276 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 23:00:10,277 INFO L351 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 1828 treesize of output 1787 [2023-11-06 23:00:26,846 INFO L351 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 8 [2023-11-06 23:00:26,954 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 23:00:26,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1329570410] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 23:00:26,954 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 23:00:26,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 20] total 49 [2023-11-06 23:00:26,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927094306] [2023-11-06 23:00:26,955 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 23:00:26,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-11-06 23:00:26,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:00:26,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-11-06 23:00:26,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=1872, Unknown=49, NotChecked=364, Total=2450 [2023-11-06 23:00:26,959 INFO L87 Difference]: Start difference. First operand 71 states and 74 transitions. Second operand has 50 states, 49 states have (on average 2.4693877551020407) internal successors, (121), 50 states have internal predecessors, (121), 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) [2023-11-06 23:00:32,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:00:32,449 INFO L93 Difference]: Finished difference Result 110 states and 116 transitions. [2023-11-06 23:00:32,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-06 23:00:32,449 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 49 states have (on average 2.4693877551020407) internal successors, (121), 50 states have internal predecessors, (121), 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 45 [2023-11-06 23:00:32,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:00:32,450 INFO L225 Difference]: With dead ends: 110 [2023-11-06 23:00:32,451 INFO L226 Difference]: Without dead ends: 110 [2023-11-06 23:00:32,452 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 59 SyntacticMatches, 4 SemanticMatches, 66 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 924 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=432, Invalid=3558, Unknown=58, NotChecked=508, Total=4556 [2023-11-06 23:00:32,453 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 368 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 1073 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 1526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1073 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 442 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2023-11-06 23:00:32,454 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 427 Invalid, 1526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1073 Invalid, 0 Unknown, 442 Unchecked, 2.5s Time] [2023-11-06 23:00:32,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2023-11-06 23:00:32,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 74. [2023-11-06 23:00:32,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 64 states have (on average 1.25) internal successors, (80), 73 states have internal predecessors, (80), 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) [2023-11-06 23:00:32,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2023-11-06 23:00:32,457 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 45 [2023-11-06 23:00:32,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:00:32,458 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2023-11-06 23:00:32,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 49 states have (on average 2.4693877551020407) internal successors, (121), 50 states have internal predecessors, (121), 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) [2023-11-06 23:00:32,458 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2023-11-06 23:00:32,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-11-06 23:00:32,458 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:00:32,459 INFO L195 NwaCegarLoop]: trace histogram [2, 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] [2023-11-06 23:00:32,473 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4ae0f48-b9d0-476b-9506-5443330d709b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-11-06 23:00:32,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4ae0f48-b9d0-476b-9506-5443330d709b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:00:32,667 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-06 23:00:32,668 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:00:32,668 INFO L85 PathProgramCache]: Analyzing trace with hash -377366917, now seen corresponding path program 1 times [2023-11-06 23:00:32,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:00:32,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279105778] [2023-11-06 23:00:32,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:00:32,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:00:32,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:00:36,185 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:00:36,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:00:36,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279105778] [2023-11-06 23:00:36,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279105778] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 23:00:36,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2023103819] [2023-11-06 23:00:36,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:00:36,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:00:36,186 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4ae0f48-b9d0-476b-9506-5443330d709b/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:00:36,188 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4ae0f48-b9d0-476b-9506-5443330d709b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:00:36,194 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4ae0f48-b9d0-476b-9506-5443330d709b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-06 23:00:36,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:00:36,453 INFO L262 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 97 conjunts are in the unsatisfiable core [2023-11-06 23:00:36,463 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:00:36,548 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-06 23:00:36,823 INFO L322 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-06 23:00:36,824 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-11-06 23:00:36,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:00:36,950 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-06 23:00:36,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:00:36,968 INFO L351 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 17 treesize of output 12 [2023-11-06 23:00:36,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:00:36,993 INFO L351 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 17 treesize of output 12 [2023-11-06 23:00:37,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:00:37,002 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-06 23:00:37,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:00:37,027 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-06 23:00:37,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:00:37,040 INFO L351 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 17 treesize of output 12 [2023-11-06 23:00:37,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:00:37,384 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2023-11-06 23:00:37,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:00:37,399 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2023-11-06 23:00:37,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:00:37,821 INFO L322 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2023-11-06 23:00:37,822 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 61 treesize of output 61 [2023-11-06 23:00:37,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:00:37,859 INFO L322 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2023-11-06 23:00:37,859 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 27 [2023-11-06 23:00:37,900 INFO L351 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 20 [2023-11-06 23:00:38,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:00:38,135 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 46 [2023-11-06 23:00:38,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:00:38,142 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 68 [2023-11-06 23:00:38,507 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 23:00:38,508 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 28 [2023-11-06 23:00:38,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:00:38,518 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-06 23:00:38,638 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 23:00:38,638 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 23:00:39,332 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 23:00:39,332 INFO L351 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 189 treesize of output 193 [2023-11-06 23:00:39,414 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1732 (Array Int Int))) (let ((.cse1 (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_prepend_#t~mem10#1.base| v_ArrVal_1732))) (store .cse3 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse3 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.offset|))))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (< .cse0 0) (forall ((v_ArrVal_1731 (Array Int Int))) (<= 0 (+ (select (select .cse1 (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_prepend_#t~mem10#1.base| v_ArrVal_1731))) (store .cse2 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse2 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ .cse0 4)) 4))))))) (forall ((v_ArrVal_1732 (Array Int Int))) (let ((.cse5 (let ((.cse7 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_prepend_#t~mem10#1.base| v_ArrVal_1732))) (store .cse7 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse7 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.offset|))))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (< .cse4 0) (forall ((v_ArrVal_1731 (Array Int Int))) (< (select (select .cse5 (select (select (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_prepend_#t~mem10#1.base| v_ArrVal_1731))) (store .cse6 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse6 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ .cse4 4)) (+ |c_ULTIMATE.start_dll_prepend_#t~mem10#1.offset| 5))))))) (forall ((v_ArrVal_1732 (Array Int Int))) (let ((.cse8 (select (select (let ((.cse11 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_prepend_#t~mem10#1.base| v_ArrVal_1732))) (store .cse11 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse11 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.offset|))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (< .cse8 0) (forall ((v_ArrVal_1731 (Array Int Int))) (= (select (let ((.cse9 (let ((.cse10 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_prepend_#t~mem10#1.base| v_ArrVal_1731))) (store .cse10 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse10 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|))))) (select .cse9 (select (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ .cse8 4)) |c_ULTIMATE.start_dll_prepend_#t~mem10#1.base|)))))) is different from false [2023-11-06 23:00:39,483 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|))) (and (forall ((v_ArrVal_1732 (Array Int Int)) (v_ArrVal_1731 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse4 (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_1732))) (store .cse4 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse4 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.offset|))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (< .cse0 0) (= (select (let ((.cse1 (let ((.cse2 (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_1731))) (store .cse2 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse2 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|))))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ .cse0 4)) .cse3)))) (forall ((v_ArrVal_1732 (Array Int Int)) (v_ArrVal_1731 (Array Int Int))) (let ((.cse6 (let ((.cse8 (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_1732))) (store .cse8 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse8 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.offset|))))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (< .cse5 0) (< (select (select .cse6 (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_1731))) (store .cse7 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse7 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ .cse5 4)) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|) 5)))))) (forall ((v_ArrVal_1732 (Array Int Int)) (v_ArrVal_1731 (Array Int Int))) (let ((.cse10 (let ((.cse12 (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_1732))) (store .cse12 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse12 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.offset|))))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (< .cse9 0) (< 0 (+ 5 (select (select .cse10 (select (select (let ((.cse11 (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_1731))) (store .cse11 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse11 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ .cse9 4)))))))))) is different from false [2023-11-06 23:00:43,818 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse6 (+ 4 |c_ULTIMATE.start_node_create_~temp~0#1.offset|))) (and (forall ((v_ArrVal_1732 (Array Int Int)) (v_ArrVal_1731 (Array Int Int)) (v_ArrVal_1727 (Array Int Int)) (v_ArrVal_1726 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| (store v_ArrVal_1727 .cse6 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_1727) |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|))))) (let ((.cse0 (select (select .cse3 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|))) (let ((.cse4 (select (select (let ((.cse5 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| (store v_ArrVal_1726 .cse6 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_1726) |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|))) .cse0 v_ArrVal_1732))) (store .cse5 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse5 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.offset|))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= .cse0 (select (let ((.cse1 (let ((.cse2 (store .cse3 .cse0 v_ArrVal_1731))) (store .cse2 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse2 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base|))))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ 4 .cse4))) (< .cse4 0)))))) (forall ((v_ArrVal_1732 (Array Int Int)) (v_ArrVal_1731 (Array Int Int)) (v_ArrVal_1727 (Array Int Int)) (v_ArrVal_1726 (Array Int Int))) (let ((.cse9 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| (store v_ArrVal_1727 .cse6 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_1727) |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|))))) (let ((.cse10 (select (select .cse9 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|))) (let ((.cse7 (let ((.cse12 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| (store v_ArrVal_1726 .cse6 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_1726) |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|))) .cse10 v_ArrVal_1732))) (store .cse12 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse12 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.offset|))))) (let ((.cse11 (select (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (< 0 (+ 5 (select (select .cse7 (select (select (let ((.cse8 (store .cse9 .cse10 v_ArrVal_1731))) (store .cse8 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse8 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base|))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 4 .cse11)))) (< .cse11 0))))))) (forall ((v_ArrVal_1732 (Array Int Int)) (v_ArrVal_1731 (Array Int Int)) (v_ArrVal_1727 (Array Int Int)) (v_ArrVal_1726 (Array Int Int))) (let ((.cse16 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| (store v_ArrVal_1727 .cse6 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_1727) |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|))))) (let ((.cse18 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| (store v_ArrVal_1726 .cse6 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_1726) |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|)))) (.cse17 (select (select .cse16 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|))) (let ((.cse14 (let ((.cse19 (store .cse18 .cse17 v_ArrVal_1732))) (store .cse19 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse19 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.offset|))))) (let ((.cse13 (select (select .cse14 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (< .cse13 0) (< (select (select .cse14 (select (select (let ((.cse15 (store .cse16 .cse17 v_ArrVal_1731))) (store .cse15 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse15 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base|))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 4 .cse13)) (+ 5 (select (select .cse18 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|))))))))))) is different from false [2023-11-06 23:00:44,136 INFO L351 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 10050 treesize of output 9660 [2023-11-06 23:00:44,257 INFO L351 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 5629 treesize of output 4975 [2023-11-06 23:00:44,333 INFO L351 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 636 treesize of output 602 [2023-11-06 23:00:44,371 INFO L351 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 604 treesize of output 594 [2023-11-06 23:00:44,404 INFO L351 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 627 treesize of output 619 [2023-11-06 23:00:44,426 INFO L351 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 579 treesize of output 567 [2023-11-06 23:00:44,460 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 23:00:44,460 INFO L351 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 545 treesize of output 542 [2023-11-06 23:00:44,489 INFO L351 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 495 treesize of output 483 [2023-11-06 23:00:44,513 INFO L351 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 517 treesize of output 509 [2023-11-06 23:00:44,558 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 23:00:44,559 INFO L351 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 447 treesize of output 432 [2023-11-06 23:00:44,588 INFO L351 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 409 treesize of output 401 [2023-11-06 23:00:44,623 INFO L351 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 393 treesize of output 389 [2023-11-06 23:00:46,214 INFO L351 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 8 [2023-11-06 23:00:46,336 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 23:00:46,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2023103819] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 23:00:46,336 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 23:00:46,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 19, 20] total 59 [2023-11-06 23:00:46,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938549078] [2023-11-06 23:00:46,337 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 23:00:46,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2023-11-06 23:00:46,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:00:46,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2023-11-06 23:00:46,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=2989, Unknown=10, NotChecked=336, Total=3540 [2023-11-06 23:00:46,340 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand has 60 states, 59 states have (on average 2.2033898305084745) internal successors, (130), 60 states have internal predecessors, (130), 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) [2023-11-06 23:00:53,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:00:53,609 INFO L93 Difference]: Finished difference Result 130 states and 136 transitions. [2023-11-06 23:00:53,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-11-06 23:00:53,617 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 59 states have (on average 2.2033898305084745) internal successors, (130), 60 states have internal predecessors, (130), 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 45 [2023-11-06 23:00:53,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:00:53,623 INFO L225 Difference]: With dead ends: 130 [2023-11-06 23:00:53,623 INFO L226 Difference]: Without dead ends: 130 [2023-11-06 23:00:53,626 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 54 SyntacticMatches, 6 SemanticMatches, 80 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1472 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=559, Invalid=5605, Unknown=10, NotChecked=468, Total=6642 [2023-11-06 23:00:53,627 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 742 mSDsluCounter, 545 mSDsCounter, 0 mSdLazyCounter, 1260 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 742 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 1679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 390 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2023-11-06 23:00:53,628 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [742 Valid, 572 Invalid, 1679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1260 Invalid, 0 Unknown, 390 Unchecked, 3.2s Time] [2023-11-06 23:00:53,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2023-11-06 23:00:53,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 76. [2023-11-06 23:00:53,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 66 states have (on average 1.2272727272727273) internal successors, (81), 75 states have internal predecessors, (81), 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) [2023-11-06 23:00:53,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 81 transitions. [2023-11-06 23:00:53,632 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 81 transitions. Word has length 45 [2023-11-06 23:00:53,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:00:53,632 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 81 transitions. [2023-11-06 23:00:53,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 59 states have (on average 2.2033898305084745) internal successors, (130), 60 states have internal predecessors, (130), 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) [2023-11-06 23:00:53,633 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 81 transitions. [2023-11-06 23:00:53,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-11-06 23:00:53,633 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:00:53,634 INFO L195 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:00:53,648 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4ae0f48-b9d0-476b-9506-5443330d709b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-11-06 23:00:53,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4ae0f48-b9d0-476b-9506-5443330d709b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:00:53,841 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-06 23:00:53,842 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:00:53,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1186516712, now seen corresponding path program 1 times [2023-11-06 23:00:53,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:00:53,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552122538] [2023-11-06 23:00:53,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:00:53,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:00:53,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:00:55,286 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 23:00:55,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:00:55,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552122538] [2023-11-06 23:00:55,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552122538] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:00:55,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:00:55,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2023-11-06 23:00:55,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830694] [2023-11-06 23:00:55,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:00:55,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-06 23:00:55,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:00:55,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-06 23:00:55,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2023-11-06 23:00:55,289 INFO L87 Difference]: Start difference. First operand 76 states and 81 transitions. Second operand has 16 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 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) [2023-11-06 23:00:56,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:00:56,520 INFO L93 Difference]: Finished difference Result 88 states and 93 transitions. [2023-11-06 23:00:56,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-06 23:00:56,521 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), 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 46 [2023-11-06 23:00:56,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:00:56,521 INFO L225 Difference]: With dead ends: 88 [2023-11-06 23:00:56,522 INFO L226 Difference]: Without dead ends: 88 [2023-11-06 23:00:56,522 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=141, Invalid=789, Unknown=0, NotChecked=0, Total=930 [2023-11-06 23:00:56,523 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 183 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-06 23:00:56,523 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 273 Invalid, 566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 559 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-06 23:00:56,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-11-06 23:00:56,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 76. [2023-11-06 23:00:56,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 66 states have (on average 1.2121212121212122) internal successors, (80), 75 states have internal predecessors, (80), 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) [2023-11-06 23:00:56,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 80 transitions. [2023-11-06 23:00:56,526 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 80 transitions. Word has length 46 [2023-11-06 23:00:56,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:00:56,526 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 80 transitions. [2023-11-06 23:00:56,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 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) [2023-11-06 23:00:56,527 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2023-11-06 23:00:56,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-11-06 23:00:56,527 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:00:56,527 INFO L195 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:00:56,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-11-06 23:00:56,528 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-06 23:00:56,528 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:00:56,529 INFO L85 PathProgramCache]: Analyzing trace with hash 2085312466, now seen corresponding path program 1 times [2023-11-06 23:00:56,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:00:56,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346452291] [2023-11-06 23:00:56,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:00:56,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:00:56,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:00:58,294 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 23:00:58,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:00:58,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346452291] [2023-11-06 23:00:58,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346452291] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 23:00:58,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [71483665] [2023-11-06 23:00:58,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:00:58,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:00:58,295 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4ae0f48-b9d0-476b-9506-5443330d709b/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:00:58,297 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4ae0f48-b9d0-476b-9506-5443330d709b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:00:58,333 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4ae0f48-b9d0-476b-9506-5443330d709b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-06 23:00:58,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:00:58,609 INFO L262 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 69 conjunts are in the unsatisfiable core [2023-11-06 23:00:58,615 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:00:58,698 INFO L351 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 [2023-11-06 23:00:58,966 INFO L322 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-06 23:00:58,967 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-11-06 23:00:59,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:00:59,094 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2023-11-06 23:00:59,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:00:59,123 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2023-11-06 23:00:59,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:00:59,162 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2023-11-06 23:00:59,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:00:59,476 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2023-11-06 23:00:59,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:00:59,832 INFO L322 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2023-11-06 23:00:59,832 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 48 [2023-11-06 23:00:59,846 INFO L351 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 15 treesize of output 11 [2023-11-06 23:00:59,990 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-06 23:00:59,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:01:00,001 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 31 [2023-11-06 23:01:00,087 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-06 23:01:00,262 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 23:01:00,262 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 20 [2023-11-06 23:01:00,342 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 23:01:00,342 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 23:01:00,462 INFO L351 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 110 treesize of output 102 [2023-11-06 23:01:00,654 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_dll_prepend_~head#1.offset|)) (.cse3 (= |c_ULTIMATE.start_dll_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (or (and (or (forall ((v_ArrVal_1999 (Array Int Int))) (not (= (select (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_prepend_#t~mem10#1.base| v_ArrVal_1999))) (store .cse1 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse1 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|))))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ |c_ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4)) 0))) (not .cse2) (not .cse3)) (or (and .cse2 .cse3) (forall ((v_ArrVal_1999 (Array Int Int)) (v_arrayElimCell_110 Int)) (or (< v_arrayElimCell_110 0) (not (= (select (let ((.cse4 (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_prepend_#t~mem10#1.base| v_ArrVal_1999))) (store .cse5 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse5 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|))))) (select .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ v_arrayElimCell_110 4)) 0)))))) (and .cse2 (<= (+ |c_ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 1) 0) .cse3))) is different from false [2023-11-06 23:01:00,694 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_dll_prepend_~head#1.offset|)) (.cse4 (= |c_ULTIMATE.start_dll_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (or (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|))) (and (or (forall ((v_ArrVal_1999 (Array Int Int)) (v_arrayElimCell_110 Int)) (or (< v_arrayElimCell_110 0) (not (= (select (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1999))) (store .cse1 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse1 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|))))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ v_arrayElimCell_110 4)) 0)))) (and .cse3 .cse4)) (or (forall ((v_ArrVal_1999 (Array Int Int))) (not (= (select (let ((.cse5 (let ((.cse6 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1999))) (store .cse6 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse6 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|))))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ |c_ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4)) 0))) (not .cse3) (not .cse4)))) (and .cse3 (<= (+ |c_ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 1) 0) .cse4))) is different from false [2023-11-06 23:01:00,833 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse4 (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_dll_prepend_~head#1.offset|)) (.cse5 (= |c_ULTIMATE.start_dll_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (or (let ((.cse8 (+ |c_ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|) .cse8 |c_ULTIMATE.start_dll_prepend_#t~mem8#1.base|)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|))) (and (or (forall ((v_ArrVal_1999 (Array Int Int)) (v_arrayElimCell_110 Int)) (or (not (= (select (let ((.cse0 (let ((.cse1 (store .cse2 .cse3 v_ArrVal_1999))) (store .cse1 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse1 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|))))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ v_arrayElimCell_110 4)) 0)) (< v_arrayElimCell_110 0))) (and .cse4 .cse5)) (or (forall ((v_ArrVal_1999 (Array Int Int))) (not (= (select (let ((.cse6 (let ((.cse7 (store .cse2 .cse3 v_ArrVal_1999))) (store .cse7 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse7 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|))))) (select .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse8) 0))) (not .cse4) (not .cse5)))))) (and .cse4 (<= (+ |c_ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 1) 0) .cse5))) is different from false [2023-11-06 23:01:01,987 INFO L351 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 1925 treesize of output 1781 [2023-11-06 23:01:02,004 INFO L351 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 197 treesize of output 183 [2023-11-06 23:01:02,019 INFO L351 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 160 treesize of output 144 [2023-11-06 23:01:02,027 INFO L351 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 166 treesize of output 158 [2023-11-06 23:01:02,823 INFO L351 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 8 [2023-11-06 23:01:02,919 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 23:01:02,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [71483665] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 23:01:02,919 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 23:01:02,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 21] total 51 [2023-11-06 23:01:02,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950756941] [2023-11-06 23:01:02,920 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 23:01:02,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2023-11-06 23:01:02,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:01:02,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2023-11-06 23:01:02,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=2057, Unknown=32, NotChecked=282, Total=2550 [2023-11-06 23:01:02,923 INFO L87 Difference]: Start difference. First operand 76 states and 80 transitions. Second operand has 51 states, 51 states have (on average 2.4705882352941178) internal successors, (126), 51 states have internal predecessors, (126), 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) [2023-11-06 23:01:05,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:01:05,683 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2023-11-06 23:01:05,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-11-06 23:01:05,684 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 2.4705882352941178) internal successors, (126), 51 states have internal predecessors, (126), 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 48 [2023-11-06 23:01:05,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:01:05,684 INFO L225 Difference]: With dead ends: 93 [2023-11-06 23:01:05,685 INFO L226 Difference]: Without dead ends: 93 [2023-11-06 23:01:05,687 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 66 SyntacticMatches, 3 SemanticMatches, 69 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1051 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=497, Invalid=4035, Unknown=36, NotChecked=402, Total=4970 [2023-11-06 23:01:05,687 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 196 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 1094 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 1380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1094 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 276 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-11-06 23:01:05,688 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 531 Invalid, 1380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1094 Invalid, 0 Unknown, 276 Unchecked, 1.2s Time] [2023-11-06 23:01:05,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2023-11-06 23:01:05,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 76. [2023-11-06 23:01:05,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 66 states have (on average 1.196969696969697) internal successors, (79), 75 states have internal predecessors, (79), 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) [2023-11-06 23:01:05,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2023-11-06 23:01:05,691 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 48 [2023-11-06 23:01:05,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:01:05,691 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2023-11-06 23:01:05,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 2.4705882352941178) internal successors, (126), 51 states have internal predecessors, (126), 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) [2023-11-06 23:01:05,692 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2023-11-06 23:01:05,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-11-06 23:01:05,692 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:01:05,692 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 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] [2023-11-06 23:01:05,699 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4ae0f48-b9d0-476b-9506-5443330d709b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-11-06 23:01:05,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4ae0f48-b9d0-476b-9506-5443330d709b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:01:05,899 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2023-11-06 23:01:05,899 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:01:05,900 INFO L85 PathProgramCache]: Analyzing trace with hash -519191680, now seen corresponding path program 2 times [2023-11-06 23:01:05,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:01:05,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206610185] [2023-11-06 23:01:05,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:01:05,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:01:05,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:01:08,918 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:01:08,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:01:08,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206610185] [2023-11-06 23:01:08,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206610185] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 23:01:08,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1762276792] [2023-11-06 23:01:08,919 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 23:01:08,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:01:08,919 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4ae0f48-b9d0-476b-9506-5443330d709b/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:01:08,920 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4ae0f48-b9d0-476b-9506-5443330d709b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:01:08,923 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4ae0f48-b9d0-476b-9506-5443330d709b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-11-06 23:01:09,271 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-06 23:01:09,272 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 23:01:09,276 INFO L262 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 123 conjunts are in the unsatisfiable core [2023-11-06 23:01:09,283 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:01:09,287 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-06 23:01:09,367 INFO L322 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-06 23:01:09,368 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2023-11-06 23:01:09,564 INFO L322 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2023-11-06 23:01:09,564 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 33 [2023-11-06 23:01:09,704 INFO L351 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 11 treesize of output 7 [2023-11-06 23:01:09,828 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-06 23:01:09,989 INFO L322 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-06 23:01:09,990 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 38 [2023-11-06 23:01:10,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:01:10,376 INFO L322 Elim1Store]: treesize reduction 92, result has 31.9 percent of original size [2023-11-06 23:01:10,377 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 41 treesize of output 60 [2023-11-06 23:01:10,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:01:10,598 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-06 23:01:10,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:01:10,618 INFO L322 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-11-06 23:01:10,618 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 86 treesize of output 61 [2023-11-06 23:01:10,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:01:10,674 INFO L322 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-11-06 23:01:10,674 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 86 treesize of output 61 [2023-11-06 23:01:10,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:01:10,706 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-06 23:01:10,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:01:10,760 INFO L322 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-11-06 23:01:10,760 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 86 treesize of output 61 [2023-11-06 23:01:10,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:01:10,786 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-06 23:01:11,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:01:11,377 INFO L322 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-06 23:01:11,378 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 93 treesize of output 61 [2023-11-06 23:01:11,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:01:11,425 INFO L351 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2023-11-06 23:01:12,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:01:12,007 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-06 23:01:12,008 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 124 treesize of output 72 [2023-11-06 23:01:12,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:01:12,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:01:12,035 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 21 [2023-11-06 23:01:12,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:01:12,261 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-06 23:01:12,261 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 93 treesize of output 51 [2023-11-06 23:01:12,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:01:12,281 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2023-11-06 23:01:12,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:01:12,874 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2023-11-06 23:01:13,495 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-06 23:01:13,496 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 111 treesize of output 41 [2023-11-06 23:01:13,934 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:01:13,935 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 23:01:15,152 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2192 Int) (v_ArrVal_2194 (Array Int Int))) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|))) (let ((.cse5 (let ((.cse8 (store |c_#memory_$Pointer$.offset| .cse7 v_ArrVal_2194))) (store .cse8 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse8 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.offset|))))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse0 (let ((.cse6 (store |c_#memory_$Pointer$.base| .cse7 (store (select |c_#memory_$Pointer$.base| .cse7) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|) 8) v_ArrVal_2192)))) (store .cse6 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse6 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|))))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (+ 4 .cse4))) (let ((.cse3 (select (select .cse5 .cse1) .cse2))) (or (= (select |c_#valid| (select (select .cse0 (select (select .cse0 .cse1) .cse2)) (+ .cse3 4))) 1) (< .cse4 0) (< .cse3 0)))))))) is different from false [2023-11-06 23:01:15,209 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2194 (Array Int Int)) (v_ArrVal_2192 Int)) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|))) (let ((.cse5 (let ((.cse8 (store |c_#memory_$Pointer$.offset| .cse7 v_ArrVal_2194))) (store .cse8 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse8 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.offset|))))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse0 (let ((.cse6 (store |c_#memory_$Pointer$.base| .cse7 (store (select |c_#memory_$Pointer$.base| .cse7) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|) 8) v_ArrVal_2192)))) (store .cse6 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse6 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|))))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (+ 4 .cse4))) (let ((.cse3 (select (select .cse5 .cse1) .cse2))) (or (= (select |c_#valid| (select (select .cse0 (select (select .cse0 .cse1) .cse2)) (+ .cse3 4))) 1) (< .cse4 0) (< .cse3 0)))))))) is different from false [2023-11-06 23:01:19,558 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2188 (Array Int Int)) (v_ArrVal_2187 (Array Int Int)) (v_ArrVal_2192 Int) (v_ArrVal_2194 (Array Int Int))) (let ((.cse11 (+ 4 |c_ULTIMATE.start_node_create_~temp~0#1.offset|))) (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| (store v_ArrVal_2188 .cse11 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2188) |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|))))) (let ((.cse9 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| (store v_ArrVal_2187 .cse11 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2187) |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|)))) (.cse8 (select (select .cse7 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|))) (let ((.cse5 (let ((.cse10 (store .cse9 .cse8 v_ArrVal_2194))) (store .cse10 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse10 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.offset|))))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (let ((.cse6 (store .cse7 .cse8 (store (select .cse7 .cse8) (+ (select (select .cse9 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|) 8) v_ArrVal_2192)))) (store .cse6 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse6 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base|))))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (+ 4 .cse4))) (let ((.cse0 (select (select .cse5 .cse2) .cse3))) (or (< .cse0 0) (= (select |c_#valid| (select (select .cse1 (select (select .cse1 .cse2) .cse3)) (+ .cse0 4))) 1) (< .cse4 0)))))))))) is different from false [2023-11-06 23:01:19,704 INFO L351 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 47155 treesize of output 46273 [2023-11-06 23:01:19,752 INFO L351 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 2277 treesize of output 2221 [2023-11-06 23:01:19,775 INFO L351 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 4459 treesize of output 4443 [2023-11-06 23:01:19,805 INFO L351 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 1597 treesize of output 1555 [2023-11-06 23:01:58,452 INFO L322 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2023-11-06 23:01:58,453 INFO L351 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 450 treesize of output 312 [2023-11-06 23:02:00,166 INFO L322 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2023-11-06 23:02:00,166 INFO L351 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 339 treesize of output 238 [2023-11-06 23:02:00,216 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:00,229 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 23:02:00,230 INFO L351 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 339 treesize of output 238 [2023-11-06 23:02:02,110 INFO L322 Elim1Store]: treesize reduction 20, result has 44.4 percent of original size [2023-11-06 23:02:02,110 INFO L351 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 345 treesize of output 245 [2023-11-06 23:02:02,163 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:02,175 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 23:02:02,175 INFO L351 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 340 treesize of output 239 [2023-11-06 23:02:02,179 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:02,180 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:02,192 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:02,288 INFO L322 Elim1Store]: treesize reduction 53, result has 48.0 percent of original size [2023-11-06 23:02:02,289 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 170 treesize of output 195 [2023-11-06 23:02:03,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:02:03,801 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:03,802 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:03,836 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 23:02:03,836 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 4 case distinctions, treesize of input 363 treesize of output 377 [2023-11-06 23:02:04,309 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:04,315 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:04,316 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:04,316 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:04,324 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:04,364 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 23:02:04,365 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 616 treesize of output 628 [2023-11-06 23:02:07,674 INFO L322 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2023-11-06 23:02:07,675 INFO L351 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 340 treesize of output 239 [2023-11-06 23:02:07,679 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:07,701 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:07,994 INFO L322 Elim1Store]: treesize reduction 294, result has 22.8 percent of original size [2023-11-06 23:02:07,995 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 18 case distinctions, treesize of input 1293 treesize of output 1264 [2023-11-06 23:02:09,192 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:09,208 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:09,298 INFO L322 Elim1Store]: treesize reduction 8, result has 87.7 percent of original size [2023-11-06 23:02:09,299 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 1296 treesize of output 1304 [2023-11-06 23:02:09,693 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:09,695 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:09,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:02:09,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:02:09,762 INFO L322 Elim1Store]: treesize reduction 69, result has 28.1 percent of original size [2023-11-06 23:02:09,763 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 67 treesize of output 52 [2023-11-06 23:02:09,774 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:09,788 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 23:02:09,788 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 36 [2023-11-06 23:02:09,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:02:09,857 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:09,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:02:09,862 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:09,863 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:09,869 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-06 23:02:09,869 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 1 [2023-11-06 23:02:09,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:02:09,885 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:09,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:02:09,892 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:09,893 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:09,900 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-06 23:02:09,900 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 1 [2023-11-06 23:02:10,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:02:10,969 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:10,974 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:10,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:02:10,975 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:10,979 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:10,979 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:10,985 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-06 23:02:10,985 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 1 [2023-11-06 23:02:10,999 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:11,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:02:11,000 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:11,001 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:11,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:02:11,003 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:11,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:02:11,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:02:11,017 INFO L322 Elim1Store]: treesize reduction 41, result has 2.4 percent of original size [2023-11-06 23:02:11,017 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 1 [2023-11-06 23:02:11,035 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:11,041 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:11,043 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:11,045 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:11,046 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:11,070 INFO L322 Elim1Store]: treesize reduction 25, result has 35.9 percent of original size [2023-11-06 23:02:11,070 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 153 treesize of output 150 [2023-11-06 23:02:11,135 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:11,139 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:11,140 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:11,141 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 25 [2023-11-06 23:02:11,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:02:11,830 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:11,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:02:11,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:02:11,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:02:11,841 INFO L322 Elim1Store]: treesize reduction 5, result has 16.7 percent of original size [2023-11-06 23:02:11,841 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 1 [2023-11-06 23:02:11,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:02:11,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:02:11,858 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:11,859 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 29 [2023-11-06 23:02:11,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:02:11,874 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:11,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:02:11,879 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:11,884 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 29 [2023-11-06 23:02:13,155 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:13,159 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:13,167 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:13,168 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:13,168 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:13,176 INFO L322 Elim1Store]: treesize reduction 44, result has 2.2 percent of original size [2023-11-06 23:02:13,177 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 312 treesize of output 1 [2023-11-06 23:02:13,191 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:13,203 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:13,209 INFO L322 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2023-11-06 23:02:13,210 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 566 treesize of output 1 [2023-11-06 23:02:13,222 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:13,226 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:13,231 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:13,239 INFO L322 Elim1Store]: treesize reduction 34, result has 2.9 percent of original size [2023-11-06 23:02:13,239 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 4 case distinctions, treesize of input 307 treesize of output 1 [2023-11-06 23:02:13,259 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:13,263 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:13,269 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:13,277 INFO L322 Elim1Store]: treesize reduction 34, result has 2.9 percent of original size [2023-11-06 23:02:13,278 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 4 case distinctions, treesize of input 607 treesize of output 1 [2023-11-06 23:02:13,302 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:13,307 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:13,317 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:13,317 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:13,318 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:13,329 INFO L322 Elim1Store]: treesize reduction 44, result has 2.2 percent of original size [2023-11-06 23:02:13,330 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 612 treesize of output 1 [2023-11-06 23:02:13,343 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:13,348 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:13,355 INFO L322 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2023-11-06 23:02:13,355 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 282 treesize of output 1 [2023-11-06 23:02:14,749 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:14,750 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:14,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:02:14,756 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:14,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:02:14,758 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:14,759 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 25 [2023-11-06 23:02:15,927 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:15,931 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:15,932 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:15,933 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2023-11-06 23:02:17,126 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:17,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:02:17,136 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:17,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:02:17,147 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-06 23:02:17,148 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 1188 treesize of output 1144 [2023-11-06 23:02:17,498 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:17,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:02:17,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:02:17,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:02:17,506 INFO L351 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 50 [2023-11-06 23:02:17,888 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:17,889 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:17,889 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:17,890 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:17,890 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:17,891 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:17,894 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-11-06 23:02:17,904 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:17,904 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:17,905 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:17,905 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:17,906 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:17,909 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-11-06 23:02:18,065 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:18,066 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:18,067 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:18,067 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:18,068 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:18,068 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:18,072 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-11-06 23:02:18,915 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:18,917 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:18,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:02:18,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:02:18,939 INFO L322 Elim1Store]: treesize reduction 34, result has 19.0 percent of original size [2023-11-06 23:02:18,939 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 25 [2023-11-06 23:02:18,980 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:18,980 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:18,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:02:18,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:02:18,984 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 9 [2023-11-06 23:02:19,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:02:19,011 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:19,015 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:19,024 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 23:02:19,024 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 38 [2023-11-06 23:02:19,046 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:19,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:02:19,050 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:19,054 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:19,081 INFO L322 Elim1Store]: treesize reduction 15, result has 48.3 percent of original size [2023-11-06 23:02:19,081 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 93 treesize of output 94 [2023-11-06 23:02:33,007 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:33,007 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:33,008 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:33,015 INFO L322 Elim1Store]: treesize reduction 5, result has 16.7 percent of original size [2023-11-06 23:02:33,015 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 1 [2023-11-06 23:02:33,019 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:33,023 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:33,024 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:33,025 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 25 [2023-11-06 23:02:33,731 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:33,731 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:33,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:02:33,737 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:33,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:02:33,739 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:33,740 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:33,741 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 29 [2023-11-06 23:02:33,778 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:33,779 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:33,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:02:33,784 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:33,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:02:33,786 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:33,787 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:33,787 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 29 [2023-11-06 23:02:33,821 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:33,821 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:33,822 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:33,828 INFO L322 Elim1Store]: treesize reduction 5, result has 16.7 percent of original size [2023-11-06 23:02:33,829 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 1 [2023-11-06 23:02:33,833 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:33,837 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:33,837 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:33,838 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 25 [2023-11-06 23:02:33,901 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:33,905 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:33,905 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:33,906 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 25 [2023-11-06 23:02:34,084 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:34,087 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:34,088 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:34,089 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 25 [2023-11-06 23:02:42,660 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:42,686 INFO L322 Elim1Store]: treesize reduction 9, result has 47.1 percent of original size [2023-11-06 23:02:42,686 INFO L351 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 95 treesize of output 91 [2023-11-06 23:02:55,202 WARN L861 $PredicateComparison]: unable to prove that (or (let ((.cse5 (= |c_ULTIMATE.start_main_~#s~0#1.offset| 4))) (let ((.cse41 (not .cse5)) (.cse14 (< |c_ULTIMATE.start_dll_create_#res#1.offset| 0)) (.cse4 (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 8)) (.cse23 (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4))) (let ((.cse739 (or .cse5 (forall ((v_arrayElimCell_157 Int) (v_arrayElimCell_156 Int) (v_ArrVal_2188 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_27| Int) (v_ArrVal_2182 Int) (v_ArrVal_2192 Int)) (let ((.cse1419 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2188) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (let ((.cse1415 (select (select .cse1419 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1416 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2182)) (.cse1420 (select .cse1419 .cse1415))) (or (not (= .cse1415 |c_ULTIMATE.start_main_~#s~0#1.base|)) (< v_arrayElimCell_157 0) (= (select .cse1416 (select (let ((.cse1417 (let ((.cse1418 (store .cse1419 .cse1415 (store .cse1420 .cse4 v_ArrVal_2192)))) (store .cse1418 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse1418 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse1417 (select (select .cse1417 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) .cse23)) 1) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_node_create_~temp~0#1.base_27| 1)) (= |v_ULTIMATE.start_node_create_~temp~0#1.base_27| .cse1415) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 0)) (= (select .cse1416 (select (let ((.cse1421 (let ((.cse1422 (store .cse1419 .cse1415 (store .cse1420 (+ v_arrayElimCell_156 8) v_ArrVal_2192)))) (store .cse1422 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse1422 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse1421 (select (select .cse1421 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) (+ v_arrayElimCell_157 4))) 1)))))))) (.cse758 (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_27| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_node_create_~temp~0#1.base_27| 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 0)) (forall ((v_ArrVal_2188 (Array Int Int))) (let ((.cse1414 (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2188) |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse1410 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select .cse1414 |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (let ((.cse1406 (select (select .cse1410 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse1406 |c_ULTIMATE.start_main_~#s~0#1.base|)) (forall ((v_arrayElimCell_157 Int) (v_arrayElimCell_156 Int) (v_ArrVal_2182 Int) (v_ArrVal_2192 Int)) (let ((.cse1407 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2182)) (.cse1411 (select .cse1410 .cse1406))) (or (< v_arrayElimCell_156 0) (< v_arrayElimCell_157 0) (= (select .cse1407 (select (let ((.cse1408 (let ((.cse1409 (store .cse1410 .cse1406 (store .cse1411 .cse4 v_ArrVal_2192)))) (store .cse1409 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse1409 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse1408 (select (select .cse1408 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) .cse23)) 1) (= (select .cse1407 (select (let ((.cse1412 (let ((.cse1413 (store .cse1410 .cse1406 (store .cse1411 (+ v_arrayElimCell_156 8) v_ArrVal_2192)))) (store .cse1413 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse1413 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse1412 (select (select .cse1412 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) (+ v_arrayElimCell_157 4))) 1)))) (= |v_ULTIMATE.start_node_create_~temp~0#1.base_27| .cse1406) (= |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select .cse1414 4))) |c_ULTIMATE.start_main_~#s~0#1.base|) 4)))))))))) (.cse760 (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_27| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_node_create_~temp~0#1.base_27| 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 0)) (forall ((v_ArrVal_2188 (Array Int Int))) (let ((.cse1399 (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2188) |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse1402 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select .cse1399 |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (let ((.cse1392 (select (select .cse1402 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse1392 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |v_ULTIMATE.start_node_create_~temp~0#1.base_27| .cse1392) (forall ((v_arrayElimCell_157 Int)) (or (< v_arrayElimCell_157 0) (forall ((v_ArrVal_2182 Int) (v_ArrVal_2192 Int)) (let ((.cse1393 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2182)) (.cse1403 (select .cse1402 .cse1392))) (or (forall ((v_arrayElimCell_156 Int)) (let ((.cse1398 (+ v_arrayElimCell_156 8))) (or (< v_arrayElimCell_156 0) (= (select .cse1393 (select (let ((.cse1394 (let ((.cse1395 (let ((.cse1396 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select .cse1399 4))))) (let ((.cse1397 (select (select .cse1396 |c_ULTIMATE.start_main_~#s~0#1.base|) 4))) (store .cse1396 .cse1397 (store (select .cse1396 .cse1397) .cse1398 v_ArrVal_2192)))))) (store .cse1395 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse1395 |c_ULTIMATE.start_main_~#s~0#1.base|) 4 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse1394 (select (select .cse1394 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) 4)) 1) (= (select .cse1393 (select (let ((.cse1400 (let ((.cse1401 (store .cse1402 .cse1392 (store .cse1403 .cse1398 v_ArrVal_2192)))) (store .cse1401 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse1401 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse1400 (select (select .cse1400 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) (+ v_arrayElimCell_157 4))) 1)))) (= (select .cse1393 (select (let ((.cse1404 (let ((.cse1405 (store .cse1402 .cse1392 (store .cse1403 .cse4 v_ArrVal_2192)))) (store .cse1405 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse1405 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse1404 (select (select .cse1404 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) .cse23)) 1)))))))))))))) (.cse718 (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_27| Int)) (or (forall ((v_ArrVal_2188 (Array Int Int))) (let ((.cse1387 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2188) |c_ULTIMATE.start_main_~#s~0#1.base|) 4))))) (let ((.cse1383 (select (select .cse1387 |c_ULTIMATE.start_main_~#s~0#1.base|) 4))) (or (not (= .cse1383 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |v_ULTIMATE.start_node_create_~temp~0#1.base_27| .cse1383) (forall ((v_arrayElimCell_157 Int) (v_ArrVal_2182 Int) (v_ArrVal_2192 Int)) (let ((.cse1384 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2182)) (.cse1388 (select .cse1387 .cse1383))) (or (= (select .cse1384 (select (let ((.cse1385 (let ((.cse1386 (store .cse1387 .cse1383 (store .cse1388 .cse4 v_ArrVal_2192)))) (store .cse1386 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse1386 |c_ULTIMATE.start_main_~#s~0#1.base|) 4 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse1385 (select (select .cse1385 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) .cse23)) 1) (forall ((v_arrayElimCell_156 Int)) (let ((.cse1389 (let ((.cse1390 (let ((.cse1391 (store .cse1387 .cse1383 (store .cse1388 (+ v_arrayElimCell_156 8) v_ArrVal_2192)))) (store .cse1391 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse1391 |c_ULTIMATE.start_main_~#s~0#1.base|) 4 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse1390 (select (select .cse1390 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))))) (or (< v_arrayElimCell_156 0) (= (select .cse1384 (select .cse1389 4)) 1) (= (select .cse1384 (select .cse1389 (+ v_arrayElimCell_157 4))) 1))))))))))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_node_create_~temp~0#1.base_27| 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 0))))) (.cse719 (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_27| Int)) (or (forall ((v_ArrVal_2188 (Array Int Int))) (let ((.cse1379 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2188) |c_ULTIMATE.start_main_~#s~0#1.base|) 4))))) (let ((.cse1375 (select (select .cse1379 |c_ULTIMATE.start_main_~#s~0#1.base|) 4))) (or (not (= .cse1375 |c_ULTIMATE.start_main_~#s~0#1.base|)) (forall ((v_arrayElimCell_157 Int) (v_arrayElimCell_156 Int) (v_ArrVal_2182 Int) (v_ArrVal_2192 Int)) (let ((.cse1376 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2182)) (.cse1380 (select .cse1379 .cse1375))) (or (= (select .cse1376 (select (let ((.cse1377 (let ((.cse1378 (store .cse1379 .cse1375 (store .cse1380 (+ v_arrayElimCell_156 8) v_ArrVal_2192)))) (store .cse1378 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse1378 |c_ULTIMATE.start_main_~#s~0#1.base|) 4 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse1377 (select (select .cse1377 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) (+ v_arrayElimCell_157 4))) 1) (= (select .cse1376 (select (let ((.cse1381 (let ((.cse1382 (store .cse1379 .cse1375 (store .cse1380 .cse4 v_ArrVal_2192)))) (store .cse1382 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse1382 |c_ULTIMATE.start_main_~#s~0#1.base|) 4 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse1381 (select (select .cse1381 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) .cse23)) 1)))) (= |v_ULTIMATE.start_node_create_~temp~0#1.base_27| .cse1375))))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_node_create_~temp~0#1.base_27| 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 0))))) (.cse720 (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_27| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_node_create_~temp~0#1.base_27| 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 0)) (forall ((v_ArrVal_2188 (Array Int Int))) (let ((.cse1371 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2188) |c_ULTIMATE.start_main_~#s~0#1.base|) 4))))) (let ((.cse1366 (select (select .cse1371 |c_ULTIMATE.start_main_~#s~0#1.base|) 4))) (or (not (= .cse1366 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |v_ULTIMATE.start_node_create_~temp~0#1.base_27| .cse1366) (forall ((v_arrayElimCell_157 Int) (v_ArrVal_2182 Int) (v_ArrVal_2192 Int)) (let ((.cse1367 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2182)) (.cse1372 (select .cse1371 .cse1366))) (or (forall ((v_arrayElimCell_156 Int)) (let ((.cse1368 (let ((.cse1369 (let ((.cse1370 (store .cse1371 .cse1366 (store .cse1372 (+ v_arrayElimCell_156 8) v_ArrVal_2192)))) (store .cse1370 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse1370 |c_ULTIMATE.start_main_~#s~0#1.base|) 4 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse1369 (select (select .cse1369 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))))) (or (= (select .cse1367 (select .cse1368 4)) 1) (= (select .cse1367 (select .cse1368 (+ v_arrayElimCell_157 4))) 1)))) (= (select .cse1367 (select (let ((.cse1373 (let ((.cse1374 (store .cse1371 .cse1366 (store .cse1372 .cse4 v_ArrVal_2192)))) (store .cse1374 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse1374 |c_ULTIMATE.start_main_~#s~0#1.base|) 4 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse1373 (select (select .cse1373 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) .cse23)) 1))))))))))) (.cse729 (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_27| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_node_create_~temp~0#1.base_27| 1)) (forall ((v_ArrVal_2188 (Array Int Int))) (let ((.cse1362 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2188) |c_ULTIMATE.start_main_~#s~0#1.base|) 4))))) (let ((.cse1358 (select (select .cse1362 |c_ULTIMATE.start_main_~#s~0#1.base|) 4))) (or (not (= .cse1358 |c_ULTIMATE.start_main_~#s~0#1.base|)) (forall ((v_arrayElimCell_157 Int) (v_arrayElimCell_156 Int) (v_ArrVal_2182 Int) (v_ArrVal_2192 Int)) (let ((.cse1359 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2182)) (.cse1363 (select .cse1362 .cse1358))) (or (< v_arrayElimCell_156 0) (= (select .cse1359 (select (let ((.cse1360 (let ((.cse1361 (store .cse1362 .cse1358 (store .cse1363 (+ v_arrayElimCell_156 8) v_ArrVal_2192)))) (store .cse1361 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse1361 |c_ULTIMATE.start_main_~#s~0#1.base|) 4 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse1360 (select (select .cse1360 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) (+ v_arrayElimCell_157 4))) 1) (= (select .cse1359 (select (let ((.cse1364 (let ((.cse1365 (store .cse1362 .cse1358 (store .cse1363 .cse4 v_ArrVal_2192)))) (store .cse1365 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse1365 |c_ULTIMATE.start_main_~#s~0#1.base|) 4 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse1364 (select (select .cse1364 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) .cse23)) 1)))) (= |v_ULTIMATE.start_node_create_~temp~0#1.base_27| .cse1358))))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 0))))) (.cse776 (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_27| Int)) (or (forall ((v_ArrVal_2188 (Array Int Int))) (let ((.cse1350 (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2188) |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse1354 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select .cse1350 |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (let ((.cse1349 (select (select .cse1354 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse1349 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |v_ULTIMATE.start_node_create_~temp~0#1.base_27| .cse1349) (= |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select .cse1350 4))) |c_ULTIMATE.start_main_~#s~0#1.base|) 4)) (forall ((v_arrayElimCell_157 Int) (v_arrayElimCell_156 Int) (v_ArrVal_2182 Int) (v_ArrVal_2192 Int)) (let ((.cse1351 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2182)) (.cse1355 (select .cse1354 .cse1349))) (or (< v_arrayElimCell_157 0) (= (select .cse1351 (select (let ((.cse1352 (let ((.cse1353 (store .cse1354 .cse1349 (store .cse1355 .cse4 v_ArrVal_2192)))) (store .cse1353 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse1353 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse1352 (select (select .cse1352 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) .cse23)) 1) (= (select .cse1351 (select (let ((.cse1356 (let ((.cse1357 (store .cse1354 .cse1349 (store .cse1355 (+ v_arrayElimCell_156 8) v_ArrVal_2192)))) (store .cse1357 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse1357 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse1356 (select (select .cse1356 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) (+ v_arrayElimCell_157 4))) 1))))))))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_node_create_~temp~0#1.base_27| 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 0))))) (.cse785 (or .cse5 (forall ((v_arrayElimCell_157 Int) (v_arrayElimCell_156 Int) (v_ArrVal_2188 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_27| Int) (v_ArrVal_2182 Int) (v_ArrVal_2192 Int)) (let ((.cse1345 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2188) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (let ((.cse1341 (select (select .cse1345 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1342 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2182)) (.cse1346 (select .cse1345 .cse1341))) (or (< v_arrayElimCell_156 0) (not (= .cse1341 |c_ULTIMATE.start_main_~#s~0#1.base|)) (< v_arrayElimCell_157 0) (= (select .cse1342 (select (let ((.cse1343 (let ((.cse1344 (store .cse1345 .cse1341 (store .cse1346 .cse4 v_ArrVal_2192)))) (store .cse1344 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse1344 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse1343 (select (select .cse1343 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) .cse23)) 1) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_node_create_~temp~0#1.base_27| 1)) (= |v_ULTIMATE.start_node_create_~temp~0#1.base_27| .cse1341) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 0)) (= (select .cse1342 (select (let ((.cse1347 (let ((.cse1348 (store .cse1345 .cse1341 (store .cse1346 (+ v_arrayElimCell_156 8) v_ArrVal_2192)))) (store .cse1348 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse1348 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse1347 (select (select .cse1347 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) (+ v_arrayElimCell_157 4))) 1)))))))) (.cse786 (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_27| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_node_create_~temp~0#1.base_27| 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 0)) (forall ((v_ArrVal_2188 (Array Int Int))) (let ((.cse1334 (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2188) |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse1337 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select .cse1334 |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (let ((.cse1327 (select (select .cse1337 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse1327 |c_ULTIMATE.start_main_~#s~0#1.base|)) (forall ((v_arrayElimCell_157 Int)) (or (forall ((v_ArrVal_2182 Int) (v_ArrVal_2192 Int)) (let ((.cse1328 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2182)) (.cse1338 (select .cse1337 .cse1327))) (or (forall ((v_arrayElimCell_156 Int)) (let ((.cse1333 (+ v_arrayElimCell_156 8))) (or (= (select .cse1328 (select (let ((.cse1329 (let ((.cse1330 (let ((.cse1331 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select .cse1334 4))))) (let ((.cse1332 (select (select .cse1331 |c_ULTIMATE.start_main_~#s~0#1.base|) 4))) (store .cse1331 .cse1332 (store (select .cse1331 .cse1332) .cse1333 v_ArrVal_2192)))))) (store .cse1330 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse1330 |c_ULTIMATE.start_main_~#s~0#1.base|) 4 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse1329 (select (select .cse1329 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) 4)) 1) (= (select .cse1328 (select (let ((.cse1335 (let ((.cse1336 (store .cse1337 .cse1327 (store .cse1338 .cse1333 v_ArrVal_2192)))) (store .cse1336 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse1336 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse1335 (select (select .cse1335 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) (+ v_arrayElimCell_157 4))) 1)))) (= (select .cse1328 (select (let ((.cse1339 (let ((.cse1340 (store .cse1337 .cse1327 (store .cse1338 .cse4 v_ArrVal_2192)))) (store .cse1340 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse1340 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse1339 (select (select .cse1339 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) .cse23)) 1)))) (< v_arrayElimCell_157 0))) (= |v_ULTIMATE.start_node_create_~temp~0#1.base_27| .cse1327))))))))) (.cse154 (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (.cse155 (< |c_#StackHeapBarrier| (+ 1 |c_ULTIMATE.start_main_~#s~0#1.base|))) (.cse245 (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_27| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_node_create_~temp~0#1.base_27| 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 0)) (forall ((v_arrayElimCell_156 Int)) (or (< v_arrayElimCell_156 0) (forall ((v_arrayElimCell_157 Int)) (or (< v_arrayElimCell_157 0) (forall ((v_ArrVal_2188 (Array Int Int)) (v_ArrVal_2182 Int) (v_ArrVal_2192 Int)) (let ((.cse1323 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2188) |c_ULTIMATE.start_main_~#s~0#1.base|) 4))))) (let ((.cse1316 (select (select .cse1323 |c_ULTIMATE.start_main_~#s~0#1.base|) 4))) (let ((.cse1324 (select .cse1323 .cse1316))) (let ((.cse1318 (let ((.cse1325 (let ((.cse1326 (store .cse1323 .cse1316 (store .cse1324 (+ v_arrayElimCell_156 8) v_ArrVal_2192)))) (store .cse1326 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse1326 |c_ULTIMATE.start_main_~#s~0#1.base|) 4 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse1325 (select (select .cse1325 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4)))) (.cse1320 (+ v_arrayElimCell_157 4)) (.cse1317 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2182)) (.cse1319 (let ((.cse1321 (let ((.cse1322 (store .cse1323 .cse1316 (store .cse1324 .cse4 v_ArrVal_2192)))) (store .cse1322 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse1322 |c_ULTIMATE.start_main_~#s~0#1.base|) 4 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse1321 (select (select .cse1321 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))))) (or (not (= |v_ULTIMATE.start_node_create_~temp~0#1.base_27| .cse1316)) (= (select .cse1317 (select .cse1318 4)) 1) (= (select .cse1317 (select .cse1319 .cse1320)) 1) (= (select .cse1317 (select .cse1318 .cse1320)) 1) (= (select .cse1317 (select .cse1319 .cse23)) 1)))))))))))))) (.cse246 (or .cse14 (forall ((v_arrayElimCell_157 Int) (v_arrayElimCell_156 Int) (v_ArrVal_2188 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_27| Int) (v_ArrVal_2182 Int) (v_ArrVal_2192 Int)) (let ((.cse1312 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2188) |c_ULTIMATE.start_main_~#s~0#1.base|) 4))))) (let ((.cse1309 (select (select .cse1312 |c_ULTIMATE.start_main_~#s~0#1.base|) 4))) (let ((.cse1313 (select .cse1312 .cse1309))) (let ((.cse1306 (let ((.cse1314 (let ((.cse1315 (store .cse1312 .cse1309 (store .cse1313 (+ v_arrayElimCell_156 8) v_ArrVal_2192)))) (store .cse1315 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse1315 |c_ULTIMATE.start_main_~#s~0#1.base|) 4 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse1314 (select (select .cse1314 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4)))) (.cse1308 (+ v_arrayElimCell_157 4)) (.cse1305 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2182)) (.cse1307 (let ((.cse1310 (let ((.cse1311 (store .cse1312 .cse1309 (store .cse1313 .cse4 v_ArrVal_2192)))) (store .cse1311 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse1311 |c_ULTIMATE.start_main_~#s~0#1.base|) 4 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse1310 (select (select .cse1310 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))))) (or (< v_arrayElimCell_156 0) (= (select .cse1305 (select .cse1306 4)) 1) (< v_arrayElimCell_157 0) (= (select .cse1305 (select .cse1307 .cse1308)) 1) (= (select .cse1305 (select .cse1306 .cse1308)) 1) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_node_create_~temp~0#1.base_27| 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 0)) (= .cse1309 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select .cse1305 (select .cse1307 .cse23)) 1))))))))) (.cse562 (forall ((v_arrayElimCell_157 Int) (v_arrayElimCell_156 Int) (v_ArrVal_2188 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_27| Int) (v_ArrVal_2182 Int) (v_ArrVal_2192 Int)) (let ((.cse1301 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2188) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (let ((.cse1298 (select (select .cse1301 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1302 (select .cse1301 .cse1298))) (let ((.cse1297 (let ((.cse1303 (let ((.cse1304 (store .cse1301 .cse1298 (store .cse1302 .cse4 v_ArrVal_2192)))) (store .cse1304 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse1304 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse1303 (select (select .cse1303 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4)))) (.cse1296 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2182))) (or (< v_arrayElimCell_156 0) (< v_arrayElimCell_157 0) (= (select .cse1296 (select .cse1297 .cse23)) 1) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_node_create_~temp~0#1.base_27| 1)) (= (select .cse1296 (select .cse1297 (+ v_arrayElimCell_157 4))) 1) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 0)) (= .cse1298 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select .cse1296 (select (let ((.cse1299 (let ((.cse1300 (store .cse1301 .cse1298 (store .cse1302 (+ v_arrayElimCell_156 8) v_ArrVal_2192)))) (store .cse1300 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse1300 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse1299 (select (select .cse1299 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) (+ v_arrayElimCell_156 4))) 1)))))))) (.cse393 (or (forall ((v_arrayElimCell_157 Int) (v_arrayElimCell_156 Int) (v_ArrVal_2188 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_27| Int) (v_ArrVal_2182 Int) (v_ArrVal_2192 Int)) (let ((.cse1290 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2188) |c_ULTIMATE.start_main_~#s~0#1.base|) 4))))) (let ((.cse1291 (select (select .cse1290 |c_ULTIMATE.start_main_~#s~0#1.base|) 4))) (let ((.cse1292 (select .cse1290 .cse1291))) (let ((.cse1287 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2182)) (.cse1293 (let ((.cse1294 (let ((.cse1295 (store .cse1290 .cse1291 (store .cse1292 .cse4 v_ArrVal_2192)))) (store .cse1295 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse1295 |c_ULTIMATE.start_main_~#s~0#1.base|) 4 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse1294 (select (select .cse1294 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))))) (or (= (select .cse1287 (select (let ((.cse1288 (let ((.cse1289 (store .cse1290 .cse1291 (store .cse1292 (+ v_arrayElimCell_156 8) v_ArrVal_2192)))) (store .cse1289 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse1289 |c_ULTIMATE.start_main_~#s~0#1.base|) 4 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse1288 (select (select .cse1288 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) 4)) 1) (< v_arrayElimCell_157 0) (= (select .cse1287 (select .cse1293 (+ v_arrayElimCell_157 4))) 1) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_node_create_~temp~0#1.base_27| 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 0)) (= .cse1291 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select .cse1287 (select .cse1293 .cse23)) 1))))))) .cse14)) (.cse403 (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_27| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_node_create_~temp~0#1.base_27| 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 0)) (forall ((v_arrayElimCell_157 Int)) (or (< v_arrayElimCell_157 0) (forall ((v_arrayElimCell_156 Int) (v_ArrVal_2188 (Array Int Int)) (v_ArrVal_2182 Int) (v_ArrVal_2192 Int)) (let ((.cse1282 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2188) |c_ULTIMATE.start_main_~#s~0#1.base|) 4))))) (let ((.cse1278 (select (select .cse1282 |c_ULTIMATE.start_main_~#s~0#1.base|) 4))) (let ((.cse1283 (select .cse1282 .cse1278))) (let ((.cse1279 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2182)) (.cse1284 (let ((.cse1285 (let ((.cse1286 (store .cse1282 .cse1278 (store .cse1283 .cse4 v_ArrVal_2192)))) (store .cse1286 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse1286 |c_ULTIMATE.start_main_~#s~0#1.base|) 4 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse1285 (select (select .cse1285 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))))) (or (not (= |v_ULTIMATE.start_node_create_~temp~0#1.base_27| .cse1278)) (= (select .cse1279 (select (let ((.cse1280 (let ((.cse1281 (store .cse1282 .cse1278 (store .cse1283 (+ v_arrayElimCell_156 8) v_ArrVal_2192)))) (store .cse1281 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse1281 |c_ULTIMATE.start_main_~#s~0#1.base|) 4 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse1280 (select (select .cse1280 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) 4)) 1) (= (select .cse1279 (select .cse1284 (+ v_arrayElimCell_157 4))) 1) (= (select .cse1279 (select .cse1284 .cse23)) 1)))))))))))) (.cse1024 (forall ((v_arrayElimCell_157 Int) (v_arrayElimCell_156 Int) (v_ArrVal_2188 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_27| Int) (v_ArrVal_2182 Int) (v_ArrVal_2192 Int)) (let ((.cse1274 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2188) |c_ULTIMATE.start_main_~#s~0#1.base|) 4))))) (let ((.cse1271 (select (select .cse1274 |c_ULTIMATE.start_main_~#s~0#1.base|) 4))) (let ((.cse1275 (select .cse1274 .cse1271))) (let ((.cse1268 (let ((.cse1276 (let ((.cse1277 (store .cse1274 .cse1271 (store .cse1275 (+ v_arrayElimCell_156 8) v_ArrVal_2192)))) (store .cse1277 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse1277 |c_ULTIMATE.start_main_~#s~0#1.base|) 4 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse1276 (select (select .cse1276 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4)))) (.cse1270 (+ v_arrayElimCell_157 4)) (.cse1267 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2182)) (.cse1269 (let ((.cse1272 (let ((.cse1273 (store .cse1274 .cse1271 (store .cse1275 .cse4 v_ArrVal_2192)))) (store .cse1273 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse1273 |c_ULTIMATE.start_main_~#s~0#1.base|) 4 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse1272 (select (select .cse1272 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))))) (or (< v_arrayElimCell_156 0) (= (select .cse1267 (select .cse1268 4)) 1) (= (select .cse1267 (select .cse1269 .cse1270)) 1) (= (select .cse1267 (select .cse1268 .cse1270)) 1) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_node_create_~temp~0#1.base_27| 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 0)) (= |v_ULTIMATE.start_node_create_~temp~0#1.base_27| .cse1271) (= .cse1271 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select .cse1267 (select .cse1269 .cse23)) 1)))))))) (.cse757 (or (forall ((v_arrayElimCell_157 Int) (v_arrayElimCell_156 Int) (v_ArrVal_2188 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_27| Int) (v_ArrVal_2182 Int) (v_ArrVal_2192 Int)) (let ((.cse1263 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2188) |c_ULTIMATE.start_main_~#s~0#1.base|) 4))))) (let ((.cse1260 (select (select .cse1263 |c_ULTIMATE.start_main_~#s~0#1.base|) 4))) (let ((.cse1264 (select .cse1263 .cse1260))) (let ((.cse1259 (let ((.cse1265 (let ((.cse1266 (store .cse1263 .cse1260 (store .cse1264 (+ v_arrayElimCell_156 8) v_ArrVal_2192)))) (store .cse1266 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse1266 |c_ULTIMATE.start_main_~#s~0#1.base|) 4 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse1265 (select (select .cse1265 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4)))) (.cse1258 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2182))) (or (< v_arrayElimCell_156 0) (= (select .cse1258 (select .cse1259 4)) 1) (= (select .cse1258 (select .cse1259 (+ v_arrayElimCell_157 4))) 1) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_node_create_~temp~0#1.base_27| 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 0)) (= |v_ULTIMATE.start_node_create_~temp~0#1.base_27| .cse1260) (= .cse1260 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select .cse1258 (select (let ((.cse1261 (let ((.cse1262 (store .cse1263 .cse1260 (store .cse1264 .cse4 v_ArrVal_2192)))) (store .cse1262 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse1262 |c_ULTIMATE.start_main_~#s~0#1.base|) 4 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse1261 (select (select .cse1261 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) .cse23)) 1))))))) .cse41)) (.cse759 (or .cse5 (forall ((v_arrayElimCell_157 Int) (v_arrayElimCell_156 Int) (v_ArrVal_2188 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_27| Int) (v_ArrVal_2182 Int) (v_ArrVal_2192 Int)) (let ((.cse1252 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2188) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (let ((.cse1253 (select (select .cse1252 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1254 (select .cse1252 .cse1253))) (let ((.cse1249 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2182)) (.cse1255 (let ((.cse1256 (let ((.cse1257 (store .cse1252 .cse1253 (store .cse1254 (+ v_arrayElimCell_156 8) v_ArrVal_2192)))) (store .cse1257 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse1257 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse1256 (select (select .cse1256 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))))) (or (< v_arrayElimCell_156 0) (= (select .cse1249 (select (let ((.cse1250 (let ((.cse1251 (store .cse1252 .cse1253 (store .cse1254 .cse4 v_ArrVal_2192)))) (store .cse1251 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse1251 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse1250 (select (select .cse1250 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) .cse23)) 1) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_node_create_~temp~0#1.base_27| 1)) (= |v_ULTIMATE.start_node_create_~temp~0#1.base_27| .cse1253) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 0)) (= .cse1253 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select .cse1249 (select .cse1255 (+ v_arrayElimCell_157 4))) 1) (= (select .cse1249 (select .cse1255 (+ v_arrayElimCell_156 4))) 1))))))))) (.cse664 (or (forall ((v_arrayElimCell_156 Int) (v_ArrVal_2188 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_27| Int) (v_ArrVal_2182 Int) (v_ArrVal_2192 Int)) (let ((.cse1244 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2188) |c_ULTIMATE.start_main_~#s~0#1.base|) 4))))) (let ((.cse1245 (select (select .cse1244 |c_ULTIMATE.start_main_~#s~0#1.base|) 4))) (let ((.cse1241 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2182)) (.cse1246 (select .cse1244 .cse1245))) (or (= (select .cse1241 (select (let ((.cse1242 (let ((.cse1243 (store .cse1244 .cse1245 (store .cse1246 (+ v_arrayElimCell_156 8) v_ArrVal_2192)))) (store .cse1243 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse1243 |c_ULTIMATE.start_main_~#s~0#1.base|) 4 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse1242 (select (select .cse1242 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) 4)) 1) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_node_create_~temp~0#1.base_27| 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 0)) (= |v_ULTIMATE.start_node_create_~temp~0#1.base_27| .cse1245) (= .cse1245 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select .cse1241 (select (let ((.cse1247 (let ((.cse1248 (store .cse1244 .cse1245 (store .cse1246 .cse4 v_ArrVal_2192)))) (store .cse1248 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse1248 |c_ULTIMATE.start_main_~#s~0#1.base|) 4 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse1247 (select (select .cse1247 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) .cse23)) 1)))))) .cse41)) (.cse761 (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_27| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_node_create_~temp~0#1.base_27| 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 0)) (forall ((v_ArrVal_2188 (Array Int Int))) (let ((.cse1237 (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2188) |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse1230 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select .cse1237 |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (let ((.cse1226 (select (select .cse1230 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= |v_ULTIMATE.start_node_create_~temp~0#1.base_27| .cse1226) (forall ((v_arrayElimCell_157 Int) (v_ArrVal_2182 Int) (v_ArrVal_2192 Int)) (let ((.cse1227 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2182)) (.cse1231 (select .cse1230 .cse1226))) (or (= (select .cse1227 (select (let ((.cse1228 (let ((.cse1229 (store .cse1230 .cse1226 (store .cse1231 .cse4 v_ArrVal_2192)))) (store .cse1229 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse1229 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse1228 (select (select .cse1228 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) .cse23)) 1) (forall ((v_arrayElimCell_156 Int)) (let ((.cse1236 (+ v_arrayElimCell_156 8))) (let ((.cse1238 (let ((.cse1239 (let ((.cse1240 (store .cse1230 .cse1226 (store .cse1231 .cse1236 v_ArrVal_2192)))) (store .cse1240 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse1240 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse1239 (select (select .cse1239 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))))) (or (< v_arrayElimCell_156 0) (= (select .cse1227 (select (let ((.cse1232 (let ((.cse1233 (let ((.cse1234 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select .cse1237 4))))) (let ((.cse1235 (select (select .cse1234 |c_ULTIMATE.start_main_~#s~0#1.base|) 4))) (store .cse1234 .cse1235 (store (select .cse1234 .cse1235) .cse1236 v_ArrVal_2192)))))) (store .cse1233 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse1233 |c_ULTIMATE.start_main_~#s~0#1.base|) 4 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse1232 (select (select .cse1232 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) 4)) 1) (= (select .cse1227 (select .cse1238 (+ v_arrayElimCell_157 4))) 1) (= (select .cse1227 (select .cse1238 (+ v_arrayElimCell_156 4))) 1)))))))) (= .cse1226 |c_ULTIMATE.start_main_~#s~0#1.base|))))))))) (.cse665 (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_27| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_node_create_~temp~0#1.base_27| 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 0)) (forall ((v_ArrVal_2188 (Array Int Int)) (v_ArrVal_2182 Int) (v_ArrVal_2192 Int)) (let ((.cse1224 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2188) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (let ((.cse1225 (select (select .cse1224 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (select (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2182) (select (let ((.cse1222 (let ((.cse1223 (store .cse1224 .cse1225 (store (select .cse1224 .cse1225) .cse4 v_ArrVal_2192)))) (store .cse1223 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse1223 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse1222 (select (select .cse1222 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) .cse23)) 1) (= |v_ULTIMATE.start_node_create_~temp~0#1.base_27| .cse1225) (= .cse1225 |c_ULTIMATE.start_main_~#s~0#1.base|)))))))) (.cse578 (or .cse5 (forall ((v_arrayElimCell_157 Int) (v_arrayElimCell_156 Int) (v_ArrVal_2188 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_27| Int) (v_ArrVal_2182 Int) (v_ArrVal_2192 Int)) (let ((.cse1218 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2188) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (let ((.cse1215 (select (select .cse1218 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1219 (select .cse1218 .cse1215))) (let ((.cse1214 (let ((.cse1220 (let ((.cse1221 (store .cse1218 .cse1215 (store .cse1219 .cse4 v_ArrVal_2192)))) (store .cse1221 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse1221 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse1220 (select (select .cse1220 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4)))) (.cse1213 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2182))) (or (< v_arrayElimCell_156 0) (= (select .cse1213 (select .cse1214 .cse23)) 1) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_node_create_~temp~0#1.base_27| 1)) (= (select .cse1213 (select .cse1214 (+ v_arrayElimCell_157 4))) 1) (= |v_ULTIMATE.start_node_create_~temp~0#1.base_27| .cse1215) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 0)) (= .cse1215 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select .cse1213 (select (let ((.cse1216 (let ((.cse1217 (store .cse1218 .cse1215 (store .cse1219 (+ v_arrayElimCell_156 8) v_ArrVal_2192)))) (store .cse1217 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse1217 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse1216 (select (select .cse1216 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) (+ v_arrayElimCell_156 4))) 1))))))))) (.cse579 (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_27| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_node_create_~temp~0#1.base_27| 1)) (forall ((v_ArrVal_2188 (Array Int Int))) (let ((.cse1205 (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2188) |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse1208 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select .cse1205 |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (let ((.cse1198 (select (select .cse1208 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= |v_ULTIMATE.start_node_create_~temp~0#1.base_27| .cse1198) (forall ((v_arrayElimCell_157 Int) (v_ArrVal_2182 Int) (v_ArrVal_2192 Int)) (let ((.cse1209 (select .cse1208 .cse1198))) (let ((.cse1199 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2182)) (.cse1210 (let ((.cse1211 (let ((.cse1212 (store .cse1208 .cse1198 (store .cse1209 .cse4 v_ArrVal_2192)))) (store .cse1212 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse1212 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse1211 (select (select .cse1211 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))))) (or (forall ((v_arrayElimCell_156 Int)) (let ((.cse1204 (+ v_arrayElimCell_156 8))) (or (< v_arrayElimCell_156 0) (= (select .cse1199 (select (let ((.cse1200 (let ((.cse1201 (let ((.cse1202 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select .cse1205 4))))) (let ((.cse1203 (select (select .cse1202 |c_ULTIMATE.start_main_~#s~0#1.base|) 4))) (store .cse1202 .cse1203 (store (select .cse1202 .cse1203) .cse1204 v_ArrVal_2192)))))) (store .cse1201 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse1201 |c_ULTIMATE.start_main_~#s~0#1.base|) 4 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse1200 (select (select .cse1200 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) 4)) 1) (= (select .cse1199 (select (let ((.cse1206 (let ((.cse1207 (store .cse1208 .cse1198 (store .cse1209 .cse1204 v_ArrVal_2192)))) (store .cse1207 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse1207 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse1206 (select (select .cse1206 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) (+ v_arrayElimCell_156 4))) 1)))) (= (select .cse1199 (select .cse1210 .cse23)) 1) (= (select .cse1199 (select .cse1210 (+ v_arrayElimCell_157 4))) 1))))) (= .cse1198 |c_ULTIMATE.start_main_~#s~0#1.base|)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 0))))) (.cse392 (forall ((v_arrayElimCell_157 Int) (v_arrayElimCell_156 Int) (v_ArrVal_2188 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_27| Int) (v_ArrVal_2182 Int) (v_ArrVal_2192 Int)) (let ((.cse1192 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2188) |c_ULTIMATE.start_main_~#s~0#1.base|) 4))))) (let ((.cse1193 (select (select .cse1192 |c_ULTIMATE.start_main_~#s~0#1.base|) 4))) (let ((.cse1194 (select .cse1192 .cse1193))) (let ((.cse1189 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2182)) (.cse1195 (let ((.cse1196 (let ((.cse1197 (store .cse1192 .cse1193 (store .cse1194 .cse4 v_ArrVal_2192)))) (store .cse1197 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse1197 |c_ULTIMATE.start_main_~#s~0#1.base|) 4 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse1196 (select (select .cse1196 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))))) (or (= (select .cse1189 (select (let ((.cse1190 (let ((.cse1191 (store .cse1192 .cse1193 (store .cse1194 (+ v_arrayElimCell_156 8) v_ArrVal_2192)))) (store .cse1191 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse1191 |c_ULTIMATE.start_main_~#s~0#1.base|) 4 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse1190 (select (select .cse1190 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) 4)) 1) (= (select .cse1189 (select .cse1195 (+ v_arrayElimCell_157 4))) 1) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_node_create_~temp~0#1.base_27| 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 0)) (= |v_ULTIMATE.start_node_create_~temp~0#1.base_27| .cse1193) (= .cse1193 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select .cse1189 (select .cse1195 .cse23)) 1)))))))) (.cse815 (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_27| Int)) (or (forall ((v_ArrVal_2188 (Array Int Int))) (let ((.cse1182 (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2188) |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse1185 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select .cse1182 |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (let ((.cse1175 (select (select .cse1185 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= |v_ULTIMATE.start_node_create_~temp~0#1.base_27| .cse1175) (= .cse1175 |c_ULTIMATE.start_main_~#s~0#1.base|) (forall ((v_ArrVal_2182 Int) (v_ArrVal_2192 Int)) (let ((.cse1176 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2182)) (.cse1186 (select .cse1185 .cse1175))) (or (forall ((v_arrayElimCell_156 Int)) (let ((.cse1181 (+ v_arrayElimCell_156 8))) (or (< v_arrayElimCell_156 0) (= (select .cse1176 (select (let ((.cse1177 (let ((.cse1178 (let ((.cse1179 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select .cse1182 4))))) (let ((.cse1180 (select (select .cse1179 |c_ULTIMATE.start_main_~#s~0#1.base|) 4))) (store .cse1179 .cse1180 (store (select .cse1179 .cse1180) .cse1181 v_ArrVal_2192)))))) (store .cse1178 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse1178 |c_ULTIMATE.start_main_~#s~0#1.base|) 4 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse1177 (select (select .cse1177 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) 4)) 1) (= (select .cse1176 (select (let ((.cse1183 (let ((.cse1184 (store .cse1185 .cse1175 (store .cse1186 .cse1181 v_ArrVal_2192)))) (store .cse1184 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse1184 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse1183 (select (select .cse1183 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) (+ v_arrayElimCell_156 4))) 1)))) (= (select .cse1176 (select (let ((.cse1187 (let ((.cse1188 (store .cse1185 .cse1175 (store .cse1186 .cse4 v_ArrVal_2192)))) (store .cse1188 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse1188 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse1187 (select (select .cse1187 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) .cse23)) 1))))))))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_node_create_~temp~0#1.base_27| 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 0))))) (.cse690 (or .cse41 (forall ((v_arrayElimCell_156 Int) (v_ArrVal_2188 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_27| Int) (v_ArrVal_2182 Int) (v_ArrVal_2192 Int)) (let ((.cse1170 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2188) |c_ULTIMATE.start_main_~#s~0#1.base|) 4))))) (let ((.cse1171 (select (select .cse1170 |c_ULTIMATE.start_main_~#s~0#1.base|) 4))) (let ((.cse1167 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2182)) (.cse1172 (select .cse1170 .cse1171))) (or (< v_arrayElimCell_156 0) (= (select .cse1167 (select (let ((.cse1168 (let ((.cse1169 (store .cse1170 .cse1171 (store .cse1172 (+ v_arrayElimCell_156 8) v_ArrVal_2192)))) (store .cse1169 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse1169 |c_ULTIMATE.start_main_~#s~0#1.base|) 4 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse1168 (select (select .cse1168 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) 4)) 1) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_node_create_~temp~0#1.base_27| 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 0)) (= |v_ULTIMATE.start_node_create_~temp~0#1.base_27| .cse1171) (= .cse1171 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select .cse1167 (select (let ((.cse1173 (let ((.cse1174 (store .cse1170 .cse1171 (store .cse1172 .cse4 v_ArrVal_2192)))) (store .cse1174 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse1174 |c_ULTIMATE.start_main_~#s~0#1.base|) 4 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse1173 (select (select .cse1173 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) .cse23)) 1)))))))) (.cse691 (or .cse5 (forall ((v_arrayElimCell_156 Int) (v_ArrVal_2188 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_27| Int) (v_ArrVal_2182 Int) (v_ArrVal_2192 Int)) (let ((.cse1162 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2188) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (let ((.cse1163 (select (select .cse1162 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1159 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2182)) (.cse1164 (select .cse1162 .cse1163))) (or (< v_arrayElimCell_156 0) (= (select .cse1159 (select (let ((.cse1160 (let ((.cse1161 (store .cse1162 .cse1163 (store .cse1164 .cse4 v_ArrVal_2192)))) (store .cse1161 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse1161 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse1160 (select (select .cse1160 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) .cse23)) 1) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_node_create_~temp~0#1.base_27| 1)) (= |v_ULTIMATE.start_node_create_~temp~0#1.base_27| .cse1163) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 0)) (= .cse1163 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select .cse1159 (select (let ((.cse1165 (let ((.cse1166 (store .cse1162 .cse1163 (store .cse1164 (+ v_arrayElimCell_156 8) v_ArrVal_2192)))) (store .cse1166 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse1166 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse1165 (select (select .cse1165 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) (+ v_arrayElimCell_156 4))) 1)))))))) (.cse1056 (forall ((v_arrayElimCell_157 Int) (v_arrayElimCell_156 Int) (v_ArrVal_2188 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_27| Int) (v_ArrVal_2182 Int) (v_ArrVal_2192 Int)) (let ((.cse1153 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2188) |c_ULTIMATE.start_main_~#s~0#1.base|) 4))))) (let ((.cse1154 (select (select .cse1153 |c_ULTIMATE.start_main_~#s~0#1.base|) 4))) (let ((.cse1155 (select .cse1153 .cse1154))) (let ((.cse1150 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2182)) (.cse1156 (let ((.cse1157 (let ((.cse1158 (store .cse1153 .cse1154 (store .cse1155 .cse4 v_ArrVal_2192)))) (store .cse1158 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse1158 |c_ULTIMATE.start_main_~#s~0#1.base|) 4 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse1157 (select (select .cse1157 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))))) (or (< v_arrayElimCell_156 0) (= (select .cse1150 (select (let ((.cse1151 (let ((.cse1152 (store .cse1153 .cse1154 (store .cse1155 (+ v_arrayElimCell_156 8) v_ArrVal_2192)))) (store .cse1152 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse1152 |c_ULTIMATE.start_main_~#s~0#1.base|) 4 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse1151 (select (select .cse1151 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) 4)) 1) (= (select .cse1150 (select .cse1156 (+ v_arrayElimCell_157 4))) 1) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_node_create_~temp~0#1.base_27| 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 0)) (= |v_ULTIMATE.start_node_create_~temp~0#1.base_27| .cse1154) (= .cse1154 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select .cse1150 (select .cse1156 .cse23)) 1)))))))) (.cse1005 (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_27| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_node_create_~temp~0#1.base_27| 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 0)) (forall ((v_arrayElimCell_156 Int)) (or (< v_arrayElimCell_156 0) (forall ((v_arrayElimCell_157 Int)) (or (forall ((v_ArrVal_2188 (Array Int Int)) (v_ArrVal_2182 Int) (v_ArrVal_2192 Int)) (let ((.cse1145 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2188) |c_ULTIMATE.start_main_~#s~0#1.base|) 4))))) (let ((.cse1141 (select (select .cse1145 |c_ULTIMATE.start_main_~#s~0#1.base|) 4))) (let ((.cse1146 (select .cse1145 .cse1141))) (let ((.cse1142 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2182)) (.cse1147 (let ((.cse1148 (let ((.cse1149 (store .cse1145 .cse1141 (store .cse1146 .cse4 v_ArrVal_2192)))) (store .cse1149 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse1149 |c_ULTIMATE.start_main_~#s~0#1.base|) 4 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse1148 (select (select .cse1148 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))))) (or (not (= |v_ULTIMATE.start_node_create_~temp~0#1.base_27| .cse1141)) (= (select .cse1142 (select (let ((.cse1143 (let ((.cse1144 (store .cse1145 .cse1141 (store .cse1146 (+ v_arrayElimCell_156 8) v_ArrVal_2192)))) (store .cse1144 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse1144 |c_ULTIMATE.start_main_~#s~0#1.base|) 4 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse1143 (select (select .cse1143 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) 4)) 1) (= (select .cse1142 (select .cse1147 (+ v_arrayElimCell_157 4))) 1) (= (select .cse1142 (select .cse1147 .cse23)) 1))))))) (< v_arrayElimCell_157 0)))))))) (.cse1006 (or (forall ((v_arrayElimCell_157 Int) (v_arrayElimCell_156 Int) (v_ArrVal_2188 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_27| Int) (v_ArrVal_2182 Int) (v_ArrVal_2192 Int)) (let ((.cse1135 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2188) |c_ULTIMATE.start_main_~#s~0#1.base|) 4))))) (let ((.cse1136 (select (select .cse1135 |c_ULTIMATE.start_main_~#s~0#1.base|) 4))) (let ((.cse1137 (select .cse1135 .cse1136))) (let ((.cse1132 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2182)) (.cse1138 (let ((.cse1139 (let ((.cse1140 (store .cse1135 .cse1136 (store .cse1137 .cse4 v_ArrVal_2192)))) (store .cse1140 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse1140 |c_ULTIMATE.start_main_~#s~0#1.base|) 4 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse1139 (select (select .cse1139 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))))) (or (< v_arrayElimCell_156 0) (= (select .cse1132 (select (let ((.cse1133 (let ((.cse1134 (store .cse1135 .cse1136 (store .cse1137 (+ v_arrayElimCell_156 8) v_ArrVal_2192)))) (store .cse1134 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse1134 |c_ULTIMATE.start_main_~#s~0#1.base|) 4 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse1133 (select (select .cse1133 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) 4)) 1) (< v_arrayElimCell_157 0) (= (select .cse1132 (select .cse1138 (+ v_arrayElimCell_157 4))) 1) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_node_create_~temp~0#1.base_27| 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 0)) (= .cse1136 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select .cse1132 (select .cse1138 .cse23)) 1))))))) .cse14))) (and (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_27| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_node_create_~temp~0#1.base_27| 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 0)) (forall ((v_ArrVal_2188 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2188) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (let ((.cse0 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= |v_ULTIMATE.start_node_create_~temp~0#1.base_27| .cse0)) (forall ((v_arrayElimCell_157 Int)) (or (< v_arrayElimCell_157 0) (forall ((v_ArrVal_2182 Int) (v_ArrVal_2192 Int)) (= (select (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2182) (select (let ((.cse1 (let ((.cse2 (store .cse3 .cse0 (store (select .cse3 .cse0) .cse4 v_ArrVal_2192)))) (store .cse2 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse1 (select (select .cse1 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) (+ v_arrayElimCell_157 4))) 1)))))))))) (or .cse5 (forall ((v_arrayElimCell_157 Int) (v_arrayElimCell_156 Int) (v_ArrVal_2188 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_27| Int) (v_ArrVal_2182 Int) (v_ArrVal_2192 Int)) (let ((.cse10 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2188) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (let ((.cse6 (select (select .cse10 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse7 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2182)) (.cse11 (select .cse10 .cse6))) (or (< v_arrayElimCell_156 0) (not (= |v_ULTIMATE.start_node_create_~temp~0#1.base_27| .cse6)) (< v_arrayElimCell_157 0) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_node_create_~temp~0#1.base_27| 1)) (= (select .cse7 (select (let ((.cse8 (let ((.cse9 (store .cse10 .cse6 (store .cse11 .cse4 v_ArrVal_2192)))) (store .cse9 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse8 (select (select .cse8 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) (+ v_arrayElimCell_157 4))) 1) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 0)) (= (select .cse7 (select (let ((.cse12 (let ((.cse13 (store .cse10 .cse6 (store .cse11 (+ v_arrayElimCell_156 8) v_ArrVal_2192)))) (store .cse13 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse13 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse12 (select (select .cse12 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) (+ v_arrayElimCell_156 4))) 1))))))) (or .cse14 (forall ((v_arrayElimCell_157 Int) (v_arrayElimCell_156 Int) (v_ArrVal_2188 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_27| Int) (v_ArrVal_2182 Int) (v_ArrVal_2192 Int)) (let ((.cse21 (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2188) |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse27 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select .cse21 |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (let ((.cse24 (select (select .cse27 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse28 (select .cse27 .cse24))) (let ((.cse22 (let ((.cse29 (let ((.cse30 (store .cse27 .cse24 (store .cse28 .cse4 v_ArrVal_2192)))) (store .cse30 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse30 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse29 (select (select .cse29 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4)))) (.cse15 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2182)) (.cse20 (+ v_arrayElimCell_156 8))) (or (< v_arrayElimCell_156 0) (= (select .cse15 (select (let ((.cse16 (let ((.cse17 (let ((.cse18 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select .cse21 4))))) (let ((.cse19 (select (select .cse18 |c_ULTIMATE.start_main_~#s~0#1.base|) 4))) (store .cse18 .cse19 (store (select .cse18 .cse19) .cse20 v_ArrVal_2192)))))) (store .cse17 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse17 |c_ULTIMATE.start_main_~#s~0#1.base|) 4 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse16 (select (select .cse16 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) 4)) 1) (< v_arrayElimCell_157 0) (= (select .cse15 (select .cse22 .cse23)) 1) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_node_create_~temp~0#1.base_27| 1)) (= (select .cse15 (select .cse22 (+ v_arrayElimCell_157 4))) 1) (= |v_ULTIMATE.start_node_create_~temp~0#1.base_27| .cse24) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 0)) (= (select .cse15 (select (let ((.cse25 (let ((.cse26 (store .cse27 .cse24 (store .cse28 .cse20 v_ArrVal_2192)))) (store .cse26 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse26 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse25 (select (select .cse25 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) (+ v_arrayElimCell_156 4))) 1))))))))) (or (forall ((v_arrayElimCell_157 Int) (v_arrayElimCell_156 Int) (v_ArrVal_2188 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_27| Int) (v_ArrVal_2182 Int) (v_ArrVal_2192 Int)) (let ((.cse36 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2188) |c_ULTIMATE.start_main_~#s~0#1.base|) 4))))) (let ((.cse31 (select (select .cse36 |c_ULTIMATE.start_main_~#s~0#1.base|) 4))) (let ((.cse37 (select .cse36 .cse31))) (let ((.cse32 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2182)) (.cse33 (let ((.cse39 (let ((.cse40 (store .cse36 .cse31 (store .cse37 (+ v_arrayElimCell_156 8) v_ArrVal_2192)))) (store .cse40 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse40 |c_ULTIMATE.start_main_~#s~0#1.base|) 4 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse39 (select (select .cse39 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4)))) (.cse38 (+ v_arrayElimCell_157 4))) (or (< v_arrayElimCell_156 0) (not (= |v_ULTIMATE.start_node_create_~temp~0#1.base_27| .cse31)) (= (select .cse32 (select .cse33 4)) 1) (< v_arrayElimCell_157 0) (= (select .cse32 (select (let ((.cse34 (let ((.cse35 (store .cse36 .cse31 (store .cse37 .cse4 v_ArrVal_2192)))) (store .cse35 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse35 |c_ULTIMATE.start_main_~#s~0#1.base|) 4 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse34 (select (select .cse34 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) .cse38)) 1) (= (select .cse32 (select .cse33 .cse38)) 1) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_node_create_~temp~0#1.base_27| 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 0)))))))) .cse41) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_27| Int)) (or (forall ((v_ArrVal_2188 (Array Int Int))) (let ((.cse49 (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2188) |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse52 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select .cse49 |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (let ((.cse42 (select (select .cse52 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= |v_ULTIMATE.start_node_create_~temp~0#1.base_27| .cse42)) (forall ((v_arrayElimCell_157 Int)) (or (< v_arrayElimCell_157 0) (forall ((v_ArrVal_2182 Int) (v_ArrVal_2192 Int)) (let ((.cse53 (select .cse52 .cse42))) (let ((.cse43 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2182)) (.cse54 (let ((.cse55 (let ((.cse56 (store .cse52 .cse42 (store .cse53 .cse4 v_ArrVal_2192)))) (store .cse56 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse56 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse55 (select (select .cse55 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))))) (or (forall ((v_arrayElimCell_156 Int)) (let ((.cse48 (+ v_arrayElimCell_156 8))) (or (< v_arrayElimCell_156 0) (= (select .cse43 (select (let ((.cse44 (let ((.cse45 (let ((.cse46 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select .cse49 4))))) (let ((.cse47 (select (select .cse46 |c_ULTIMATE.start_main_~#s~0#1.base|) 4))) (store .cse46 .cse47 (store (select .cse46 .cse47) .cse48 v_ArrVal_2192)))))) (store .cse45 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse45 |c_ULTIMATE.start_main_~#s~0#1.base|) 4 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse44 (select (select .cse44 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) 4)) 1) (= (select .cse43 (select (let ((.cse50 (let ((.cse51 (store .cse52 .cse42 (store .cse53 .cse48 v_ArrVal_2192)))) (store .cse51 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse51 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse50 (select (select .cse50 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) (+ v_arrayElimCell_156 4))) 1)))) (= (select .cse43 (select .cse54 .cse23)) 1) (= (select .cse43 (select .cse54 (+ v_arrayElimCell_157 4))) 1)))))))))))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_node_create_~temp~0#1.base_27| 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 0)))) (or (and (or .cse14 (and (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_27| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_node_create_~temp~0#1.base_27| 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 0)) (forall ((v_arrayElimCell_157 Int)) (or (< v_arrayElimCell_157 0) (forall ((v_ArrVal_2188 (Array Int Int))) (let ((.cse64 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2188) |c_ULTIMATE.start_main_~#s~0#1.base|) 4))))) (let ((.cse57 (select (select .cse64 |c_ULTIMATE.start_main_~#s~0#1.base|) 4))) (or (not (= .cse57 |c_ULTIMATE.start_main_~#s~0#1.base|)) (forall ((v_ArrVal_2182 Int) (v_ArrVal_2192 Int)) (let ((.cse65 (select .cse64 .cse57))) (let ((.cse60 (+ v_arrayElimCell_157 4)) (.cse58 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2182)) (.cse59 (let ((.cse66 (let ((.cse67 (store .cse64 .cse57 (store .cse65 .cse4 v_ArrVal_2192)))) (store .cse67 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse67 |c_ULTIMATE.start_main_~#s~0#1.base|) 4 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse66 (select (select .cse66 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))))) (or (= (select .cse58 (select .cse59 .cse60)) 1) (forall ((v_arrayElimCell_156 Int)) (let ((.cse61 (let ((.cse62 (let ((.cse63 (store .cse64 .cse57 (store .cse65 (+ v_arrayElimCell_156 8) v_ArrVal_2192)))) (store .cse63 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse63 |c_ULTIMATE.start_main_~#s~0#1.base|) 4 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse62 (select (select .cse62 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))))) (or (= (select .cse58 (select .cse61 4)) 1) (= (select .cse58 (select .cse61 .cse60)) 1)))) (= (select .cse58 (select .cse59 .cse23)) 1))))))))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_27| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_node_create_~temp~0#1.base_27| 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 0)) (forall ((v_arrayElimCell_157 Int)) (or (< v_arrayElimCell_157 0) (forall ((v_ArrVal_2188 (Array Int Int))) (let ((.cse74 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2188) |c_ULTIMATE.start_main_~#s~0#1.base|) 4))))) (let ((.cse68 (select (select .cse74 |c_ULTIMATE.start_main_~#s~0#1.base|) 4))) (or (not (= .cse68 |c_ULTIMATE.start_main_~#s~0#1.base|)) (forall ((v_arrayElimCell_156 Int) (v_ArrVal_2182 Int) (v_ArrVal_2192 Int)) (let ((.cse75 (select .cse74 .cse68))) (let ((.cse71 (+ v_arrayElimCell_157 4)) (.cse69 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2182)) (.cse70 (let ((.cse76 (let ((.cse77 (store .cse74 .cse68 (store .cse75 .cse4 v_ArrVal_2192)))) (store .cse77 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse77 |c_ULTIMATE.start_main_~#s~0#1.base|) 4 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse76 (select (select .cse76 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))))) (or (= (select .cse69 (select .cse70 .cse71)) 1) (= (select .cse69 (select (let ((.cse72 (let ((.cse73 (store .cse74 .cse68 (store .cse75 (+ v_arrayElimCell_156 8) v_ArrVal_2192)))) (store .cse73 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse73 |c_ULTIMATE.start_main_~#s~0#1.base|) 4 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse72 (select (select .cse72 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) .cse71)) 1) (= (select .cse69 (select .cse70 .cse23)) 1))))))))))))))) (or .cse14 (and (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_27| Int)) (or (forall ((v_arrayElimCell_157 Int) (v_ArrVal_2188 (Array Int Int))) (let ((.cse84 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2188) |c_ULTIMATE.start_main_~#s~0#1.base|) 4))))) (let ((.cse78 (select (select .cse84 |c_ULTIMATE.start_main_~#s~0#1.base|) 4))) (or (not (= .cse78 |c_ULTIMATE.start_main_~#s~0#1.base|)) (forall ((v_arrayElimCell_156 Int) (v_ArrVal_2182 Int) (v_ArrVal_2192 Int)) (let ((.cse85 (select .cse84 .cse78))) (let ((.cse81 (+ v_arrayElimCell_157 4)) (.cse79 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2182)) (.cse80 (let ((.cse86 (let ((.cse87 (store .cse84 .cse78 (store .cse85 .cse4 v_ArrVal_2192)))) (store .cse87 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse87 |c_ULTIMATE.start_main_~#s~0#1.base|) 4 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse86 (select (select .cse86 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))))) (or (= (select .cse79 (select .cse80 .cse81)) 1) (= (select .cse79 (select (let ((.cse82 (let ((.cse83 (store .cse84 .cse78 (store .cse85 (+ v_arrayElimCell_156 8) v_ArrVal_2192)))) (store .cse83 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse83 |c_ULTIMATE.start_main_~#s~0#1.base|) 4 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse82 (select (select .cse82 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) .cse81)) 1) (= (select .cse79 (select .cse80 .cse23)) 1))))))))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_node_create_~temp~0#1.base_27| 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 0)))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_27| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_node_create_~temp~0#1.base_27| 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 0)) (forall ((v_arrayElimCell_157 Int) (v_ArrVal_2188 (Array Int Int))) (let ((.cse95 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2188) |c_ULTIMATE.start_main_~#s~0#1.base|) 4))))) (let ((.cse88 (select (select .cse95 |c_ULTIMATE.start_main_~#s~0#1.base|) 4))) (or (not (= .cse88 |c_ULTIMATE.start_main_~#s~0#1.base|)) (forall ((v_ArrVal_2182 Int) (v_ArrVal_2192 Int)) (let ((.cse96 (select .cse95 .cse88))) (let ((.cse91 (+ v_arrayElimCell_157 4)) (.cse89 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2182)) (.cse90 (let ((.cse97 (let ((.cse98 (store .cse95 .cse88 (store .cse96 .cse4 v_ArrVal_2192)))) (store .cse98 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse98 |c_ULTIMATE.start_main_~#s~0#1.base|) 4 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse97 (select (select .cse97 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))))) (or (= (select .cse89 (select .cse90 .cse91)) 1) (forall ((v_arrayElimCell_156 Int)) (let ((.cse92 (let ((.cse93 (let ((.cse94 (store .cse95 .cse88 (store .cse96 (+ v_arrayElimCell_156 8) v_ArrVal_2192)))) (store .cse94 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse94 |c_ULTIMATE.start_main_~#s~0#1.base|) 4 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse93 (select (select .cse93 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))))) (or (= (select .cse89 (select .cse92 4)) 1) (= (select .cse89 (select .cse92 .cse91)) 1)))) (= (select .cse89 (select .cse90 .cse23)) 1)))))))))))))) .cse41) (or (and (or .cse14 (forall ((v_arrayElimCell_157 Int) (v_arrayElimCell_156 Int) (v_ArrVal_2188 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_27| Int) (v_ArrVal_2182 Int) (v_ArrVal_2192 Int)) (let ((.cse106 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2188) |c_ULTIMATE.start_main_~#s~0#1.base|) 4))))) (let ((.cse103 (select (select .cse106 |c_ULTIMATE.start_main_~#s~0#1.base|) 4))) (let ((.cse107 (select .cse106 .cse103))) (let ((.cse100 (let ((.cse108 (let ((.cse109 (store .cse106 .cse103 (store .cse107 (+ v_arrayElimCell_156 8) v_ArrVal_2192)))) (store .cse109 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse109 |c_ULTIMATE.start_main_~#s~0#1.base|) 4 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse108 (select (select .cse108 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4)))) (.cse102 (+ v_arrayElimCell_157 4)) (.cse99 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2182)) (.cse101 (let ((.cse104 (let ((.cse105 (store .cse106 .cse103 (store .cse107 .cse4 v_ArrVal_2192)))) (store .cse105 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse105 |c_ULTIMATE.start_main_~#s~0#1.base|) 4 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse104 (select (select .cse104 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))))) (or (< v_arrayElimCell_156 0) (= (select .cse99 (select .cse100 4)) 1) (= (select .cse99 (select .cse100 (+ v_arrayElimCell_156 4))) 1) (< v_arrayElimCell_157 0) (= (select .cse99 (select .cse101 .cse102)) 1) (= (select .cse99 (select .cse100 .cse102)) 1) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_node_create_~temp~0#1.base_27| 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 0)) (= .cse103 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select .cse99 (select .cse101 .cse23)) 1)))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_27| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_node_create_~temp~0#1.base_27| 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 0)) (forall ((v_arrayElimCell_156 Int)) (or (< v_arrayElimCell_156 0) (forall ((v_arrayElimCell_157 Int)) (or (< v_arrayElimCell_157 0) (forall ((v_ArrVal_2188 (Array Int Int)) (v_ArrVal_2182 Int) (v_ArrVal_2192 Int)) (let ((.cse117 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2188) |c_ULTIMATE.start_main_~#s~0#1.base|) 4))))) (let ((.cse110 (select (select .cse117 |c_ULTIMATE.start_main_~#s~0#1.base|) 4))) (let ((.cse118 (select .cse117 .cse110))) (let ((.cse112 (let ((.cse119 (let ((.cse120 (store .cse117 .cse110 (store .cse118 (+ v_arrayElimCell_156 8) v_ArrVal_2192)))) (store .cse120 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse120 |c_ULTIMATE.start_main_~#s~0#1.base|) 4 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse119 (select (select .cse119 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4)))) (.cse114 (+ v_arrayElimCell_157 4)) (.cse111 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2182)) (.cse113 (let ((.cse115 (let ((.cse116 (store .cse117 .cse110 (store .cse118 .cse4 v_ArrVal_2192)))) (store .cse116 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse116 |c_ULTIMATE.start_main_~#s~0#1.base|) 4 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse115 (select (select .cse115 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))))) (or (not (= |v_ULTIMATE.start_node_create_~temp~0#1.base_27| .cse110)) (= (select .cse111 (select .cse112 4)) 1) (= (select .cse111 (select .cse112 (+ v_arrayElimCell_156 4))) 1) (= (select .cse111 (select .cse113 .cse114)) 1) (= (select .cse111 (select .cse112 .cse114)) 1) (= (select .cse111 (select .cse113 .cse23)) 1))))))))))))) (or .cse14 (forall ((v_arrayElimCell_157 Int) (v_arrayElimCell_156 Int) (v_ArrVal_2188 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_27| Int) (v_ArrVal_2182 Int) (v_ArrVal_2192 Int)) (let ((.cse128 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2188) |c_ULTIMATE.start_main_~#s~0#1.base|) 4))))) (let ((.cse125 (select (select .cse128 |c_ULTIMATE.start_main_~#s~0#1.base|) 4))) (let ((.cse129 (select .cse128 .cse125))) (let ((.cse122 (let ((.cse130 (let ((.cse131 (store .cse128 .cse125 (store .cse129 (+ v_arrayElimCell_156 8) v_ArrVal_2192)))) (store .cse131 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse131 |c_ULTIMATE.start_main_~#s~0#1.base|) 4 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse130 (select (select .cse130 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4)))) (.cse124 (+ v_arrayElimCell_157 4)) (.cse121 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2182)) (.cse123 (let ((.cse126 (let ((.cse127 (store .cse128 .cse125 (store .cse129 .cse4 v_ArrVal_2192)))) (store .cse127 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse127 |c_ULTIMATE.start_main_~#s~0#1.base|) 4 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse126 (select (select .cse126 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))))) (or (< v_arrayElimCell_156 0) (= (select .cse121 (select .cse122 4)) 1) (= (select .cse121 (select .cse122 (+ v_arrayElimCell_156 4))) 1) (= (select .cse121 (select .cse123 .cse124)) 1) (= (select .cse121 (select .cse122 .cse124)) 1) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_node_create_~temp~0#1.base_27| 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 0)) (= |v_ULTIMATE.start_node_create_~temp~0#1.base_27| .cse125) (= .cse125 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select .cse121 (select .cse123 .cse23)) 1)))))))) (or (forall ((v_arrayElimCell_157 Int) (v_arrayElimCell_156 Int) (v_ArrVal_2188 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_27| Int) (v_ArrVal_2182 Int) (v_ArrVal_2192 Int)) (let ((.cse139 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2188) |c_ULTIMATE.start_main_~#s~0#1.base|) 4))))) (let ((.cse136 (select (select .cse139 |c_ULTIMATE.start_main_~#s~0#1.base|) 4))) (let ((.cse140 (select .cse139 .cse136))) (let ((.cse133 (let ((.cse141 (let ((.cse142 (store .cse139 .cse136 (store .cse140 (+ v_arrayElimCell_156 8) v_ArrVal_2192)))) (store .cse142 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse142 |c_ULTIMATE.start_main_~#s~0#1.base|) 4 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse141 (select (select .cse141 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4)))) (.cse135 (+ v_arrayElimCell_157 4)) (.cse132 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2182)) (.cse134 (let ((.cse137 (let ((.cse138 (store .cse139 .cse136 (store .cse140 .cse4 v_ArrVal_2192)))) (store .cse138 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse138 |c_ULTIMATE.start_main_~#s~0#1.base|) 4 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse137 (select (select .cse137 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))))) (or (< v_arrayElimCell_156 0) (= (select .cse132 (select .cse133 4)) 1) (= (select .cse132 (select .cse133 (+ v_arrayElimCell_156 4))) 1) (= (select .cse132 (select .cse134 .cse135)) 1) (= (select .cse132 (select .cse133 .cse135)) 1) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_node_create_~temp~0#1.base_27| 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 0)) (= |v_ULTIMATE.start_node_create_~temp~0#1.base_27| .cse136) (= (select .cse132 (select .cse134 .cse23)) 1))))))) .cse14) (or (forall ((v_arrayElimCell_157 Int) (v_arrayElimCell_156 Int) (v_ArrVal_2188 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_27| Int) (v_ArrVal_2182 Int) (v_ArrVal_2192 Int)) (let ((.cse149 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2188) |c_ULTIMATE.start_main_~#s~0#1.base|) 4))))) (let ((.cse150 (select (select .cse149 |c_ULTIMATE.start_main_~#s~0#1.base|) 4))) (let ((.cse151 (select .cse149 .cse150))) (let ((.cse144 (let ((.cse152 (let ((.cse153 (store .cse149 .cse150 (store .cse151 (+ v_arrayElimCell_156 8) v_ArrVal_2192)))) (store .cse153 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse153 |c_ULTIMATE.start_main_~#s~0#1.base|) 4 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse152 (select (select .cse152 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4)))) (.cse146 (+ v_arrayElimCell_157 4)) (.cse143 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2182)) (.cse145 (let ((.cse147 (let ((.cse148 (store .cse149 .cse150 (store .cse151 .cse4 v_ArrVal_2192)))) (store .cse148 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse148 |c_ULTIMATE.start_main_~#s~0#1.base|) 4 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse147 (select (select .cse147 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))))) (or (< v_arrayElimCell_156 0) (= (select .cse143 (select .cse144 4)) 1) (= (select .cse143 (select .cse144 (+ v_arrayElimCell_156 4))) 1) (< v_arrayElimCell_157 0) (= (select .cse143 (select .cse145 .cse146)) 1) (= (select .cse143 (select .cse144 .cse146)) 1) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_node_create_~temp~0#1.base_27| 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 0)) (= (select .cse143 (select .cse145 .cse23)) 1))))))) .cse14)) .cse41) (or .cse154 .cse155 (and (or .cse5 (forall ((v_arrayElimArr_3 (Array Int Int)) (v_arrayElimCell_157 Int) (v_arrayElimCell_156 Int) (v_ArrVal_2182 Int) (v_ArrVal_2192 Int)) (let ((.cse161 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_arrayElimArr_3)) (.cse156 (select v_arrayElimArr_3 4))) (let ((.cse162 (select .cse161 .cse156))) (let ((.cse158 (let ((.cse163 (store .cse162 .cse4 v_ArrVal_2192))) (let ((.cse164 (store (select (store .cse161 .cse156 .cse163) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (select (store (store |c_#memory_$Pointer$.base| .cse156 .cse163) |c_ULTIMATE.start_main_~#s~0#1.base| .cse164) (select .cse164 4))))) (.cse157 (store |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2182))) (or (< v_arrayElimCell_156 0) (= .cse156 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select .cse157 (select .cse158 .cse23)) 1) (= (select .cse157 (select .cse158 (+ v_arrayElimCell_157 4))) 1) (not (= (select v_arrayElimArr_3 |c_ULTIMATE.start_main_~#s~0#1.offset|) .cse156)) (= (select .cse157 (select (let ((.cse159 (store .cse162 (+ v_arrayElimCell_156 8) v_ArrVal_2192))) (let ((.cse160 (store (select (store .cse161 .cse156 .cse159) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (select (store (store |c_#memory_$Pointer$.base| .cse156 .cse159) |c_ULTIMATE.start_main_~#s~0#1.base| .cse160) (select .cse160 4)))) (+ v_arrayElimCell_156 4))) 1))))))) (forall ((v_arrayElimArr_2 (Array Int Int)) (v_arrayElimCell_157 Int) (v_arrayElimCell_156 Int) (v_ArrVal_2182 Int) (v_ArrVal_2192 Int)) (let ((.cse170 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_arrayElimArr_2)) (.cse167 (select v_arrayElimArr_2 4))) (let ((.cse171 (select .cse170 .cse167))) (let ((.cse165 (store |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2182)) (.cse166 (let ((.cse172 (store .cse171 .cse4 v_ArrVal_2192))) (let ((.cse173 (store (select (store .cse170 .cse167 .cse172) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (select (store (store |c_#memory_$Pointer$.base| .cse167 .cse172) |c_ULTIMATE.start_main_~#s~0#1.base| .cse173) (select .cse173 4)))))) (or (= v_ArrVal_2182 1) (< v_arrayElimCell_156 0) (= (select .cse165 (select .cse166 .cse23)) 1) (not (= (select v_arrayElimArr_2 |c_ULTIMATE.start_main_~#s~0#1.offset|) .cse167)) (= .cse167 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select .cse165 (select (let ((.cse168 (store .cse171 (+ v_arrayElimCell_156 8) v_ArrVal_2192))) (let ((.cse169 (store (select (store .cse170 .cse167 .cse168) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (select (store (store |c_#memory_$Pointer$.base| .cse167 .cse168) |c_ULTIMATE.start_main_~#s~0#1.base| .cse169) (select .cse169 4)))) (+ v_arrayElimCell_156 4))) 1) (= (select .cse165 (select .cse166 (+ v_arrayElimCell_157 4))) 1)))))))) (or (and (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_27| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_node_create_~temp~0#1.base_27| 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 0)) (forall ((v_arrayElimCell_157 Int)) (or (< v_arrayElimCell_157 0) (forall ((v_ArrVal_2188 (Array Int Int))) (let ((.cse175 (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2188) |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse181 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select .cse175 |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (let ((.cse174 (select (select .cse181 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse174 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select .cse175 4))) |c_ULTIMATE.start_main_~#s~0#1.base|) 4)) (forall ((v_arrayElimCell_156 Int) (v_ArrVal_2182 Int) (v_ArrVal_2192 Int)) (let ((.cse182 (select .cse181 .cse174))) (let ((.cse177 (let ((.cse183 (let ((.cse184 (store .cse181 .cse174 (store .cse182 .cse4 v_ArrVal_2192)))) (store .cse184 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse184 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse183 (select (select .cse183 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4)))) (.cse176 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2182)) (.cse178 (+ v_arrayElimCell_157 4))) (or (< v_arrayElimCell_156 0) (= (select .cse176 (select .cse177 .cse23)) 1) (= (select .cse176 (select .cse177 .cse178)) 1) (= (select .cse176 (select (let ((.cse179 (let ((.cse180 (store .cse181 .cse174 (store .cse182 (+ v_arrayElimCell_156 8) v_ArrVal_2192)))) (store .cse180 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse180 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse179 (select (select .cse179 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) .cse178)) 1)))))))))))))) (or .cse5 (forall ((v_arrayElimCell_157 Int) (v_arrayElimCell_156 Int) (v_ArrVal_2188 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_27| Int) (v_ArrVal_2182 Int) (v_ArrVal_2192 Int)) (let ((.cse191 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2188) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (let ((.cse185 (select (select .cse191 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse192 (select .cse191 .cse185))) (let ((.cse187 (let ((.cse193 (let ((.cse194 (store .cse191 .cse185 (store .cse192 .cse4 v_ArrVal_2192)))) (store .cse194 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse194 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse193 (select (select .cse193 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4)))) (.cse186 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2182)) (.cse188 (+ v_arrayElimCell_157 4))) (or (< v_arrayElimCell_156 0) (not (= .cse185 |c_ULTIMATE.start_main_~#s~0#1.base|)) (< v_arrayElimCell_157 0) (= (select .cse186 (select .cse187 .cse23)) 1) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_node_create_~temp~0#1.base_27| 1)) (= (select .cse186 (select .cse187 .cse188)) 1) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 0)) (= (select .cse186 (select (let ((.cse189 (let ((.cse190 (store .cse191 .cse185 (store .cse192 (+ v_arrayElimCell_156 8) v_ArrVal_2192)))) (store .cse190 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse190 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse189 (select (select .cse189 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) .cse188)) 1)))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_27| Int)) (or (forall ((v_arrayElimCell_157 Int)) (or (forall ((v_ArrVal_2188 (Array Int Int))) (let ((.cse202 (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2188) |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse205 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select .cse202 |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (let ((.cse195 (select (select .cse205 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse195 |c_ULTIMATE.start_main_~#s~0#1.base|)) (forall ((v_ArrVal_2182 Int) (v_ArrVal_2192 Int)) (let ((.cse206 (select .cse205 .cse195))) (let ((.cse196 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2182)) (.cse208 (let ((.cse209 (let ((.cse210 (store .cse205 .cse195 (store .cse206 .cse4 v_ArrVal_2192)))) (store .cse210 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse210 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse209 (select (select .cse209 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4)))) (.cse207 (+ v_arrayElimCell_157 4))) (or (forall ((v_arrayElimCell_156 Int)) (let ((.cse201 (+ v_arrayElimCell_156 8))) (or (< v_arrayElimCell_156 0) (= (select .cse196 (select (let ((.cse197 (let ((.cse198 (let ((.cse199 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select .cse202 4))))) (let ((.cse200 (select (select .cse199 |c_ULTIMATE.start_main_~#s~0#1.base|) 4))) (store .cse199 .cse200 (store (select .cse199 .cse200) .cse201 v_ArrVal_2192)))))) (store .cse198 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse198 |c_ULTIMATE.start_main_~#s~0#1.base|) 4 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse197 (select (select .cse197 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) 4)) 1) (= (select .cse196 (select (let ((.cse203 (let ((.cse204 (store .cse205 .cse195 (store .cse206 .cse201 v_ArrVal_2192)))) (store .cse204 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse204 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse203 (select (select .cse203 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) .cse207)) 1)))) (= (select .cse196 (select .cse208 .cse23)) 1) (= (select .cse196 (select .cse208 .cse207)) 1)))))))))) (< v_arrayElimCell_157 0))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_node_create_~temp~0#1.base_27| 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 0))))) .cse14) (or (and (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_27| Int)) (or (forall ((v_arrayElimCell_156 Int)) (or (< v_arrayElimCell_156 0) (forall ((v_ArrVal_2188 (Array Int Int))) (let ((.cse217 (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2188) |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse223 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select .cse217 |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (let ((.cse224 (select (select .cse223 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_arrayElimCell_157 Int) (v_ArrVal_2182 Int) (v_ArrVal_2192 Int)) (let ((.cse216 (+ v_arrayElimCell_156 8)) (.cse225 (select .cse223 .cse224))) (let ((.cse218 (let ((.cse226 (let ((.cse227 (store .cse223 .cse224 (store .cse225 .cse4 v_ArrVal_2192)))) (store .cse227 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse227 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse226 (select (select .cse226 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4)))) (.cse219 (+ v_arrayElimCell_157 4)) (.cse211 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2182)) (.cse220 (let ((.cse221 (let ((.cse222 (store .cse223 .cse224 (store .cse225 .cse216 v_ArrVal_2192)))) (store .cse222 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse222 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse221 (select (select .cse221 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))))) (or (= (select .cse211 (select (let ((.cse212 (let ((.cse213 (let ((.cse214 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select .cse217 4))))) (let ((.cse215 (select (select .cse214 |c_ULTIMATE.start_main_~#s~0#1.base|) 4))) (store .cse214 .cse215 (store (select .cse214 .cse215) .cse216 v_ArrVal_2192)))))) (store .cse213 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse213 |c_ULTIMATE.start_main_~#s~0#1.base|) 4 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse212 (select (select .cse212 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) 4)) 1) (= (select .cse211 (select .cse218 .cse23)) 1) (= (select .cse211 (select .cse218 .cse219)) 1) (= (select .cse211 (select .cse220 .cse219)) 1) (= (select .cse211 (select .cse220 (+ v_arrayElimCell_156 4))) 1))))) (= |v_ULTIMATE.start_node_create_~temp~0#1.base_27| .cse224) (= .cse224 |c_ULTIMATE.start_main_~#s~0#1.base|)))))))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_node_create_~temp~0#1.base_27| 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 0)))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_27| Int)) (or (forall ((v_arrayElimCell_156 Int)) (or (< v_arrayElimCell_156 0) (forall ((v_ArrVal_2188 (Array Int Int))) (let ((.cse234 (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2188) |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse240 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select .cse234 |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (let ((.cse241 (select (select .cse240 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_2182 Int) (v_ArrVal_2192 Int)) (let ((.cse233 (+ v_arrayElimCell_156 8)) (.cse242 (select .cse240 .cse241))) (let ((.cse235 (let ((.cse243 (let ((.cse244 (store .cse240 .cse241 (store .cse242 .cse4 v_ArrVal_2192)))) (store .cse244 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse244 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse243 (select (select .cse243 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4)))) (.cse228 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2182)) (.cse237 (let ((.cse238 (let ((.cse239 (store .cse240 .cse241 (store .cse242 .cse233 v_ArrVal_2192)))) (store .cse239 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse239 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse238 (select (select .cse238 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))))) (or (= (select .cse228 (select (let ((.cse229 (let ((.cse230 (let ((.cse231 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select .cse234 4))))) (let ((.cse232 (select (select .cse231 |c_ULTIMATE.start_main_~#s~0#1.base|) 4))) (store .cse231 .cse232 (store (select .cse231 .cse232) .cse233 v_ArrVal_2192)))))) (store .cse230 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse230 |c_ULTIMATE.start_main_~#s~0#1.base|) 4 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse229 (select (select .cse229 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) 4)) 1) (= (select .cse228 (select .cse235 .cse23)) 1) (forall ((v_arrayElimCell_157 Int)) (let ((.cse236 (+ v_arrayElimCell_157 4))) (or (< v_arrayElimCell_157 0) (= (select .cse228 (select .cse235 .cse236)) 1) (= (select .cse228 (select .cse237 .cse236)) 1)))) (= (select .cse228 (select .cse237 (+ v_arrayElimCell_156 4))) 1))))) (= .cse241 |c_ULTIMATE.start_main_~#s~0#1.base|)))))))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_node_create_~temp~0#1.base_27| 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 0))))) .cse14) (or (and .cse245 .cse246) .cse41) (or .cse14 (and (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_27| Int)) (or (forall ((v_arrayElimCell_157 Int)) (or (< v_arrayElimCell_157 0) (forall ((v_ArrVal_2188 (Array Int Int))) (let ((.cse254 (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2188) |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse257 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select .cse254 |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (let ((.cse247 (select (select .cse257 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse247 |c_ULTIMATE.start_main_~#s~0#1.base|)) (forall ((v_ArrVal_2182 Int) (v_ArrVal_2192 Int)) (let ((.cse258 (select .cse257 .cse247))) (let ((.cse248 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2182)) (.cse260 (let ((.cse261 (let ((.cse262 (store .cse257 .cse247 (store .cse258 .cse4 v_ArrVal_2192)))) (store .cse262 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse262 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse261 (select (select .cse261 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4)))) (.cse259 (+ v_arrayElimCell_157 4))) (or (forall ((v_arrayElimCell_156 Int)) (let ((.cse253 (+ v_arrayElimCell_156 8))) (or (= (select .cse248 (select (let ((.cse249 (let ((.cse250 (let ((.cse251 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select .cse254 4))))) (let ((.cse252 (select (select .cse251 |c_ULTIMATE.start_main_~#s~0#1.base|) 4))) (store .cse251 .cse252 (store (select .cse251 .cse252) .cse253 v_ArrVal_2192)))))) (store .cse250 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse250 |c_ULTIMATE.start_main_~#s~0#1.base|) 4 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse249 (select (select .cse249 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) 4)) 1) (= (select .cse248 (select (let ((.cse255 (let ((.cse256 (store .cse257 .cse247 (store .cse258 .cse253 v_ArrVal_2192)))) (store .cse256 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse256 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse255 (select (select .cse255 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) .cse259)) 1)))) (= (select .cse248 (select .cse260 .cse23)) 1) (= (select .cse248 (select .cse260 .cse259)) 1)))))))))))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_node_create_~temp~0#1.base_27| 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 0)))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_27| Int)) (or (forall ((v_arrayElimCell_157 Int)) (or (forall ((v_ArrVal_2188 (Array Int Int))) (let ((.cse273 (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2188) |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse269 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select .cse273 |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (let ((.cse263 (select (select .cse269 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse263 |c_ULTIMATE.start_main_~#s~0#1.base|)) (forall ((v_arrayElimCell_156 Int) (v_ArrVal_2182 Int) (v_ArrVal_2192 Int)) (let ((.cse270 (select .cse269 .cse263))) (let ((.cse265 (let ((.cse271 (let ((.cse272 (store .cse269 .cse263 (store .cse270 .cse4 v_ArrVal_2192)))) (store .cse272 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse272 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse271 (select (select .cse271 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4)))) (.cse264 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2182)) (.cse266 (+ v_arrayElimCell_157 4))) (or (= (select .cse264 (select .cse265 .cse23)) 1) (= (select .cse264 (select .cse265 .cse266)) 1) (= (select .cse264 (select (let ((.cse267 (let ((.cse268 (store .cse269 .cse263 (store .cse270 (+ v_arrayElimCell_156 8) v_ArrVal_2192)))) (store .cse268 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse268 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse267 (select (select .cse267 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) .cse266)) 1))))) (= |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select .cse273 4))) |c_ULTIMATE.start_main_~#s~0#1.base|) 4))))))) (< v_arrayElimCell_157 0))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_node_create_~temp~0#1.base_27| 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 0)))) (or .cse5 (forall ((v_arrayElimCell_157 Int) (v_arrayElimCell_156 Int) (v_ArrVal_2188 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_27| Int) (v_ArrVal_2182 Int) (v_ArrVal_2192 Int)) (let ((.cse280 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2188) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (let ((.cse274 (select (select .cse280 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse281 (select .cse280 .cse274))) (let ((.cse276 (let ((.cse282 (let ((.cse283 (store .cse280 .cse274 (store .cse281 .cse4 v_ArrVal_2192)))) (store .cse283 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse283 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse282 (select (select .cse282 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4)))) (.cse275 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2182)) (.cse277 (+ v_arrayElimCell_157 4))) (or (not (= .cse274 |c_ULTIMATE.start_main_~#s~0#1.base|)) (< v_arrayElimCell_157 0) (= (select .cse275 (select .cse276 .cse23)) 1) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_node_create_~temp~0#1.base_27| 1)) (= (select .cse275 (select .cse276 .cse277)) 1) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 0)) (= (select .cse275 (select (let ((.cse278 (let ((.cse279 (store .cse280 .cse274 (store .cse281 (+ v_arrayElimCell_156 8) v_ArrVal_2192)))) (store .cse279 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse279 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse278 (select (select .cse278 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) .cse277)) 1)))))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_27| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_node_create_~temp~0#1.base_27| 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 0)) (forall ((v_arrayElimCell_156 Int)) (or (< v_arrayElimCell_156 0) (forall ((v_ArrVal_2188 (Array Int Int))) (let ((.cse290 (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2188) |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse296 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select .cse290 |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (let ((.cse297 (select (select .cse296 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_2182 Int) (v_ArrVal_2192 Int)) (let ((.cse289 (+ v_arrayElimCell_156 8)) (.cse298 (select .cse296 .cse297))) (let ((.cse291 (let ((.cse299 (let ((.cse300 (store .cse296 .cse297 (store .cse298 .cse4 v_ArrVal_2192)))) (store .cse300 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse300 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse299 (select (select .cse299 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4)))) (.cse284 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2182)) (.cse293 (let ((.cse294 (let ((.cse295 (store .cse296 .cse297 (store .cse298 .cse289 v_ArrVal_2192)))) (store .cse295 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse295 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse294 (select (select .cse294 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))))) (or (= (select .cse284 (select (let ((.cse285 (let ((.cse286 (let ((.cse287 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select .cse290 4))))) (let ((.cse288 (select (select .cse287 |c_ULTIMATE.start_main_~#s~0#1.base|) 4))) (store .cse287 .cse288 (store (select .cse287 .cse288) .cse289 v_ArrVal_2192)))))) (store .cse286 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse286 |c_ULTIMATE.start_main_~#s~0#1.base|) 4 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse285 (select (select .cse285 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) 4)) 1) (= (select .cse284 (select .cse291 .cse23)) 1) (forall ((v_arrayElimCell_157 Int)) (let ((.cse292 (+ v_arrayElimCell_157 4))) (or (< v_arrayElimCell_157 0) (= (select .cse284 (select .cse291 .cse292)) 1) (= (select .cse284 (select .cse293 .cse292)) 1)))) (= (select .cse284 (select .cse293 (+ v_arrayElimCell_156 4))) 1))))) (not (= |v_ULTIMATE.start_node_create_~temp~0#1.base_27| .cse297)) (= .cse297 |c_ULTIMATE.start_main_~#s~0#1.base|)))))))))) (or (forall ((v_arrayElimCell_157 Int) (v_arrayElimCell_156 Int) (v_ArrVal_2188 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_27| Int) (v_ArrVal_2182 Int) (v_ArrVal_2192 Int)) (let ((.cse305 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2188) |c_ULTIMATE.start_main_~#s~0#1.base|) 4))))) (let ((.cse301 (select (select .cse305 |c_ULTIMATE.start_main_~#s~0#1.base|) 4))) (let ((.cse302 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2182)) (.cse306 (select .cse305 .cse301))) (or (< v_arrayElimCell_156 0) (not (= |v_ULTIMATE.start_node_create_~temp~0#1.base_27| .cse301)) (= (select .cse302 (select (let ((.cse303 (let ((.cse304 (store .cse305 .cse301 (store .cse306 (+ v_arrayElimCell_156 8) v_ArrVal_2192)))) (store .cse304 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse304 |c_ULTIMATE.start_main_~#s~0#1.base|) 4 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse303 (select (select .cse303 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) 4)) 1) (< v_arrayElimCell_157 0) (= (select .cse302 (select (let ((.cse307 (let ((.cse308 (store .cse305 .cse301 (store .cse306 .cse4 v_ArrVal_2192)))) (store .cse308 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse308 |c_ULTIMATE.start_main_~#s~0#1.base|) 4 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse307 (select (select .cse307 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) (+ v_arrayElimCell_157 4))) 1) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_node_create_~temp~0#1.base_27| 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 0))))))) .cse41) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_27| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_node_create_~temp~0#1.base_27| 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 0)) (forall ((v_arrayElimCell_156 Int)) (or (< v_arrayElimCell_156 0) (forall ((v_arrayElimCell_157 Int)) (or (< v_arrayElimCell_157 0) (forall ((v_ArrVal_2188 (Array Int Int)) (v_ArrVal_2182 Int) (v_ArrVal_2192 Int)) (let ((.cse315 (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2188) |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse322 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select .cse315 |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (let ((.cse316 (select (select .cse322 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse314 (+ v_arrayElimCell_156 8)) (.cse323 (select .cse322 .cse316))) (let ((.cse317 (let ((.cse324 (let ((.cse325 (store .cse322 .cse316 (store .cse323 .cse4 v_ArrVal_2192)))) (store .cse325 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse325 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse324 (select (select .cse324 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4)))) (.cse318 (+ v_arrayElimCell_157 4)) (.cse309 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2182)) (.cse319 (let ((.cse320 (let ((.cse321 (store .cse322 .cse316 (store .cse323 .cse314 v_ArrVal_2192)))) (store .cse321 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse321 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse320 (select (select .cse320 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))))) (or (= (select .cse309 (select (let ((.cse310 (let ((.cse311 (let ((.cse312 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select .cse315 4))))) (let ((.cse313 (select (select .cse312 |c_ULTIMATE.start_main_~#s~0#1.base|) 4))) (store .cse312 .cse313 (store (select .cse312 .cse313) .cse314 v_ArrVal_2192)))))) (store .cse311 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse311 |c_ULTIMATE.start_main_~#s~0#1.base|) 4 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse310 (select (select .cse310 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) 4)) 1) (not (= |v_ULTIMATE.start_node_create_~temp~0#1.base_27| .cse316)) (= (select .cse309 (select .cse317 .cse23)) 1) (= (select .cse309 (select .cse317 .cse318)) 1) (= (select .cse309 (select .cse319 .cse318)) 1) (= (select .cse309 (select .cse319 (+ v_arrayElimCell_156 4))) 1)))))))))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_27| Int)) (or (forall ((v_arrayElimCell_156 Int)) (or (< v_arrayElimCell_156 0) (forall ((v_arrayElimCell_157 Int)) (or (< v_arrayElimCell_157 0) (forall ((v_ArrVal_2188 (Array Int Int)) (v_ArrVal_2182 Int) (v_ArrVal_2192 Int)) (let ((.cse332 (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2188) |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse337 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select .cse332 |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (let ((.cse333 (select (select .cse337 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse338 (select .cse337 .cse333))) (let ((.cse334 (let ((.cse339 (let ((.cse340 (store .cse337 .cse333 (store .cse338 .cse4 v_ArrVal_2192)))) (store .cse340 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse340 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse339 (select (select .cse339 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4)))) (.cse326 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2182)) (.cse331 (+ v_arrayElimCell_156 8))) (or (= (select .cse326 (select (let ((.cse327 (let ((.cse328 (let ((.cse329 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select .cse332 4))))) (let ((.cse330 (select (select .cse329 |c_ULTIMATE.start_main_~#s~0#1.base|) 4))) (store .cse329 .cse330 (store (select .cse329 .cse330) .cse331 v_ArrVal_2192)))))) (store .cse328 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse328 |c_ULTIMATE.start_main_~#s~0#1.base|) 4 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse327 (select (select .cse327 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) 4)) 1) (not (= |v_ULTIMATE.start_node_create_~temp~0#1.base_27| .cse333)) (= (select .cse326 (select .cse334 .cse23)) 1) (= (select .cse326 (select .cse334 (+ v_arrayElimCell_157 4))) 1) (= (select .cse326 (select (let ((.cse335 (let ((.cse336 (store .cse337 .cse333 (store .cse338 .cse331 v_ArrVal_2192)))) (store .cse336 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse336 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse335 (select (select .cse335 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) (+ v_arrayElimCell_156 4))) 1)))))))))))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_node_create_~temp~0#1.base_27| 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 0)))) (or (and (or .cse14 (and (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_27| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_node_create_~temp~0#1.base_27| 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 0)) (forall ((v_arrayElimCell_157 Int)) (or (< v_arrayElimCell_157 0) (forall ((v_ArrVal_2188 (Array Int Int))) (let ((.cse347 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2188) |c_ULTIMATE.start_main_~#s~0#1.base|) 4))))) (let ((.cse341 (select (select .cse347 |c_ULTIMATE.start_main_~#s~0#1.base|) 4))) (or (not (= .cse341 |c_ULTIMATE.start_main_~#s~0#1.base|)) (forall ((v_arrayElimCell_156 Int) (v_ArrVal_2182 Int) (v_ArrVal_2192 Int)) (let ((.cse348 (select .cse347 .cse341))) (let ((.cse344 (+ v_arrayElimCell_157 4)) (.cse342 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2182)) (.cse343 (let ((.cse349 (let ((.cse350 (store .cse347 .cse341 (store .cse348 .cse4 v_ArrVal_2192)))) (store .cse350 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse350 |c_ULTIMATE.start_main_~#s~0#1.base|) 4 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse349 (select (select .cse349 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))))) (or (< v_arrayElimCell_156 0) (= (select .cse342 (select .cse343 .cse344)) 1) (= (select .cse342 (select (let ((.cse345 (let ((.cse346 (store .cse347 .cse341 (store .cse348 (+ v_arrayElimCell_156 8) v_ArrVal_2192)))) (store .cse346 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse346 |c_ULTIMATE.start_main_~#s~0#1.base|) 4 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse345 (select (select .cse345 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) .cse344)) 1) (= (select .cse342 (select .cse343 .cse23)) 1))))))))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_27| Int)) (or (forall ((v_arrayElimCell_157 Int)) (or (< v_arrayElimCell_157 0) (forall ((v_ArrVal_2188 (Array Int Int))) (let ((.cse357 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2188) |c_ULTIMATE.start_main_~#s~0#1.base|) 4))))) (let ((.cse358 (select (select .cse357 |c_ULTIMATE.start_main_~#s~0#1.base|) 4))) (or (forall ((v_ArrVal_2182 Int) (v_ArrVal_2192 Int)) (let ((.cse359 (select .cse357 .cse358))) (let ((.cse352 (let ((.cse360 (let ((.cse361 (store .cse357 .cse358 (store .cse359 .cse4 v_ArrVal_2192)))) (store .cse361 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse361 |c_ULTIMATE.start_main_~#s~0#1.base|) 4 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse360 (select (select .cse360 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4)))) (.cse351 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2182)) (.cse353 (+ v_arrayElimCell_157 4))) (or (= (select .cse351 (select .cse352 .cse353)) 1) (= (select .cse351 (select .cse352 .cse23)) 1) (forall ((v_arrayElimCell_156 Int)) (let ((.cse354 (let ((.cse355 (let ((.cse356 (store .cse357 .cse358 (store .cse359 (+ v_arrayElimCell_156 8) v_ArrVal_2192)))) (store .cse356 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse356 |c_ULTIMATE.start_main_~#s~0#1.base|) 4 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse355 (select (select .cse355 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))))) (or (< v_arrayElimCell_156 0) (= (select .cse351 (select .cse354 4)) 1) (= (select .cse351 (select .cse354 .cse353)) 1)))))))) (not (= .cse358 |c_ULTIMATE.start_main_~#s~0#1.base|)))))))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_node_create_~temp~0#1.base_27| 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 0)))))) (or (and (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_27| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_node_create_~temp~0#1.base_27| 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 0)) (forall ((v_arrayElimCell_157 Int) (v_ArrVal_2188 (Array Int Int))) (let ((.cse368 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2188) |c_ULTIMATE.start_main_~#s~0#1.base|) 4))))) (let ((.cse369 (select (select .cse368 |c_ULTIMATE.start_main_~#s~0#1.base|) 4))) (or (forall ((v_ArrVal_2182 Int) (v_ArrVal_2192 Int)) (let ((.cse370 (select .cse368 .cse369))) (let ((.cse363 (let ((.cse371 (let ((.cse372 (store .cse368 .cse369 (store .cse370 .cse4 v_ArrVal_2192)))) (store .cse372 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse372 |c_ULTIMATE.start_main_~#s~0#1.base|) 4 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse371 (select (select .cse371 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4)))) (.cse362 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2182)) (.cse364 (+ v_arrayElimCell_157 4))) (or (= (select .cse362 (select .cse363 .cse364)) 1) (= (select .cse362 (select .cse363 .cse23)) 1) (forall ((v_arrayElimCell_156 Int)) (let ((.cse365 (let ((.cse366 (let ((.cse367 (store .cse368 .cse369 (store .cse370 (+ v_arrayElimCell_156 8) v_ArrVal_2192)))) (store .cse367 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse367 |c_ULTIMATE.start_main_~#s~0#1.base|) 4 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse366 (select (select .cse366 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))))) (or (< v_arrayElimCell_156 0) (= (select .cse362 (select .cse365 4)) 1) (= (select .cse362 (select .cse365 .cse364)) 1)))))))) (not (= .cse369 |c_ULTIMATE.start_main_~#s~0#1.base|)))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_27| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_node_create_~temp~0#1.base_27| 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 0)) (forall ((v_arrayElimCell_157 Int) (v_ArrVal_2188 (Array Int Int))) (let ((.cse379 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2188) |c_ULTIMATE.start_main_~#s~0#1.base|) 4))))) (let ((.cse373 (select (select .cse379 |c_ULTIMATE.start_main_~#s~0#1.base|) 4))) (or (not (= .cse373 |c_ULTIMATE.start_main_~#s~0#1.base|)) (forall ((v_arrayElimCell_156 Int) (v_ArrVal_2182 Int) (v_ArrVal_2192 Int)) (let ((.cse380 (select .cse379 .cse373))) (let ((.cse376 (+ v_arrayElimCell_157 4)) (.cse374 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2182)) (.cse375 (let ((.cse381 (let ((.cse382 (store .cse379 .cse373 (store .cse380 .cse4 v_ArrVal_2192)))) (store .cse382 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse382 |c_ULTIMATE.start_main_~#s~0#1.base|) 4 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse381 (select (select .cse381 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))))) (or (< v_arrayElimCell_156 0) (= (select .cse374 (select .cse375 .cse376)) 1) (= (select .cse374 (select (let ((.cse377 (let ((.cse378 (store .cse379 .cse373 (store .cse380 (+ v_arrayElimCell_156 8) v_ArrVal_2192)))) (store .cse378 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse378 |c_ULTIMATE.start_main_~#s~0#1.base|) 4 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse377 (select (select .cse377 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) .cse376)) 1) (= (select .cse374 (select .cse375 .cse23)) 1)))))))))))) .cse14)) .cse41) (or (and (or (forall ((v_arrayElimCell_157 Int) (v_arrayElimCell_156 Int) (v_ArrVal_2188 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_27| Int) (v_ArrVal_2182 Int) (v_ArrVal_2192 Int)) (let ((.cse386 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2188) |c_ULTIMATE.start_main_~#s~0#1.base|) 4))))) (let ((.cse387 (select (select .cse386 |c_ULTIMATE.start_main_~#s~0#1.base|) 4))) (let ((.cse388 (select .cse386 .cse387))) (let ((.cse383 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2182)) (.cse389 (let ((.cse390 (let ((.cse391 (store .cse386 .cse387 (store .cse388 .cse4 v_ArrVal_2192)))) (store .cse391 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse391 |c_ULTIMATE.start_main_~#s~0#1.base|) 4 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse390 (select (select .cse390 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))))) (or (= (select .cse383 (select (let ((.cse384 (let ((.cse385 (store .cse386 .cse387 (store .cse388 (+ v_arrayElimCell_156 8) v_ArrVal_2192)))) (store .cse385 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse385 |c_ULTIMATE.start_main_~#s~0#1.base|) 4 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse384 (select (select .cse384 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) 4)) 1) (= (select .cse383 (select .cse389 (+ v_arrayElimCell_157 4))) 1) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_node_create_~temp~0#1.base_27| 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 0)) (= |v_ULTIMATE.start_node_create_~temp~0#1.base_27| .cse387) (= (select .cse383 (select .cse389 .cse23)) 1))))))) .cse14) (or .cse392 .cse14) .cse393 (or (forall ((v_arrayElimCell_157 Int) (v_arrayElimCell_156 Int) (v_ArrVal_2188 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_27| Int) (v_ArrVal_2182 Int) (v_ArrVal_2192 Int)) (let ((.cse397 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2188) |c_ULTIMATE.start_main_~#s~0#1.base|) 4))))) (let ((.cse398 (select (select .cse397 |c_ULTIMATE.start_main_~#s~0#1.base|) 4))) (let ((.cse399 (select .cse397 .cse398))) (let ((.cse394 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2182)) (.cse400 (let ((.cse401 (let ((.cse402 (store .cse397 .cse398 (store .cse399 .cse4 v_ArrVal_2192)))) (store .cse402 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse402 |c_ULTIMATE.start_main_~#s~0#1.base|) 4 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse401 (select (select .cse401 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))))) (or (= (select .cse394 (select (let ((.cse395 (let ((.cse396 (store .cse397 .cse398 (store .cse399 (+ v_arrayElimCell_156 8) v_ArrVal_2192)))) (store .cse396 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse396 |c_ULTIMATE.start_main_~#s~0#1.base|) 4 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse395 (select (select .cse395 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) 4)) 1) (< v_arrayElimCell_157 0) (= (select .cse394 (select .cse400 (+ v_arrayElimCell_157 4))) 1) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_node_create_~temp~0#1.base_27| 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 0)) (= (select .cse394 (select .cse400 .cse23)) 1))))))) .cse14) .cse403) .cse41) (or .cse5 (and (or .cse14 (forall ((v_arrayElimCell_157 Int) (v_arrayElimCell_156 Int) (v_ArrVal_2188 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_27| Int) (v_ArrVal_2182 Int) (v_ArrVal_2192 Int)) (let ((.cse411 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2188) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (let ((.cse407 (select (select .cse411 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse412 (select .cse411 .cse407))) (let ((.cse405 (let ((.cse413 (let ((.cse414 (store .cse411 .cse407 (store .cse412 .cse4 v_ArrVal_2192)))) (store .cse414 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse414 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse413 (select (select .cse413 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4)))) (.cse406 (+ v_arrayElimCell_157 4)) (.cse404 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2182)) (.cse408 (let ((.cse409 (let ((.cse410 (store .cse411 .cse407 (store .cse412 (+ v_arrayElimCell_156 8) v_ArrVal_2192)))) (store .cse410 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse410 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse409 (select (select .cse409 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))))) (or (< v_arrayElimCell_156 0) (< v_arrayElimCell_157 0) (= (select .cse404 (select .cse405 .cse23)) 1) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_node_create_~temp~0#1.base_27| 1)) (= (select .cse404 (select .cse405 .cse406)) 1) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 0)) (= .cse407 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select .cse404 (select .cse408 .cse406)) 1) (= (select .cse404 (select .cse408 (+ v_arrayElimCell_156 4))) 1)))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_27| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_node_create_~temp~0#1.base_27| 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 0)) (forall ((v_arrayElimCell_156 Int)) (or (< v_arrayElimCell_156 0) (forall ((v_arrayElimCell_157 Int)) (or (forall ((v_ArrVal_2188 (Array Int Int)) (v_ArrVal_2182 Int) (v_ArrVal_2192 Int)) (let ((.cse422 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2188) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (let ((.cse415 (select (select .cse422 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse423 (select .cse422 .cse415))) (let ((.cse417 (let ((.cse424 (let ((.cse425 (store .cse422 .cse415 (store .cse423 .cse4 v_ArrVal_2192)))) (store .cse425 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse425 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse424 (select (select .cse424 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4)))) (.cse418 (+ v_arrayElimCell_157 4)) (.cse416 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2182)) (.cse419 (let ((.cse420 (let ((.cse421 (store .cse422 .cse415 (store .cse423 (+ v_arrayElimCell_156 8) v_ArrVal_2192)))) (store .cse421 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse421 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse420 (select (select .cse420 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))))) (or (not (= |v_ULTIMATE.start_node_create_~temp~0#1.base_27| .cse415)) (= (select .cse416 (select .cse417 .cse23)) 1) (= (select .cse416 (select .cse417 .cse418)) 1) (= .cse415 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select .cse416 (select .cse419 .cse418)) 1) (= (select .cse416 (select .cse419 (+ v_arrayElimCell_156 4))) 1))))))) (< v_arrayElimCell_157 0))))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_27| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_node_create_~temp~0#1.base_27| 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 0)) (forall ((v_ArrVal_2188 (Array Int Int))) (let ((.cse430 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2188) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (let ((.cse431 (select (select .cse430 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_2182 Int) (v_ArrVal_2192 Int)) (let ((.cse426 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2182)) (.cse427 (let ((.cse428 (let ((.cse429 (store .cse430 .cse431 (store (select .cse430 .cse431) .cse4 v_ArrVal_2192)))) (store .cse429 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse429 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse428 (select (select .cse428 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))))) (or (= (select .cse426 (select .cse427 .cse23)) 1) (forall ((v_arrayElimCell_157 Int)) (or (< v_arrayElimCell_157 0) (= (select .cse426 (select .cse427 (+ v_arrayElimCell_157 4))) 1)))))) (not (= |v_ULTIMATE.start_node_create_~temp~0#1.base_27| .cse431)))))))) (or (and (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_27| Int)) (or (forall ((v_ArrVal_2188 (Array Int Int)) (v_ArrVal_2182 Int) (v_ArrVal_2192 Int)) (let ((.cse432 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2182)) (.cse433 (let ((.cse434 (let ((.cse435 (let ((.cse436 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2188) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (let ((.cse437 (select (select .cse436 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (store .cse436 .cse437 (store (select .cse436 .cse437) .cse4 v_ArrVal_2192)))))) (store .cse435 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse435 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse434 (select (select .cse434 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))))) (or (= (select .cse432 (select .cse433 .cse23)) 1) (forall ((v_arrayElimCell_157 Int)) (or (< v_arrayElimCell_157 0) (= (select .cse432 (select .cse433 (+ v_arrayElimCell_157 4))) 1)))))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_node_create_~temp~0#1.base_27| 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 0)))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_27| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_node_create_~temp~0#1.base_27| 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 0)) (forall ((v_ArrVal_2188 (Array Int Int))) (let ((.cse443 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2188) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (let ((.cse438 (select (select .cse443 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= |v_ULTIMATE.start_node_create_~temp~0#1.base_27| .cse438) (forall ((v_arrayElimCell_157 Int) (v_ArrVal_2182 Int) (v_ArrVal_2192 Int)) (let ((.cse439 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2182)) (.cse440 (let ((.cse441 (let ((.cse442 (store .cse443 .cse438 (store (select .cse443 .cse438) .cse4 v_ArrVal_2192)))) (store .cse442 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse442 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse441 (select (select .cse441 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))))) (or (= (select .cse439 (select .cse440 .cse23)) 1) (= (select .cse439 (select .cse440 (+ v_arrayElimCell_157 4))) 1))))))))))) .cse14) (or .cse5 (and (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_27| Int)) (or (forall ((v_arrayElimCell_156 Int)) (or (< v_arrayElimCell_156 0) (forall ((v_ArrVal_2188 (Array Int Int))) (let ((.cse451 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2188) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (let ((.cse444 (select (select .cse451 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= |v_ULTIMATE.start_node_create_~temp~0#1.base_27| .cse444)) (forall ((v_ArrVal_2182 Int) (v_ArrVal_2192 Int)) (let ((.cse452 (select .cse451 .cse444))) (let ((.cse446 (let ((.cse453 (let ((.cse454 (store .cse451 .cse444 (store .cse452 .cse4 v_ArrVal_2192)))) (store .cse454 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse454 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse453 (select (select .cse453 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4)))) (.cse445 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2182)) (.cse448 (let ((.cse449 (let ((.cse450 (store .cse451 .cse444 (store .cse452 (+ v_arrayElimCell_156 8) v_ArrVal_2192)))) (store .cse450 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse450 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse449 (select (select .cse449 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))))) (or (= (select .cse445 (select .cse446 .cse23)) 1) (forall ((v_arrayElimCell_157 Int)) (let ((.cse447 (+ v_arrayElimCell_157 4))) (or (< v_arrayElimCell_157 0) (= (select .cse445 (select .cse446 .cse447)) 1) (= (select .cse445 (select .cse448 .cse447)) 1)))) (= (select .cse445 (select .cse448 (+ v_arrayElimCell_156 4))) 1))))))))))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_node_create_~temp~0#1.base_27| 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 0)))) (or .cse14 (and (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_27| Int)) (or (forall ((v_arrayElimCell_156 Int)) (or (< v_arrayElimCell_156 0) (forall ((v_ArrVal_2188 (Array Int Int))) (let ((.cse462 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2188) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (let ((.cse455 (select (select .cse462 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= .cse455 |c_ULTIMATE.start_main_~#s~0#1.base|) (forall ((v_ArrVal_2182 Int) (v_ArrVal_2192 Int)) (let ((.cse463 (select .cse462 .cse455))) (let ((.cse457 (let ((.cse464 (let ((.cse465 (store .cse462 .cse455 (store .cse463 .cse4 v_ArrVal_2192)))) (store .cse465 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse465 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse464 (select (select .cse464 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4)))) (.cse456 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2182)) (.cse459 (let ((.cse460 (let ((.cse461 (store .cse462 .cse455 (store .cse463 (+ v_arrayElimCell_156 8) v_ArrVal_2192)))) (store .cse461 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse461 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse460 (select (select .cse460 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))))) (or (= (select .cse456 (select .cse457 .cse23)) 1) (forall ((v_arrayElimCell_157 Int)) (let ((.cse458 (+ v_arrayElimCell_157 4))) (or (< v_arrayElimCell_157 0) (= (select .cse456 (select .cse457 .cse458)) 1) (= (select .cse456 (select .cse459 .cse458)) 1)))) (= (select .cse456 (select .cse459 (+ v_arrayElimCell_156 4))) 1))))))))))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_node_create_~temp~0#1.base_27| 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 0)))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_27| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_node_create_~temp~0#1.base_27| 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 0)) (forall ((v_arrayElimCell_156 Int)) (or (< v_arrayElimCell_156 0) (forall ((v_ArrVal_2188 (Array Int Int))) (let ((.cse472 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2188) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (let ((.cse473 (select (select .cse472 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_arrayElimCell_157 Int) (v_ArrVal_2182 Int) (v_ArrVal_2192 Int)) (let ((.cse474 (select .cse472 .cse473))) (let ((.cse467 (let ((.cse475 (let ((.cse476 (store .cse472 .cse473 (store .cse474 .cse4 v_ArrVal_2192)))) (store .cse476 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse476 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse475 (select (select .cse475 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4)))) (.cse468 (+ v_arrayElimCell_157 4)) (.cse466 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2182)) (.cse469 (let ((.cse470 (let ((.cse471 (store .cse472 .cse473 (store .cse474 (+ v_arrayElimCell_156 8) v_ArrVal_2192)))) (store .cse471 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse471 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse470 (select (select .cse470 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))))) (or (= (select .cse466 (select .cse467 .cse23)) 1) (= (select .cse466 (select .cse467 .cse468)) 1) (= (select .cse466 (select .cse469 .cse468)) 1) (= (select .cse466 (select .cse469 (+ v_arrayElimCell_156 4))) 1))))) (= |v_ULTIMATE.start_node_create_~temp~0#1.base_27| .cse473) (= .cse473 |c_ULTIMATE.start_main_~#s~0#1.base|))))))))))) (or .cse14 (forall ((v_arrayElimCell_157 Int) (v_arrayElimCell_156 Int) (v_ArrVal_2188 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_27| Int) (v_ArrVal_2182 Int) (v_ArrVal_2192 Int)) (let ((.cse483 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2188) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (let ((.cse484 (select (select .cse483 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse485 (select .cse483 .cse484))) (let ((.cse478 (let ((.cse486 (let ((.cse487 (store .cse483 .cse484 (store .cse485 .cse4 v_ArrVal_2192)))) (store .cse487 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse487 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse486 (select (select .cse486 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4)))) (.cse479 (+ v_arrayElimCell_157 4)) (.cse477 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2182)) (.cse480 (let ((.cse481 (let ((.cse482 (store .cse483 .cse484 (store .cse485 (+ v_arrayElimCell_156 8) v_ArrVal_2192)))) (store .cse482 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse482 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse481 (select (select .cse481 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))))) (or (< v_arrayElimCell_156 0) (< v_arrayElimCell_157 0) (= (select .cse477 (select .cse478 .cse23)) 1) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_node_create_~temp~0#1.base_27| 1)) (= (select .cse477 (select .cse478 .cse479)) 1) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 0)) (= (select .cse477 (select .cse480 .cse479)) 1) (= (select .cse477 (select .cse480 (+ v_arrayElimCell_156 4))) 1)))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_27| Int)) (or (forall ((v_arrayElimCell_156 Int)) (or (< v_arrayElimCell_156 0) (forall ((v_arrayElimCell_157 Int)) (or (< v_arrayElimCell_157 0) (forall ((v_ArrVal_2188 (Array Int Int)) (v_ArrVal_2182 Int) (v_ArrVal_2192 Int)) (let ((.cse495 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2188) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (let ((.cse488 (select (select .cse495 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse496 (select .cse495 .cse488))) (let ((.cse490 (let ((.cse497 (let ((.cse498 (store .cse495 .cse488 (store .cse496 .cse4 v_ArrVal_2192)))) (store .cse498 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse498 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse497 (select (select .cse497 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4)))) (.cse491 (+ v_arrayElimCell_157 4)) (.cse489 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2182)) (.cse492 (let ((.cse493 (let ((.cse494 (store .cse495 .cse488 (store .cse496 (+ v_arrayElimCell_156 8) v_ArrVal_2192)))) (store .cse494 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse494 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse493 (select (select .cse493 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))))) (or (not (= |v_ULTIMATE.start_node_create_~temp~0#1.base_27| .cse488)) (= (select .cse489 (select .cse490 .cse23)) 1) (= (select .cse489 (select .cse490 .cse491)) 1) (= (select .cse489 (select .cse492 .cse491)) 1) (= (select .cse489 (select .cse492 (+ v_arrayElimCell_156 4))) 1))))))))))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_node_create_~temp~0#1.base_27| 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 0)))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_27| Int)) (or (forall ((v_arrayElimCell_157 Int) (v_ArrVal_2188 (Array Int Int)) (v_ArrVal_2182 Int) (v_ArrVal_2192 Int)) (let ((.cse502 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2188) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (let ((.cse499 (select (select .cse502 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= |v_ULTIMATE.start_node_create_~temp~0#1.base_27| .cse499)) (< v_arrayElimCell_157 0) (= (select (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2182) (select (let ((.cse500 (let ((.cse501 (store .cse502 .cse499 (store (select .cse502 .cse499) .cse4 v_ArrVal_2192)))) (store .cse501 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse501 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse500 (select (select .cse500 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) (+ v_arrayElimCell_157 4))) 1))))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_node_create_~temp~0#1.base_27| 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 0)))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_27| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_node_create_~temp~0#1.base_27| 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 0)) (forall ((v_ArrVal_2188 (Array Int Int))) (let ((.cse510 (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2188) |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse515 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select .cse510 |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (let ((.cse503 (select (select .cse515 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= |v_ULTIMATE.start_node_create_~temp~0#1.base_27| .cse503)) (forall ((v_arrayElimCell_157 Int)) (or (< v_arrayElimCell_157 0) (forall ((v_ArrVal_2182 Int) (v_ArrVal_2192 Int)) (let ((.cse504 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2182)) (.cse516 (select .cse515 .cse503)) (.cse512 (+ v_arrayElimCell_157 4))) (or (forall ((v_arrayElimCell_156 Int)) (let ((.cse509 (+ v_arrayElimCell_156 8))) (let ((.cse511 (let ((.cse513 (let ((.cse514 (store .cse515 .cse503 (store .cse516 .cse509 v_ArrVal_2192)))) (store .cse514 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse514 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse513 (select (select .cse513 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))))) (or (< v_arrayElimCell_156 0) (= (select .cse504 (select (let ((.cse505 (let ((.cse506 (let ((.cse507 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select .cse510 4))))) (let ((.cse508 (select (select .cse507 |c_ULTIMATE.start_main_~#s~0#1.base|) 4))) (store .cse507 .cse508 (store (select .cse507 .cse508) .cse509 v_ArrVal_2192)))))) (store .cse506 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse506 |c_ULTIMATE.start_main_~#s~0#1.base|) 4 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse505 (select (select .cse505 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) 4)) 1) (= (select .cse504 (select .cse511 .cse512)) 1) (= (select .cse504 (select .cse511 (+ v_arrayElimCell_156 4))) 1))))) (= (select .cse504 (select (let ((.cse517 (let ((.cse518 (store .cse515 .cse503 (store .cse516 .cse4 v_ArrVal_2192)))) (store .cse518 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse518 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse517 (select (select .cse517 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) .cse512)) 1))))))))))))) (or (forall ((v_arrayElimCell_157 Int) (v_arrayElimCell_156 Int) (v_ArrVal_2188 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_27| Int) (v_ArrVal_2182 Int) (v_ArrVal_2192 Int)) (let ((.cse525 (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2188) |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse530 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select .cse525 |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (let ((.cse527 (select (select .cse530 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse531 (select .cse530 .cse527))) (let ((.cse526 (let ((.cse532 (let ((.cse533 (store .cse530 .cse527 (store .cse531 .cse4 v_ArrVal_2192)))) (store .cse533 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse533 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse532 (select (select .cse532 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4)))) (.cse519 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2182)) (.cse524 (+ v_arrayElimCell_156 8))) (or (< v_arrayElimCell_156 0) (= (select .cse519 (select (let ((.cse520 (let ((.cse521 (let ((.cse522 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select .cse525 4))))) (let ((.cse523 (select (select .cse522 |c_ULTIMATE.start_main_~#s~0#1.base|) 4))) (store .cse522 .cse523 (store (select .cse522 .cse523) .cse524 v_ArrVal_2192)))))) (store .cse521 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse521 |c_ULTIMATE.start_main_~#s~0#1.base|) 4 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse520 (select (select .cse520 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) 4)) 1) (< v_arrayElimCell_157 0) (= (select .cse519 (select .cse526 .cse23)) 1) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_node_create_~temp~0#1.base_27| 1)) (= (select .cse519 (select .cse526 (+ v_arrayElimCell_157 4))) 1) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 0)) (= .cse527 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select .cse519 (select (let ((.cse528 (let ((.cse529 (store .cse530 .cse527 (store .cse531 .cse524 v_ArrVal_2192)))) (store .cse529 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse529 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse528 (select (select .cse528 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) (+ v_arrayElimCell_156 4))) 1)))))))) .cse14) (or (forall ((v_arrayElimCell_157 Int) (v_arrayElimCell_156 Int) (v_ArrVal_2188 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_27| Int) (v_ArrVal_2182 Int) (v_ArrVal_2192 Int)) (let ((.cse540 (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2188) |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse547 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select .cse540 |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (let ((.cse543 (select (select .cse547 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse539 (+ v_arrayElimCell_156 8)) (.cse548 (select .cse547 .cse543))) (let ((.cse541 (let ((.cse549 (let ((.cse550 (store .cse547 .cse543 (store .cse548 .cse4 v_ArrVal_2192)))) (store .cse550 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse550 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse549 (select (select .cse549 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4)))) (.cse542 (+ v_arrayElimCell_157 4)) (.cse534 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2182)) (.cse544 (let ((.cse545 (let ((.cse546 (store .cse547 .cse543 (store .cse548 .cse539 v_ArrVal_2192)))) (store .cse546 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse546 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse545 (select (select .cse545 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))))) (or (< v_arrayElimCell_156 0) (= (select .cse534 (select (let ((.cse535 (let ((.cse536 (let ((.cse537 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select .cse540 4))))) (let ((.cse538 (select (select .cse537 |c_ULTIMATE.start_main_~#s~0#1.base|) 4))) (store .cse537 .cse538 (store (select .cse537 .cse538) .cse539 v_ArrVal_2192)))))) (store .cse536 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse536 |c_ULTIMATE.start_main_~#s~0#1.base|) 4 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse535 (select (select .cse535 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) 4)) 1) (< v_arrayElimCell_157 0) (= (select .cse534 (select .cse541 .cse23)) 1) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_node_create_~temp~0#1.base_27| 1)) (= (select .cse534 (select .cse541 .cse542)) 1) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 0)) (= .cse543 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select .cse534 (select .cse544 .cse542)) 1) (= (select .cse534 (select .cse544 (+ v_arrayElimCell_156 4))) 1)))))))) .cse14) (or .cse154 .cse155 (forall ((v_arrayElimArr_1 (Array Int Int)) (v_arrayElimCell_157 Int) (v_arrayElimCell_156 Int) (v_ArrVal_2182 Int) (v_ArrVal_2192 Int)) (let ((.cse558 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_arrayElimArr_1)) (.cse553 (select v_arrayElimArr_1 4))) (let ((.cse559 (select .cse558 .cse553))) (let ((.cse552 (let ((.cse560 (store .cse559 .cse4 v_ArrVal_2192))) (let ((.cse561 (store (select (store .cse558 .cse553 .cse560) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (select (store (store |c_#memory_$Pointer$.base| .cse553 .cse560) |c_ULTIMATE.start_main_~#s~0#1.base| .cse561) (select .cse561 4))))) (.cse555 (+ v_arrayElimCell_157 4)) (.cse551 (store |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_2182)) (.cse554 (let ((.cse556 (store .cse559 (+ v_arrayElimCell_156 8) v_ArrVal_2192))) (let ((.cse557 (store (select (store .cse558 .cse553 .cse556) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (select (store (store |c_#memory_$Pointer$.base| .cse553 .cse556) |c_ULTIMATE.start_main_~#s~0#1.base| .cse557) (select .cse557 4)))))) (or (= v_ArrVal_2182 1) (< v_arrayElimCell_156 0) (= (select .cse551 (select .cse552 .cse23)) 1) (= .cse553 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select .cse551 (select .cse554 .cse555)) 1) (= (select .cse551 (select .cse552 .cse555)) 1) (not (= (select v_arrayElimArr_1 |c_ULTIMATE.start_main_~#s~0#1.offset|) .cse553)) (= 1 (select .cse551 (select .cse554 (+ v_arrayElimCell_156 4)))))))))) (or .cse14 (and (or .cse5 .cse562) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_27| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_node_create_~temp~0#1.base_27| 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 0)) (forall ((v_ArrVal_2188 (Array Int Int))) (let ((.cse569 (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2188) |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse572 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select .cse569 |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (let ((.cse573 (select (select .cse572 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_arrayElimCell_157 Int)) (or (< v_arrayElimCell_157 0) (forall ((v_ArrVal_2182 Int) (v_ArrVal_2192 Int)) (let ((.cse574 (select .cse572 .cse573))) (let ((.cse563 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2182)) (.cse575 (let ((.cse576 (let ((.cse577 (store .cse572 .cse573 (store .cse574 .cse4 v_ArrVal_2192)))) (store .cse577 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse577 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse576 (select (select .cse576 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))))) (or (forall ((v_arrayElimCell_156 Int)) (let ((.cse568 (+ v_arrayElimCell_156 8))) (or (< v_arrayElimCell_156 0) (= (select .cse563 (select (let ((.cse564 (let ((.cse565 (let ((.cse566 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select .cse569 4))))) (let ((.cse567 (select (select .cse566 |c_ULTIMATE.start_main_~#s~0#1.base|) 4))) (store .cse566 .cse567 (store (select .cse566 .cse567) .cse568 v_ArrVal_2192)))))) (store .cse565 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse565 |c_ULTIMATE.start_main_~#s~0#1.base|) 4 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse564 (select (select .cse564 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) 4)) 1) (= (select .cse563 (select (let ((.cse570 (let ((.cse571 (store .cse572 .cse573 (store .cse574 .cse568 v_ArrVal_2192)))) (store .cse571 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse571 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse570 (select (select .cse570 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) (+ v_arrayElimCell_156 4))) 1)))) (= (select .cse563 (select .cse575 .cse23)) 1) (= (select .cse563 (select .cse575 (+ v_arrayElimCell_157 4))) 1))))))) (= .cse573 |c_ULTIMATE.start_main_~#s~0#1.base|)))))))) .cse578 .cse579)) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_27| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_node_create_~temp~0#1.base_27| 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 0)) (forall ((v_ArrVal_2188 (Array Int Int))) (let ((.cse587 (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2188) |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse590 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select .cse587 |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (let ((.cse580 (select (select .cse590 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= |v_ULTIMATE.start_node_create_~temp~0#1.base_27| .cse580)) (forall ((v_arrayElimCell_157 Int)) (or (< v_arrayElimCell_157 0) (forall ((v_ArrVal_2182 Int) (v_ArrVal_2192 Int)) (let ((.cse581 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2182)) (.cse591 (select .cse590 .cse580))) (or (forall ((v_arrayElimCell_156 Int)) (let ((.cse586 (+ v_arrayElimCell_156 8))) (or (< v_arrayElimCell_156 0) (= (select .cse581 (select (let ((.cse582 (let ((.cse583 (let ((.cse584 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select .cse587 4))))) (let ((.cse585 (select (select .cse584 |c_ULTIMATE.start_main_~#s~0#1.base|) 4))) (store .cse584 .cse585 (store (select .cse584 .cse585) .cse586 v_ArrVal_2192)))))) (store .cse583 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse583 |c_ULTIMATE.start_main_~#s~0#1.base|) 4 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse582 (select (select .cse582 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) 4)) 1) (= (select .cse581 (select (let ((.cse588 (let ((.cse589 (store .cse590 .cse580 (store .cse591 .cse586 v_ArrVal_2192)))) (store .cse589 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse589 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse588 (select (select .cse588 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) (+ v_arrayElimCell_156 4))) 1)))) (= (select .cse581 (select (let ((.cse592 (let ((.cse593 (store .cse590 .cse580 (store .cse591 .cse4 v_ArrVal_2192)))) (store .cse593 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse593 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse592 (select (select .cse592 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) (+ v_arrayElimCell_157 4))) 1))))))))))))) (or (and .cse578 .cse579) .cse14) (or .cse14 (and (or .cse5 (forall ((v_arrayElimCell_157 Int) (v_arrayElimCell_156 Int) (v_ArrVal_2188 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_27| Int) (v_ArrVal_2182 Int) (v_ArrVal_2192 Int)) (let ((.cse600 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2188) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (let ((.cse594 (select (select .cse600 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse601 (select .cse600 .cse594))) (let ((.cse596 (let ((.cse602 (let ((.cse603 (store .cse600 .cse594 (store .cse601 .cse4 v_ArrVal_2192)))) (store .cse603 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse603 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse602 (select (select .cse602 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4)))) (.cse595 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2182)) (.cse597 (+ v_arrayElimCell_157 4))) (or (< v_arrayElimCell_156 0) (not (= .cse594 |c_ULTIMATE.start_main_~#s~0#1.base|)) (< v_arrayElimCell_157 0) (= (select .cse595 (select .cse596 .cse23)) 1) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_node_create_~temp~0#1.base_27| 1)) (= (select .cse595 (select .cse596 .cse597)) 1) (= |v_ULTIMATE.start_node_create_~temp~0#1.base_27| .cse594) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 0)) (= (select .cse595 (select (let ((.cse598 (let ((.cse599 (store .cse600 .cse594 (store .cse601 (+ v_arrayElimCell_156 8) v_ArrVal_2192)))) (store .cse599 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse599 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse598 (select (select .cse598 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) .cse597)) 1)))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_27| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_node_create_~temp~0#1.base_27| 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 0)) (forall ((v_arrayElimCell_157 Int)) (or (< v_arrayElimCell_157 0) (forall ((v_ArrVal_2188 (Array Int Int))) (let ((.cse611 (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2188) |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse614 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select .cse611 |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (let ((.cse604 (select (select .cse614 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse604 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |v_ULTIMATE.start_node_create_~temp~0#1.base_27| .cse604) (forall ((v_ArrVal_2182 Int) (v_ArrVal_2192 Int)) (let ((.cse615 (select .cse614 .cse604))) (let ((.cse605 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2182)) (.cse617 (let ((.cse618 (let ((.cse619 (store .cse614 .cse604 (store .cse615 .cse4 v_ArrVal_2192)))) (store .cse619 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse619 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse618 (select (select .cse618 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4)))) (.cse616 (+ v_arrayElimCell_157 4))) (or (forall ((v_arrayElimCell_156 Int)) (let ((.cse610 (+ v_arrayElimCell_156 8))) (or (< v_arrayElimCell_156 0) (= (select .cse605 (select (let ((.cse606 (let ((.cse607 (let ((.cse608 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select .cse611 4))))) (let ((.cse609 (select (select .cse608 |c_ULTIMATE.start_main_~#s~0#1.base|) 4))) (store .cse608 .cse609 (store (select .cse608 .cse609) .cse610 v_ArrVal_2192)))))) (store .cse607 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse607 |c_ULTIMATE.start_main_~#s~0#1.base|) 4 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse606 (select (select .cse606 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) 4)) 1) (= (select .cse605 (select (let ((.cse612 (let ((.cse613 (store .cse614 .cse604 (store .cse615 .cse610 v_ArrVal_2192)))) (store .cse613 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse613 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse612 (select (select .cse612 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) .cse616)) 1)))) (= (select .cse605 (select .cse617 .cse23)) 1) (= (select .cse605 (select .cse617 .cse616)) 1)))))))))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_27| Int)) (or (forall ((v_arrayElimCell_157 Int)) (or (forall ((v_ArrVal_2188 (Array Int Int))) (let ((.cse621 (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2188) |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse627 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select .cse621 |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (let ((.cse620 (select (select .cse627 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse620 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |v_ULTIMATE.start_node_create_~temp~0#1.base_27| .cse620) (= |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select .cse621 4))) |c_ULTIMATE.start_main_~#s~0#1.base|) 4)) (forall ((v_arrayElimCell_156 Int) (v_ArrVal_2182 Int) (v_ArrVal_2192 Int)) (let ((.cse628 (select .cse627 .cse620))) (let ((.cse623 (let ((.cse629 (let ((.cse630 (store .cse627 .cse620 (store .cse628 .cse4 v_ArrVal_2192)))) (store .cse630 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse630 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse629 (select (select .cse629 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4)))) (.cse622 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2182)) (.cse624 (+ v_arrayElimCell_157 4))) (or (< v_arrayElimCell_156 0) (= (select .cse622 (select .cse623 .cse23)) 1) (= (select .cse622 (select .cse623 .cse624)) 1) (= (select .cse622 (select (let ((.cse625 (let ((.cse626 (store .cse627 .cse620 (store .cse628 (+ v_arrayElimCell_156 8) v_ArrVal_2192)))) (store .cse626 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse626 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse625 (select (select .cse625 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) .cse624)) 1)))))))))) (< v_arrayElimCell_157 0))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_node_create_~temp~0#1.base_27| 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 0)))))) (or .cse5 (forall ((v_arrayElimCell_157 Int) (v_arrayElimCell_156 Int) (v_ArrVal_2188 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_27| Int) (v_ArrVal_2182 Int) (v_ArrVal_2192 Int)) (let ((.cse637 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2188) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (let ((.cse631 (select (select .cse637 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse638 (select .cse637 .cse631))) (let ((.cse633 (let ((.cse639 (let ((.cse640 (store .cse637 .cse631 (store .cse638 .cse4 v_ArrVal_2192)))) (store .cse640 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse640 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse639 (select (select .cse639 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4)))) (.cse632 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2182)) (.cse634 (+ v_arrayElimCell_157 4))) (or (not (= .cse631 |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= |v_ULTIMATE.start_node_create_~temp~0#1.base_27| .cse631)) (< v_arrayElimCell_157 0) (= (select .cse632 (select .cse633 .cse23)) 1) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_node_create_~temp~0#1.base_27| 1)) (= (select .cse632 (select .cse633 .cse634)) 1) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 0)) (= (select .cse632 (select (let ((.cse635 (let ((.cse636 (store .cse637 .cse631 (store .cse638 (+ v_arrayElimCell_156 8) v_ArrVal_2192)))) (store .cse636 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse636 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse635 (select (select .cse635 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) .cse634)) 1)))))))) (or (and (or .cse41 (forall ((v_arrayElimCell_157 Int) (v_arrayElimCell_156 Int) (v_ArrVal_2188 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_27| Int) (v_ArrVal_2182 Int) (v_ArrVal_2192 Int)) (let ((.cse646 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2188) |c_ULTIMATE.start_main_~#s~0#1.base|) 4))))) (let ((.cse643 (select (select .cse646 |c_ULTIMATE.start_main_~#s~0#1.base|) 4))) (let ((.cse647 (select .cse646 .cse643))) (let ((.cse642 (let ((.cse648 (let ((.cse649 (store .cse646 .cse643 (store .cse647 (+ v_arrayElimCell_156 8) v_ArrVal_2192)))) (store .cse649 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse649 |c_ULTIMATE.start_main_~#s~0#1.base|) 4 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse648 (select (select .cse648 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4)))) (.cse641 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2182))) (or (< v_arrayElimCell_156 0) (= (select .cse641 (select .cse642 4)) 1) (< v_arrayElimCell_157 0) (= (select .cse641 (select .cse642 (+ v_arrayElimCell_157 4))) 1) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_node_create_~temp~0#1.base_27| 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 0)) (= |v_ULTIMATE.start_node_create_~temp~0#1.base_27| .cse643) (= .cse643 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select .cse641 (select (let ((.cse644 (let ((.cse645 (store .cse646 .cse643 (store .cse647 .cse4 v_ArrVal_2192)))) (store .cse645 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse645 |c_ULTIMATE.start_main_~#s~0#1.base|) 4 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse644 (select (select .cse644 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) .cse23)) 1)))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_27| Int)) (or (forall ((v_ArrVal_2188 (Array Int Int))) (let ((.cse656 (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2188) |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse659 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select .cse656 |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (let ((.cse660 (select (select .cse659 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_arrayElimCell_156 Int) (v_ArrVal_2182 Int) (v_ArrVal_2192 Int)) (let ((.cse650 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2182)) (.cse661 (select .cse659 .cse660)) (.cse655 (+ v_arrayElimCell_156 8))) (or (< v_arrayElimCell_156 0) (= (select .cse650 (select (let ((.cse651 (let ((.cse652 (let ((.cse653 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select .cse656 4))))) (let ((.cse654 (select (select .cse653 |c_ULTIMATE.start_main_~#s~0#1.base|) 4))) (store .cse653 .cse654 (store (select .cse653 .cse654) .cse655 v_ArrVal_2192)))))) (store .cse652 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse652 |c_ULTIMATE.start_main_~#s~0#1.base|) 4 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse651 (select (select .cse651 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) 4)) 1) (= (select .cse650 (select (let ((.cse657 (let ((.cse658 (store .cse659 .cse660 (store .cse661 .cse4 v_ArrVal_2192)))) (store .cse658 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse658 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse657 (select (select .cse657 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) .cse23)) 1) (= (select .cse650 (select (let ((.cse662 (let ((.cse663 (store .cse659 .cse660 (store .cse661 .cse655 v_ArrVal_2192)))) (store .cse663 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse663 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse662 (select (select .cse662 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) (+ v_arrayElimCell_156 4))) 1)))) (= |v_ULTIMATE.start_node_create_~temp~0#1.base_27| .cse660) (= .cse660 |c_ULTIMATE.start_main_~#s~0#1.base|)))))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_node_create_~temp~0#1.base_27| 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 0)))) .cse664 .cse665 (or .cse5 (forall ((v_arrayElimCell_157 Int) (v_arrayElimCell_156 Int) (v_ArrVal_2188 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_27| Int) (v_ArrVal_2182 Int) (v_ArrVal_2192 Int)) (let ((.cse669 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2188) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (let ((.cse670 (select (select .cse669 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse671 (select .cse669 .cse670))) (let ((.cse666 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2182)) (.cse672 (let ((.cse673 (let ((.cse674 (store .cse669 .cse670 (store .cse671 (+ v_arrayElimCell_156 8) v_ArrVal_2192)))) (store .cse674 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse674 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse673 (select (select .cse673 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))))) (or (< v_arrayElimCell_156 0) (< v_arrayElimCell_157 0) (= (select .cse666 (select (let ((.cse667 (let ((.cse668 (store .cse669 .cse670 (store .cse671 .cse4 v_ArrVal_2192)))) (store .cse668 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse668 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse667 (select (select .cse667 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) .cse23)) 1) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_node_create_~temp~0#1.base_27| 1)) (= |v_ULTIMATE.start_node_create_~temp~0#1.base_27| .cse670) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 0)) (= .cse670 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select .cse666 (select .cse672 (+ v_arrayElimCell_157 4))) 1) (= (select .cse666 (select .cse672 (+ v_arrayElimCell_156 4))) 1)))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_27| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_node_create_~temp~0#1.base_27| 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 0)) (forall ((v_ArrVal_2188 (Array Int Int))) (let ((.cse686 (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2188) |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse678 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select .cse686 |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (let ((.cse679 (select (select .cse678 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_arrayElimCell_157 Int)) (or (< v_arrayElimCell_157 0) (forall ((v_ArrVal_2182 Int) (v_ArrVal_2192 Int)) (let ((.cse675 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2182)) (.cse680 (select .cse678 .cse679))) (or (= (select .cse675 (select (let ((.cse676 (let ((.cse677 (store .cse678 .cse679 (store .cse680 .cse4 v_ArrVal_2192)))) (store .cse677 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse677 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse676 (select (select .cse676 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) .cse23)) 1) (forall ((v_arrayElimCell_156 Int)) (let ((.cse685 (+ v_arrayElimCell_156 8))) (let ((.cse687 (let ((.cse688 (let ((.cse689 (store .cse678 .cse679 (store .cse680 .cse685 v_ArrVal_2192)))) (store .cse689 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse689 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse688 (select (select .cse688 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))))) (or (< v_arrayElimCell_156 0) (= (select .cse675 (select (let ((.cse681 (let ((.cse682 (let ((.cse683 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select .cse686 4))))) (let ((.cse684 (select (select .cse683 |c_ULTIMATE.start_main_~#s~0#1.base|) 4))) (store .cse683 .cse684 (store (select .cse683 .cse684) .cse685 v_ArrVal_2192)))))) (store .cse682 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse682 |c_ULTIMATE.start_main_~#s~0#1.base|) 4 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse681 (select (select .cse681 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) 4)) 1) (= (select .cse675 (select .cse687 (+ v_arrayElimCell_157 4))) 1) (= (select .cse675 (select .cse687 (+ v_arrayElimCell_156 4))) 1)))))))))) (= |v_ULTIMATE.start_node_create_~temp~0#1.base_27| .cse679) (= .cse679 |c_ULTIMATE.start_main_~#s~0#1.base|)))))))) .cse690 .cse691) .cse14) (or (and (or .cse41 (and (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_27| Int)) (or (forall ((v_ArrVal_2188 (Array Int Int))) (let ((.cse696 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2188) |c_ULTIMATE.start_main_~#s~0#1.base|) 4))))) (let ((.cse697 (select (select .cse696 |c_ULTIMATE.start_main_~#s~0#1.base|) 4))) (or (forall ((v_arrayElimCell_157 Int) (v_ArrVal_2182 Int) (v_ArrVal_2192 Int)) (let ((.cse692 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2182)) (.cse698 (select .cse696 .cse697))) (or (forall ((v_arrayElimCell_156 Int)) (let ((.cse693 (let ((.cse694 (let ((.cse695 (store .cse696 .cse697 (store .cse698 (+ v_arrayElimCell_156 8) v_ArrVal_2192)))) (store .cse695 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse695 |c_ULTIMATE.start_main_~#s~0#1.base|) 4 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse694 (select (select .cse694 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))))) (or (< v_arrayElimCell_156 0) (= (select .cse692 (select .cse693 4)) 1) (= (select .cse692 (select .cse693 (+ v_arrayElimCell_156 4))) 1) (= (select .cse692 (select .cse693 (+ v_arrayElimCell_157 4))) 1)))) (= (select .cse692 (select (let ((.cse699 (let ((.cse700 (store .cse696 .cse697 (store .cse698 .cse4 v_ArrVal_2192)))) (store .cse700 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse700 |c_ULTIMATE.start_main_~#s~0#1.base|) 4 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse699 (select (select .cse699 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) .cse23)) 1)))) (= |v_ULTIMATE.start_node_create_~temp~0#1.base_27| .cse697))))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_node_create_~temp~0#1.base_27| 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 0)))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_27| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_node_create_~temp~0#1.base_27| 1)) (forall ((v_ArrVal_2188 (Array Int Int))) (let ((.cse706 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2188) |c_ULTIMATE.start_main_~#s~0#1.base|) 4))))) (let ((.cse701 (select (select .cse706 |c_ULTIMATE.start_main_~#s~0#1.base|) 4))) (or (= |v_ULTIMATE.start_node_create_~temp~0#1.base_27| .cse701) (forall ((v_ArrVal_2182 Int) (v_ArrVal_2192 Int)) (let ((.cse702 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2182)) (.cse707 (select .cse706 .cse701))) (or (forall ((v_arrayElimCell_156 Int)) (let ((.cse703 (let ((.cse704 (let ((.cse705 (store .cse706 .cse701 (store .cse707 (+ v_arrayElimCell_156 8) v_ArrVal_2192)))) (store .cse705 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse705 |c_ULTIMATE.start_main_~#s~0#1.base|) 4 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse704 (select (select .cse704 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))))) (or (< v_arrayElimCell_156 0) (= (select .cse702 (select .cse703 4)) 1) (= (select .cse702 (select .cse703 (+ v_arrayElimCell_156 4))) 1)))) (= (select .cse702 (select (let ((.cse708 (let ((.cse709 (store .cse706 .cse701 (store .cse707 .cse4 v_ArrVal_2192)))) (store .cse709 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse709 |c_ULTIMATE.start_main_~#s~0#1.base|) 4 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse708 (select (select .cse708 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) .cse23)) 1)))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 0)))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_27| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_node_create_~temp~0#1.base_27| 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 0)) (forall ((v_ArrVal_2188 (Array Int Int))) (let ((.cse713 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2188) |c_ULTIMATE.start_main_~#s~0#1.base|) 4))))) (let ((.cse714 (select (select .cse713 |c_ULTIMATE.start_main_~#s~0#1.base|) 4))) (or (forall ((v_arrayElimCell_156 Int) (v_ArrVal_2182 Int) (v_ArrVal_2192 Int)) (let ((.cse710 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2182)) (.cse715 (select .cse713 .cse714))) (or (< v_arrayElimCell_156 0) (= (select .cse710 (select (let ((.cse711 (let ((.cse712 (store .cse713 .cse714 (store .cse715 (+ v_arrayElimCell_156 8) v_ArrVal_2192)))) (store .cse712 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse712 |c_ULTIMATE.start_main_~#s~0#1.base|) 4 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse711 (select (select .cse711 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) 4)) 1) (= (select .cse710 (select (let ((.cse716 (let ((.cse717 (store .cse713 .cse714 (store .cse715 .cse4 v_ArrVal_2192)))) (store .cse717 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse717 |c_ULTIMATE.start_main_~#s~0#1.base|) 4 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse716 (select (select .cse716 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) .cse23)) 1)))) (= |v_ULTIMATE.start_node_create_~temp~0#1.base_27| .cse714))))))) .cse718 .cse719 .cse720 (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_27| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_node_create_~temp~0#1.base_27| 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 0)) (forall ((v_ArrVal_2188 (Array Int Int))) (let ((.cse725 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2188) |c_ULTIMATE.start_main_~#s~0#1.base|) 4))))) (let ((.cse721 (select (select .cse725 |c_ULTIMATE.start_main_~#s~0#1.base|) 4))) (or (= |v_ULTIMATE.start_node_create_~temp~0#1.base_27| .cse721) (forall ((v_arrayElimCell_156 Int) (v_ArrVal_2182 Int) (v_ArrVal_2192 Int)) (let ((.cse722 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2182)) (.cse726 (select .cse725 .cse721))) (or (= (select .cse722 (select (let ((.cse723 (let ((.cse724 (store .cse725 .cse721 (store .cse726 (+ v_arrayElimCell_156 8) v_ArrVal_2192)))) (store .cse724 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse724 |c_ULTIMATE.start_main_~#s~0#1.base|) 4 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse723 (select (select .cse723 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) 4)) 1) (= (select .cse722 (select (let ((.cse727 (let ((.cse728 (store .cse725 .cse721 (store .cse726 .cse4 v_ArrVal_2192)))) (store .cse728 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse728 |c_ULTIMATE.start_main_~#s~0#1.base|) 4 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse727 (select (select .cse727 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) .cse23)) 1)))))))))) .cse729 (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_27| Int)) (or (forall ((v_ArrVal_2188 (Array Int Int))) (let ((.cse734 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2188) |c_ULTIMATE.start_main_~#s~0#1.base|) 4))))) (let ((.cse735 (select (select .cse734 |c_ULTIMATE.start_main_~#s~0#1.base|) 4))) (or (forall ((v_arrayElimCell_157 Int) (v_arrayElimCell_156 Int) (v_ArrVal_2182 Int) (v_ArrVal_2192 Int)) (let ((.cse736 (select .cse734 .cse735))) (let ((.cse731 (let ((.cse737 (let ((.cse738 (store .cse734 .cse735 (store .cse736 (+ v_arrayElimCell_156 8) v_ArrVal_2192)))) (store .cse738 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse738 |c_ULTIMATE.start_main_~#s~0#1.base|) 4 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse737 (select (select .cse737 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4)))) (.cse730 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2182))) (or (< v_arrayElimCell_156 0) (= (select .cse730 (select .cse731 4)) 1) (= (select .cse730 (select .cse731 (+ v_arrayElimCell_157 4))) 1) (= (select .cse730 (select (let ((.cse732 (let ((.cse733 (store .cse734 .cse735 (store .cse736 .cse4 v_ArrVal_2192)))) (store .cse733 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse733 |c_ULTIMATE.start_main_~#s~0#1.base|) 4 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse732 (select (select .cse732 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) .cse23)) 1))))) (= |v_ULTIMATE.start_node_create_~temp~0#1.base_27| .cse735))))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_node_create_~temp~0#1.base_27| 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 0)))))) .cse739 (or .cse5 (forall ((v_arrayElimCell_157 Int) (v_arrayElimCell_156 Int) (v_ArrVal_2188 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_27| Int) (v_ArrVal_2182 Int) (v_ArrVal_2192 Int)) (let ((.cse743 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2188) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (let ((.cse744 (select (select .cse743 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse745 (select .cse743 .cse744))) (let ((.cse740 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2182)) (.cse746 (let ((.cse747 (let ((.cse748 (store .cse743 .cse744 (store .cse745 (+ v_arrayElimCell_156 8) v_ArrVal_2192)))) (store .cse748 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse748 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse747 (select (select .cse747 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))))) (or (< v_arrayElimCell_156 0) (< v_arrayElimCell_157 0) (= (select .cse740 (select (let ((.cse741 (let ((.cse742 (store .cse743 .cse744 (store .cse745 .cse4 v_ArrVal_2192)))) (store .cse742 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse742 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse741 (select (select .cse741 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) .cse23)) 1) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_node_create_~temp~0#1.base_27| 1)) (= |v_ULTIMATE.start_node_create_~temp~0#1.base_27| .cse744) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 0)) (= (select .cse740 (select .cse746 (+ v_arrayElimCell_157 4))) 1) (= (select .cse740 (select .cse746 (+ v_arrayElimCell_156 4))) 1)))))))) (or .cse5 (forall ((v_arrayElimCell_156 Int) (v_ArrVal_2188 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_27| Int) (v_ArrVal_2182 Int) (v_ArrVal_2192 Int)) (let ((.cse752 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2188) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (let ((.cse753 (select (select .cse752 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse749 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2182)) (.cse754 (select .cse752 .cse753))) (or (< v_arrayElimCell_156 0) (= (select .cse749 (select (let ((.cse750 (let ((.cse751 (store .cse752 .cse753 (store .cse754 .cse4 v_ArrVal_2192)))) (store .cse751 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse751 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse750 (select (select .cse750 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) .cse23)) 1) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_node_create_~temp~0#1.base_27| 1)) (= |v_ULTIMATE.start_node_create_~temp~0#1.base_27| .cse753) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 0)) (= (select .cse749 (select (let ((.cse755 (let ((.cse756 (store .cse752 .cse753 (store .cse754 (+ v_arrayElimCell_156 8) v_ArrVal_2192)))) (store .cse756 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse756 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse755 (select (select .cse755 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) (+ v_arrayElimCell_156 4))) 1))))))) .cse757 .cse758 .cse759 .cse760 .cse761 (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_27| Int)) (or (forall ((v_ArrVal_2188 (Array Int Int))) (let ((.cse768 (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2188) |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse771 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select .cse768 |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (let ((.cse772 (select (select .cse771 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_arrayElimCell_156 Int) (v_ArrVal_2182 Int) (v_ArrVal_2192 Int)) (let ((.cse762 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2182)) (.cse773 (select .cse771 .cse772)) (.cse767 (+ v_arrayElimCell_156 8))) (or (< v_arrayElimCell_156 0) (= (select .cse762 (select (let ((.cse763 (let ((.cse764 (let ((.cse765 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select .cse768 4))))) (let ((.cse766 (select (select .cse765 |c_ULTIMATE.start_main_~#s~0#1.base|) 4))) (store .cse765 .cse766 (store (select .cse765 .cse766) .cse767 v_ArrVal_2192)))))) (store .cse764 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse764 |c_ULTIMATE.start_main_~#s~0#1.base|) 4 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse763 (select (select .cse763 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) 4)) 1) (= (select .cse762 (select (let ((.cse769 (let ((.cse770 (store .cse771 .cse772 (store .cse773 .cse4 v_ArrVal_2192)))) (store .cse770 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse770 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse769 (select (select .cse769 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) .cse23)) 1) (= (select .cse762 (select (let ((.cse774 (let ((.cse775 (store .cse771 .cse772 (store .cse773 .cse767 v_ArrVal_2192)))) (store .cse775 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse775 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse774 (select (select .cse774 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) (+ v_arrayElimCell_156 4))) 1)))) (= |v_ULTIMATE.start_node_create_~temp~0#1.base_27| .cse772)))))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_node_create_~temp~0#1.base_27| 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 0)))) .cse776 (or (forall ((v_arrayElimCell_156 Int) (v_ArrVal_2188 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_27| Int) (v_ArrVal_2182 Int) (v_ArrVal_2192 Int)) (let ((.cse780 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2188) |c_ULTIMATE.start_main_~#s~0#1.base|) 4))))) (let ((.cse781 (select (select .cse780 |c_ULTIMATE.start_main_~#s~0#1.base|) 4))) (let ((.cse777 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2182)) (.cse782 (select .cse780 .cse781))) (or (= (select .cse777 (select (let ((.cse778 (let ((.cse779 (store .cse780 .cse781 (store .cse782 (+ v_arrayElimCell_156 8) v_ArrVal_2192)))) (store .cse779 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse779 |c_ULTIMATE.start_main_~#s~0#1.base|) 4 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse778 (select (select .cse778 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) 4)) 1) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_node_create_~temp~0#1.base_27| 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 0)) (= |v_ULTIMATE.start_node_create_~temp~0#1.base_27| .cse781) (= (select .cse777 (select (let ((.cse783 (let ((.cse784 (store .cse780 .cse781 (store .cse782 .cse4 v_ArrVal_2192)))) (store .cse784 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse784 |c_ULTIMATE.start_main_~#s~0#1.base|) 4 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse783 (select (select .cse783 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) .cse23)) 1)))))) .cse41) .cse785 .cse786 (or (forall ((v_arrayElimCell_157 Int) (v_arrayElimCell_156 Int) (v_ArrVal_2188 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_27| Int) (v_ArrVal_2182 Int) (v_ArrVal_2192 Int)) (let ((.cse792 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2188) |c_ULTIMATE.start_main_~#s~0#1.base|) 4))))) (let ((.cse789 (select (select .cse792 |c_ULTIMATE.start_main_~#s~0#1.base|) 4))) (let ((.cse793 (select .cse792 .cse789))) (let ((.cse788 (let ((.cse794 (let ((.cse795 (store .cse792 .cse789 (store .cse793 (+ v_arrayElimCell_156 8) v_ArrVal_2192)))) (store .cse795 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse795 |c_ULTIMATE.start_main_~#s~0#1.base|) 4 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse794 (select (select .cse794 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4)))) (.cse787 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2182))) (or (< v_arrayElimCell_156 0) (= (select .cse787 (select .cse788 4)) 1) (< v_arrayElimCell_157 0) (= (select .cse787 (select .cse788 (+ v_arrayElimCell_157 4))) 1) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_node_create_~temp~0#1.base_27| 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 0)) (= |v_ULTIMATE.start_node_create_~temp~0#1.base_27| .cse789) (= (select .cse787 (select (let ((.cse790 (let ((.cse791 (store .cse792 .cse789 (store .cse793 .cse4 v_ArrVal_2192)))) (store .cse791 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse791 |c_ULTIMATE.start_main_~#s~0#1.base|) 4 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse790 (select (select .cse790 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) .cse23)) 1))))))) .cse41) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_27| Int)) (or (forall ((v_ArrVal_2188 (Array Int Int))) (let ((.cse807 (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2188) |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse799 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select .cse807 |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (let ((.cse800 (select (select .cse799 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_arrayElimCell_157 Int)) (or (< v_arrayElimCell_157 0) (forall ((v_ArrVal_2182 Int) (v_ArrVal_2192 Int)) (let ((.cse796 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2182)) (.cse801 (select .cse799 .cse800))) (or (= (select .cse796 (select (let ((.cse797 (let ((.cse798 (store .cse799 .cse800 (store .cse801 .cse4 v_ArrVal_2192)))) (store .cse798 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse798 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse797 (select (select .cse797 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) .cse23)) 1) (forall ((v_arrayElimCell_156 Int)) (let ((.cse806 (+ v_arrayElimCell_156 8))) (let ((.cse808 (let ((.cse809 (let ((.cse810 (store .cse799 .cse800 (store .cse801 .cse806 v_ArrVal_2192)))) (store .cse810 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse810 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse809 (select (select .cse809 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))))) (or (< v_arrayElimCell_156 0) (= (select .cse796 (select (let ((.cse802 (let ((.cse803 (let ((.cse804 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select .cse807 4))))) (let ((.cse805 (select (select .cse804 |c_ULTIMATE.start_main_~#s~0#1.base|) 4))) (store .cse804 .cse805 (store (select .cse804 .cse805) .cse806 v_ArrVal_2192)))))) (store .cse803 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse803 |c_ULTIMATE.start_main_~#s~0#1.base|) 4 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse802 (select (select .cse802 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) 4)) 1) (= (select .cse796 (select .cse808 (+ v_arrayElimCell_157 4))) 1) (= (select .cse796 (select .cse808 (+ v_arrayElimCell_156 4))) 1)))))))))) (= |v_ULTIMATE.start_node_create_~temp~0#1.base_27| .cse800)))))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_node_create_~temp~0#1.base_27| 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 0)))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_27| Int)) (or (forall ((v_ArrVal_2188 (Array Int Int)) (v_ArrVal_2182 Int) (v_ArrVal_2192 Int)) (let ((.cse813 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2188) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (let ((.cse814 (select (select .cse813 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (select (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2182) (select (let ((.cse811 (let ((.cse812 (store .cse813 .cse814 (store (select .cse813 .cse814) .cse4 v_ArrVal_2192)))) (store .cse812 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse812 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse811 (select (select .cse811 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) .cse23)) 1) (= |v_ULTIMATE.start_node_create_~temp~0#1.base_27| .cse814))))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_node_create_~temp~0#1.base_27| 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 0)) (= |v_ULTIMATE.start_node_create_~temp~0#1.base_27| |c_ULTIMATE.start_main_~#s~0#1.base|))) .cse815 (or (forall ((v_arrayElimCell_156 Int) (v_ArrVal_2188 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_27| Int) (v_ArrVal_2182 Int) (v_ArrVal_2192 Int)) (let ((.cse819 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2188) |c_ULTIMATE.start_main_~#s~0#1.base|) 4))))) (let ((.cse820 (select (select .cse819 |c_ULTIMATE.start_main_~#s~0#1.base|) 4))) (let ((.cse816 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2182)) (.cse821 (select .cse819 .cse820))) (or (< v_arrayElimCell_156 0) (= (select .cse816 (select (let ((.cse817 (let ((.cse818 (store .cse819 .cse820 (store .cse821 (+ v_arrayElimCell_156 8) v_ArrVal_2192)))) (store .cse818 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse818 |c_ULTIMATE.start_main_~#s~0#1.base|) 4 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse817 (select (select .cse817 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) 4)) 1) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_node_create_~temp~0#1.base_27| 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 0)) (= |v_ULTIMATE.start_node_create_~temp~0#1.base_27| .cse820) (= (select .cse816 (select (let ((.cse822 (let ((.cse823 (store .cse819 .cse820 (store .cse821 .cse4 v_ArrVal_2192)))) (store .cse823 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse823 |c_ULTIMATE.start_main_~#s~0#1.base|) 4 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse822 (select (select .cse822 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) .cse23)) 1)))))) .cse41)) .cse14) (or .cse5 (and (or .cse14 (forall ((v_arrayElimCell_157 Int) (v_arrayElimCell_156 Int) (v_ArrVal_2188 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_27| Int) (v_ArrVal_2182 Int) (v_ArrVal_2192 Int)) (let ((.cse829 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2188) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (let ((.cse824 (select (select .cse829 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse830 (select .cse829 .cse824))) (let ((.cse826 (let ((.cse831 (let ((.cse832 (store .cse829 .cse824 (store .cse830 .cse4 v_ArrVal_2192)))) (store .cse832 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse832 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse831 (select (select .cse831 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4)))) (.cse825 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2182))) (or (< v_arrayElimCell_156 0) (not (= .cse824 |c_ULTIMATE.start_main_~#s~0#1.base|)) (< v_arrayElimCell_157 0) (= (select .cse825 (select .cse826 .cse23)) 1) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_node_create_~temp~0#1.base_27| 1)) (= (select .cse825 (select .cse826 (+ v_arrayElimCell_157 4))) 1) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 0)) (= (select .cse825 (select (let ((.cse827 (let ((.cse828 (store .cse829 .cse824 (store .cse830 (+ v_arrayElimCell_156 8) v_ArrVal_2192)))) (store .cse828 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse828 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse827 (select (select .cse827 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) (+ v_arrayElimCell_156 4))) 1)))))))) (or .cse14 (forall ((v_arrayElimCell_157 Int) (v_arrayElimCell_156 Int) (v_ArrVal_2188 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_27| Int) (v_ArrVal_2182 Int) (v_ArrVal_2192 Int)) (let ((.cse838 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2188) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (let ((.cse835 (select (select .cse838 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse839 (select .cse838 .cse835))) (let ((.cse834 (let ((.cse840 (let ((.cse841 (store .cse838 .cse835 (store .cse839 .cse4 v_ArrVal_2192)))) (store .cse841 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse841 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse840 (select (select .cse840 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4)))) (.cse833 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2182))) (or (< v_arrayElimCell_156 0) (< v_arrayElimCell_157 0) (= (select .cse833 (select .cse834 .cse23)) 1) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_node_create_~temp~0#1.base_27| 1)) (= (select .cse833 (select .cse834 (+ v_arrayElimCell_157 4))) 1) (= |v_ULTIMATE.start_node_create_~temp~0#1.base_27| .cse835) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 0)) (= (select .cse833 (select (let ((.cse836 (let ((.cse837 (store .cse838 .cse835 (store .cse839 (+ v_arrayElimCell_156 8) v_ArrVal_2192)))) (store .cse837 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse837 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse836 (select (select .cse836 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) (+ v_arrayElimCell_156 4))) 1)))))))))) (or (and (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_27| Int)) (or (forall ((v_ArrVal_2188 (Array Int Int))) (let ((.cse847 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2188) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (let ((.cse842 (select (select .cse847 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse842 |c_ULTIMATE.start_main_~#s~0#1.base|)) (forall ((v_ArrVal_2182 Int) (v_ArrVal_2192 Int)) (let ((.cse843 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2182)) (.cse844 (let ((.cse845 (let ((.cse846 (store .cse847 .cse842 (store (select .cse847 .cse842) .cse4 v_ArrVal_2192)))) (store .cse846 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse846 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse845 (select (select .cse845 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))))) (or (forall ((v_arrayElimCell_157 Int)) (= (select .cse843 (select .cse844 (+ v_arrayElimCell_157 4))) 1)) (= (select .cse843 (select .cse844 .cse23)) 1)))))))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_node_create_~temp~0#1.base_27| 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 0)))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_27| Int)) (or (forall ((v_ArrVal_2188 (Array Int Int))) (let ((.cse852 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2188) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (let ((.cse853 (select (select .cse852 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_2182 Int) (v_ArrVal_2192 Int)) (let ((.cse848 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2182)) (.cse849 (let ((.cse850 (let ((.cse851 (store .cse852 .cse853 (store (select .cse852 .cse853) .cse4 v_ArrVal_2192)))) (store .cse851 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse851 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse850 (select (select .cse850 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))))) (or (= (select .cse848 (select .cse849 .cse23)) 1) (forall ((v_arrayElimCell_157 Int)) (or (< v_arrayElimCell_157 0) (= (select .cse848 (select .cse849 (+ v_arrayElimCell_157 4))) 1)))))) (not (= .cse853 |c_ULTIMATE.start_main_~#s~0#1.base|)))))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_node_create_~temp~0#1.base_27| 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 0))))) .cse14) (or (forall ((v_arrayElimCell_157 Int) (v_arrayElimCell_156 Int) (v_ArrVal_2188 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_27| Int) (v_ArrVal_2182 Int) (v_ArrVal_2192 Int)) (let ((.cse858 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2188) |c_ULTIMATE.start_main_~#s~0#1.base|) 4))))) (let ((.cse854 (select (select .cse858 |c_ULTIMATE.start_main_~#s~0#1.base|) 4))) (let ((.cse855 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2182)) (.cse859 (select .cse858 .cse854))) (or (not (= |v_ULTIMATE.start_node_create_~temp~0#1.base_27| .cse854)) (= (select .cse855 (select (let ((.cse856 (let ((.cse857 (store .cse858 .cse854 (store .cse859 (+ v_arrayElimCell_156 8) v_ArrVal_2192)))) (store .cse857 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse857 |c_ULTIMATE.start_main_~#s~0#1.base|) 4 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse856 (select (select .cse856 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) 4)) 1) (< v_arrayElimCell_157 0) (= (select .cse855 (select (let ((.cse860 (let ((.cse861 (store .cse858 .cse854 (store .cse859 .cse4 v_ArrVal_2192)))) (store .cse861 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse861 |c_ULTIMATE.start_main_~#s~0#1.base|) 4 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse860 (select (select .cse860 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) (+ v_arrayElimCell_157 4))) 1) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_node_create_~temp~0#1.base_27| 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 0))))))) .cse41) (or .cse14 (forall ((v_arrayElimCell_157 Int) (v_arrayElimCell_156 Int) (v_ArrVal_2188 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_27| Int) (v_ArrVal_2182 Int) (v_ArrVal_2192 Int)) (let ((.cse868 (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2188) |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse873 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select .cse868 |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (let ((.cse869 (select (select .cse873 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse874 (select .cse873 .cse869))) (let ((.cse870 (let ((.cse875 (let ((.cse876 (store .cse873 .cse869 (store .cse874 .cse4 v_ArrVal_2192)))) (store .cse876 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse876 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse875 (select (select .cse875 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4)))) (.cse862 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2182)) (.cse867 (+ v_arrayElimCell_156 8))) (or (< v_arrayElimCell_156 0) (= (select .cse862 (select (let ((.cse863 (let ((.cse864 (let ((.cse865 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select .cse868 4))))) (let ((.cse866 (select (select .cse865 |c_ULTIMATE.start_main_~#s~0#1.base|) 4))) (store .cse865 .cse866 (store (select .cse865 .cse866) .cse867 v_ArrVal_2192)))))) (store .cse864 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse864 |c_ULTIMATE.start_main_~#s~0#1.base|) 4 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse863 (select (select .cse863 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) 4)) 1) (not (= .cse869 |c_ULTIMATE.start_main_~#s~0#1.base|)) (< v_arrayElimCell_157 0) (= (select .cse862 (select .cse870 .cse23)) 1) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_node_create_~temp~0#1.base_27| 1)) (= (select .cse862 (select .cse870 (+ v_arrayElimCell_157 4))) 1) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 0)) (= (select .cse862 (select (let ((.cse871 (let ((.cse872 (store .cse873 .cse869 (store .cse874 .cse867 v_ArrVal_2192)))) (store .cse872 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse872 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse871 (select (select .cse871 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) (+ v_arrayElimCell_156 4))) 1))))))))) (or .cse5 (forall ((v_arrayElimCell_157 Int) (v_arrayElimCell_156 Int) (v_ArrVal_2188 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_27| Int) (v_ArrVal_2182 Int) (v_ArrVal_2192 Int)) (let ((.cse881 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2188) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (let ((.cse877 (select (select .cse881 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse882 (select .cse881 .cse877))) (let ((.cse883 (+ v_arrayElimCell_157 4)) (.cse878 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2182)) (.cse884 (let ((.cse885 (let ((.cse886 (store .cse881 .cse877 (store .cse882 (+ v_arrayElimCell_156 8) v_ArrVal_2192)))) (store .cse886 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse886 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse885 (select (select .cse885 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))))) (or (< v_arrayElimCell_156 0) (not (= |v_ULTIMATE.start_node_create_~temp~0#1.base_27| .cse877)) (< v_arrayElimCell_157 0) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_node_create_~temp~0#1.base_27| 1)) (= (select .cse878 (select (let ((.cse879 (let ((.cse880 (store .cse881 .cse877 (store .cse882 .cse4 v_ArrVal_2192)))) (store .cse880 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse880 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse879 (select (select .cse879 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) .cse883)) 1) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 0)) (= (select .cse878 (select .cse884 .cse883)) 1) (= (select .cse878 (select .cse884 (+ v_arrayElimCell_156 4))) 1)))))))) (or .cse14 (and .cse739 (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_27| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_node_create_~temp~0#1.base_27| 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 0)) (forall ((v_ArrVal_2188 (Array Int Int))) (let ((.cse898 (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2188) |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse891 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select .cse898 |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (let ((.cse887 (select (select .cse891 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse887 |c_ULTIMATE.start_main_~#s~0#1.base|)) (forall ((v_arrayElimCell_157 Int)) (or (< v_arrayElimCell_157 0) (forall ((v_ArrVal_2182 Int) (v_ArrVal_2192 Int)) (let ((.cse888 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2182)) (.cse892 (select .cse891 .cse887))) (or (= (select .cse888 (select (let ((.cse889 (let ((.cse890 (store .cse891 .cse887 (store .cse892 .cse4 v_ArrVal_2192)))) (store .cse890 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse890 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse889 (select (select .cse889 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) .cse23)) 1) (forall ((v_arrayElimCell_156 Int)) (let ((.cse897 (+ v_arrayElimCell_156 8))) (let ((.cse899 (let ((.cse900 (let ((.cse901 (store .cse891 .cse887 (store .cse892 .cse897 v_ArrVal_2192)))) (store .cse901 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse901 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse900 (select (select .cse900 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))))) (or (< v_arrayElimCell_156 0) (= (select .cse888 (select (let ((.cse893 (let ((.cse894 (let ((.cse895 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select .cse898 4))))) (let ((.cse896 (select (select .cse895 |c_ULTIMATE.start_main_~#s~0#1.base|) 4))) (store .cse895 .cse896 (store (select .cse895 .cse896) .cse897 v_ArrVal_2192)))))) (store .cse894 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse894 |c_ULTIMATE.start_main_~#s~0#1.base|) 4 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse893 (select (select .cse893 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) 4)) 1) (= (select .cse888 (select .cse899 (+ v_arrayElimCell_157 4))) 1) (= (select .cse888 (select .cse899 (+ v_arrayElimCell_156 4))) 1)))))))))) (= |v_ULTIMATE.start_node_create_~temp~0#1.base_27| .cse887)))))))) .cse758 (or (forall ((v_arrayElimCell_157 Int) (v_arrayElimCell_156 Int) (v_ArrVal_2188 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_27| Int) (v_ArrVal_2182 Int) (v_ArrVal_2192 Int)) (let ((.cse907 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2188) |c_ULTIMATE.start_main_~#s~0#1.base|) 4))))) (let ((.cse902 (select (select .cse907 |c_ULTIMATE.start_main_~#s~0#1.base|) 4))) (let ((.cse908 (select .cse907 .cse902))) (let ((.cse904 (let ((.cse909 (let ((.cse910 (store .cse907 .cse902 (store .cse908 (+ v_arrayElimCell_156 8) v_ArrVal_2192)))) (store .cse910 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse910 |c_ULTIMATE.start_main_~#s~0#1.base|) 4 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse909 (select (select .cse909 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4)))) (.cse903 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2182))) (or (< v_arrayElimCell_156 0) (not (= .cse902 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (select .cse903 (select .cse904 4)) 1) (< v_arrayElimCell_157 0) (= (select .cse903 (select .cse904 (+ v_arrayElimCell_157 4))) 1) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_node_create_~temp~0#1.base_27| 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 0)) (= |v_ULTIMATE.start_node_create_~temp~0#1.base_27| .cse902) (= (select .cse903 (select (let ((.cse905 (let ((.cse906 (store .cse907 .cse902 (store .cse908 .cse4 v_ArrVal_2192)))) (store .cse906 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse906 |c_ULTIMATE.start_main_~#s~0#1.base|) 4 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse905 (select (select .cse905 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) .cse23)) 1))))))) .cse41) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_27| Int)) (or (forall ((v_ArrVal_2188 (Array Int Int))) (let ((.cse918 (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2188) |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse921 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select .cse918 |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (let ((.cse911 (select (select .cse921 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse911 |c_ULTIMATE.start_main_~#s~0#1.base|)) (forall ((v_arrayElimCell_156 Int) (v_ArrVal_2182 Int) (v_ArrVal_2192 Int)) (let ((.cse912 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2182)) (.cse922 (select .cse921 .cse911)) (.cse917 (+ v_arrayElimCell_156 8))) (or (< v_arrayElimCell_156 0) (= (select .cse912 (select (let ((.cse913 (let ((.cse914 (let ((.cse915 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select .cse918 4))))) (let ((.cse916 (select (select .cse915 |c_ULTIMATE.start_main_~#s~0#1.base|) 4))) (store .cse915 .cse916 (store (select .cse915 .cse916) .cse917 v_ArrVal_2192)))))) (store .cse914 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse914 |c_ULTIMATE.start_main_~#s~0#1.base|) 4 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse913 (select (select .cse913 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) 4)) 1) (= (select .cse912 (select (let ((.cse919 (let ((.cse920 (store .cse921 .cse911 (store .cse922 .cse4 v_ArrVal_2192)))) (store .cse920 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse920 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse919 (select (select .cse919 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) .cse23)) 1) (= (select .cse912 (select (let ((.cse923 (let ((.cse924 (store .cse921 .cse911 (store .cse922 .cse917 v_ArrVal_2192)))) (store .cse924 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse924 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse923 (select (select .cse923 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) (+ v_arrayElimCell_156 4))) 1)))) (= |v_ULTIMATE.start_node_create_~temp~0#1.base_27| .cse911)))))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_node_create_~temp~0#1.base_27| 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 0)))) .cse760 (or (and (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_27| Int)) (or (forall ((v_ArrVal_2188 (Array Int Int))) (let ((.cse930 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2188) |c_ULTIMATE.start_main_~#s~0#1.base|) 4))))) (let ((.cse925 (select (select .cse930 |c_ULTIMATE.start_main_~#s~0#1.base|) 4))) (or (not (= .cse925 |c_ULTIMATE.start_main_~#s~0#1.base|)) (forall ((v_arrayElimCell_157 Int) (v_arrayElimCell_156 Int) (v_ArrVal_2182 Int) (v_ArrVal_2192 Int)) (let ((.cse931 (select .cse930 .cse925))) (let ((.cse927 (let ((.cse932 (let ((.cse933 (store .cse930 .cse925 (store .cse931 (+ v_arrayElimCell_156 8) v_ArrVal_2192)))) (store .cse933 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse933 |c_ULTIMATE.start_main_~#s~0#1.base|) 4 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse932 (select (select .cse932 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4)))) (.cse926 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2182))) (or (< v_arrayElimCell_156 0) (= (select .cse926 (select .cse927 4)) 1) (= (select .cse926 (select .cse927 (+ v_arrayElimCell_157 4))) 1) (= (select .cse926 (select (let ((.cse928 (let ((.cse929 (store .cse930 .cse925 (store .cse931 .cse4 v_ArrVal_2192)))) (store .cse929 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse929 |c_ULTIMATE.start_main_~#s~0#1.base|) 4 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse928 (select (select .cse928 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) .cse23)) 1))))) (= |v_ULTIMATE.start_node_create_~temp~0#1.base_27| .cse925))))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_node_create_~temp~0#1.base_27| 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 0)))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_27| Int)) (or (forall ((v_ArrVal_2188 (Array Int Int))) (let ((.cse938 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2188) |c_ULTIMATE.start_main_~#s~0#1.base|) 4))))) (let ((.cse934 (select (select .cse938 |c_ULTIMATE.start_main_~#s~0#1.base|) 4))) (or (not (= .cse934 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |v_ULTIMATE.start_node_create_~temp~0#1.base_27| .cse934) (forall ((v_arrayElimCell_156 Int) (v_ArrVal_2182 Int) (v_ArrVal_2192 Int)) (let ((.cse935 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2182)) (.cse939 (select .cse938 .cse934))) (or (= (select .cse935 (select (let ((.cse936 (let ((.cse937 (store .cse938 .cse934 (store .cse939 (+ v_arrayElimCell_156 8) v_ArrVal_2192)))) (store .cse937 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse937 |c_ULTIMATE.start_main_~#s~0#1.base|) 4 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse936 (select (select .cse936 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) 4)) 1) (= (select .cse935 (select (let ((.cse940 (let ((.cse941 (store .cse938 .cse934 (store .cse939 .cse4 v_ArrVal_2192)))) (store .cse941 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse941 |c_ULTIMATE.start_main_~#s~0#1.base|) 4 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse940 (select (select .cse940 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) .cse23)) 1)))))))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_node_create_~temp~0#1.base_27| 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 0)))) .cse718 .cse719 (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_27| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_node_create_~temp~0#1.base_27| 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 0)) (forall ((v_ArrVal_2188 (Array Int Int))) (let ((.cse945 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2188) |c_ULTIMATE.start_main_~#s~0#1.base|) 4))))) (let ((.cse946 (select (select .cse945 |c_ULTIMATE.start_main_~#s~0#1.base|) 4))) (or (forall ((v_arrayElimCell_156 Int) (v_ArrVal_2182 Int) (v_ArrVal_2192 Int)) (let ((.cse942 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2182)) (.cse947 (select .cse945 .cse946))) (or (< v_arrayElimCell_156 0) (= (select .cse942 (select (let ((.cse943 (let ((.cse944 (store .cse945 .cse946 (store .cse947 (+ v_arrayElimCell_156 8) v_ArrVal_2192)))) (store .cse944 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse944 |c_ULTIMATE.start_main_~#s~0#1.base|) 4 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse943 (select (select .cse943 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) 4)) 1) (= (select .cse942 (select (let ((.cse948 (let ((.cse949 (store .cse945 .cse946 (store .cse947 .cse4 v_ArrVal_2192)))) (store .cse949 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse949 |c_ULTIMATE.start_main_~#s~0#1.base|) 4 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse948 (select (select .cse948 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) .cse23)) 1)))) (not (= .cse946 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |v_ULTIMATE.start_node_create_~temp~0#1.base_27| .cse946))))))) .cse720 (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_27| Int)) (or (forall ((v_ArrVal_2188 (Array Int Int))) (let ((.cse955 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2188) |c_ULTIMATE.start_main_~#s~0#1.base|) 4))))) (let ((.cse950 (select (select .cse955 |c_ULTIMATE.start_main_~#s~0#1.base|) 4))) (or (not (= .cse950 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |v_ULTIMATE.start_node_create_~temp~0#1.base_27| .cse950) (forall ((v_ArrVal_2182 Int) (v_ArrVal_2192 Int)) (let ((.cse951 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2182)) (.cse956 (select .cse955 .cse950))) (or (forall ((v_arrayElimCell_156 Int)) (let ((.cse952 (let ((.cse953 (let ((.cse954 (store .cse955 .cse950 (store .cse956 (+ v_arrayElimCell_156 8) v_ArrVal_2192)))) (store .cse954 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse954 |c_ULTIMATE.start_main_~#s~0#1.base|) 4 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse953 (select (select .cse953 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))))) (or (< v_arrayElimCell_156 0) (= (select .cse951 (select .cse952 4)) 1) (= (select .cse951 (select .cse952 (+ v_arrayElimCell_156 4))) 1)))) (= (select .cse951 (select (let ((.cse957 (let ((.cse958 (store .cse955 .cse950 (store .cse956 .cse4 v_ArrVal_2192)))) (store .cse958 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse958 |c_ULTIMATE.start_main_~#s~0#1.base|) 4 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse957 (select (select .cse957 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) .cse23)) 1)))))))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_node_create_~temp~0#1.base_27| 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 0)))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_27| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_node_create_~temp~0#1.base_27| 1)) (forall ((v_ArrVal_2188 (Array Int Int))) (let ((.cse964 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2188) |c_ULTIMATE.start_main_~#s~0#1.base|) 4))))) (let ((.cse959 (select (select .cse964 |c_ULTIMATE.start_main_~#s~0#1.base|) 4))) (or (not (= .cse959 |c_ULTIMATE.start_main_~#s~0#1.base|)) (forall ((v_arrayElimCell_157 Int) (v_ArrVal_2182 Int) (v_ArrVal_2192 Int)) (let ((.cse960 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2182)) (.cse965 (select .cse964 .cse959))) (or (forall ((v_arrayElimCell_156 Int)) (let ((.cse961 (let ((.cse962 (let ((.cse963 (store .cse964 .cse959 (store .cse965 (+ v_arrayElimCell_156 8) v_ArrVal_2192)))) (store .cse963 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse963 |c_ULTIMATE.start_main_~#s~0#1.base|) 4 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse962 (select (select .cse962 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))))) (or (< v_arrayElimCell_156 0) (= (select .cse960 (select .cse961 4)) 1) (= (select .cse960 (select .cse961 (+ v_arrayElimCell_156 4))) 1) (= (select .cse960 (select .cse961 (+ v_arrayElimCell_157 4))) 1)))) (= (select .cse960 (select (let ((.cse966 (let ((.cse967 (store .cse964 .cse959 (store .cse965 .cse4 v_ArrVal_2192)))) (store .cse967 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse967 |c_ULTIMATE.start_main_~#s~0#1.base|) 4 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse966 (select (select .cse966 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) .cse23)) 1)))) (= |v_ULTIMATE.start_node_create_~temp~0#1.base_27| .cse959))))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 0)))) .cse729) .cse41) .cse776 .cse785 .cse786 (or (forall ((v_arrayElimCell_156 Int) (v_ArrVal_2188 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_27| Int) (v_ArrVal_2182 Int) (v_ArrVal_2192 Int)) (let ((.cse972 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2188) |c_ULTIMATE.start_main_~#s~0#1.base|) 4))))) (let ((.cse968 (select (select .cse972 |c_ULTIMATE.start_main_~#s~0#1.base|) 4))) (let ((.cse969 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2182)) (.cse973 (select .cse972 .cse968))) (or (< v_arrayElimCell_156 0) (not (= .cse968 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (select .cse969 (select (let ((.cse970 (let ((.cse971 (store .cse972 .cse968 (store .cse973 (+ v_arrayElimCell_156 8) v_ArrVal_2192)))) (store .cse971 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse971 |c_ULTIMATE.start_main_~#s~0#1.base|) 4 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse970 (select (select .cse970 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) 4)) 1) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_node_create_~temp~0#1.base_27| 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 0)) (= |v_ULTIMATE.start_node_create_~temp~0#1.base_27| .cse968) (= (select .cse969 (select (let ((.cse974 (let ((.cse975 (store .cse972 .cse968 (store .cse973 .cse4 v_ArrVal_2192)))) (store .cse975 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse975 |c_ULTIMATE.start_main_~#s~0#1.base|) 4 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse974 (select (select .cse974 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) .cse23)) 1)))))) .cse41) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_27| Int)) (or (forall ((v_ArrVal_2188 (Array Int Int)) (v_ArrVal_2182 Int) (v_ArrVal_2192 Int)) (let ((.cse979 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2188) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (let ((.cse976 (select (select .cse979 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse976 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (select (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2182) (select (let ((.cse977 (let ((.cse978 (store .cse979 .cse976 (store (select .cse979 .cse976) .cse4 v_ArrVal_2192)))) (store .cse978 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse978 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse977 (select (select .cse977 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) .cse23)) 1))))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_node_create_~temp~0#1.base_27| 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 0)) (= |v_ULTIMATE.start_node_create_~temp~0#1.base_27| |c_ULTIMATE.start_main_~#s~0#1.base|))) (or .cse5 (forall ((v_arrayElimCell_157 Int) (v_arrayElimCell_156 Int) (v_ArrVal_2188 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_27| Int) (v_ArrVal_2182 Int) (v_ArrVal_2192 Int)) (let ((.cse984 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2188) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (let ((.cse980 (select (select .cse984 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse985 (select .cse984 .cse980))) (let ((.cse981 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2182)) (.cse986 (let ((.cse987 (let ((.cse988 (store .cse984 .cse980 (store .cse985 (+ v_arrayElimCell_156 8) v_ArrVal_2192)))) (store .cse988 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse988 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse987 (select (select .cse987 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))))) (or (< v_arrayElimCell_156 0) (not (= .cse980 |c_ULTIMATE.start_main_~#s~0#1.base|)) (< v_arrayElimCell_157 0) (= (select .cse981 (select (let ((.cse982 (let ((.cse983 (store .cse984 .cse980 (store .cse985 .cse4 v_ArrVal_2192)))) (store .cse983 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse983 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse982 (select (select .cse982 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) .cse23)) 1) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_node_create_~temp~0#1.base_27| 1)) (= |v_ULTIMATE.start_node_create_~temp~0#1.base_27| .cse980) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 0)) (= (select .cse981 (select .cse986 (+ v_arrayElimCell_157 4))) 1) (= (select .cse981 (select .cse986 (+ v_arrayElimCell_156 4))) 1)))))))) (or (forall ((v_arrayElimCell_156 Int) (v_ArrVal_2188 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_27| Int) (v_ArrVal_2182 Int) (v_ArrVal_2192 Int)) (let ((.cse993 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2188) |c_ULTIMATE.start_main_~#s~0#1.base|) 4))))) (let ((.cse989 (select (select .cse993 |c_ULTIMATE.start_main_~#s~0#1.base|) 4))) (let ((.cse990 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2182)) (.cse994 (select .cse993 .cse989))) (or (not (= .cse989 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (select .cse990 (select (let ((.cse991 (let ((.cse992 (store .cse993 .cse989 (store .cse994 (+ v_arrayElimCell_156 8) v_ArrVal_2192)))) (store .cse992 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse992 |c_ULTIMATE.start_main_~#s~0#1.base|) 4 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse991 (select (select .cse991 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) 4)) 1) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_node_create_~temp~0#1.base_27| 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 0)) (= |v_ULTIMATE.start_node_create_~temp~0#1.base_27| .cse989) (= (select .cse990 (select (let ((.cse995 (let ((.cse996 (store .cse993 .cse989 (store .cse994 .cse4 v_ArrVal_2192)))) (store .cse996 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse996 |c_ULTIMATE.start_main_~#s~0#1.base|) 4 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse995 (select (select .cse995 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) .cse23)) 1)))))) .cse41) (or .cse5 (forall ((v_arrayElimCell_156 Int) (v_ArrVal_2188 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_27| Int) (v_ArrVal_2182 Int) (v_ArrVal_2192 Int)) (let ((.cse1001 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2188) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (let ((.cse997 (select (select .cse1001 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse998 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2182)) (.cse1002 (select .cse1001 .cse997))) (or (< v_arrayElimCell_156 0) (not (= .cse997 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (select .cse998 (select (let ((.cse999 (let ((.cse1000 (store .cse1001 .cse997 (store .cse1002 .cse4 v_ArrVal_2192)))) (store .cse1000 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse1000 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse999 (select (select .cse999 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) .cse23)) 1) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_node_create_~temp~0#1.base_27| 1)) (= |v_ULTIMATE.start_node_create_~temp~0#1.base_27| .cse997) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 0)) (= (select .cse998 (select (let ((.cse1003 (let ((.cse1004 (store .cse1001 .cse997 (store .cse1002 (+ v_arrayElimCell_156 8) v_ArrVal_2192)))) (store .cse1004 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse1004 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse1003 (select (select .cse1003 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) (+ v_arrayElimCell_156 4))) 1))))))))) (or .cse154 .cse155) (or .cse41 (and .cse1005 .cse1006)) (or (forall ((v_arrayElimCell_157 Int) (v_arrayElimCell_156 Int) (v_ArrVal_2188 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_27| Int) (v_ArrVal_2182 Int) (v_ArrVal_2192 Int)) (let ((.cse1013 (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2188) |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse1019 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select .cse1013 |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (let ((.cse1020 (select (select .cse1019 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1012 (+ v_arrayElimCell_156 8)) (.cse1021 (select .cse1019 .cse1020))) (let ((.cse1014 (let ((.cse1022 (let ((.cse1023 (store .cse1019 .cse1020 (store .cse1021 .cse4 v_ArrVal_2192)))) (store .cse1023 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse1023 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse1022 (select (select .cse1022 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4)))) (.cse1015 (+ v_arrayElimCell_157 4)) (.cse1007 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2182)) (.cse1016 (let ((.cse1017 (let ((.cse1018 (store .cse1019 .cse1020 (store .cse1021 .cse1012 v_ArrVal_2192)))) (store .cse1018 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse1018 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse1017 (select (select .cse1017 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))))) (or (< v_arrayElimCell_156 0) (= (select .cse1007 (select (let ((.cse1008 (let ((.cse1009 (let ((.cse1010 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select .cse1013 4))))) (let ((.cse1011 (select (select .cse1010 |c_ULTIMATE.start_main_~#s~0#1.base|) 4))) (store .cse1010 .cse1011 (store (select .cse1010 .cse1011) .cse1012 v_ArrVal_2192)))))) (store .cse1009 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse1009 |c_ULTIMATE.start_main_~#s~0#1.base|) 4 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse1008 (select (select .cse1008 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) 4)) 1) (< v_arrayElimCell_157 0) (= (select .cse1007 (select .cse1014 .cse23)) 1) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_node_create_~temp~0#1.base_27| 1)) (= (select .cse1007 (select .cse1014 .cse1015)) 1) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 0)) (= (select .cse1007 (select .cse1016 .cse1015)) 1) (= (select .cse1007 (select .cse1016 (+ v_arrayElimCell_156 4))) 1)))))))) .cse14) (or (and (or .cse1024 .cse14) (or (forall ((v_arrayElimCell_157 Int) (v_arrayElimCell_156 Int) (v_ArrVal_2188 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_27| Int) (v_ArrVal_2182 Int) (v_ArrVal_2192 Int)) (let ((.cse1031 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2188) |c_ULTIMATE.start_main_~#s~0#1.base|) 4))))) (let ((.cse1032 (select (select .cse1031 |c_ULTIMATE.start_main_~#s~0#1.base|) 4))) (let ((.cse1033 (select .cse1031 .cse1032))) (let ((.cse1026 (let ((.cse1034 (let ((.cse1035 (store .cse1031 .cse1032 (store .cse1033 (+ v_arrayElimCell_156 8) v_ArrVal_2192)))) (store .cse1035 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse1035 |c_ULTIMATE.start_main_~#s~0#1.base|) 4 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse1034 (select (select .cse1034 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4)))) (.cse1028 (+ v_arrayElimCell_157 4)) (.cse1025 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2182)) (.cse1027 (let ((.cse1029 (let ((.cse1030 (store .cse1031 .cse1032 (store .cse1033 .cse4 v_ArrVal_2192)))) (store .cse1030 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse1030 |c_ULTIMATE.start_main_~#s~0#1.base|) 4 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse1029 (select (select .cse1029 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))))) (or (< v_arrayElimCell_156 0) (= (select .cse1025 (select .cse1026 4)) 1) (< v_arrayElimCell_157 0) (= (select .cse1025 (select .cse1027 .cse1028)) 1) (= (select .cse1025 (select .cse1026 .cse1028)) 1) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_node_create_~temp~0#1.base_27| 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 0)) (= (select .cse1025 (select .cse1027 .cse23)) 1))))))) .cse14) (or (forall ((v_arrayElimCell_157 Int) (v_arrayElimCell_156 Int) (v_ArrVal_2188 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_27| Int) (v_ArrVal_2182 Int) (v_ArrVal_2192 Int)) (let ((.cse1043 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2188) |c_ULTIMATE.start_main_~#s~0#1.base|) 4))))) (let ((.cse1040 (select (select .cse1043 |c_ULTIMATE.start_main_~#s~0#1.base|) 4))) (let ((.cse1044 (select .cse1043 .cse1040))) (let ((.cse1037 (let ((.cse1045 (let ((.cse1046 (store .cse1043 .cse1040 (store .cse1044 (+ v_arrayElimCell_156 8) v_ArrVal_2192)))) (store .cse1046 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse1046 |c_ULTIMATE.start_main_~#s~0#1.base|) 4 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse1045 (select (select .cse1045 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4)))) (.cse1039 (+ v_arrayElimCell_157 4)) (.cse1036 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2182)) (.cse1038 (let ((.cse1041 (let ((.cse1042 (store .cse1043 .cse1040 (store .cse1044 .cse4 v_ArrVal_2192)))) (store .cse1042 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse1042 |c_ULTIMATE.start_main_~#s~0#1.base|) 4 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse1041 (select (select .cse1041 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))))) (or (< v_arrayElimCell_156 0) (= (select .cse1036 (select .cse1037 4)) 1) (= (select .cse1036 (select .cse1038 .cse1039)) 1) (= (select .cse1036 (select .cse1037 .cse1039)) 1) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_node_create_~temp~0#1.base_27| 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 0)) (= |v_ULTIMATE.start_node_create_~temp~0#1.base_27| .cse1040) (= (select .cse1036 (select .cse1038 .cse23)) 1))))))) .cse14) .cse245 .cse246) .cse41) (or .cse5 (and (or .cse562 .cse14) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_27| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_node_create_~temp~0#1.base_27| 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 0)) (forall ((v_arrayElimCell_156 Int)) (or (< v_arrayElimCell_156 0) (forall ((v_arrayElimCell_157 Int)) (or (< v_arrayElimCell_157 0) (forall ((v_ArrVal_2188 (Array Int Int)) (v_ArrVal_2182 Int) (v_ArrVal_2192 Int)) (let ((.cse1052 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2188) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (let ((.cse1047 (select (select .cse1052 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1053 (select .cse1052 .cse1047))) (let ((.cse1049 (let ((.cse1054 (let ((.cse1055 (store .cse1052 .cse1047 (store .cse1053 .cse4 v_ArrVal_2192)))) (store .cse1055 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse1055 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse1054 (select (select .cse1054 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4)))) (.cse1048 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2182))) (or (not (= |v_ULTIMATE.start_node_create_~temp~0#1.base_27| .cse1047)) (= (select .cse1048 (select .cse1049 .cse23)) 1) (= (select .cse1048 (select .cse1049 (+ v_arrayElimCell_157 4))) 1) (= (select .cse1048 (select (let ((.cse1050 (let ((.cse1051 (store .cse1052 .cse1047 (store .cse1053 (+ v_arrayElimCell_156 8) v_ArrVal_2192)))) (store .cse1051 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse1051 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse1050 (select (select .cse1050 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) (+ v_arrayElimCell_156 4))) 1))))))))))))))) (or .cse41 (and .cse393 .cse403)) (or (and (or .cse1024 .cse41) .cse757 .cse759 (or .cse41 .cse1056) .cse664 .cse761 .cse665 (or .cse5 (forall ((v_arrayElimCell_157 Int) (v_arrayElimCell_156 Int) (v_ArrVal_2188 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_27| Int) (v_ArrVal_2182 Int) (v_ArrVal_2192 Int)) (let ((.cse1064 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2188) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (let ((.cse1060 (select (select .cse1064 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1065 (select .cse1064 .cse1060))) (let ((.cse1058 (let ((.cse1066 (let ((.cse1067 (store .cse1064 .cse1060 (store .cse1065 .cse4 v_ArrVal_2192)))) (store .cse1067 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse1067 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse1066 (select (select .cse1066 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4)))) (.cse1059 (+ v_arrayElimCell_157 4)) (.cse1057 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2182)) (.cse1061 (let ((.cse1062 (let ((.cse1063 (store .cse1064 .cse1060 (store .cse1065 (+ v_arrayElimCell_156 8) v_ArrVal_2192)))) (store .cse1063 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse1063 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse1062 (select (select .cse1062 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))))) (or (< v_arrayElimCell_156 0) (= (select .cse1057 (select .cse1058 .cse23)) 1) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_node_create_~temp~0#1.base_27| 1)) (= (select .cse1057 (select .cse1058 .cse1059)) 1) (= |v_ULTIMATE.start_node_create_~temp~0#1.base_27| .cse1060) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 0)) (= .cse1060 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select .cse1057 (select .cse1061 .cse1059)) 1) (= (select .cse1057 (select .cse1061 (+ v_arrayElimCell_156 4))) 1)))))))) .cse578 .cse579 (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_27| Int)) (or (forall ((v_ArrVal_2188 (Array Int Int))) (let ((.cse1075 (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2188) |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse1080 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select .cse1075 |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (let ((.cse1081 (select (select .cse1080 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_arrayElimCell_157 Int) (v_ArrVal_2182 Int) (v_ArrVal_2192 Int)) (let ((.cse1082 (select .cse1080 .cse1081))) (let ((.cse1068 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2182)) (.cse1069 (let ((.cse1083 (let ((.cse1084 (store .cse1080 .cse1081 (store .cse1082 .cse4 v_ArrVal_2192)))) (store .cse1084 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse1084 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse1083 (select (select .cse1083 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4)))) (.cse1077 (+ v_arrayElimCell_157 4))) (or (= (select .cse1068 (select .cse1069 .cse23)) 1) (forall ((v_arrayElimCell_156 Int)) (let ((.cse1074 (+ v_arrayElimCell_156 8))) (let ((.cse1076 (let ((.cse1078 (let ((.cse1079 (store .cse1080 .cse1081 (store .cse1082 .cse1074 v_ArrVal_2192)))) (store .cse1079 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse1079 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse1078 (select (select .cse1078 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))))) (or (< v_arrayElimCell_156 0) (= (select .cse1068 (select (let ((.cse1070 (let ((.cse1071 (let ((.cse1072 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select .cse1075 4))))) (let ((.cse1073 (select (select .cse1072 |c_ULTIMATE.start_main_~#s~0#1.base|) 4))) (store .cse1072 .cse1073 (store (select .cse1072 .cse1073) .cse1074 v_ArrVal_2192)))))) (store .cse1071 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse1071 |c_ULTIMATE.start_main_~#s~0#1.base|) 4 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse1070 (select (select .cse1070 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) 4)) 1) (= (select .cse1068 (select .cse1076 .cse1077)) 1) (= (select .cse1068 (select .cse1076 (+ v_arrayElimCell_156 4))) 1))))) (= (select .cse1068 (select .cse1069 .cse1077)) 1))))) (= |v_ULTIMATE.start_node_create_~temp~0#1.base_27| .cse1081) (= .cse1081 |c_ULTIMATE.start_main_~#s~0#1.base|)))))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_node_create_~temp~0#1.base_27| 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 0)))) (or .cse392 .cse41) .cse815 .cse690 .cse691) .cse14) (or .cse5 (forall ((v_arrayElimCell_157 Int) (v_arrayElimCell_156 Int) (v_ArrVal_2188 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_27| Int) (v_ArrVal_2182 Int) (v_ArrVal_2192 Int)) (let ((.cse1090 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2188) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (let ((.cse1085 (select (select .cse1090 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1091 (select .cse1090 .cse1085))) (let ((.cse1087 (let ((.cse1092 (let ((.cse1093 (store .cse1090 .cse1085 (store .cse1091 .cse4 v_ArrVal_2192)))) (store .cse1093 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse1093 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse1092 (select (select .cse1092 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4)))) (.cse1086 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2182))) (or (< v_arrayElimCell_156 0) (not (= |v_ULTIMATE.start_node_create_~temp~0#1.base_27| .cse1085)) (< v_arrayElimCell_157 0) (= (select .cse1086 (select .cse1087 .cse23)) 1) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_node_create_~temp~0#1.base_27| 1)) (= (select .cse1086 (select .cse1087 (+ v_arrayElimCell_157 4))) 1) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 0)) (= (select .cse1086 (select (let ((.cse1088 (let ((.cse1089 (store .cse1090 .cse1085 (store .cse1091 (+ v_arrayElimCell_156 8) v_ArrVal_2192)))) (store .cse1089 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse1089 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse1088 (select (select .cse1088 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) (+ v_arrayElimCell_156 4))) 1)))))))) (or (and (or (forall ((v_arrayElimCell_157 Int) (v_arrayElimCell_156 Int) (v_ArrVal_2188 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_27| Int) (v_ArrVal_2182 Int) (v_ArrVal_2192 Int)) (let ((.cse1097 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2188) |c_ULTIMATE.start_main_~#s~0#1.base|) 4))))) (let ((.cse1098 (select (select .cse1097 |c_ULTIMATE.start_main_~#s~0#1.base|) 4))) (let ((.cse1099 (select .cse1097 .cse1098))) (let ((.cse1094 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2182)) (.cse1100 (let ((.cse1101 (let ((.cse1102 (store .cse1097 .cse1098 (store .cse1099 .cse4 v_ArrVal_2192)))) (store .cse1102 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse1102 |c_ULTIMATE.start_main_~#s~0#1.base|) 4 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse1101 (select (select .cse1101 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))))) (or (< v_arrayElimCell_156 0) (= (select .cse1094 (select (let ((.cse1095 (let ((.cse1096 (store .cse1097 .cse1098 (store .cse1099 (+ v_arrayElimCell_156 8) v_ArrVal_2192)))) (store .cse1096 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse1096 |c_ULTIMATE.start_main_~#s~0#1.base|) 4 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse1095 (select (select .cse1095 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) 4)) 1) (= (select .cse1094 (select .cse1100 (+ v_arrayElimCell_157 4))) 1) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_node_create_~temp~0#1.base_27| 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 0)) (= |v_ULTIMATE.start_node_create_~temp~0#1.base_27| .cse1098) (= (select .cse1094 (select .cse1100 .cse23)) 1))))))) .cse14) (or .cse14 .cse1056) (or .cse14 (forall ((v_arrayElimCell_157 Int) (v_arrayElimCell_156 Int) (v_ArrVal_2188 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_27| Int) (v_ArrVal_2182 Int) (v_ArrVal_2192 Int)) (let ((.cse1106 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2188) |c_ULTIMATE.start_main_~#s~0#1.base|) 4))))) (let ((.cse1107 (select (select .cse1106 |c_ULTIMATE.start_main_~#s~0#1.base|) 4))) (let ((.cse1108 (select .cse1106 .cse1107))) (let ((.cse1103 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2182)) (.cse1109 (let ((.cse1110 (let ((.cse1111 (store .cse1106 .cse1107 (store .cse1108 .cse4 v_ArrVal_2192)))) (store .cse1111 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse1111 |c_ULTIMATE.start_main_~#s~0#1.base|) 4 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse1110 (select (select .cse1110 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))))) (or (< v_arrayElimCell_156 0) (= (select .cse1103 (select (let ((.cse1104 (let ((.cse1105 (store .cse1106 .cse1107 (store .cse1108 (+ v_arrayElimCell_156 8) v_ArrVal_2192)))) (store .cse1105 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse1105 |c_ULTIMATE.start_main_~#s~0#1.base|) 4 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse1104 (select (select .cse1104 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))) 4)) 1) (< v_arrayElimCell_157 0) (= (select .cse1103 (select .cse1109 (+ v_arrayElimCell_157 4))) 1) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_node_create_~temp~0#1.base_27| 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 0)) (= (select .cse1103 (select .cse1109 .cse23)) 1)))))))) .cse1005 .cse1006) .cse41) (or (and (or .cse14 (forall ((v_arrayElimCell_157 Int) (v_arrayElimCell_156 Int) (v_ArrVal_2188 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_27| Int) (v_ArrVal_2182 Int) (v_ArrVal_2192 Int)) (let ((.cse1118 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2188) |c_ULTIMATE.start_main_~#s~0#1.base|) 4))))) (let ((.cse1115 (select (select .cse1118 |c_ULTIMATE.start_main_~#s~0#1.base|) 4))) (let ((.cse1119 (select .cse1118 .cse1115))) (let ((.cse1113 (let ((.cse1120 (let ((.cse1121 (store .cse1118 .cse1115 (store .cse1119 (+ v_arrayElimCell_156 8) v_ArrVal_2192)))) (store .cse1121 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse1121 |c_ULTIMATE.start_main_~#s~0#1.base|) 4 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse1120 (select (select .cse1120 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4)))) (.cse1112 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2182)) (.cse1114 (let ((.cse1116 (let ((.cse1117 (store .cse1118 .cse1115 (store .cse1119 .cse4 v_ArrVal_2192)))) (store .cse1117 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse1117 |c_ULTIMATE.start_main_~#s~0#1.base|) 4 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse1116 (select (select .cse1116 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))))) (or (< v_arrayElimCell_156 0) (= (select .cse1112 (select .cse1113 4)) 1) (= (select .cse1112 (select .cse1113 (+ v_arrayElimCell_156 4))) 1) (= (select .cse1112 (select .cse1114 (+ v_arrayElimCell_157 4))) 1) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_node_create_~temp~0#1.base_27| 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 0)) (= |v_ULTIMATE.start_node_create_~temp~0#1.base_27| .cse1115) (= (select .cse1112 (select .cse1114 .cse23)) 1)))))))) (or (forall ((v_arrayElimCell_157 Int) (v_arrayElimCell_156 Int) (v_ArrVal_2188 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_27| Int) (v_ArrVal_2182 Int) (v_ArrVal_2192 Int)) (let ((.cse1128 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| (store v_ArrVal_2188 4 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2188) |c_ULTIMATE.start_main_~#s~0#1.base|) 4))))) (let ((.cse1122 (select (select .cse1128 |c_ULTIMATE.start_main_~#s~0#1.base|) 4))) (let ((.cse1129 (select .cse1128 .cse1122))) (let ((.cse1124 (let ((.cse1130 (let ((.cse1131 (store .cse1128 .cse1122 (store .cse1129 (+ v_arrayElimCell_156 8) v_ArrVal_2192)))) (store .cse1131 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse1131 |c_ULTIMATE.start_main_~#s~0#1.base|) 4 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse1130 (select (select .cse1130 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4)))) (.cse1123 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27| v_ArrVal_2182)) (.cse1125 (let ((.cse1126 (let ((.cse1127 (store .cse1128 .cse1122 (store .cse1129 .cse4 v_ArrVal_2192)))) (store .cse1127 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse1127 |c_ULTIMATE.start_main_~#s~0#1.base|) 4 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|))))) (select .cse1126 (select (select .cse1126 |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 4))))) (or (< v_arrayElimCell_156 0) (not (= .cse1122 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (select .cse1123 (select .cse1124 4)) 1) (= (select .cse1123 (select .cse1124 (+ v_arrayElimCell_156 4))) 1) (= (select .cse1123 (select .cse1125 (+ v_arrayElimCell_157 4))) 1) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_node_create_~temp~0#1.base_27| 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_27|) 0)) (= (select .cse1123 (select .cse1125 .cse23)) 1))))))) .cse14)) .cse41))))) (not (= |c_ULTIMATE.start_dll_create_#res#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from true