./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 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e7c5120-c554-4e57-b53b-fcd34b89e973/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e7c5120-c554-4e57-b53b-fcd34b89e973/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e7c5120-c554-4e57-b53b-fcd34b89e973/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e7c5120-c554-4e57-b53b-fcd34b89e973/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/dll2n_prepend_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e7c5120-c554-4e57-b53b-fcd34b89e973/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e7c5120-c554-4e57-b53b-fcd34b89e973/bin/uautomizer-verify-qhAvR1uOyd --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 46bbe683d8965e9a855fbd780578b958a816bbdd25bc1fa0d6151e1b826f8669 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 13:55:47,355 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 13:55:47,414 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e7c5120-c554-4e57-b53b-fcd34b89e973/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-13 13:55:47,418 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 13:55:47,419 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 13:55:47,444 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 13:55:47,445 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 13:55:47,445 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 13:55:47,445 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 13:55:47,445 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 13:55:47,446 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 13:55:47,446 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 13:55:47,446 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 13:55:47,446 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 13:55:47,446 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 13:55:47,446 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 13:55:47,447 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 13:55:47,447 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 13:55:47,447 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 13:55:47,447 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 13:55:47,447 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-13 13:55:47,447 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-13 13:55:47,447 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-13 13:55:47,447 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 13:55:47,447 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-13 13:55:47,448 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 13:55:47,448 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-13 13:55:47,450 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 13:55:47,450 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 13:55:47,450 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 13:55:47,450 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 13:55:47,450 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 13:55:47,450 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 13:55:47,450 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 13:55:47,451 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 13:55:47,451 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 13:55:47,451 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 13:55:47,451 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 13:55:47,451 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 13:55:47,451 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 13:55:47,451 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 13:55:47,451 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 13:55:47,451 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e7c5120-c554-4e57-b53b-fcd34b89e973/bin/uautomizer-verify-qhAvR1uOyd Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 46bbe683d8965e9a855fbd780578b958a816bbdd25bc1fa0d6151e1b826f8669 [2024-11-13 13:55:47,776 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 13:55:47,786 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 13:55:47,788 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 13:55:47,790 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 13:55:47,790 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 13:55:47,791 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e7c5120-c554-4e57-b53b-fcd34b89e973/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/list-simple/dll2n_prepend_equal.i Unable to find full path for "g++" [2024-11-13 13:55:49,639 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 13:55:50,035 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 13:55:50,036 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e7c5120-c554-4e57-b53b-fcd34b89e973/sv-benchmarks/c/list-simple/dll2n_prepend_equal.i [2024-11-13 13:55:50,052 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e7c5120-c554-4e57-b53b-fcd34b89e973/bin/uautomizer-verify-qhAvR1uOyd/data/63561766a/a726b9218c4c46f8804f09e4fcd262c9/FLAGc26a97c8c [2024-11-13 13:55:50,074 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e7c5120-c554-4e57-b53b-fcd34b89e973/bin/uautomizer-verify-qhAvR1uOyd/data/63561766a/a726b9218c4c46f8804f09e4fcd262c9 [2024-11-13 13:55:50,077 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 13:55:50,079 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 13:55:50,083 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 13:55:50,083 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 13:55:50,087 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 13:55:50,088 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 01:55:50" (1/1) ... [2024-11-13 13:55:50,089 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a050f41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:55:50, skipping insertion in model container [2024-11-13 13:55:50,091 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 01:55:50" (1/1) ... [2024-11-13 13:55:50,126 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 13:55:50,430 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 13:55:50,444 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 13:55:50,523 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 13:55:50,561 INFO L204 MainTranslator]: Completed translation [2024-11-13 13:55:50,561 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:55:50 WrapperNode [2024-11-13 13:55:50,561 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 13:55:50,563 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 13:55:50,563 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 13:55:50,563 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 13:55:50,570 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:55:50" (1/1) ... [2024-11-13 13:55:50,583 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:55:50" (1/1) ... [2024-11-13 13:55:50,613 INFO L138 Inliner]: procedures = 127, calls = 39, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 118 [2024-11-13 13:55:50,617 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 13:55:50,618 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 13:55:50,618 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 13:55:50,618 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 13:55:50,630 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:55:50" (1/1) ... [2024-11-13 13:55:50,631 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:55:50" (1/1) ... [2024-11-13 13:55:50,637 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:55:50" (1/1) ... [2024-11-13 13:55:50,663 INFO L175 MemorySlicer]: Split 21 memory accesses to 3 slices as follows [2, 7, 12]. 57 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 10 writes are split as follows [0, 1, 9]. [2024-11-13 13:55:50,664 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:55:50" (1/1) ... [2024-11-13 13:55:50,664 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:55:50" (1/1) ... [2024-11-13 13:55:50,677 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:55:50" (1/1) ... [2024-11-13 13:55:50,684 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:55:50" (1/1) ... [2024-11-13 13:55:50,689 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:55:50" (1/1) ... [2024-11-13 13:55:50,691 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:55:50" (1/1) ... [2024-11-13 13:55:50,693 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 13:55:50,700 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 13:55:50,700 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 13:55:50,701 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 13:55:50,702 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:55:50" (1/1) ... [2024-11-13 13:55:50,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 13:55:50,728 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e7c5120-c554-4e57-b53b-fcd34b89e973/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:55:50,744 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e7c5120-c554-4e57-b53b-fcd34b89e973/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 13:55:50,747 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e7c5120-c554-4e57-b53b-fcd34b89e973/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 13:55:50,781 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2024-11-13 13:55:50,781 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2024-11-13 13:55:50,781 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-13 13:55:50,781 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-13 13:55:50,781 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-13 13:55:50,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-13 13:55:50,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-13 13:55:50,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-13 13:55:50,782 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-13 13:55:50,782 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 13:55:50,782 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-13 13:55:50,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-13 13:55:50,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-13 13:55:50,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-13 13:55:50,783 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-13 13:55:50,783 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-13 13:55:50,783 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-13 13:55:50,783 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-13 13:55:50,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-13 13:55:50,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-13 13:55:50,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-13 13:55:50,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 13:55:50,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-13 13:55:50,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-13 13:55:50,785 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 13:55:50,785 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 13:55:50,950 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 13:55:50,952 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 13:55:50,973 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2024-11-13 13:55:51,293 INFO L? ?]: Removed 108 outVars from TransFormulas that were not future-live. [2024-11-13 13:55:51,293 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 13:55:51,313 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 13:55:51,313 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-13 13:55:51,317 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:55:51 BoogieIcfgContainer [2024-11-13 13:55:51,318 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 13:55:51,320 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 13:55:51,320 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 13:55:51,326 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 13:55:51,327 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 01:55:50" (1/3) ... [2024-11-13 13:55:51,327 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a8b3d29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 01:55:51, skipping insertion in model container [2024-11-13 13:55:51,327 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:55:50" (2/3) ... [2024-11-13 13:55:51,327 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a8b3d29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 01:55:51, skipping insertion in model container [2024-11-13 13:55:51,328 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:55:51" (3/3) ... [2024-11-13 13:55:51,329 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_prepend_equal.i [2024-11-13 13:55:51,344 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 13:55:51,346 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG dll2n_prepend_equal.i that has 2 procedures, 98 locations, 1 initial locations, 3 loop locations, and 41 error locations. [2024-11-13 13:55:51,387 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 13:55:51,402 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3eecf6ec, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 13:55:51,402 INFO L334 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2024-11-13 13:55:51,406 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) [2024-11-13 13:55:51,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-13 13:55:51,412 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:55:51,412 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-13 13:55:51,413 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-13 13:55:51,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:55:51,417 INFO L85 PathProgramCache]: Analyzing trace with hash 33470383, now seen corresponding path program 1 times [2024-11-13 13:55:51,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:55:51,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293491458] [2024-11-13 13:55:51,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:55:51,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:55:51,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:55:51,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:55:51,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:55:51,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293491458] [2024-11-13 13:55:51,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293491458] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:55:51,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:55:51,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 13:55:51,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023846206] [2024-11-13 13:55:51,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:55:51,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 13:55:51,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:55:51,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 13:55:51,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:55:51,711 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) [2024-11-13 13:55:51,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:55:51,866 INFO L93 Difference]: Finished difference Result 93 states and 100 transitions. [2024-11-13 13:55:51,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:55:51,869 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 [2024-11-13 13:55:51,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:55:51,876 INFO L225 Difference]: With dead ends: 93 [2024-11-13 13:55:51,876 INFO L226 Difference]: Without dead ends: 87 [2024-11-13 13:55:51,878 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:55:51,881 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 9 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 13:55:51,882 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 137 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 13:55:51,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-13 13:55:51,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-11-13 13:55:51,914 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) [2024-11-13 13:55:51,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 92 transitions. [2024-11-13 13:55:51,919 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 92 transitions. Word has length 5 [2024-11-13 13:55:51,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:55:51,920 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 92 transitions. [2024-11-13 13:55:51,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:55:51,920 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 92 transitions. [2024-11-13 13:55:51,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-13 13:55:51,921 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:55:51,921 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-13 13:55:51,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 13:55:51,921 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-13 13:55:51,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:55:51,922 INFO L85 PathProgramCache]: Analyzing trace with hash 33470384, now seen corresponding path program 1 times [2024-11-13 13:55:51,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:55:51,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068863804] [2024-11-13 13:55:51,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:55:51,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:55:51,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:55:52,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:55:52,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:55:52,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068863804] [2024-11-13 13:55:52,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068863804] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:55:52,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:55:52,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 13:55:52,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676304079] [2024-11-13 13:55:52,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:55:52,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 13:55:52,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:55:52,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 13:55:52,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:55:52,108 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) [2024-11-13 13:55:52,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:55:52,224 INFO L93 Difference]: Finished difference Result 84 states and 89 transitions. [2024-11-13 13:55:52,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:55:52,225 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 [2024-11-13 13:55:52,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:55:52,226 INFO L225 Difference]: With dead ends: 84 [2024-11-13 13:55:52,226 INFO L226 Difference]: Without dead ends: 84 [2024-11-13 13:55:52,226 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:55:52,227 INFO L432 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 [2024-11-13 13:55:52,227 INFO L433 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] [2024-11-13 13:55:52,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-13 13:55:52,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-11-13 13:55:52,237 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) [2024-11-13 13:55:52,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2024-11-13 13:55:52,239 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 5 [2024-11-13 13:55:52,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:55:52,240 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions. [2024-11-13 13:55:52,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:55:52,240 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2024-11-13 13:55:52,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-13 13:55:52,240 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:55:52,241 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:55:52,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 13:55:52,241 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-13 13:55:52,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:55:52,242 INFO L85 PathProgramCache]: Analyzing trace with hash 2099158735, now seen corresponding path program 1 times [2024-11-13 13:55:52,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:55:52,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569618330] [2024-11-13 13:55:52,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:55:52,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:55:52,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:55:52,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:55:52,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:55:52,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569618330] [2024-11-13 13:55:52,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569618330] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:55:52,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:55:52,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 13:55:52,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757780938] [2024-11-13 13:55:52,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:55:52,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 13:55:52,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:55:52,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 13:55:52,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:55:52,345 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) [2024-11-13 13:55:52,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:55:52,369 INFO L93 Difference]: Finished difference Result 94 states and 100 transitions. [2024-11-13 13:55:52,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:55:52,370 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 [2024-11-13 13:55:52,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:55:52,371 INFO L225 Difference]: With dead ends: 94 [2024-11-13 13:55:52,372 INFO L226 Difference]: Without dead ends: 94 [2024-11-13 13:55:52,373 INFO L431 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 [2024-11-13 13:55:52,373 INFO L432 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 [2024-11-13 13:55:52,376 INFO L433 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] [2024-11-13 13:55:52,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-13 13:55:52,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 85. [2024-11-13 13:55:52,383 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) [2024-11-13 13:55:52,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 90 transitions. [2024-11-13 13:55:52,384 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 90 transitions. Word has length 7 [2024-11-13 13:55:52,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:55:52,384 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 90 transitions. [2024-11-13 13:55:52,385 INFO L472 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) [2024-11-13 13:55:52,385 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 90 transitions. [2024-11-13 13:55:52,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-13 13:55:52,385 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:55:52,385 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:55:52,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-13 13:55:52,385 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-13 13:55:52,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:55:52,389 INFO L85 PathProgramCache]: Analyzing trace with hash -278170765, now seen corresponding path program 1 times [2024-11-13 13:55:52,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:55:52,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139715341] [2024-11-13 13:55:52,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:55:52,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:55:52,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:55:52,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:55:52,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:55:52,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139715341] [2024-11-13 13:55:52,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139715341] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:55:52,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:55:52,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 13:55:52,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94806133] [2024-11-13 13:55:52,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:55:52,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 13:55:52,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:55:52,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 13:55:52,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:55:52,492 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) [2024-11-13 13:55:52,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:55:52,520 INFO L93 Difference]: Finished difference Result 90 states and 95 transitions. [2024-11-13 13:55:52,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:55:52,524 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 [2024-11-13 13:55:52,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:55:52,524 INFO L225 Difference]: With dead ends: 90 [2024-11-13 13:55:52,524 INFO L226 Difference]: Without dead ends: 90 [2024-11-13 13:55:52,525 INFO L431 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 [2024-11-13 13:55:52,525 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 0 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 13:55:52,525 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 166 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 13:55:52,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-13 13:55:52,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-11-13 13:55:52,532 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) [2024-11-13 13:55:52,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 95 transitions. [2024-11-13 13:55:52,532 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 95 transitions. Word has length 9 [2024-11-13 13:55:52,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:55:52,536 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 95 transitions. [2024-11-13 13:55:52,537 INFO L472 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) [2024-11-13 13:55:52,537 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 95 transitions. [2024-11-13 13:55:52,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 13:55:52,537 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:55:52,537 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:55:52,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-13 13:55:52,537 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-13 13:55:52,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:55:52,538 INFO L85 PathProgramCache]: Analyzing trace with hash 248872223, now seen corresponding path program 1 times [2024-11-13 13:55:52,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:55:52,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197317529] [2024-11-13 13:55:52,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:55:52,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:55:52,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:55:52,698 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:55:52,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:55:52,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197317529] [2024-11-13 13:55:52,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197317529] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:55:52,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [323940287] [2024-11-13 13:55:52,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:55:52,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:55:52,699 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e7c5120-c554-4e57-b53b-fcd34b89e973/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:55:52,702 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e7c5120-c554-4e57-b53b-fcd34b89e973/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:55:52,704 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e7c5120-c554-4e57-b53b-fcd34b89e973/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-13 13:55:52,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:55:52,835 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-13 13:55:52,840 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:55:52,909 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:55:52,909 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:55:52,953 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:55:52,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [323940287] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:55:52,954 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 13:55:52,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2024-11-13 13:55:52,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507506626] [2024-11-13 13:55:52,954 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 13:55:52,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 13:55:52,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:55:52,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 13:55:52,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-13 13:55:52,956 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) [2024-11-13 13:55:52,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:55:52,986 INFO L93 Difference]: Finished difference Result 92 states and 97 transitions. [2024-11-13 13:55:52,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 13:55:52,986 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 [2024-11-13 13:55:52,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:55:52,987 INFO L225 Difference]: With dead ends: 92 [2024-11-13 13:55:52,987 INFO L226 Difference]: Without dead ends: 92 [2024-11-13 13:55:52,987 INFO L431 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 [2024-11-13 13:55:52,988 INFO L432 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 [2024-11-13 13:55:52,988 INFO L433 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] [2024-11-13 13:55:52,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-13 13:55:52,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-11-13 13:55:52,992 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) [2024-11-13 13:55:52,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 97 transitions. [2024-11-13 13:55:52,993 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 97 transitions. Word has length 14 [2024-11-13 13:55:52,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:55:52,993 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 97 transitions. [2024-11-13 13:55:52,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:55:52,994 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 97 transitions. [2024-11-13 13:55:52,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-13 13:55:52,994 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:55:52,994 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-13 13:55:53,015 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e7c5120-c554-4e57-b53b-fcd34b89e973/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-13 13:55:53,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e7c5120-c554-4e57-b53b-fcd34b89e973/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:55:53,195 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-13 13:55:53,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:55:53,196 INFO L85 PathProgramCache]: Analyzing trace with hash -287048253, now seen corresponding path program 1 times [2024-11-13 13:55:53,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:55:53,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810143855] [2024-11-13 13:55:53,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:55:53,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:55:53,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:55:53,487 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:55:53,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:55:53,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810143855] [2024-11-13 13:55:53,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810143855] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:55:53,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1599624136] [2024-11-13 13:55:53,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:55:53,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:55:53,489 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e7c5120-c554-4e57-b53b-fcd34b89e973/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:55:53,491 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e7c5120-c554-4e57-b53b-fcd34b89e973/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:55:53,494 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e7c5120-c554-4e57-b53b-fcd34b89e973/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-13 13:55:53,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:55:53,622 INFO L255 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-13 13:55:53,624 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:55:53,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-13 13:55:53,695 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-13 13:55:53,696 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-11-13 13:55:53,722 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:55:53,722 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:55:53,773 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:55:53,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1599624136] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:55:53,773 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 13:55:53,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 4 [2024-11-13 13:55:53,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778326113] [2024-11-13 13:55:53,773 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 13:55:53,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 13:55:53,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:55:53,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 13:55:53,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-13 13:55:53,777 INFO L87 Difference]: Start difference. First operand 92 states and 97 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:55:53,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:55:53,926 INFO L93 Difference]: Finished difference Result 91 states and 96 transitions. [2024-11-13 13:55:53,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 13:55:53,927 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 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 [2024-11-13 13:55:53,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:55:53,927 INFO L225 Difference]: With dead ends: 91 [2024-11-13 13:55:53,928 INFO L226 Difference]: Without dead ends: 91 [2024-11-13 13:55:53,928 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-13 13:55:53,928 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 5 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 13:55:53,929 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 162 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 13:55:53,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-13 13:55:53,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-11-13 13:55:53,935 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) [2024-11-13 13:55:53,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 96 transitions. [2024-11-13 13:55:53,939 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 96 transitions. Word has length 16 [2024-11-13 13:55:53,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:55:53,939 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 96 transitions. [2024-11-13 13:55:53,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:55:53,940 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 96 transitions. [2024-11-13 13:55:53,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-13 13:55:53,940 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:55:53,940 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-13 13:55:53,963 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e7c5120-c554-4e57-b53b-fcd34b89e973/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-13 13:55:54,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e7c5120-c554-4e57-b53b-fcd34b89e973/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-13 13:55:54,147 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-13 13:55:54,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:55:54,148 INFO L85 PathProgramCache]: Analyzing trace with hash -287048252, now seen corresponding path program 1 times [2024-11-13 13:55:54,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:55:54,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491007840] [2024-11-13 13:55:54,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:55:54,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:55:54,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:55:54,453 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:55:54,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:55:54,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491007840] [2024-11-13 13:55:54,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491007840] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:55:54,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1214113336] [2024-11-13 13:55:54,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:55:54,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:55:54,454 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e7c5120-c554-4e57-b53b-fcd34b89e973/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:55:54,455 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e7c5120-c554-4e57-b53b-fcd34b89e973/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:55:54,457 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e7c5120-c554-4e57-b53b-fcd34b89e973/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-13 13:55:54,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:55:54,597 INFO L255 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-13 13:55:54,599 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:55:54,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-13 13:55:54,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-13 13:55:54,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:55:54,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-13 13:55:54,736 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 13:55:54,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-13 13:55:54,780 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:55:54,780 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:55:55,162 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:55:55,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1214113336] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:55:55,163 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 13:55:55,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 9 [2024-11-13 13:55:55,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581072578] [2024-11-13 13:55:55,163 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 13:55:55,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-13 13:55:55,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:55:55,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-13 13:55:55,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-13 13:55:55,164 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) [2024-11-13 13:55:55,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:55:55,490 INFO L93 Difference]: Finished difference Result 90 states and 95 transitions. [2024-11-13 13:55:55,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 13:55:55,491 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 [2024-11-13 13:55:55,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:55:55,491 INFO L225 Difference]: With dead ends: 90 [2024-11-13 13:55:55,491 INFO L226 Difference]: Without dead ends: 90 [2024-11-13 13:55:55,491 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-13 13:55:55,492 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 18 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 13:55:55,492 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 299 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 13:55:55,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-13 13:55:55,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-11-13 13:55:55,500 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) [2024-11-13 13:55:55,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 95 transitions. [2024-11-13 13:55:55,500 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 95 transitions. Word has length 16 [2024-11-13 13:55:55,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:55:55,501 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 95 transitions. [2024-11-13 13:55:55,504 INFO L472 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) [2024-11-13 13:55:55,508 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 95 transitions. [2024-11-13 13:55:55,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-13 13:55:55,508 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:55:55,508 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:55:55,531 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e7c5120-c554-4e57-b53b-fcd34b89e973/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-13 13:55:55,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e7c5120-c554-4e57-b53b-fcd34b89e973/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:55:55,709 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-13 13:55:55,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:55:55,711 INFO L85 PathProgramCache]: Analyzing trace with hash -5839665, now seen corresponding path program 2 times [2024-11-13 13:55:55,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:55:55,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162864663] [2024-11-13 13:55:55,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:55:55,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:55:55,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:55:55,808 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:55:55,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:55:55,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162864663] [2024-11-13 13:55:55,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162864663] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:55:55,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [315854047] [2024-11-13 13:55:55,808 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 13:55:55,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:55:55,808 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e7c5120-c554-4e57-b53b-fcd34b89e973/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:55:55,810 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e7c5120-c554-4e57-b53b-fcd34b89e973/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:55:55,811 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e7c5120-c554-4e57-b53b-fcd34b89e973/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-13 13:55:55,922 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-13 13:55:55,922 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 13:55:55,923 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-13 13:55:55,927 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:55:55,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-13 13:55:55,945 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-13 13:55:55,945 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 13:55:55,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [315854047] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:55:55,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 13:55:55,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2024-11-13 13:55:55,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931657619] [2024-11-13 13:55:55,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:55:55,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 13:55:55,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:55:55,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 13:55:55,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 13:55:55,947 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) [2024-11-13 13:55:56,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:55:56,023 INFO L93 Difference]: Finished difference Result 87 states and 92 transitions. [2024-11-13 13:55:56,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:55:56,023 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 [2024-11-13 13:55:56,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:55:56,024 INFO L225 Difference]: With dead ends: 87 [2024-11-13 13:55:56,024 INFO L226 Difference]: Without dead ends: 87 [2024-11-13 13:55:56,024 INFO L431 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 [2024-11-13 13:55:56,025 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 3 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 13:55:56,025 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 117 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 13:55:56,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-13 13:55:56,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-11-13 13:55:56,035 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) [2024-11-13 13:55:56,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 92 transitions. [2024-11-13 13:55:56,036 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 92 transitions. Word has length 21 [2024-11-13 13:55:56,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:55:56,036 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 92 transitions. [2024-11-13 13:55:56,036 INFO L472 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) [2024-11-13 13:55:56,036 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 92 transitions. [2024-11-13 13:55:56,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-13 13:55:56,036 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:55:56,036 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:55:56,057 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e7c5120-c554-4e57-b53b-fcd34b89e973/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-13 13:55:56,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e7c5120-c554-4e57-b53b-fcd34b89e973/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:55:56,237 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-13 13:55:56,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:55:56,237 INFO L85 PathProgramCache]: Analyzing trace with hash -5839664, now seen corresponding path program 1 times [2024-11-13 13:55:56,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:55:56,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69975530] [2024-11-13 13:55:56,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:55:56,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:55:56,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:55:56,330 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:55:56,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:55:56,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69975530] [2024-11-13 13:55:56,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69975530] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:55:56,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1935555670] [2024-11-13 13:55:56,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:55:56,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:55:56,331 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e7c5120-c554-4e57-b53b-fcd34b89e973/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:55:56,333 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e7c5120-c554-4e57-b53b-fcd34b89e973/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:55:56,335 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e7c5120-c554-4e57-b53b-fcd34b89e973/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-13 13:55:56,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:55:56,480 INFO L255 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-13 13:55:56,482 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:55:56,506 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:55:56,506 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:55:56,530 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:55:56,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1935555670] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:55:56,531 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 13:55:56,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2024-11-13 13:55:56,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454377561] [2024-11-13 13:55:56,531 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 13:55:56,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 13:55:56,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:55:56,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 13:55:56,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 13:55:56,532 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) [2024-11-13 13:55:56,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:55:56,575 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2024-11-13 13:55:56,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 13:55:56,577 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 [2024-11-13 13:55:56,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:55:56,578 INFO L225 Difference]: With dead ends: 87 [2024-11-13 13:55:56,578 INFO L226 Difference]: Without dead ends: 87 [2024-11-13 13:55:56,578 INFO L431 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 [2024-11-13 13:55:56,578 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 4 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 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 [2024-11-13 13:55:56,579 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 221 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 13:55:56,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-13 13:55:56,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-11-13 13:55:56,585 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) [2024-11-13 13:55:56,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 91 transitions. [2024-11-13 13:55:56,586 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 91 transitions. Word has length 21 [2024-11-13 13:55:56,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:55:56,586 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 91 transitions. [2024-11-13 13:55:56,586 INFO L472 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) [2024-11-13 13:55:56,586 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 91 transitions. [2024-11-13 13:55:56,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-13 13:55:56,587 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:55:56,587 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:55:56,609 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e7c5120-c554-4e57-b53b-fcd34b89e973/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-13 13:55:56,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e7c5120-c554-4e57-b53b-fcd34b89e973/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:55:56,794 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-13 13:55:56,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:55:56,795 INFO L85 PathProgramCache]: Analyzing trace with hash -563203316, now seen corresponding path program 1 times [2024-11-13 13:55:56,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:55:56,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883533029] [2024-11-13 13:55:56,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:55:56,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:55:56,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:55:56,929 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-13 13:55:56,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:55:56,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883533029] [2024-11-13 13:55:56,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883533029] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:55:56,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:55:56,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 13:55:56,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442519192] [2024-11-13 13:55:56,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:55:56,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 13:55:56,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:55:56,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 13:55:56,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:55:56,931 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) [2024-11-13 13:55:56,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:55:56,995 INFO L93 Difference]: Finished difference Result 84 states and 88 transitions. [2024-11-13 13:55:56,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:55:56,996 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 [2024-11-13 13:55:56,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:55:56,996 INFO L225 Difference]: With dead ends: 84 [2024-11-13 13:55:56,996 INFO L226 Difference]: Without dead ends: 84 [2024-11-13 13:55:56,997 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:55:56,997 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 3 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 13:55:56,998 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 121 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 13:55:56,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-13 13:55:57,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-11-13 13:55:57,000 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) [2024-11-13 13:55:57,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 88 transitions. [2024-11-13 13:55:57,001 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 88 transitions. Word has length 22 [2024-11-13 13:55:57,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:55:57,001 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 88 transitions. [2024-11-13 13:55:57,001 INFO L472 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) [2024-11-13 13:55:57,001 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 88 transitions. [2024-11-13 13:55:57,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-13 13:55:57,001 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:55:57,002 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:55:57,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-13 13:55:57,002 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-13 13:55:57,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:55:57,002 INFO L85 PathProgramCache]: Analyzing trace with hash 299379093, now seen corresponding path program 1 times [2024-11-13 13:55:57,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:55:57,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439269526] [2024-11-13 13:55:57,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:55:57,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:55:57,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:55:57,367 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 13:55:57,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:55:57,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439269526] [2024-11-13 13:55:57,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439269526] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:55:57,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1591234007] [2024-11-13 13:55:57,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:55:57,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:55:57,368 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e7c5120-c554-4e57-b53b-fcd34b89e973/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:55:57,370 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e7c5120-c554-4e57-b53b-fcd34b89e973/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:55:57,372 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e7c5120-c554-4e57-b53b-fcd34b89e973/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-13 13:55:57,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:55:57,561 INFO L255 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-13 13:55:57,564 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:55:57,571 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-13 13:55:57,603 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-13 13:55:57,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-11-13 13:55:57,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:55:57,731 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2024-11-13 13:55:57,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:55:57,974 INFO L349 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2024-11-13 13:55:57,974 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 22 [2024-11-13 13:55:58,110 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:55:58,110 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:56:54,555 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:56:54,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1591234007] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:56:54,555 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 13:56:54,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2024-11-13 13:56:54,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299398105] [2024-11-13 13:56:54,556 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 13:56:54,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-13 13:56:54,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:56:54,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-13 13:56:54,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=190, Unknown=12, NotChecked=0, Total=272 [2024-11-13 13:56:54,557 INFO L87 Difference]: Start difference. First operand 84 states and 88 transitions. Second operand has 17 states, 16 states have (on average 4.4375) internal successors, (71), 17 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:56:54,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:56:54,882 INFO L93 Difference]: Finished difference Result 90 states and 95 transitions. [2024-11-13 13:56:54,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 13:56:54,883 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 4.4375) internal successors, (71), 17 states have internal predecessors, (71), 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 [2024-11-13 13:56:54,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:56:54,883 INFO L225 Difference]: With dead ends: 90 [2024-11-13 13:56:54,883 INFO L226 Difference]: Without dead ends: 90 [2024-11-13 13:56:54,884 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 56.5s TimeCoverageRelationStatistics Valid=113, Invalid=255, Unknown=12, NotChecked=0, Total=380 [2024-11-13 13:56:54,884 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 163 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 13:56:54,884 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 165 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 13:56:54,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-13 13:56:54,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 78. [2024-11-13 13:56:54,891 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) [2024-11-13 13:56:54,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 82 transitions. [2024-11-13 13:56:54,894 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 82 transitions. Word has length 27 [2024-11-13 13:56:54,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:56:54,894 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 82 transitions. [2024-11-13 13:56:54,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 4.4375) internal successors, (71), 17 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:56:54,894 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2024-11-13 13:56:54,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-13 13:56:54,895 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:56:54,895 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:56:54,914 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e7c5120-c554-4e57-b53b-fcd34b89e973/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-13 13:56:55,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e7c5120-c554-4e57-b53b-fcd34b89e973/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-13 13:56:55,096 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-13 13:56:55,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:56:55,096 INFO L85 PathProgramCache]: Analyzing trace with hash 299379094, now seen corresponding path program 1 times [2024-11-13 13:56:55,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:56:55,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56924150] [2024-11-13 13:56:55,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:56:55,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:56:55,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:56:55,633 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-13 13:56:55,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:56:55,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56924150] [2024-11-13 13:56:55,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56924150] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:56:55,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [697567054] [2024-11-13 13:56:55,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:56:55,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:56:55,634 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e7c5120-c554-4e57-b53b-fcd34b89e973/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:56:55,636 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e7c5120-c554-4e57-b53b-fcd34b89e973/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:56:55,638 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e7c5120-c554-4e57-b53b-fcd34b89e973/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-13 13:56:55,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:56:55,805 INFO L255 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-13 13:56:55,808 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:56:55,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-13 13:56:55,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:56:55,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-13 13:56:55,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:56:55,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-13 13:56:56,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:56:56,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-13 13:56:56,051 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-13 13:56:56,052 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 13:56:56,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [697567054] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:56:56,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 13:56:56,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 5 [2024-11-13 13:56:56,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924509722] [2024-11-13 13:56:56,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:56:56,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 13:56:56,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:56:56,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 13:56:56,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-13 13:56:56,054 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) [2024-11-13 13:56:56,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:56:56,159 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2024-11-13 13:56:56,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 13:56:56,160 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 [2024-11-13 13:56:56,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:56:56,160 INFO L225 Difference]: With dead ends: 72 [2024-11-13 13:56:56,160 INFO L226 Difference]: Without dead ends: 72 [2024-11-13 13:56:56,161 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-13 13:56:56,161 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 52 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 13:56:56,161 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 88 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 13:56:56,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-13 13:56:56,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-11-13 13:56:56,163 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) [2024-11-13 13:56:56,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2024-11-13 13:56:56,164 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 27 [2024-11-13 13:56:56,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:56:56,164 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 76 transitions. [2024-11-13 13:56:56,164 INFO L472 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) [2024-11-13 13:56:56,164 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2024-11-13 13:56:56,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-13 13:56:56,165 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:56:56,165 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:56:56,185 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e7c5120-c554-4e57-b53b-fcd34b89e973/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-13 13:56:56,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e7c5120-c554-4e57-b53b-fcd34b89e973/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-13 13:56:56,365 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-13 13:56:56,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:56:56,366 INFO L85 PathProgramCache]: Analyzing trace with hash 690817331, now seen corresponding path program 1 times [2024-11-13 13:56:56,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:56:56,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056086600] [2024-11-13 13:56:56,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:56:56,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:56:56,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:56:56,472 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-13 13:56:56,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:56:56,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056086600] [2024-11-13 13:56:56,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056086600] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:56:56,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:56:56,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 13:56:56,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048378060] [2024-11-13 13:56:56,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:56:56,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 13:56:56,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:56:56,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 13:56:56,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 13:56:56,474 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) [2024-11-13 13:56:56,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:56:56,590 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2024-11-13 13:56:56,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 13:56:56,590 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 [2024-11-13 13:56:56,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:56:56,591 INFO L225 Difference]: With dead ends: 71 [2024-11-13 13:56:56,591 INFO L226 Difference]: Without dead ends: 71 [2024-11-13 13:56:56,591 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 13:56:56,592 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 11 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 13:56:56,592 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 150 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 13:56:56,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-13 13:56:56,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2024-11-13 13:56:56,594 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) [2024-11-13 13:56:56,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2024-11-13 13:56:56,595 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 28 [2024-11-13 13:56:56,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:56:56,595 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2024-11-13 13:56:56,595 INFO L472 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) [2024-11-13 13:56:56,595 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2024-11-13 13:56:56,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-13 13:56:56,596 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:56:56,596 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:56:56,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-13 13:56:56,596 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-13 13:56:56,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:56:56,597 INFO L85 PathProgramCache]: Analyzing trace with hash 690817332, now seen corresponding path program 1 times [2024-11-13 13:56:56,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:56:56,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331691420] [2024-11-13 13:56:56,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:56:56,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:56:56,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:56:56,790 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-13 13:56:56,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:56:56,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331691420] [2024-11-13 13:56:56,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331691420] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:56:56,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:56:56,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 13:56:56,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433434404] [2024-11-13 13:56:56,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:56:56,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 13:56:56,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:56:56,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 13:56:56,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 13:56:56,792 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) [2024-11-13 13:56:56,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:56:56,900 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2024-11-13 13:56:56,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 13:56:56,900 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 [2024-11-13 13:56:56,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:56:56,901 INFO L225 Difference]: With dead ends: 70 [2024-11-13 13:56:56,901 INFO L226 Difference]: Without dead ends: 70 [2024-11-13 13:56:56,901 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 13:56:56,902 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 10 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 13:56:56,902 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 162 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 13:56:56,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-13 13:56:56,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2024-11-13 13:56:56,904 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) [2024-11-13 13:56:56,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 74 transitions. [2024-11-13 13:56:56,904 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 74 transitions. Word has length 28 [2024-11-13 13:56:56,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:56:56,905 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 74 transitions. [2024-11-13 13:56:56,905 INFO L472 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) [2024-11-13 13:56:56,905 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2024-11-13 13:56:56,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-13 13:56:56,905 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:56:56,906 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:56:56,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-13 13:56:56,906 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-13 13:56:56,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:56:56,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1074425824, now seen corresponding path program 1 times [2024-11-13 13:56:56,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:56:56,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798017706] [2024-11-13 13:56:56,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:56:56,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:56:56,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:56:57,203 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 13:56:57,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:56:57,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798017706] [2024-11-13 13:56:57,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798017706] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:56:57,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:56:57,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 13:56:57,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304256925] [2024-11-13 13:56:57,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:56:57,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 13:56:57,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:56:57,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 13:56:57,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-13 13:56:57,205 INFO L87 Difference]: Start difference. First operand 70 states and 74 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) [2024-11-13 13:56:57,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:56:57,428 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2024-11-13 13:56:57,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 13:56:57,428 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 33 [2024-11-13 13:56:57,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:56:57,429 INFO L225 Difference]: With dead ends: 69 [2024-11-13 13:56:57,429 INFO L226 Difference]: Without dead ends: 69 [2024-11-13 13:56:57,429 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-13 13:56:57,430 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 18 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 13:56:57,430 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 194 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 13:56:57,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-13 13:56:57,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-11-13 13:56:57,433 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) [2024-11-13 13:56:57,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2024-11-13 13:56:57,433 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 33 [2024-11-13 13:56:57,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:56:57,434 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2024-11-13 13:56:57,434 INFO L472 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) [2024-11-13 13:56:57,434 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2024-11-13 13:56:57,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-13 13:56:57,435 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:56:57,435 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:56:57,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-13 13:56:57,435 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-13 13:56:57,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:56:57,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1074425825, now seen corresponding path program 1 times [2024-11-13 13:56:57,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:56:57,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995167213] [2024-11-13 13:56:57,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:56:57,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:56:57,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:56:57,892 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 13:56:57,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:56:57,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995167213] [2024-11-13 13:56:57,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995167213] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:56:57,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:56:57,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 13:56:57,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963829535] [2024-11-13 13:56:57,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:56:57,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 13:56:57,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:56:57,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 13:56:57,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-13 13:56:57,893 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand has 7 states, 6 states have (on average 5.5) internal successors, (33), 7 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) [2024-11-13 13:56:58,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:56:58,100 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2024-11-13 13:56:58,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 13:56:58,101 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.5) internal successors, (33), 7 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 [2024-11-13 13:56:58,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:56:58,101 INFO L225 Difference]: With dead ends: 68 [2024-11-13 13:56:58,102 INFO L226 Difference]: Without dead ends: 68 [2024-11-13 13:56:58,102 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-13 13:56:58,102 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 10 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 13:56:58,102 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 214 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 13:56:58,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-11-13 13:56:58,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2024-11-13 13:56:58,104 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) [2024-11-13 13:56:58,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2024-11-13 13:56:58,105 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 33 [2024-11-13 13:56:58,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:56:58,105 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2024-11-13 13:56:58,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.5) internal successors, (33), 7 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) [2024-11-13 13:56:58,105 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2024-11-13 13:56:58,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-13 13:56:58,105 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:56:58,105 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:56:58,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-13 13:56:58,106 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-13 13:56:58,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:56:58,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1097966286, now seen corresponding path program 1 times [2024-11-13 13:56:58,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:56:58,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683254672] [2024-11-13 13:56:58,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:56:58,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:56:58,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:56:58,325 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 13:56:58,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:56:58,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683254672] [2024-11-13 13:56:58,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683254672] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:56:58,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:56:58,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 13:56:58,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380629201] [2024-11-13 13:56:58,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:56:58,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 13:56:58,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:56:58,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 13:56:58,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-13 13:56:58,327 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:56:58,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:56:58,450 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2024-11-13 13:56:58,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 13:56:58,451 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 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 [2024-11-13 13:56:58,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:56:58,452 INFO L225 Difference]: With dead ends: 68 [2024-11-13 13:56:58,452 INFO L226 Difference]: Without dead ends: 68 [2024-11-13 13:56:58,452 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-13 13:56:58,453 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 12 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 13:56:58,453 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 277 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 13:56:58,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-11-13 13:56:58,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2024-11-13 13:56:58,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 57 states have (on average 1.2456140350877194) internal successors, (71), 67 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:56:58,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2024-11-13 13:56:58,458 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 37 [2024-11-13 13:56:58,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:56:58,458 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2024-11-13 13:56:58,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:56:58,458 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2024-11-13 13:56:58,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-13 13:56:58,459 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:56:58,459 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:56:58,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-13 13:56:58,459 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-13 13:56:58,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:56:58,459 INFO L85 PathProgramCache]: Analyzing trace with hash 76948672, now seen corresponding path program 1 times [2024-11-13 13:56:58,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:56:58,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550480160] [2024-11-13 13:56:58,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:56:58,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:56:58,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:56:58,773 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-13 13:56:58,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:56:58,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550480160] [2024-11-13 13:56:58,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550480160] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:56:58,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:56:58,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-13 13:56:58,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446915512] [2024-11-13 13:56:58,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:56:58,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-13 13:56:58,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:56:58,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-13 13:56:58,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-13 13:56:58,776 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand has 9 states, 8 states have (on average 4.25) internal successors, (34), 9 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) [2024-11-13 13:56:59,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:56:59,007 INFO L93 Difference]: Finished difference Result 69 states and 74 transitions. [2024-11-13 13:56:59,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 13:56:59,008 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.25) internal successors, (34), 9 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 [2024-11-13 13:56:59,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:56:59,008 INFO L225 Difference]: With dead ends: 69 [2024-11-13 13:56:59,008 INFO L226 Difference]: Without dead ends: 69 [2024-11-13 13:56:59,009 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-13 13:56:59,010 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 24 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 13:56:59,010 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 220 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 13:56:59,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-13 13:56:59,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-11-13 13:56:59,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 59 states have (on average 1.2542372881355932) internal successors, (74), 68 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) [2024-11-13 13:56:59,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 74 transitions. [2024-11-13 13:56:59,012 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 74 transitions. Word has length 40 [2024-11-13 13:56:59,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:56:59,012 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 74 transitions. [2024-11-13 13:56:59,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.25) internal successors, (34), 9 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) [2024-11-13 13:56:59,012 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 74 transitions. [2024-11-13 13:56:59,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-13 13:56:59,013 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:56:59,013 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:56:59,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-13 13:56:59,013 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-13 13:56:59,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:56:59,014 INFO L85 PathProgramCache]: Analyzing trace with hash 76948673, now seen corresponding path program 1 times [2024-11-13 13:56:59,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:56:59,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109112164] [2024-11-13 13:56:59,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:56:59,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:56:59,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:56:59,502 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-13 13:56:59,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:56:59,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109112164] [2024-11-13 13:56:59,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109112164] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:56:59,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:56:59,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 13:56:59,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509240640] [2024-11-13 13:56:59,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:56:59,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 13:56:59,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:56:59,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 13:56:59,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-13 13:56:59,505 INFO L87 Difference]: Start difference. First operand 69 states and 74 transitions. Second operand has 8 states, 7 states have (on average 4.857142857142857) 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) [2024-11-13 13:56:59,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:56:59,768 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2024-11-13 13:56:59,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 13:56:59,769 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.857142857142857) 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 [2024-11-13 13:56:59,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:56:59,770 INFO L225 Difference]: With dead ends: 71 [2024-11-13 13:56:59,770 INFO L226 Difference]: Without dead ends: 71 [2024-11-13 13:56:59,770 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-13 13:56:59,771 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 24 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 13:56:59,771 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 212 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 13:56:59,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-13 13:56:59,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2024-11-13 13:56:59,774 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) [2024-11-13 13:56:59,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2024-11-13 13:56:59,775 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 40 [2024-11-13 13:56:59,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:56:59,775 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2024-11-13 13:56:59,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.857142857142857) 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) [2024-11-13 13:56:59,775 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2024-11-13 13:56:59,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-13 13:56:59,776 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:56:59,776 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:56:59,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-13 13:56:59,776 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-13 13:56:59,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:56:59,777 INFO L85 PathProgramCache]: Analyzing trace with hash -1135865815, now seen corresponding path program 1 times [2024-11-13 13:56:59,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:56:59,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385528083] [2024-11-13 13:56:59,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:56:59,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:56:59,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:57:00,080 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-13 13:57:00,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:57:00,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385528083] [2024-11-13 13:57:00,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385528083] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:57:00,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:57:00,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-13 13:57:00,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561337408] [2024-11-13 13:57:00,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:57:00,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 13:57:00,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:57:00,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 13:57:00,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-13 13:57:00,083 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:57:00,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:57:00,229 INFO L93 Difference]: Finished difference Result 71 states and 74 transitions. [2024-11-13 13:57:00,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 13:57:00,230 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 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 43 [2024-11-13 13:57:00,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:57:00,230 INFO L225 Difference]: With dead ends: 71 [2024-11-13 13:57:00,230 INFO L226 Difference]: Without dead ends: 71 [2024-11-13 13:57:00,230 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-13 13:57:00,231 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 24 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 13:57:00,232 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 277 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 13:57:00,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-13 13:57:00,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2024-11-13 13:57:00,234 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) [2024-11-13 13:57:00,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 74 transitions. [2024-11-13 13:57:00,239 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 74 transitions. Word has length 43 [2024-11-13 13:57:00,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:57:00,239 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 74 transitions. [2024-11-13 13:57:00,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:57:00,240 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 74 transitions. [2024-11-13 13:57:00,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-13 13:57:00,240 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:57:00,240 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:57:00,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-13 13:57:00,240 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-13 13:57:00,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:57:00,241 INFO L85 PathProgramCache]: Analyzing trace with hash 600854904, now seen corresponding path program 1 times [2024-11-13 13:57:00,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:57:00,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805609882] [2024-11-13 13:57:00,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:57:00,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:57:00,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:57:01,344 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 13:57:01,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:57:01,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805609882] [2024-11-13 13:57:01,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805609882] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:57:01,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [30648848] [2024-11-13 13:57:01,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:57:01,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:57:01,345 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e7c5120-c554-4e57-b53b-fcd34b89e973/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:57:01,347 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e7c5120-c554-4e57-b53b-fcd34b89e973/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:57:01,349 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e7c5120-c554-4e57-b53b-fcd34b89e973/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-13 13:57:01,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:57:01,582 INFO L255 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 57 conjuncts are in the unsatisfiable core [2024-11-13 13:57:01,587 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:57:01,632 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-13 13:57:01,787 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-13 13:57:01,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-11-13 13:57:02,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-11-13 13:57:02,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:57:02,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 17 [2024-11-13 13:57:02,496 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:57:02,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 42 [2024-11-13 13:57:02,508 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-13 13:57:02,640 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:57:02,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 33 [2024-11-13 13:57:02,649 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:57:02,652 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:57:02,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 28 [2024-11-13 13:57:02,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-13 13:57:02,824 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 13:57:02,824 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:57:02,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 64 [2024-11-13 13:57:03,163 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:57:03,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 96 [2024-11-13 13:57:03,338 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_dll_prepend_~head#1.offset|)) (.cse6 (= |c_ULTIMATE.start_dll_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (forall ((v_ArrVal_1560 (Array Int Int)) (v_arrayElimCell_20 Int)) (let ((.cse0 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_prepend_#t~mem10#1.base| v_ArrVal_1560))) (or (= (select (select .cse0 .cse1) (+ 4 v_arrayElimCell_20)) |c_ULTIMATE.start_dll_prepend_#t~mem10#1.base|) (= |c_ULTIMATE.start_dll_prepend_#t~mem10#1.base| (select (select .cse0 |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|) .cse2))))) (or (forall ((v_ArrVal_1560 (Array Int Int)) (v_arrayElimCell_20 Int)) (let ((.cse4 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_prepend_#t~mem10#1.base| v_ArrVal_1560))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|) .cse2))) (or (= |c_ULTIMATE.start_dll_prepend_#t~mem10#1.base| .cse3) (= (select (select .cse4 .cse1) (+ 4 v_arrayElimCell_20)) .cse3))))) (not .cse5) (not .cse6)) (forall ((v_ArrVal_1560 (Array Int Int)) (v_arrayElimCell_20 Int)) (let ((.cse9 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_prepend_#t~mem10#1.base| v_ArrVal_1560))) (let ((.cse7 (select (select .cse9 .cse1) (+ 4 v_arrayElimCell_20))) (.cse8 (select (select .cse9 |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|) .cse2))) (or (= .cse7 |c_ULTIMATE.start_dll_prepend_#t~mem10#1.base|) (= |c_ULTIMATE.start_dll_prepend_#t~mem10#1.base| .cse8) (= .cse7 .cse8))))) (or (forall ((v_ArrVal_1560 (Array Int Int)) (v_arrayElimCell_20 Int)) (let ((.cse11 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_prepend_#t~mem10#1.base| v_ArrVal_1560))) (let ((.cse10 (select (select .cse11 .cse1) (+ 4 v_arrayElimCell_20)))) (or (= .cse10 |c_ULTIMATE.start_dll_prepend_#t~mem10#1.base|) (= .cse10 (select (select .cse11 |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|) .cse2)))))) (and .cse5 .cse6)))) is different from false [2024-11-13 13:57:03,411 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4)) (.cse5 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|)) (.cse9 (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_dll_prepend_~head#1.offset|)) (.cse10 (= |c_ULTIMATE.start_dll_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (forall ((v_ArrVal_1560 (Array Int Int)) (v_arrayElimCell_20 Int)) (let ((.cse3 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_1560))) (let ((.cse1 (select (select .cse3 .cse5) (+ 4 v_arrayElimCell_20))) (.cse2 (select (select .cse3 |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|) .cse4))) (or (= .cse0 .cse1) (= .cse1 .cse2) (= .cse0 .cse2))))) (forall ((v_ArrVal_1560 (Array Int Int)) (v_arrayElimCell_20 Int)) (let ((.cse6 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_1560))) (or (= .cse0 (select (select .cse6 .cse5) (+ 4 v_arrayElimCell_20))) (= .cse0 (select (select .cse6 |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|) .cse4))))) (or (forall ((v_ArrVal_1560 (Array Int Int)) (v_arrayElimCell_20 Int)) (let ((.cse7 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_1560))) (let ((.cse8 (select (select .cse7 |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|) .cse4))) (or (= (select (select .cse7 .cse5) (+ 4 v_arrayElimCell_20)) .cse8) (= .cse0 .cse8))))) (not .cse9) (not .cse10)) (or (forall ((v_ArrVal_1560 (Array Int Int)) (v_arrayElimCell_20 Int)) (let ((.cse12 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_1560))) (let ((.cse11 (select (select .cse12 .cse5) (+ 4 v_arrayElimCell_20)))) (or (= .cse0 .cse11) (= .cse11 (select (select .cse12 |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|) .cse4)))))) (and .cse9 .cse10)))) is different from false [2024-11-13 13:57:03,627 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:57:03,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 118 treesize of output 88 [2024-11-13 13:57:03,644 INFO L349 Elim1Store]: treesize reduction 4, result has 73.3 percent of original size [2024-11-13 13:57:03,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 234 treesize of output 191 [2024-11-13 13:57:03,662 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:57:03,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 140 treesize of output 124 [2024-11-13 13:57:03,759 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-13 13:57:03,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 84 treesize of output 1 [2024-11-13 13:57:03,768 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-13 13:57:03,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 1 [2024-11-13 13:57:03,781 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:57:03,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 68 [2024-11-13 13:57:03,787 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:57:03,803 INFO L349 Elim1Store]: treesize reduction 4, result has 73.3 percent of original size [2024-11-13 13:57:03,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 121 treesize of output 94 [2024-11-13 13:57:03,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 35 [2024-11-13 13:57:04,158 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:57:04,158 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 21 [2024-11-13 13:57:04,567 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 13:57:04,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [30648848] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:57:04,568 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 13:57:04,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 46 [2024-11-13 13:57:04,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703804032] [2024-11-13 13:57:04,568 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 13:57:04,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2024-11-13 13:57:04,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:57:04,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2024-11-13 13:57:04,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1845, Unknown=2, NotChecked=174, Total=2162 [2024-11-13 13:57:04,571 INFO L87 Difference]: Start difference. First operand 71 states and 74 transitions. Second operand has 47 states, 46 states have (on average 2.5) internal successors, (115), 47 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:57:06,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:57:06,866 INFO L93 Difference]: Finished difference Result 78 states and 83 transitions. [2024-11-13 13:57:06,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-13 13:57:06,867 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 2.5) internal successors, (115), 47 states have internal predecessors, (115), 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 [2024-11-13 13:57:06,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:57:06,868 INFO L225 Difference]: With dead ends: 78 [2024-11-13 13:57:06,868 INFO L226 Difference]: Without dead ends: 78 [2024-11-13 13:57:06,869 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 577 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=285, Invalid=3261, Unknown=2, NotChecked=234, Total=3782 [2024-11-13 13:57:06,870 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 88 mSDsluCounter, 630 mSDsCounter, 0 mSdLazyCounter, 1196 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 660 SdHoareTripleChecker+Invalid, 1330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 129 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-13 13:57:06,871 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 660 Invalid, 1330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1196 Invalid, 0 Unknown, 129 Unchecked, 1.1s Time] [2024-11-13 13:57:06,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-13 13:57:06,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 74. [2024-11-13 13:57:06,874 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) [2024-11-13 13:57:06,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2024-11-13 13:57:06,874 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 45 [2024-11-13 13:57:06,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:57:06,875 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2024-11-13 13:57:06,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 2.5) internal successors, (115), 47 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:57:06,875 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2024-11-13 13:57:06,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-13 13:57:06,876 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:57:06,876 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:57:06,897 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e7c5120-c554-4e57-b53b-fcd34b89e973/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-13 13:57:07,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e7c5120-c554-4e57-b53b-fcd34b89e973/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:57:07,077 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-13 13:57:07,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:57:07,078 INFO L85 PathProgramCache]: Analyzing trace with hash 600854905, now seen corresponding path program 1 times [2024-11-13 13:57:07,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:57:07,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133496827] [2024-11-13 13:57:07,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:57:07,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:57:07,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:57:09,150 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 13:57:09,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:57:09,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133496827] [2024-11-13 13:57:09,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133496827] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:57:09,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [589815859] [2024-11-13 13:57:09,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:57:09,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:57:09,151 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e7c5120-c554-4e57-b53b-fcd34b89e973/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:57:09,153 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e7c5120-c554-4e57-b53b-fcd34b89e973/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:57:09,154 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e7c5120-c554-4e57-b53b-fcd34b89e973/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-13 13:57:09,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:57:09,404 INFO L255 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 81 conjuncts are in the unsatisfiable core [2024-11-13 13:57:09,413 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:57:09,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-13 13:57:09,474 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-13 13:57:09,719 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-13 13:57:09,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-11-13 13:57:09,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-13 13:57:10,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-11-13 13:57:10,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-11-13 13:57:10,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:57:10,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 17 [2024-11-13 13:57:10,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:57:10,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 17 [2024-11-13 13:57:10,547 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:57:10,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 31 [2024-11-13 13:57:10,557 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:57:10,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 21 [2024-11-13 13:57:10,688 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:57:10,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 46 [2024-11-13 13:57:10,694 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:57:10,697 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:57:10,697 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 37 [2024-11-13 13:57:10,820 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-13 13:57:10,829 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-13 13:57:10,978 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 13:57:10,978 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:57:11,426 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#1.base| |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|)) (.cse1 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#1.offset| |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|) 4))) (and (forall ((v_ArrVal_1743 (Array Int Int))) (<= 0 (+ 4 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_prepend_#t~mem10#1.base| v_ArrVal_1743) .cse0) .cse1)))) (forall ((v_ArrVal_1744 (Array Int Int)) (v_ArrVal_1743 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_prepend_#t~mem10#1.base| v_ArrVal_1743) .cse0) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_prepend_#t~mem10#1.base| v_ArrVal_1744) .cse0) .cse1)))))) is different from false [2024-11-13 13:57:11,445 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_prepend_~head#1.base|))) (let ((.cse0 (select .cse3 |c_ULTIMATE.start_dll_prepend_~head#1.offset|)) (.cse1 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_prepend_~head#1.base| (store .cse3 |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|)) (.cse2 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#1.offset| |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|) 4))) (and (forall ((v_ArrVal_1744 (Array Int Int)) (v_ArrVal_1743 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_1743) .cse1) .cse2) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_1744) .cse1) .cse2)))) (forall ((v_ArrVal_1743 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_1743) .cse1) .cse2) 4)))))) is different from false [2024-11-13 13:57:11,509 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:57:11,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 53 [2024-11-13 13:57:11,522 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:57:11,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 108 treesize of output 107 [2024-11-13 13:57:11,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 25 [2024-11-13 13:57:11,572 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:57:11,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 101 treesize of output 102 [2024-11-13 13:57:11,584 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:57:11,584 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 92 [2024-11-13 13:57:11,588 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:57:11,600 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:57:11,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 69 [2024-11-13 13:57:11,605 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:57:11,616 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:57:11,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 32 [2024-11-13 13:57:12,281 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 62 [2024-11-13 13:57:12,298 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:57:12,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 76 [2024-11-13 13:57:12,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 59 [2024-11-13 13:57:12,327 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:57:12,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 65 [2024-11-13 13:57:12,998 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 13:57:12,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [589815859] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:57:12,998 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 13:57:12,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 18] total 51 [2024-11-13 13:57:12,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409015326] [2024-11-13 13:57:12,998 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 13:57:12,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-11-13 13:57:12,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:57:12,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-11-13 13:57:13,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=2306, Unknown=2, NotChecked=194, Total=2652 [2024-11-13 13:57:13,003 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand has 52 states, 51 states have (on average 2.450980392156863) internal successors, (125), 52 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:57:16,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:57:16,041 INFO L93 Difference]: Finished difference Result 80 states and 84 transitions. [2024-11-13 13:57:16,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-13 13:57:16,042 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 51 states have (on average 2.450980392156863) internal successors, (125), 52 states have internal predecessors, (125), 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 [2024-11-13 13:57:16,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:57:16,042 INFO L225 Difference]: With dead ends: 80 [2024-11-13 13:57:16,042 INFO L226 Difference]: Without dead ends: 80 [2024-11-13 13:57:16,047 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 68 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 677 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=322, Invalid=4240, Unknown=2, NotChecked=266, Total=4830 [2024-11-13 13:57:16,049 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 146 mSDsluCounter, 769 mSDsCounter, 0 mSdLazyCounter, 1419 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 801 SdHoareTripleChecker+Invalid, 1561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 135 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-13 13:57:16,049 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 801 Invalid, 1561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1419 Invalid, 0 Unknown, 135 Unchecked, 1.4s Time] [2024-11-13 13:57:16,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-13 13:57:16,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 76. [2024-11-13 13:57:16,051 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) [2024-11-13 13:57:16,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 81 transitions. [2024-11-13 13:57:16,052 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 81 transitions. Word has length 45 [2024-11-13 13:57:16,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:57:16,053 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 81 transitions. [2024-11-13 13:57:16,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 51 states have (on average 2.450980392156863) internal successors, (125), 52 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:57:16,054 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 81 transitions. [2024-11-13 13:57:16,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-13 13:57:16,054 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:57:16,054 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:57:16,068 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e7c5120-c554-4e57-b53b-fcd34b89e973/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-13 13:57:16,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e7c5120-c554-4e57-b53b-fcd34b89e973/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-11-13 13:57:16,255 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-13 13:57:16,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:57:16,255 INFO L85 PathProgramCache]: Analyzing trace with hash 1446621127, now seen corresponding path program 1 times [2024-11-13 13:57:16,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:57:16,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048208277] [2024-11-13 13:57:16,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:57:16,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:57:16,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:57:17,103 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 13:57:17,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:57:17,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048208277] [2024-11-13 13:57:17,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048208277] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:57:17,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:57:17,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-13 13:57:17,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713257812] [2024-11-13 13:57:17,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:57:17,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-13 13:57:17,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:57:17,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-13 13:57:17,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2024-11-13 13:57:17,105 INFO L87 Difference]: Start difference. First operand 76 states and 81 transitions. Second operand has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 15 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) [2024-11-13 13:57:17,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:57:17,553 INFO L93 Difference]: Finished difference Result 80 states and 83 transitions. [2024-11-13 13:57:17,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-13 13:57:17,553 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 15 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 [2024-11-13 13:57:17,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:57:17,554 INFO L225 Difference]: With dead ends: 80 [2024-11-13 13:57:17,554 INFO L226 Difference]: Without dead ends: 80 [2024-11-13 13:57:17,554 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2024-11-13 13:57:17,555 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 30 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-13 13:57:17,555 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 373 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 456 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-13 13:57:17,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-13 13:57:17,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 76. [2024-11-13 13:57:17,556 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) [2024-11-13 13:57:17,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 80 transitions. [2024-11-13 13:57:17,557 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 80 transitions. Word has length 46 [2024-11-13 13:57:17,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:57:17,557 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 80 transitions. [2024-11-13 13:57:17,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 15 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) [2024-11-13 13:57:17,558 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2024-11-13 13:57:17,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-13 13:57:17,558 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:57:17,558 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:57:17,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-13 13:57:17,559 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-13 13:57:17,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:57:17,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1356461967, now seen corresponding path program 1 times [2024-11-13 13:57:17,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:57:17,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021768891] [2024-11-13 13:57:17,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:57:17,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:57:17,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:57:18,605 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 13:57:18,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:57:18,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021768891] [2024-11-13 13:57:18,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021768891] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:57:18,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1248966451] [2024-11-13 13:57:18,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:57:18,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:57:18,606 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e7c5120-c554-4e57-b53b-fcd34b89e973/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:57:18,608 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e7c5120-c554-4e57-b53b-fcd34b89e973/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:57:18,610 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e7c5120-c554-4e57-b53b-fcd34b89e973/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-13 13:57:18,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:57:18,875 INFO L255 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 67 conjuncts are in the unsatisfiable core [2024-11-13 13:57:18,880 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:57:18,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-13 13:57:19,106 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-13 13:57:19,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-11-13 13:57:19,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-11-13 13:57:19,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:57:19,995 INFO L378 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 30 treesize of output 17 [2024-11-13 13:57:20,042 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:57:20,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 30 [2024-11-13 13:57:20,050 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:57:20,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2024-11-13 13:57:20,188 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:57:20,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 32 [2024-11-13 13:57:20,194 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:57:20,196 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:57:20,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 27 [2024-11-13 13:57:20,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 12 [2024-11-13 13:57:20,340 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 13:57:20,340 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:57:20,716 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2009 (Array Int Int))) (not (= (select (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_prepend_~head#1.base|))) (select (store |c_#memory_$Pointer$#2.base| (select .cse0 |c_ULTIMATE.start_dll_prepend_~head#1.offset|) v_ArrVal_2009) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_prepend_~head#1.base| (store .cse0 |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|))) (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#1.offset| |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|) 4)) 0))) is different from false [2024-11-13 13:57:20,924 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:57:20,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 52 [2024-11-13 13:57:20,935 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:57:20,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 107 treesize of output 106 [2024-11-13 13:57:20,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 50 [2024-11-13 13:57:21,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 56 [2024-11-13 13:57:21,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 52 [2024-11-13 13:57:21,559 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:57:21,559 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 64 [2024-11-13 13:57:21,576 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:57:21,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 61 [2024-11-13 13:57:22,197 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 13:57:22,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1248966451] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:57:22,197 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 13:57:22,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 21] total 51 [2024-11-13 13:57:22,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107514700] [2024-11-13 13:57:22,198 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 13:57:22,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2024-11-13 13:57:22,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:57:22,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2024-11-13 13:57:22,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=2278, Unknown=13, NotChecked=96, Total=2550 [2024-11-13 13:57:22,200 INFO L87 Difference]: Start difference. First operand 76 states and 80 transitions. Second operand has 51 states, 51 states have (on average 2.3529411764705883) internal successors, (120), 51 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:57:24,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:57:24,751 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2024-11-13 13:57:24,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-13 13:57:24,751 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 2.3529411764705883) internal successors, (120), 51 states have internal predecessors, (120), 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 [2024-11-13 13:57:24,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:57:24,752 INFO L225 Difference]: With dead ends: 76 [2024-11-13 13:57:24,752 INFO L226 Difference]: Without dead ends: 76 [2024-11-13 13:57:24,753 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 67 SyntacticMatches, 2 SemanticMatches, 70 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 765 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=376, Invalid=4585, Unknown=13, NotChecked=138, Total=5112 [2024-11-13 13:57:24,753 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 93 mSDsluCounter, 843 mSDsCounter, 0 mSdLazyCounter, 1295 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 874 SdHoareTripleChecker+Invalid, 1365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 62 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-13 13:57:24,754 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 874 Invalid, 1365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1295 Invalid, 0 Unknown, 62 Unchecked, 1.2s Time] [2024-11-13 13:57:24,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-13 13:57:24,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2024-11-13 13:57:24,756 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) [2024-11-13 13:57:24,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2024-11-13 13:57:24,756 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 48 [2024-11-13 13:57:24,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:57:24,757 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2024-11-13 13:57:24,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 2.3529411764705883) internal successors, (120), 51 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:57:24,757 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2024-11-13 13:57:24,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-13 13:57:24,758 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:57:24,758 INFO L215 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] [2024-11-13 13:57:24,775 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e7c5120-c554-4e57-b53b-fcd34b89e973/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-13 13:57:24,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e7c5120-c554-4e57-b53b-fcd34b89e973/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-11-13 13:57:24,958 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-11-13 13:57:24,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:57:24,959 INFO L85 PathProgramCache]: Analyzing trace with hash -938649664, now seen corresponding path program 2 times [2024-11-13 13:57:24,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:57:24,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584891459] [2024-11-13 13:57:24,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:57:24,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:57:25,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:57:27,485 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:57:27,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:57:27,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584891459] [2024-11-13 13:57:27,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584891459] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:57:27,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1406383204] [2024-11-13 13:57:27,485 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 13:57:27,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:57:27,485 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e7c5120-c554-4e57-b53b-fcd34b89e973/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:57:27,487 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e7c5120-c554-4e57-b53b-fcd34b89e973/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:57:27,497 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7e7c5120-c554-4e57-b53b-fcd34b89e973/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-13 13:57:27,832 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-13 13:57:27,832 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 13:57:27,835 INFO L255 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 101 conjuncts are in the unsatisfiable core [2024-11-13 13:57:27,840 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:57:27,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-13 13:57:27,974 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-13 13:57:27,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-13 13:57:28,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-13 13:57:28,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-13 13:57:28,155 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-13 13:57:28,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2024-11-13 13:57:28,370 INFO L349 Elim1Store]: treesize reduction 76, result has 36.1 percent of original size [2024-11-13 13:57:28,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 52 [2024-11-13 13:57:28,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 33 [2024-11-13 13:57:28,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 33 [2024-11-13 13:57:28,581 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 33 [2024-11-13 13:57:28,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-11-13 13:57:28,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 42 [2024-11-13 13:57:29,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:57:29,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 17 [2024-11-13 13:57:29,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:57:29,497 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:57:29,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:57:29,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 62 [2024-11-13 13:57:29,763 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:57:29,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 193 treesize of output 137 [2024-11-13 13:57:29,769 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:57:29,774 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:57:29,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 137 treesize of output 104 [2024-11-13 13:57:30,056 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:57:30,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2024-11-13 13:57:30,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-13 13:57:30,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 3 [2024-11-13 13:57:30,877 INFO L349 Elim1Store]: treesize reduction 42, result has 6.7 percent of original size [2024-11-13 13:57:30,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 77 treesize of output 38 [2024-11-13 13:57:31,206 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:57:31,206 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:57:31,720 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2199 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#1.base| |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|)) (.cse2 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#1.offset| |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|) 4))) (select (let ((.cse0 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_prepend_#t~mem10#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_prepend_#t~mem10#1.base|) (+ |c_ULTIMATE.start_dll_prepend_#t~mem10#1.offset| 8) |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|)))) (select .cse0 (select (select .cse0 .cse1) .cse2))) (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_prepend_#t~mem10#1.base| v_ArrVal_2199) .cse1) .cse2) 4)))) 1)) is different from false [2024-11-13 13:57:31,731 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2199 (Array Int Int))) (= (select |c_#valid| (let ((.cse4 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base|)) (.cse5 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_prepend_~head#1.base|))) (let ((.cse3 (select .cse5 |c_ULTIMATE.start_dll_prepend_~head#1.offset|)) (.cse1 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_prepend_~head#1.base| (store .cse5 |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|)) (.cse2 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base| (store .cse4 |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|) 4))) (select (let ((.cse0 (store |c_#memory_$Pointer$#2.base| .cse3 (store (select |c_#memory_$Pointer$#2.base| .cse3) (+ (select .cse4 |c_ULTIMATE.start_dll_prepend_~head#1.offset|) 8) |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|)))) (select .cse0 (select (select .cse0 .cse1) .cse2))) (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse3 v_ArrVal_2199) .cse1) .cse2) 4))))) 1)) is different from false [2024-11-13 13:57:31,763 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:57:31,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 172 treesize of output 173 [2024-11-13 13:57:31,779 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:57:31,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 348 treesize of output 347 [2024-11-13 13:57:31,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 161 treesize of output 145 [2024-11-13 13:58:14,080 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:58:14,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 267 treesize of output 207 [2024-11-13 13:58:14,120 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:58:14,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 133 treesize of output 110 [2024-11-13 13:58:14,152 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:58:14,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 137 treesize of output 114 [2024-11-13 13:58:14,180 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:58:14,180 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 133 treesize of output 110 [2024-11-13 13:58:14,216 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:58:14,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 133 treesize of output 110 [2024-11-13 13:58:14,247 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:58:14,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 267 treesize of output 207 [2024-11-13 13:58:14,286 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:58:14,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 271 treesize of output 211 [2024-11-13 13:58:23,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1014 treesize of output 892 [2024-11-13 13:58:23,776 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:58:23,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1671 treesize of output 1485 [2024-11-13 13:58:23,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1248 treesize of output 1144 [2024-11-13 13:58:23,886 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:58:23,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2130 treesize of output 1970 [2024-11-13 13:58:27,403 INFO L349 Elim1Store]: treesize reduction 66, result has 33.3 percent of original size [2024-11-13 13:58:27,403 INFO L378 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 4 new quantified variables, introduced 7 case distinctions, treesize of input 99 treesize of output 105 [2024-11-13 13:58:28,386 INFO L349 Elim1Store]: treesize reduction 50, result has 33.3 percent of original size [2024-11-13 13:58:28,387 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 73 treesize of output 80 [2024-11-13 13:58:28,489 INFO L349 Elim1Store]: treesize reduction 20, result has 31.0 percent of original size [2024-11-13 13:58:28,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 25 [2024-11-13 13:58:32,631 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse15 (< |c_ULTIMATE.start_main_~#s~0#1.offset| 0)) (.cse16 (not (= (select |c_#valid| |c_ULTIMATE.start_dll_create_#res#1.base|) 0))) (.cse13 (store |c_#valid| |c_ULTIMATE.start_dll_create_#res#1.base| 1)) (.cse4 (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 8)) (.cse5 (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4)) (.cse6 (< |c_ULTIMATE.start_main_~#s~0#1.offset| 1))) (and (or (forall ((v_arrayElimArr_10 (Array Int Int)) (v_prenex_12 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int) (v_prenex_11 Int) (v_prenex_13 Int)) (let ((.cse0 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse1 (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_10))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_dll_create_#res#1.base|))) (select (store .cse2 |c_ULTIMATE.start_dll_create_#res#1.base| (store .cse3 .cse4 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|)) (select .cse3 .cse5)))))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (= (select .cse0 (select .cse1 (+ v_prenex_12 4))) 1) (= |c_ULTIMATE.start_dll_create_#res#1.offset| v_prenex_13) (= (select .cse0 (select .cse1 (+ v_prenex_11 4))) 1) (not (= (select v_arrayElimArr_10 (+ v_prenex_13 4)) |c_ULTIMATE.start_dll_create_#res#1.base|))))) .cse6) (or (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int) (v_arrayElimArr_16 (Array Int Int)) (v_prenex_10 Int) (v_prenex_9 Int)) (let ((.cse8 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_16))) (let ((.cse12 (select .cse8 |c_ULTIMATE.start_dll_create_#res#1.base|))) (let ((.cse9 (store .cse8 |c_ULTIMATE.start_dll_create_#res#1.base| (store .cse12 .cse4 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))) (.cse10 (+ v_prenex_10 4)) (.cse7 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse11 (select .cse12 .cse5))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (= (select .cse7 (select (select .cse8 (select (select .cse9 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) .cse10)) .cse5)) 1) (= (select .cse7 (select (select .cse9 .cse11) (+ v_prenex_9 4))) 1) (not (= (select v_arrayElimArr_16 .cse10) |c_ULTIMATE.start_dll_create_#res#1.base|)) (= 1 (select .cse7 (select (select .cse8 .cse11) .cse5)))))))) .cse6) (or (forall ((v_prenex_4 Int) (v_arrayElimArr_17 (Array Int Int))) (let ((.cse14 (+ v_prenex_4 4))) (or (= (select .cse13 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_#res#1.base| v_arrayElimArr_17) (select v_arrayElimArr_17 .cse5)) .cse14)) 1) (= (select .cse13 (select v_arrayElimArr_17 .cse14)) 1) (not (= (select v_arrayElimArr_17 .cse4) |c_ULTIMATE.start_dll_create_#res#1.base|))))) .cse15 .cse16) (or (and (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimArr_16 (Array Int Int)) (v_prenex_10 Int) (v_prenex_9 Int)) (let ((.cse20 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_16)) (.cse21 (+ v_prenex_10 4))) (let ((.cse18 (let ((.cse22 (select v_arrayElimArr_16 .cse21))) (store .cse20 .cse22 (store (select .cse20 .cse22) .cse4 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))))) (let ((.cse19 (select (select .cse18 |c_ULTIMATE.start_dll_create_#res#1.base|) .cse5)) (.cse17 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1))) (or (= (select .cse17 (select (select .cse18 .cse19) (+ v_prenex_9 4))) 1) (= (select .cse17 (select (select .cse20 .cse19) .cse5)) 1) (= (select .cse17 (select (select .cse20 (select (select .cse18 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) .cse21)) .cse5)) 1)))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_prenex_7 Int) (v_arrayElimArr_13 (Array Int Int)) (v_prenex_8 Int)) (let ((.cse25 (select v_arrayElimArr_13 (+ v_prenex_8 4)))) (or (= (select (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1) (select (let ((.cse23 (let ((.cse24 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_13))) (store .cse24 .cse25 (store (select .cse24 .cse25) .cse4 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))))) (select .cse23 (select (select .cse23 |c_ULTIMATE.start_dll_create_#res#1.base|) .cse5))) (+ v_prenex_7 4))) 1) (= |c_ULTIMATE.start_dll_create_#res#1.offset| v_prenex_8) (= .cse25 |c_ULTIMATE.start_dll_create_#res#1.base|)))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_prenex_7 Int) (v_arrayElimArr_13 (Array Int Int)) (v_prenex_8 Int)) (let ((.cse29 (+ v_prenex_8 4))) (let ((.cse30 (select v_arrayElimArr_13 .cse29))) (let ((.cse26 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse27 (let ((.cse31 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_13))) (store .cse31 .cse30 (store (select .cse31 .cse30) .cse4 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|)))) (.cse28 (+ v_prenex_7 4))) (or (= (select .cse26 (select (select .cse27 (select (select .cse27 |c_ULTIMATE.start_dll_create_#res#1.base|) .cse5)) .cse28)) 1) (= (select .cse26 (select (select .cse27 (select (select .cse27 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) .cse29)) .cse28)) 1) (= |c_ULTIMATE.start_dll_create_#res#1.offset| v_prenex_8) (= .cse30 |c_ULTIMATE.start_dll_create_#res#1.base|)))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_prenex_6 Int) (v_arrayElimArr_12 (Array Int Int))) (or (= (select v_arrayElimArr_12 (+ v_prenex_6 4)) |c_ULTIMATE.start_dll_create_#res#1.base|) (= (select (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1) (select (let ((.cse32 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_12))) (select .cse32 (select (select .cse32 |c_ULTIMATE.start_dll_create_#res#1.base|) .cse5))) .cse5)) 1))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimArr_16 (Array Int Int)) (v_prenex_10 Int) (v_prenex_9 Int)) (let ((.cse38 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_16)) (.cse39 (+ v_prenex_10 4))) (let ((.cse34 (let ((.cse40 (select v_arrayElimArr_16 .cse39))) (store .cse38 .cse40 (store (select .cse38 .cse40) .cse4 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))))) (let ((.cse36 (+ v_prenex_9 4)) (.cse35 (select (select .cse34 |c_ULTIMATE.start_dll_create_#res#1.base|) .cse5)) (.cse33 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse37 (select (select .cse34 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) .cse39))) (or (= (select .cse33 (select (select .cse34 .cse35) .cse36)) 1) (= (select .cse33 (select (select .cse34 .cse37) .cse36)) 1) (= (select .cse33 (select (select .cse38 .cse35) .cse5)) 1) (= (select .cse33 (select (select .cse38 .cse37) .cse5)) 1)))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimArr_11 (Array Int Int)) (v_prenex_4 Int)) (let ((.cse46 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_11))) (let ((.cse45 (select .cse46 |c_ULTIMATE.start_dll_create_#res#1.base|))) (let ((.cse42 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse43 (store .cse46 |c_ULTIMATE.start_dll_create_#res#1.base| (store .cse45 .cse4 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))) (.cse44 (+ v_prenex_4 4))) (or (forall ((v_prenex_5 Int)) (let ((.cse41 (+ v_prenex_5 4))) (or (not (= (select v_arrayElimArr_11 .cse41) |c_ULTIMATE.start_dll_create_#res#1.base|)) (= (select .cse42 (select (select .cse43 (select (select .cse43 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) .cse41)) .cse44)) 1)))) (= (select .cse42 (select (select .cse43 (select .cse45 .cse5)) .cse44)) 1)))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_prenex_6 Int) (v_arrayElimArr_12 (Array Int Int))) (let ((.cse49 (select v_arrayElimArr_12 (+ v_prenex_6 4))) (.cse47 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse48 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_12))) (or (= (select .cse47 (select (select .cse48 .cse49) .cse5)) 1) (= .cse49 |c_ULTIMATE.start_dll_create_#res#1.base|) (= (select .cse47 (select (select .cse48 (select (select .cse48 |c_ULTIMATE.start_dll_create_#res#1.base|) .cse5)) .cse5)) 1)))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimArr_16 (Array Int Int)) (v_prenex_10 Int) (v_prenex_9 Int)) (let ((.cse55 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_16)) (.cse54 (+ v_prenex_10 4))) (let ((.cse51 (let ((.cse56 (select v_arrayElimArr_16 .cse54))) (store .cse55 .cse56 (store (select .cse55 .cse56) .cse4 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))))) (let ((.cse53 (+ v_prenex_9 4)) (.cse50 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse52 (select (select .cse51 |c_ULTIMATE.start_dll_create_#res#1.base|) .cse5))) (or (= (select .cse50 (select (select .cse51 .cse52) .cse53)) 1) (= (select .cse50 (select (select .cse51 (select (select .cse51 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) .cse54)) .cse53)) 1) (= (select .cse50 (select (select .cse55 .cse52) .cse5)) 1)))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimArr_10 (Array Int Int)) (v_prenex_12 Int) (v_prenex_11 Int) (v_prenex_13 Int)) (let ((.cse57 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse58 (let ((.cse59 (let ((.cse60 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_10)) (.cse61 (select v_arrayElimArr_10 (+ v_prenex_13 4)))) (store .cse60 .cse61 (store (select .cse60 .cse61) .cse4 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))))) (select .cse59 (select (select .cse59 |c_ULTIMATE.start_dll_create_#res#1.base|) .cse5))))) (or (= (select .cse57 (select .cse58 (+ v_prenex_11 4))) 1) (= |c_ULTIMATE.start_dll_create_#res#1.offset| v_prenex_13) (= (select .cse57 (select .cse58 (+ v_prenex_12 4))) 1)))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (forall ((v_arrayElimArr_15 (Array Int Int)) (v_prenex_2 Int) (v_prenex_3 Int) (v_arrayElimCell_102 Int)) (let ((.cse62 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse63 (let ((.cse64 (let ((.cse65 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_15)) (.cse66 (select v_arrayElimArr_15 (+ v_prenex_3 4)))) (store .cse65 .cse66 (store (select .cse65 .cse66) .cse4 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))))) (select .cse64 (select (select .cse64 |c_ULTIMATE.start_dll_create_#res#1.base|) .cse5))))) (or (= (select .cse62 (select .cse63 (+ v_prenex_2 4))) 1) (= (select .cse62 (select .cse63 (+ v_arrayElimCell_102 4))) 1)))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (= |v_ULTIMATE.start_node_create_~temp~0#1.base_31| |c_ULTIMATE.start_dll_create_#res#1.base|))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimArr_11 (Array Int Int)) (v_prenex_4 Int) (v_prenex_5 Int)) (or (not (= (select v_arrayElimArr_11 (+ v_prenex_5 4)) |c_ULTIMATE.start_dll_create_#res#1.base|)) (= (select (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1) (select (let ((.cse67 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_11))) (let ((.cse68 (select .cse67 |c_ULTIMATE.start_dll_create_#res#1.base|))) (select (store .cse67 |c_ULTIMATE.start_dll_create_#res#1.base| (store .cse68 .cse4 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|)) (select .cse68 .cse5)))) (+ v_prenex_4 4))) 1))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimArr_16 (Array Int Int)) (v_prenex_10 Int) (v_prenex_9 Int)) (let ((.cse72 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_16))) (let ((.cse70 (let ((.cse73 (select v_arrayElimArr_16 (+ v_prenex_10 4)))) (store .cse72 .cse73 (store (select .cse72 .cse73) .cse4 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))))) (let ((.cse69 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse71 (select (select .cse70 |c_ULTIMATE.start_dll_create_#res#1.base|) .cse5))) (or (= (select .cse69 (select (select .cse70 .cse71) (+ v_prenex_9 4))) 1) (= (select .cse69 (select (select .cse72 .cse71) .cse5)) 1)))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (= |v_ULTIMATE.start_node_create_~temp~0#1.base_31| |c_ULTIMATE.start_dll_create_#res#1.base|) (forall ((v_arrayElimArr_14 (Array Int Int)) (v_arrayElimCell_101 Int) (|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (let ((.cse76 (select v_arrayElimArr_14 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4)))) (or (= (select (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1) (select (let ((.cse74 (let ((.cse75 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_14))) (store .cse75 .cse76 (store (select .cse75 .cse76) .cse4 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))))) (select .cse74 (select (select .cse74 |c_ULTIMATE.start_dll_create_#res#1.base|) .cse5))) (+ v_arrayElimCell_101 4))) 1) (= .cse76 |c_ULTIMATE.start_dll_create_#res#1.base|))))))) .cse6) (or (and (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimArr_16 (Array Int Int)) (v_prenex_10 Int)) (let ((.cse78 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_16))) (let ((.cse83 (select .cse78 |c_ULTIMATE.start_dll_create_#res#1.base|))) (let ((.cse81 (store .cse78 |c_ULTIMATE.start_dll_create_#res#1.base| (store .cse83 .cse4 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))) (.cse80 (+ v_prenex_10 4))) (let ((.cse79 (select (select .cse81 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) .cse80)) (.cse77 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1))) (or (= (select .cse77 (select (select .cse78 .cse79) .cse5)) 1) (not (= (select v_arrayElimArr_16 .cse80) |c_ULTIMATE.start_dll_create_#res#1.base|)) (forall ((v_prenex_9 Int)) (let ((.cse82 (+ v_prenex_9 4))) (or (= (select .cse77 (select (select .cse81 .cse79) .cse82)) 1) (= (select .cse77 (select (select .cse81 (select .cse83 .cse5)) .cse82)) 1)))))))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimArr_16 (Array Int Int)) (v_prenex_10 Int) (v_prenex_9 Int)) (let ((.cse85 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_16))) (let ((.cse87 (store .cse85 |c_ULTIMATE.start_dll_create_#res#1.base| (store (select .cse85 |c_ULTIMATE.start_dll_create_#res#1.base|) .cse4 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))) (.cse88 (+ v_prenex_10 4))) (let ((.cse84 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse86 (select (select .cse87 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) .cse88))) (or (= (select .cse84 (select (select .cse85 .cse86) .cse5)) 1) (= (select .cse84 (select (select .cse87 .cse86) (+ v_prenex_9 4))) 1) (not (= (select v_arrayElimArr_16 .cse88) |c_ULTIMATE.start_dll_create_#res#1.base|)))))))))) .cse15) (or .cse15 (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int) (v_arrayElimArr_16 (Array Int Int)) (v_prenex_10 Int) (v_prenex_9 Int)) (let ((.cse90 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_16))) (let ((.cse94 (select .cse90 |c_ULTIMATE.start_dll_create_#res#1.base|))) (let ((.cse92 (store .cse90 |c_ULTIMATE.start_dll_create_#res#1.base| (store .cse94 .cse4 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))) (.cse93 (+ v_prenex_10 4))) (let ((.cse91 (select (select .cse92 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) .cse93)) (.cse89 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (= (select .cse89 (select (select .cse90 .cse91) .cse5)) 1) (= (select .cse89 (select (select .cse92 .cse91) (+ v_prenex_9 4))) 1) (not (= (select v_arrayElimArr_16 .cse93) |c_ULTIMATE.start_dll_create_#res#1.base|)) (= 1 (select .cse89 (select (select .cse90 (select .cse94 .cse5)) .cse5)))))))))) (or .cse15 (and (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (forall ((v_arrayElimArr_12 (Array Int Int))) (let ((.cse96 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse97 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_12))) (or (forall ((v_prenex_6 Int)) (let ((.cse95 (select v_arrayElimArr_12 (+ v_prenex_6 4)))) (or (not (= .cse95 |c_ULTIMATE.start_dll_create_#res#1.base|)) (= (select .cse96 (select (select .cse97 .cse95) .cse5)) 1)))) (= (select .cse96 (select (select .cse97 (select (select .cse97 |c_ULTIMATE.start_dll_create_#res#1.base|) .cse5)) .cse5)) 1)))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (= |v_ULTIMATE.start_node_create_~temp~0#1.base_31| |c_ULTIMATE.start_dll_create_#res#1.base|))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_prenex_6 Int) (v_arrayElimArr_12 (Array Int Int))) (let ((.cse98 (select v_arrayElimArr_12 (+ v_prenex_6 4)))) (or (not (= .cse98 |c_ULTIMATE.start_dll_create_#res#1.base|)) (= (select (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1) (select (select (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_12) .cse98) .cse5)) 1)))) (= |v_ULTIMATE.start_node_create_~temp~0#1.base_31| |c_ULTIMATE.start_dll_create_#res#1.base|))))) (or (forall ((v_arrayElimArr_15 (Array Int Int)) (v_prenex_2 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int) (v_prenex_3 Int) (v_arrayElimCell_102 Int)) (let ((.cse99 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse100 (let ((.cse101 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_15))) (let ((.cse102 (select .cse101 |c_ULTIMATE.start_dll_create_#res#1.base|))) (select (store .cse101 |c_ULTIMATE.start_dll_create_#res#1.base| (store .cse102 .cse4 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|)) (select .cse102 .cse5)))))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (= (select .cse99 (select .cse100 (+ v_prenex_2 4))) 1) (not (= (select v_arrayElimArr_15 (+ v_prenex_3 4)) |c_ULTIMATE.start_dll_create_#res#1.base|)) (= (select .cse99 (select .cse100 (+ v_arrayElimCell_102 4))) 1) (= |v_ULTIMATE.start_node_create_~temp~0#1.base_31| |c_ULTIMATE.start_dll_create_#res#1.base|)))) .cse6) (or (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int) (v_arrayElimArr_16 (Array Int Int)) (v_prenex_10 Int) (v_prenex_9 Int)) (let ((.cse104 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_16))) (let ((.cse110 (select .cse104 |c_ULTIMATE.start_dll_create_#res#1.base|))) (let ((.cse106 (store .cse104 |c_ULTIMATE.start_dll_create_#res#1.base| (store .cse110 .cse4 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))) (.cse109 (+ v_prenex_10 4))) (let ((.cse105 (select (select .cse106 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) .cse109)) (.cse107 (+ v_prenex_9 4)) (.cse103 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse108 (select .cse110 .cse5))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (= (select .cse103 (select (select .cse104 .cse105) .cse5)) 1) (= (select .cse103 (select (select .cse106 .cse105) .cse107)) 1) (= (select .cse103 (select (select .cse106 .cse108) .cse107)) 1) (not (= (select v_arrayElimArr_16 .cse109) |c_ULTIMATE.start_dll_create_#res#1.base|)) (= 1 (select .cse103 (select (select .cse104 .cse108) .cse5))))))))) .cse15) (or (and (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimArr_16 (Array Int Int))) (let ((.cse116 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_16))) (let ((.cse117 (select .cse116 |c_ULTIMATE.start_dll_create_#res#1.base|))) (let ((.cse112 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse115 (select .cse117 .cse5))) (or (forall ((v_prenex_10 Int)) (let ((.cse111 (+ v_prenex_10 4))) (or (not (= (select v_arrayElimArr_16 .cse111) |c_ULTIMATE.start_dll_create_#res#1.base|)) (forall ((v_prenex_9 Int)) (let ((.cse113 (store .cse116 |c_ULTIMATE.start_dll_create_#res#1.base| (store .cse117 .cse4 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))) (.cse114 (+ v_prenex_9 4))) (or (= (select .cse112 (select (select .cse113 (select (select .cse113 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) .cse111)) .cse114)) 1) (= (select .cse112 (select (select .cse113 .cse115) .cse114)) 1))))))) (= 1 (select .cse112 (select (select .cse116 .cse115) .cse5)))))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimArr_16 (Array Int Int))) (let ((.cse119 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_16))) (let ((.cse121 (select .cse119 |c_ULTIMATE.start_dll_create_#res#1.base|))) (let ((.cse118 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse120 (select .cse121 .cse5))) (or (= 1 (select .cse118 (select (select .cse119 .cse120) .cse5))) (forall ((v_prenex_10 Int)) (not (= (select v_arrayElimArr_16 (+ v_prenex_10 4)) |c_ULTIMATE.start_dll_create_#res#1.base|))) (forall ((v_prenex_9 Int)) (= (select .cse118 (select (select (store .cse119 |c_ULTIMATE.start_dll_create_#res#1.base| (store .cse121 .cse4 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|)) .cse120) (+ v_prenex_9 4))) 1)))))))))) .cse6) (or (forall ((v_arrayElimArr_11 (Array Int Int)) (v_prenex_4 Int) (v_prenex_5 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (let ((.cse127 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_11))) (let ((.cse125 (select .cse127 |c_ULTIMATE.start_dll_create_#res#1.base|))) (let ((.cse123 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse124 (store .cse127 |c_ULTIMATE.start_dll_create_#res#1.base| (store .cse125 .cse4 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))) (.cse122 (+ v_prenex_5 4)) (.cse126 (+ v_prenex_4 4))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (not (= (select v_arrayElimArr_11 .cse122) |c_ULTIMATE.start_dll_create_#res#1.base|)) (= (select .cse123 (select (select .cse124 (select .cse125 .cse5)) .cse126)) 1) (= (select .cse123 (select (select .cse124 (select (select .cse124 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) .cse122)) .cse126)) 1)))))) .cse6) (or .cse15 .cse16 (and (forall ((v_arrayElimArr_18 (Array Int Int))) (or (forall ((v_prenex_5 Int)) (let ((.cse128 (select v_arrayElimArr_18 (+ v_prenex_5 4)))) (or (= .cse5 v_prenex_5) (not (= .cse128 |c_ULTIMATE.start_dll_create_#res#1.base|)) (forall ((v_prenex_4 Int)) (= (select .cse13 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_#res#1.base| v_arrayElimArr_18) .cse128) (+ v_prenex_4 4))) 1))))) (not (= (select v_arrayElimArr_18 .cse4) |c_ULTIMATE.start_dll_create_#res#1.base|)))) (forall ((v_arrayElimCell_114 Int)) (= 1 (select .cse13 v_arrayElimCell_114))))) (or (and (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimArr_16 (Array Int Int)) (v_arrayElimCell_108 Int)) (let ((.cse134 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_16))) (let ((.cse135 (store (select .cse134 |c_ULTIMATE.start_dll_create_#res#1.base|) (+ v_arrayElimCell_108 8) |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))) (let ((.cse129 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse133 (select .cse135 .cse5))) (or (forall ((v_prenex_10 Int)) (let ((.cse131 (+ v_prenex_10 4))) (or (forall ((v_prenex_9 Int)) (let ((.cse130 (store .cse134 |c_ULTIMATE.start_dll_create_#res#1.base| .cse135)) (.cse132 (+ v_prenex_9 4))) (or (= (select .cse129 (select (select .cse130 (select (select .cse130 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) .cse131)) .cse132)) 1) (= (select .cse129 (select (select .cse130 .cse133) .cse132)) 1)))) (not (= (select v_arrayElimArr_16 .cse131) |c_ULTIMATE.start_dll_create_#res#1.base|))))) (= (select .cse129 (select (select .cse134 .cse133) (+ v_arrayElimCell_108 4))) 1)))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimArr_16 (Array Int Int)) (v_prenex_10 Int) (v_arrayElimCell_108 Int) (v_prenex_9 Int)) (let ((.cse137 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_16))) (let ((.cse142 (store (select .cse137 |c_ULTIMATE.start_dll_create_#res#1.base|) (+ v_arrayElimCell_108 8) |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))) (let ((.cse139 (+ v_prenex_10 4)) (.cse140 (+ v_arrayElimCell_108 4)) (.cse136 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse138 (store .cse137 |c_ULTIMATE.start_dll_create_#res#1.base| .cse142)) (.cse141 (select .cse142 .cse5))) (or (= (select .cse136 (select (select .cse137 (select (select .cse138 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) .cse139)) .cse140)) 1) (not (= (select v_arrayElimArr_16 .cse139) |c_ULTIMATE.start_dll_create_#res#1.base|)) (= (select .cse136 (select (select .cse137 .cse141) .cse140)) 1) (= (select .cse136 (select (select .cse138 .cse141) (+ v_prenex_9 4))) 1)))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (= |v_ULTIMATE.start_node_create_~temp~0#1.base_31| |c_ULTIMATE.start_dll_create_#res#1.base|) (forall ((v_arrayElimArr_15 (Array Int Int)) (v_prenex_2 Int) (v_prenex_3 Int) (v_arrayElimCell_102 Int) (v_arrayElimCell_108 Int)) (let ((.cse143 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse144 (let ((.cse145 (let ((.cse146 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_15)) (.cse147 (select v_arrayElimArr_15 (+ v_prenex_3 4)))) (store .cse146 .cse147 (store (select .cse146 .cse147) (+ v_arrayElimCell_108 8) |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))))) (select .cse145 (select (select .cse145 |c_ULTIMATE.start_dll_create_#res#1.base|) .cse5))))) (or (= (select .cse143 (select .cse144 (+ v_arrayElimCell_102 4))) 1) (= (select .cse143 (select .cse144 (+ v_prenex_2 4))) 1)))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_prenex_6 Int) (v_arrayElimArr_12 (Array Int Int)) (v_arrayElimCell_108 Int)) (or (= (select v_arrayElimArr_12 (+ v_prenex_6 4)) |c_ULTIMATE.start_dll_create_#res#1.base|) (= (select (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1) (select (let ((.cse148 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_12))) (select .cse148 (select (select .cse148 |c_ULTIMATE.start_dll_create_#res#1.base|) .cse5))) (+ v_arrayElimCell_108 4))) 1))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimArr_11 (Array Int Int)) (v_prenex_4 Int) (v_arrayElimCell_108 Int)) (let ((.cse154 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_11))) (let ((.cse151 (store (select .cse154 |c_ULTIMATE.start_dll_create_#res#1.base|) (+ v_arrayElimCell_108 8) |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))) (let ((.cse149 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse150 (store .cse154 |c_ULTIMATE.start_dll_create_#res#1.base| .cse151)) (.cse152 (+ v_prenex_4 4))) (or (= (select .cse149 (select (select .cse150 (select .cse151 .cse5)) .cse152)) 1) (forall ((v_prenex_5 Int)) (let ((.cse153 (+ v_prenex_5 4))) (or (not (= (select v_arrayElimArr_11 .cse153) |c_ULTIMATE.start_dll_create_#res#1.base|)) (= (select .cse149 (select (select .cse150 (select (select .cse150 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) .cse153)) .cse152)) 1))))))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_prenex_7 Int) (v_arrayElimArr_13 (Array Int Int)) (v_arrayElimCell_108 Int) (v_prenex_8 Int)) (let ((.cse157 (select v_arrayElimArr_13 (+ v_prenex_8 4)))) (or (= (select (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1) (select (let ((.cse155 (let ((.cse156 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_13))) (store .cse156 .cse157 (store (select .cse156 .cse157) (+ v_arrayElimCell_108 8) |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))))) (select .cse155 (select (select .cse155 |c_ULTIMATE.start_dll_create_#res#1.base|) .cse5))) (+ v_prenex_7 4))) 1) (= |c_ULTIMATE.start_dll_create_#res#1.offset| v_prenex_8) (= .cse157 |c_ULTIMATE.start_dll_create_#res#1.base|)))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_prenex_7 Int) (v_arrayElimArr_13 (Array Int Int)) (v_arrayElimCell_108 Int) (v_prenex_8 Int)) (let ((.cse161 (+ v_prenex_8 4))) (let ((.cse162 (select v_arrayElimArr_13 .cse161))) (let ((.cse158 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse159 (let ((.cse163 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_13))) (store .cse163 .cse162 (store (select .cse163 .cse162) (+ v_arrayElimCell_108 8) |v_ULTIMATE.start_node_create_~temp~0#1.base_31|)))) (.cse160 (+ v_prenex_7 4))) (or (= (select .cse158 (select (select .cse159 (select (select .cse159 |c_ULTIMATE.start_dll_create_#res#1.base|) .cse5)) .cse160)) 1) (= (select .cse158 (select (select .cse159 (select (select .cse159 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) .cse161)) .cse160)) 1) (= |c_ULTIMATE.start_dll_create_#res#1.offset| v_prenex_8) (= .cse162 |c_ULTIMATE.start_dll_create_#res#1.base|)))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimArr_16 (Array Int Int)) (v_arrayElimCell_108 Int)) (let ((.cse165 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_16))) (let ((.cse167 (store (select .cse165 |c_ULTIMATE.start_dll_create_#res#1.base|) (+ v_arrayElimCell_108 8) |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))) (let ((.cse164 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse166 (select .cse167 .cse5))) (or (= (select .cse164 (select (select .cse165 .cse166) (+ v_arrayElimCell_108 4))) 1) (forall ((v_prenex_10 Int)) (not (= (select v_arrayElimArr_16 (+ v_prenex_10 4)) |c_ULTIMATE.start_dll_create_#res#1.base|))) (forall ((v_prenex_9 Int)) (= (select .cse164 (select (select (store .cse165 |c_ULTIMATE.start_dll_create_#res#1.base| .cse167) .cse166) (+ v_prenex_9 4))) 1))))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimArr_10 (Array Int Int)) (v_prenex_12 Int) (v_prenex_11 Int) (v_prenex_13 Int) (v_arrayElimCell_108 Int)) (let ((.cse168 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse169 (let ((.cse170 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_10))) (let ((.cse171 (store (select .cse170 |c_ULTIMATE.start_dll_create_#res#1.base|) (+ v_arrayElimCell_108 8) |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))) (select (store .cse170 |c_ULTIMATE.start_dll_create_#res#1.base| .cse171) (select .cse171 .cse5)))))) (or (= (select .cse168 (select .cse169 (+ v_prenex_12 4))) 1) (= (select .cse168 (select .cse169 (+ v_prenex_11 4))) 1) (= |c_ULTIMATE.start_dll_create_#res#1.offset| v_prenex_13) (not (= (select v_arrayElimArr_10 (+ v_prenex_13 4)) |c_ULTIMATE.start_dll_create_#res#1.base|))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_prenex_6 Int) (v_arrayElimArr_12 (Array Int Int)) (v_arrayElimCell_108 Int)) (let ((.cse172 (select v_arrayElimArr_12 (+ v_prenex_6 4))) (.cse173 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse174 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_12)) (.cse175 (+ v_arrayElimCell_108 4))) (or (= .cse172 |c_ULTIMATE.start_dll_create_#res#1.base|) (= (select .cse173 (select (select .cse174 .cse172) .cse175)) 1) (= (select .cse173 (select (select .cse174 (select (select .cse174 |c_ULTIMATE.start_dll_create_#res#1.base|) .cse5)) .cse175)) 1)))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (= |v_ULTIMATE.start_node_create_~temp~0#1.base_31| |c_ULTIMATE.start_dll_create_#res#1.base|) (forall ((v_arrayElimArr_14 (Array Int Int)) (v_arrayElimCell_101 Int) (v_arrayElimCell_108 Int) (|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (let ((.cse178 (select v_arrayElimArr_14 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4)))) (or (= (select (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1) (select (let ((.cse176 (let ((.cse177 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_14))) (store .cse177 .cse178 (store (select .cse177 .cse178) (+ v_arrayElimCell_108 8) |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))))) (select .cse176 (select (select .cse176 |c_ULTIMATE.start_dll_create_#res#1.base|) .cse5))) (+ v_arrayElimCell_101 4))) 1) (= .cse178 |c_ULTIMATE.start_dll_create_#res#1.base|)))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimArr_11 (Array Int Int)) (v_prenex_4 Int) (v_prenex_5 Int) (v_arrayElimCell_108 Int)) (or (= (select (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1) (select (let ((.cse179 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_11))) (let ((.cse180 (store (select .cse179 |c_ULTIMATE.start_dll_create_#res#1.base|) (+ v_arrayElimCell_108 8) |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))) (select (store .cse179 |c_ULTIMATE.start_dll_create_#res#1.base| .cse180) (select .cse180 .cse5)))) (+ v_prenex_4 4))) 1) (not (= (select v_arrayElimArr_11 (+ v_prenex_5 4)) |c_ULTIMATE.start_dll_create_#res#1.base|)))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimArr_16 (Array Int Int)) (v_arrayElimCell_108 Int)) (let ((.cse182 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_16))) (let ((.cse189 (store (select .cse182 |c_ULTIMATE.start_dll_create_#res#1.base|) (+ v_arrayElimCell_108 8) |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))) (let ((.cse181 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse187 (select .cse189 .cse5)) (.cse184 (+ v_arrayElimCell_108 4))) (or (forall ((v_prenex_10 Int)) (let ((.cse185 (store .cse182 |c_ULTIMATE.start_dll_create_#res#1.base| .cse189)) (.cse188 (+ v_prenex_10 4))) (let ((.cse183 (select (select .cse185 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) .cse188))) (or (= (select .cse181 (select (select .cse182 .cse183) .cse184)) 1) (forall ((v_prenex_9 Int)) (let ((.cse186 (+ v_prenex_9 4))) (or (= (select .cse181 (select (select .cse185 .cse183) .cse186)) 1) (= (select .cse181 (select (select .cse185 .cse187) .cse186)) 1)))) (not (= (select v_arrayElimArr_16 .cse188) |c_ULTIMATE.start_dll_create_#res#1.base|)))))) (= (select .cse181 (select (select .cse182 .cse187) .cse184)) 1)))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (forall ((v_arrayElimArr_10 (Array Int Int)) (v_prenex_12 Int) (v_prenex_11 Int) (v_prenex_13 Int) (v_arrayElimCell_108 Int)) (let ((.cse190 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse191 (let ((.cse192 (let ((.cse193 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_10)) (.cse194 (select v_arrayElimArr_10 (+ v_prenex_13 4)))) (store .cse193 .cse194 (store (select .cse193 .cse194) (+ v_arrayElimCell_108 8) |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))))) (select .cse192 (select (select .cse192 |c_ULTIMATE.start_dll_create_#res#1.base|) .cse5))))) (or (= (select .cse190 (select .cse191 (+ v_prenex_11 4))) 1) (= (select .cse190 (select .cse191 (+ v_prenex_12 4))) 1) (= |c_ULTIMATE.start_dll_create_#res#1.offset| v_prenex_13)))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimArr_16 (Array Int Int)) (v_prenex_10 Int) (v_arrayElimCell_108 Int) (v_prenex_9 Int)) (let ((.cse196 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_16)) (.cse200 (+ v_prenex_10 4))) (let ((.cse199 (let ((.cse201 (select v_arrayElimArr_16 .cse200))) (store .cse196 .cse201 (store (select .cse196 .cse201) (+ v_arrayElimCell_108 8) |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))))) (let ((.cse198 (+ v_arrayElimCell_108 4)) (.cse195 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse197 (select (select .cse199 |c_ULTIMATE.start_dll_create_#res#1.base|) .cse5))) (or (= (select .cse195 (select (select .cse196 .cse197) .cse198)) 1) (= (select .cse195 (select (select .cse196 (select (select .cse199 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) .cse200)) .cse198)) 1) (= (select .cse195 (select (select .cse199 .cse197) (+ v_prenex_9 4))) 1)))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimArr_16 (Array Int Int)) (v_prenex_10 Int) (v_arrayElimCell_108 Int) (v_prenex_9 Int)) (let ((.cse203 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_16))) (let ((.cse205 (let ((.cse206 (select v_arrayElimArr_16 (+ v_prenex_10 4)))) (store .cse203 .cse206 (store (select .cse203 .cse206) (+ v_arrayElimCell_108 8) |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))))) (let ((.cse202 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse204 (select (select .cse205 |c_ULTIMATE.start_dll_create_#res#1.base|) .cse5))) (or (= (select .cse202 (select (select .cse203 .cse204) (+ v_arrayElimCell_108 4))) 1) (= (select .cse202 (select (select .cse205 .cse204) (+ v_prenex_9 4))) 1)))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (forall ((v_arrayElimArr_15 (Array Int Int)) (v_prenex_2 Int) (v_prenex_3 Int) (v_arrayElimCell_102 Int) (v_arrayElimCell_108 Int)) (let ((.cse207 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse208 (let ((.cse209 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_15))) (let ((.cse210 (store (select .cse209 |c_ULTIMATE.start_dll_create_#res#1.base|) (+ v_arrayElimCell_108 8) |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))) (select (store .cse209 |c_ULTIMATE.start_dll_create_#res#1.base| .cse210) (select .cse210 .cse5)))))) (or (not (= (select v_arrayElimArr_15 (+ v_prenex_3 4)) |c_ULTIMATE.start_dll_create_#res#1.base|)) (= 1 (select .cse207 (select .cse208 (+ v_arrayElimCell_102 4)))) (= (select .cse207 (select .cse208 (+ v_prenex_2 4))) 1)))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (= |v_ULTIMATE.start_node_create_~temp~0#1.base_31| |c_ULTIMATE.start_dll_create_#res#1.base|))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimArr_16 (Array Int Int)) (v_prenex_10 Int) (v_arrayElimCell_108 Int) (v_prenex_9 Int)) (let ((.cse215 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_16)) (.cse213 (+ v_prenex_10 4))) (let ((.cse212 (let ((.cse217 (select v_arrayElimArr_16 .cse213))) (store .cse215 .cse217 (store (select .cse215 .cse217) (+ v_arrayElimCell_108 8) |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))))) (let ((.cse211 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse216 (select (select .cse212 |c_ULTIMATE.start_dll_create_#res#1.base|) .cse5)) (.cse214 (+ v_prenex_9 4))) (or (= (select .cse211 (select (select .cse212 (select (select .cse212 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) .cse213)) .cse214)) 1) (= (select .cse211 (select (select .cse215 .cse216) (+ v_arrayElimCell_108 4))) 1) (= (select .cse211 (select (select .cse212 .cse216) .cse214)) 1)))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimArr_16 (Array Int Int)) (v_prenex_10 Int) (v_arrayElimCell_108 Int) (v_prenex_9 Int)) (let ((.cse222 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_16)) (.cse225 (+ v_prenex_10 4))) (let ((.cse219 (let ((.cse226 (select v_arrayElimArr_16 .cse225))) (store .cse222 .cse226 (store (select .cse222 .cse226) (+ v_arrayElimCell_108 8) |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))))) (let ((.cse220 (select (select .cse219 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) .cse225)) (.cse224 (+ v_arrayElimCell_108 4)) (.cse218 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse223 (select (select .cse219 |c_ULTIMATE.start_dll_create_#res#1.base|) .cse5)) (.cse221 (+ v_prenex_9 4))) (or (= (select .cse218 (select (select .cse219 .cse220) .cse221)) 1) (= (select .cse218 (select (select .cse222 .cse223) .cse224)) 1) (= (select .cse218 (select (select .cse222 .cse220) .cse224)) 1) (= (select .cse218 (select (select .cse219 .cse223) .cse221)) 1))))))))) .cse6) (or (forall ((v_arrayElimArr_11 (Array Int Int)) (v_prenex_4 Int) (v_prenex_5 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (not (= (select v_arrayElimArr_11 (+ v_prenex_5 4)) |c_ULTIMATE.start_dll_create_#res#1.base|)) (= (select (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1) (select (let ((.cse227 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_11))) (let ((.cse228 (select .cse227 |c_ULTIMATE.start_dll_create_#res#1.base|))) (select (store .cse227 |c_ULTIMATE.start_dll_create_#res#1.base| (store .cse228 .cse4 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|)) (select .cse228 .cse5)))) (+ v_prenex_4 4))) 1))) .cse6))) is different from true [2024-11-13 13:58:38,436 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse167 (not (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0))) (.cse165 (store |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base| 1)) (.cse0 (< |c_ULTIMATE.start_main_~#s~0#1.offset| 1)) (.cse104 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8)) (.cse168 (< |c_ULTIMATE.start_main_~#s~0#1.offset| 0)) (.cse9 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4))) (and (or .cse0 (and (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimArr_16 (Array Int Int)) (v_prenex_10 Int) (v_arrayElimCell_108 Int) (v_prenex_9 Int)) (let ((.cse6 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_16)) (.cse8 (+ v_prenex_10 4))) (let ((.cse2 (let ((.cse10 (select v_arrayElimArr_16 .cse8))) (store .cse6 .cse10 (store (select .cse6 .cse10) (+ v_arrayElimCell_108 8) |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))))) (let ((.cse4 (+ v_prenex_9 4)) (.cse5 (select (select .cse2 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse9)) (.cse1 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse3 (select (select .cse2 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) .cse8)) (.cse7 (+ v_arrayElimCell_108 4))) (or (= (select .cse1 (select (select .cse2 .cse3) .cse4)) 1) (= (select .cse1 (select (select .cse2 .cse5) .cse4)) 1) (= (select .cse1 (select (select .cse6 .cse5) .cse7)) 1) (= (select .cse1 (select (select .cse6 .cse3) .cse7)) 1)))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimArr_16 (Array Int Int)) (v_arrayElimCell_108 Int)) (let ((.cse16 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_16))) (let ((.cse17 (store (select .cse16 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ v_arrayElimCell_108 8) |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))) (let ((.cse11 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse15 (select .cse17 .cse9))) (or (forall ((v_prenex_10 Int)) (let ((.cse13 (+ v_prenex_10 4))) (or (forall ((v_prenex_9 Int)) (let ((.cse12 (store .cse16 |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse17)) (.cse14 (+ v_prenex_9 4))) (or (= (select .cse11 (select (select .cse12 (select (select .cse12 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) .cse13)) .cse14)) 1) (= (select .cse11 (select (select .cse12 .cse15) .cse14)) 1)))) (not (= (select v_arrayElimArr_16 .cse13) |c_ULTIMATE.start_dll_create_~head~0#1.base|))))) (= (select .cse11 (select (select .cse16 .cse15) (+ v_arrayElimCell_108 4))) 1)))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (= |v_ULTIMATE.start_node_create_~temp~0#1.base_31| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (forall ((v_arrayElimArr_14 (Array Int Int)) (v_arrayElimCell_101 Int) (v_arrayElimCell_108 Int) (|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (let ((.cse18 (select v_arrayElimArr_14 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4)))) (or (= .cse18 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (select (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1) (select (let ((.cse19 (let ((.cse20 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_14))) (store .cse20 .cse18 (store (select .cse20 .cse18) (+ v_arrayElimCell_108 8) |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))))) (select .cse19 (select (select .cse19 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse9))) (+ v_arrayElimCell_101 4))) 1)))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimArr_16 (Array Int Int)) (v_prenex_10 Int) (v_arrayElimCell_108 Int) (v_prenex_9 Int)) (let ((.cse26 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_16)) (.cse23 (+ v_prenex_10 4))) (let ((.cse22 (let ((.cse27 (select v_arrayElimArr_16 .cse23))) (store .cse26 .cse27 (store (select .cse26 .cse27) (+ v_arrayElimCell_108 8) |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))))) (let ((.cse24 (+ v_prenex_9 4)) (.cse21 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse25 (select (select .cse22 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse9))) (or (= (select .cse21 (select (select .cse22 (select (select .cse22 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) .cse23)) .cse24)) 1) (= (select .cse21 (select (select .cse22 .cse25) .cse24)) 1) (= (select .cse21 (select (select .cse26 .cse25) (+ v_arrayElimCell_108 4))) 1)))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimArr_11 (Array Int Int)) (v_prenex_4 Int) (v_arrayElimCell_108 Int)) (let ((.cse33 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_11))) (let ((.cse30 (store (select .cse33 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ v_arrayElimCell_108 8) |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))) (let ((.cse28 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse29 (store .cse33 |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse30)) (.cse31 (+ v_prenex_4 4))) (or (= (select .cse28 (select (select .cse29 (select .cse30 .cse9)) .cse31)) 1) (forall ((v_prenex_5 Int)) (let ((.cse32 (+ v_prenex_5 4))) (or (not (= (select v_arrayElimArr_11 .cse32) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= (select .cse28 (select (select .cse29 (select (select .cse29 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) .cse32)) .cse31)) 1))))))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (= |v_ULTIMATE.start_node_create_~temp~0#1.base_31| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (forall ((v_arrayElimArr_15 (Array Int Int)) (v_prenex_2 Int) (v_prenex_3 Int) (v_arrayElimCell_102 Int) (v_arrayElimCell_108 Int)) (let ((.cse34 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse35 (let ((.cse36 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_15))) (let ((.cse37 (store (select .cse36 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ v_arrayElimCell_108 8) |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))) (select (store .cse36 |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse37) (select .cse37 .cse9)))))) (or (not (= (select v_arrayElimArr_15 (+ v_prenex_3 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= (select .cse34 (select .cse35 (+ v_prenex_2 4))) 1) (= 1 (select .cse34 (select .cse35 (+ v_arrayElimCell_102 4))))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_prenex_6 Int) (v_arrayElimArr_12 (Array Int Int)) (v_arrayElimCell_108 Int)) (or (= (select v_arrayElimArr_12 (+ v_prenex_6 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (select (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1) (select (let ((.cse38 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_12))) (select .cse38 (select (select .cse38 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse9))) (+ v_arrayElimCell_108 4))) 1))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimArr_10 (Array Int Int)) (v_prenex_12 Int) (v_prenex_11 Int) (v_prenex_13 Int) (v_arrayElimCell_108 Int)) (let ((.cse39 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse40 (let ((.cse41 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_10))) (let ((.cse42 (store (select .cse41 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ v_arrayElimCell_108 8) |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))) (select (store .cse41 |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse42) (select .cse42 .cse9)))))) (or (= (select .cse39 (select .cse40 (+ v_prenex_12 4))) 1) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| v_prenex_13) (not (= (select v_arrayElimArr_10 (+ v_prenex_13 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= (select .cse39 (select .cse40 (+ v_prenex_11 4))) 1)))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_prenex_7 Int) (v_arrayElimArr_13 (Array Int Int)) (v_arrayElimCell_108 Int) (v_prenex_8 Int)) (let ((.cse45 (select v_arrayElimArr_13 (+ v_prenex_8 4)))) (or (= (select (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1) (select (let ((.cse43 (let ((.cse44 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_13))) (store .cse44 .cse45 (store (select .cse44 .cse45) (+ v_arrayElimCell_108 8) |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))))) (select .cse43 (select (select .cse43 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse9))) (+ v_prenex_7 4))) 1) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| v_prenex_8) (= .cse45 |c_ULTIMATE.start_dll_create_~head~0#1.base|)))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimArr_11 (Array Int Int)) (v_prenex_4 Int) (v_prenex_5 Int) (v_arrayElimCell_108 Int)) (or (not (= (select v_arrayElimArr_11 (+ v_prenex_5 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= (select (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1) (select (let ((.cse46 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_11))) (let ((.cse47 (store (select .cse46 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ v_arrayElimCell_108 8) |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))) (select (store .cse46 |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse47) (select .cse47 .cse9)))) (+ v_prenex_4 4))) 1))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimArr_16 (Array Int Int)) (v_prenex_10 Int) (v_arrayElimCell_108 Int) (v_prenex_9 Int)) (let ((.cse51 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_16))) (let ((.cse49 (let ((.cse52 (select v_arrayElimArr_16 (+ v_prenex_10 4)))) (store .cse51 .cse52 (store (select .cse51 .cse52) (+ v_arrayElimCell_108 8) |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))))) (let ((.cse48 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse50 (select (select .cse49 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse9))) (or (= (select .cse48 (select (select .cse49 .cse50) (+ v_prenex_9 4))) 1) (= (select .cse48 (select (select .cse51 .cse50) (+ v_arrayElimCell_108 4))) 1)))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimArr_10 (Array Int Int)) (v_prenex_12 Int) (v_prenex_11 Int) (v_prenex_13 Int) (v_arrayElimCell_108 Int)) (let ((.cse53 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse54 (let ((.cse55 (let ((.cse56 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_10)) (.cse57 (select v_arrayElimArr_10 (+ v_prenex_13 4)))) (store .cse56 .cse57 (store (select .cse56 .cse57) (+ v_arrayElimCell_108 8) |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))))) (select .cse55 (select (select .cse55 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse9))))) (or (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| v_prenex_13) (= (select .cse53 (select .cse54 (+ v_prenex_11 4))) 1) (= (select .cse53 (select .cse54 (+ v_prenex_12 4))) 1)))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimArr_16 (Array Int Int)) (v_prenex_10 Int) (v_arrayElimCell_108 Int) (v_prenex_9 Int)) (let ((.cse59 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_16))) (let ((.cse64 (store (select .cse59 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ v_arrayElimCell_108 8) |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))) (let ((.cse61 (+ v_arrayElimCell_108 4)) (.cse63 (+ v_prenex_10 4)) (.cse58 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse62 (store .cse59 |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse64)) (.cse60 (select .cse64 .cse9))) (or (= (select .cse58 (select (select .cse59 .cse60) .cse61)) 1) (= (select .cse58 (select (select .cse59 (select (select .cse62 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) .cse63)) .cse61)) 1) (not (= (select v_arrayElimArr_16 .cse63) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= (select .cse58 (select (select .cse62 .cse60) (+ v_prenex_9 4))) 1)))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_prenex_7 Int) (v_arrayElimArr_13 (Array Int Int)) (v_arrayElimCell_108 Int) (v_prenex_8 Int)) (let ((.cse68 (+ v_prenex_8 4))) (let ((.cse69 (select v_arrayElimArr_13 .cse68))) (let ((.cse65 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse66 (let ((.cse70 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_13))) (store .cse70 .cse69 (store (select .cse70 .cse69) (+ v_arrayElimCell_108 8) |v_ULTIMATE.start_node_create_~temp~0#1.base_31|)))) (.cse67 (+ v_prenex_7 4))) (or (= (select .cse65 (select (select .cse66 (select (select .cse66 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse9)) .cse67)) 1) (= (select .cse65 (select (select .cse66 (select (select .cse66 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) .cse68)) .cse67)) 1) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| v_prenex_8) (= .cse69 |c_ULTIMATE.start_dll_create_~head~0#1.base|)))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_prenex_6 Int) (v_arrayElimArr_12 (Array Int Int)) (v_arrayElimCell_108 Int)) (let ((.cse72 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse73 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_12)) (.cse71 (select v_arrayElimArr_12 (+ v_prenex_6 4))) (.cse74 (+ v_arrayElimCell_108 4))) (or (= .cse71 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (select .cse72 (select (select .cse73 (select (select .cse73 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse9)) .cse74)) 1) (= (select .cse72 (select (select .cse73 .cse71) .cse74)) 1)))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimArr_16 (Array Int Int)) (v_arrayElimCell_108 Int)) (let ((.cse76 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_16))) (let ((.cse77 (store (select .cse76 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ v_arrayElimCell_108 8) |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))) (let ((.cse75 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse78 (select .cse77 .cse9))) (or (forall ((v_prenex_9 Int)) (= (select .cse75 (select (select (store .cse76 |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse77) .cse78) (+ v_prenex_9 4))) 1)) (= (select .cse75 (select (select .cse76 .cse78) (+ v_arrayElimCell_108 4))) 1) (forall ((v_prenex_10 Int)) (not (= (select v_arrayElimArr_16 (+ v_prenex_10 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)))))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (forall ((v_arrayElimArr_16 (Array Int Int)) (v_prenex_10 Int) (v_arrayElimCell_108 Int) (v_prenex_9 Int)) (let ((.cse82 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_16)) (.cse84 (+ v_prenex_10 4))) (let ((.cse80 (let ((.cse85 (select v_arrayElimArr_16 .cse84))) (store .cse82 .cse85 (store (select .cse82 .cse85) (+ v_arrayElimCell_108 8) |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))))) (let ((.cse81 (select (select .cse80 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse9)) (.cse79 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse83 (+ v_arrayElimCell_108 4))) (or (= (select .cse79 (select (select .cse80 .cse81) (+ v_prenex_9 4))) 1) (= (select .cse79 (select (select .cse82 .cse81) .cse83)) 1) (= (select .cse79 (select (select .cse82 (select (select .cse80 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) .cse84)) .cse83)) 1)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimArr_15 (Array Int Int)) (v_prenex_2 Int) (v_prenex_3 Int) (v_arrayElimCell_102 Int) (v_arrayElimCell_108 Int)) (let ((.cse86 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse87 (let ((.cse88 (let ((.cse89 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_15)) (.cse90 (select v_arrayElimArr_15 (+ v_prenex_3 4)))) (store .cse89 .cse90 (store (select .cse89 .cse90) (+ v_arrayElimCell_108 8) |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))))) (select .cse88 (select (select .cse88 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse9))))) (or (= (select .cse86 (select .cse87 (+ v_arrayElimCell_102 4))) 1) (= (select .cse86 (select .cse87 (+ v_prenex_2 4))) 1)))) (= |v_ULTIMATE.start_node_create_~temp~0#1.base_31| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimArr_16 (Array Int Int)) (v_arrayElimCell_108 Int)) (let ((.cse92 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_16))) (let ((.cse99 (store (select .cse92 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ v_arrayElimCell_108 8) |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))) (let ((.cse93 (select .cse99 .cse9)) (.cse91 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse94 (+ v_arrayElimCell_108 4))) (or (= (select .cse91 (select (select .cse92 .cse93) .cse94)) 1) (forall ((v_prenex_10 Int)) (let ((.cse95 (store .cse92 |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse99)) (.cse98 (+ v_prenex_10 4))) (let ((.cse96 (select (select .cse95 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) .cse98))) (or (forall ((v_prenex_9 Int)) (let ((.cse97 (+ v_prenex_9 4))) (or (= (select .cse91 (select (select .cse95 .cse96) .cse97)) 1) (= (select .cse91 (select (select .cse95 .cse93) .cse97)) 1)))) (= (select .cse91 (select (select .cse92 .cse96) .cse94)) 1) (not (= (select v_arrayElimArr_16 .cse98) |c_ULTIMATE.start_dll_create_~head~0#1.base|))))))))))))))) (or (forall ((v_arrayElimArr_15 (Array Int Int)) (v_prenex_2 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int) (v_prenex_3 Int) (v_arrayElimCell_102 Int)) (let ((.cse100 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse101 (let ((.cse102 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_15))) (let ((.cse103 (select .cse102 |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (select (store .cse102 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse103 .cse104 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|)) (select .cse103 .cse9)))))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (= (select .cse100 (select .cse101 (+ v_prenex_2 4))) 1) (= |v_ULTIMATE.start_node_create_~temp~0#1.base_31| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= (select v_arrayElimArr_15 (+ v_prenex_3 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= (select .cse100 (select .cse101 (+ v_arrayElimCell_102 4))) 1)))) .cse0) (or (and (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (forall ((v_arrayElimArr_16 (Array Int Int)) (v_prenex_10 Int) (v_prenex_9 Int)) (let ((.cse108 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_16))) (let ((.cse106 (let ((.cse109 (select v_arrayElimArr_16 (+ v_prenex_10 4)))) (store .cse108 .cse109 (store (select .cse108 .cse109) .cse104 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))))) (let ((.cse105 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse107 (select (select .cse106 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse9))) (or (= (select .cse105 (select (select .cse106 .cse107) (+ v_prenex_9 4))) 1) (= (select .cse105 (select (select .cse108 .cse107) .cse9)) 1)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_prenex_6 Int) (v_arrayElimArr_12 (Array Int Int))) (let ((.cse111 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse112 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_12)) (.cse110 (select v_arrayElimArr_12 (+ v_prenex_6 4)))) (or (= .cse110 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (select .cse111 (select (select .cse112 (select (select .cse112 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse9)) .cse9)) 1) (= (select .cse111 (select (select .cse112 .cse110) .cse9)) 1)))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimArr_14 (Array Int Int)) (v_arrayElimCell_101 Int) (|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (let ((.cse113 (select v_arrayElimArr_14 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4)))) (or (= .cse113 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (select (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1) (select (let ((.cse114 (let ((.cse115 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_14))) (store .cse115 .cse113 (store (select .cse115 .cse113) .cse104 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))))) (select .cse114 (select (select .cse114 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse9))) (+ v_arrayElimCell_101 4))) 1)))) (= |v_ULTIMATE.start_node_create_~temp~0#1.base_31| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_prenex_7 Int) (v_arrayElimArr_13 (Array Int Int)) (v_prenex_8 Int)) (let ((.cse119 (+ v_prenex_8 4))) (let ((.cse120 (select v_arrayElimArr_13 .cse119))) (let ((.cse116 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse117 (let ((.cse121 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_13))) (store .cse121 .cse120 (store (select .cse121 .cse120) .cse104 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|)))) (.cse118 (+ v_prenex_7 4))) (or (= (select .cse116 (select (select .cse117 (select (select .cse117 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse9)) .cse118)) 1) (= (select .cse116 (select (select .cse117 (select (select .cse117 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) .cse119)) .cse118)) 1) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| v_prenex_8) (= .cse120 |c_ULTIMATE.start_dll_create_~head~0#1.base|)))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimArr_11 (Array Int Int)) (v_prenex_4 Int)) (let ((.cse127 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_11))) (let ((.cse126 (select .cse127 |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (let ((.cse123 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse124 (store .cse127 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse126 .cse104 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))) (.cse125 (+ v_prenex_4 4))) (or (forall ((v_prenex_5 Int)) (let ((.cse122 (+ v_prenex_5 4))) (or (not (= (select v_arrayElimArr_11 .cse122) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= (select .cse123 (select (select .cse124 (select (select .cse124 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) .cse122)) .cse125)) 1)))) (= (select .cse123 (select (select .cse124 (select .cse126 .cse9)) .cse125)) 1)))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimArr_10 (Array Int Int)) (v_prenex_12 Int) (v_prenex_11 Int) (v_prenex_13 Int)) (let ((.cse128 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse129 (let ((.cse130 (let ((.cse131 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_10)) (.cse132 (select v_arrayElimArr_10 (+ v_prenex_13 4)))) (store .cse131 .cse132 (store (select .cse131 .cse132) .cse104 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))))) (select .cse130 (select (select .cse130 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse9))))) (or (= (select .cse128 (select .cse129 (+ v_prenex_11 4))) 1) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| v_prenex_13) (= (select .cse128 (select .cse129 (+ v_prenex_12 4))) 1)))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_prenex_7 Int) (v_arrayElimArr_13 (Array Int Int)) (v_prenex_8 Int)) (let ((.cse135 (select v_arrayElimArr_13 (+ v_prenex_8 4)))) (or (= (select (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1) (select (let ((.cse133 (let ((.cse134 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_13))) (store .cse134 .cse135 (store (select .cse134 .cse135) .cse104 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))))) (select .cse133 (select (select .cse133 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse9))) (+ v_prenex_7 4))) 1) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| v_prenex_8) (= .cse135 |c_ULTIMATE.start_dll_create_~head~0#1.base|)))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimArr_16 (Array Int Int)) (v_prenex_10 Int) (v_prenex_9 Int)) (let ((.cse141 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_16)) (.cse142 (+ v_prenex_10 4))) (let ((.cse137 (let ((.cse143 (select v_arrayElimArr_16 .cse142))) (store .cse141 .cse143 (store (select .cse141 .cse143) .cse104 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))))) (let ((.cse139 (+ v_prenex_9 4)) (.cse140 (select (select .cse137 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) .cse142)) (.cse136 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse138 (select (select .cse137 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse9))) (or (= (select .cse136 (select (select .cse137 .cse138) .cse139)) 1) (= (select .cse136 (select (select .cse137 .cse140) .cse139)) 1) (= (select .cse136 (select (select .cse141 .cse140) .cse9)) 1) (= (select .cse136 (select (select .cse141 .cse138) .cse9)) 1)))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (= |v_ULTIMATE.start_node_create_~temp~0#1.base_31| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (forall ((v_arrayElimArr_15 (Array Int Int)) (v_prenex_2 Int) (v_prenex_3 Int) (v_arrayElimCell_102 Int)) (let ((.cse144 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse145 (let ((.cse146 (let ((.cse147 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_15)) (.cse148 (select v_arrayElimArr_15 (+ v_prenex_3 4)))) (store .cse147 .cse148 (store (select .cse147 .cse148) .cse104 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))))) (select .cse146 (select (select .cse146 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse9))))) (or (= (select .cse144 (select .cse145 (+ v_prenex_2 4))) 1) (= (select .cse144 (select .cse145 (+ v_arrayElimCell_102 4))) 1)))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimArr_11 (Array Int Int)) (v_prenex_4 Int) (v_prenex_5 Int)) (or (not (= (select v_arrayElimArr_11 (+ v_prenex_5 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= (select (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1) (select (let ((.cse149 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_11))) (let ((.cse150 (select .cse149 |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (select (store .cse149 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse150 .cse104 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|)) (select .cse150 .cse9)))) (+ v_prenex_4 4))) 1))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_prenex_6 Int) (v_arrayElimArr_12 (Array Int Int))) (or (= (select v_arrayElimArr_12 (+ v_prenex_6 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (select (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1) (select (let ((.cse151 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_12))) (select .cse151 (select (select .cse151 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse9))) .cse9)) 1))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimArr_16 (Array Int Int)) (v_prenex_10 Int) (v_prenex_9 Int)) (let ((.cse155 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_16)) (.cse156 (+ v_prenex_10 4))) (let ((.cse153 (let ((.cse157 (select v_arrayElimArr_16 .cse156))) (store .cse155 .cse157 (store (select .cse155 .cse157) .cse104 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))))) (let ((.cse152 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse154 (select (select .cse153 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse9))) (or (= (select .cse152 (select (select .cse153 .cse154) (+ v_prenex_9 4))) 1) (= (select .cse152 (select (select .cse155 (select (select .cse153 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) .cse156)) .cse9)) 1) (= (select .cse152 (select (select .cse155 .cse154) .cse9)) 1)))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimArr_16 (Array Int Int)) (v_prenex_10 Int) (v_prenex_9 Int)) (let ((.cse163 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_16)) (.cse162 (+ v_prenex_10 4))) (let ((.cse159 (let ((.cse164 (select v_arrayElimArr_16 .cse162))) (store .cse163 .cse164 (store (select .cse163 .cse164) .cse104 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))))) (let ((.cse161 (+ v_prenex_9 4)) (.cse158 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse160 (select (select .cse159 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse9))) (or (= (select .cse158 (select (select .cse159 .cse160) .cse161)) 1) (= (select .cse158 (select (select .cse159 (select (select .cse159 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) .cse162)) .cse161)) 1) (= (select .cse158 (select (select .cse163 .cse160) .cse9)) 1))))))))) .cse0) (or (and (forall ((v_arrayElimCell_114 Int)) (= (select .cse165 v_arrayElimCell_114) 1)) (forall ((v_arrayElimArr_18 (Array Int Int))) (or (forall ((v_prenex_5 Int)) (let ((.cse166 (select v_arrayElimArr_18 (+ v_prenex_5 4)))) (or (= v_prenex_5 .cse9) (forall ((v_prenex_4 Int)) (= (select .cse165 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_arrayElimArr_18) .cse166) (+ v_prenex_4 4))) 1)) (not (= .cse166 |c_ULTIMATE.start_dll_create_~head~0#1.base|))))) (not (= (select v_arrayElimArr_18 .cse104) |c_ULTIMATE.start_dll_create_~head~0#1.base|))))) .cse167 .cse168) (or (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int) (v_arrayElimArr_16 (Array Int Int)) (v_prenex_10 Int) (v_prenex_9 Int)) (let ((.cse170 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_16))) (let ((.cse174 (select .cse170 |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (let ((.cse172 (+ v_prenex_10 4)) (.cse169 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse171 (store .cse170 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse174 .cse104 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))) (.cse173 (select .cse174 .cse9))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (= (select .cse169 (select (select .cse170 (select (select .cse171 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) .cse172)) .cse9)) 1) (= (select .cse169 (select (select .cse170 .cse173) .cse9)) 1) (not (= (select v_arrayElimArr_16 .cse172) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= (select .cse169 (select (select .cse171 .cse173) (+ v_prenex_9 4))) 1)))))) .cse0) (or .cse167 .cse168 (forall ((v_prenex_4 Int) (v_arrayElimArr_17 (Array Int Int))) (let ((.cse175 (+ v_prenex_4 4))) (or (not (= (select v_arrayElimArr_17 .cse104) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= (select .cse165 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_arrayElimArr_17) (select v_arrayElimArr_17 .cse9)) .cse175)) 1) (= (select .cse165 (select v_arrayElimArr_17 .cse175)) 1))))) (or (forall ((v_arrayElimArr_10 (Array Int Int)) (v_prenex_12 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int) (v_prenex_11 Int) (v_prenex_13 Int)) (let ((.cse176 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse177 (let ((.cse178 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_10))) (let ((.cse179 (select .cse178 |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (select (store .cse178 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse179 .cse104 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|)) (select .cse179 .cse9)))))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| v_prenex_13) (= (select .cse176 (select .cse177 (+ v_prenex_12 4))) 1) (not (= (select v_arrayElimArr_10 (+ v_prenex_13 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= (select .cse176 (select .cse177 (+ v_prenex_11 4))) 1)))) .cse0) (or (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int) (v_arrayElimArr_16 (Array Int Int)) (v_prenex_10 Int) (v_prenex_9 Int)) (let ((.cse181 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_16))) (let ((.cse187 (select .cse181 |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (let ((.cse185 (store .cse181 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse187 .cse104 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))) (.cse184 (+ v_prenex_10 4))) (let ((.cse183 (select .cse187 .cse9)) (.cse180 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse182 (select (select .cse185 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) .cse184)) (.cse186 (+ v_prenex_9 4))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (= (select .cse180 (select (select .cse181 .cse182) .cse9)) 1) (= (select .cse180 (select (select .cse181 .cse183) .cse9)) 1) (not (= (select v_arrayElimArr_16 .cse184) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= (select .cse180 (select (select .cse185 .cse183) .cse186)) 1) (= (select .cse180 (select (select .cse185 .cse182) .cse186)) 1))))))) .cse168) (or (forall ((v_arrayElimArr_11 (Array Int Int)) (v_prenex_4 Int) (v_prenex_5 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (let ((.cse193 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_11))) (let ((.cse192 (select .cse193 |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (let ((.cse188 (+ v_prenex_5 4)) (.cse189 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse190 (store .cse193 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse192 .cse104 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))) (.cse191 (+ v_prenex_4 4))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (not (= (select v_arrayElimArr_11 .cse188) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= (select .cse189 (select (select .cse190 (select (select .cse190 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) .cse188)) .cse191)) 1) (= (select .cse189 (select (select .cse190 (select .cse192 .cse9)) .cse191)) 1)))))) .cse0) (or .cse168 (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int) (v_arrayElimArr_16 (Array Int Int)) (v_prenex_10 Int) (v_prenex_9 Int)) (let ((.cse195 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_16))) (let ((.cse197 (select .cse195 |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (let ((.cse199 (store .cse195 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse197 .cse104 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))) (.cse198 (+ v_prenex_10 4))) (let ((.cse194 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse196 (select (select .cse199 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) .cse198))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (= (select .cse194 (select (select .cse195 .cse196) .cse9)) 1) (= (select .cse194 (select (select .cse195 (select .cse197 .cse9)) .cse9)) 1) (not (= (select v_arrayElimArr_16 .cse198) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= (select .cse194 (select (select .cse199 .cse196) (+ v_prenex_9 4))) 1)))))))) (or .cse0 (forall ((v_arrayElimArr_11 (Array Int Int)) (v_prenex_4 Int) (v_prenex_5 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (not (= (select v_arrayElimArr_11 (+ v_prenex_5 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= (select (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1) (select (let ((.cse200 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_11))) (let ((.cse201 (select .cse200 |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (select (store .cse200 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse201 .cse104 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|)) (select .cse201 .cse9)))) (+ v_prenex_4 4))) 1)))) (or (and (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimArr_16 (Array Int Int))) (let ((.cse203 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_16))) (let ((.cse205 (select .cse203 |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (let ((.cse202 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse204 (select .cse205 .cse9))) (or (= (select .cse202 (select (select .cse203 .cse204) .cse9)) 1) (forall ((v_prenex_10 Int)) (not (= (select v_arrayElimArr_16 (+ v_prenex_10 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (forall ((v_prenex_9 Int)) (= (select .cse202 (select (select (store .cse203 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse205 .cse104 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|)) .cse204) (+ v_prenex_9 4))) 1))))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimArr_16 (Array Int Int))) (let ((.cse211 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_16))) (let ((.cse212 (select .cse211 |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (let ((.cse206 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse208 (select .cse212 .cse9))) (or (forall ((v_prenex_10 Int)) (let ((.cse210 (+ v_prenex_10 4))) (or (forall ((v_prenex_9 Int)) (let ((.cse207 (store .cse211 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse212 .cse104 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))) (.cse209 (+ v_prenex_9 4))) (or (= (select .cse206 (select (select .cse207 .cse208) .cse209)) 1) (= (select .cse206 (select (select .cse207 (select (select .cse207 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) .cse210)) .cse209)) 1)))) (not (= (select v_arrayElimArr_16 .cse210) |c_ULTIMATE.start_dll_create_~head~0#1.base|))))) (= (select .cse206 (select (select .cse211 .cse208) .cse9)) 1))))))))) .cse0) (or .cse168 (and (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimArr_16 (Array Int Int)) (v_prenex_10 Int)) (let ((.cse214 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_16))) (let ((.cse217 (select .cse214 |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (let ((.cse216 (store .cse214 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse217 .cse104 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))) (.cse219 (+ v_prenex_10 4))) (let ((.cse213 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse215 (select (select .cse216 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) .cse219))) (or (= (select .cse213 (select (select .cse214 .cse215) .cse9)) 1) (forall ((v_prenex_9 Int)) (let ((.cse218 (+ v_prenex_9 4))) (or (= (select .cse213 (select (select .cse216 (select .cse217 .cse9)) .cse218)) 1) (= (select .cse213 (select (select .cse216 .cse215) .cse218)) 1)))) (not (= (select v_arrayElimArr_16 .cse219) |c_ULTIMATE.start_dll_create_~head~0#1.base|)))))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimArr_16 (Array Int Int)) (v_prenex_10 Int) (v_prenex_9 Int)) (let ((.cse221 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_16))) (let ((.cse224 (store .cse221 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse221 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse104 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))) (.cse223 (+ v_prenex_10 4))) (let ((.cse220 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse222 (select (select .cse224 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) .cse223))) (or (= (select .cse220 (select (select .cse221 .cse222) .cse9)) 1) (not (= (select v_arrayElimArr_16 .cse223) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= (select .cse220 (select (select .cse224 .cse222) (+ v_prenex_9 4))) 1)))))))))) (or .cse168 (and (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (= |v_ULTIMATE.start_node_create_~temp~0#1.base_31| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (forall ((v_arrayElimArr_12 (Array Int Int))) (let ((.cse226 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse227 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_12))) (or (forall ((v_prenex_6 Int)) (let ((.cse225 (select v_arrayElimArr_12 (+ v_prenex_6 4)))) (or (not (= .cse225 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= (select .cse226 (select (select .cse227 .cse225) .cse9)) 1)))) (= (select .cse226 (select (select .cse227 (select (select .cse227 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse9)) .cse9)) 1)))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (= |v_ULTIMATE.start_node_create_~temp~0#1.base_31| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (forall ((v_prenex_6 Int) (v_arrayElimArr_12 (Array Int Int))) (let ((.cse228 (select v_arrayElimArr_12 (+ v_prenex_6 4)))) (or (not (= .cse228 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= (select (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1) (select (select (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_12) .cse228) .cse9)) 1)))))))))) is different from true [2024-11-13 13:58:45,816 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse7 (store |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 1)) (.cse10 (not (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))) (.cse4 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (.cse9 (< |c_ULTIMATE.start_main_~#s~0#1.offset| 0)) (.cse6 (< |c_ULTIMATE.start_main_~#s~0#1.offset| 1)) (.cse5 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (and (or (forall ((v_arrayElimArr_10 (Array Int Int)) (v_prenex_12 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int) (v_prenex_11 Int) (v_prenex_13 Int)) (let ((.cse0 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse1 (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_10))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (select (store .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse3 .cse4 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|)) (select .cse3 .cse5)))))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (= v_prenex_13 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) (= (select .cse0 (select .cse1 (+ v_prenex_11 4))) 1) (= (select .cse0 (select .cse1 (+ v_prenex_12 4))) 1) (not (= (select v_arrayElimArr_10 (+ v_prenex_13 4)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))))) .cse6) (or (and (forall ((v_arrayElimCell_114 Int)) (= (select .cse7 v_arrayElimCell_114) 1)) (forall ((v_arrayElimArr_18 (Array Int Int))) (or (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select v_arrayElimArr_18 .cse4))) (forall ((v_prenex_5 Int)) (let ((.cse8 (select v_arrayElimArr_18 (+ v_prenex_5 4)))) (or (not (= .cse8 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= v_prenex_5 .cse5) (forall ((v_prenex_4 Int)) (= (select .cse7 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_18) .cse8) (+ v_prenex_4 4))) 1)))))))) .cse9 .cse10) (or (and (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (forall ((v_arrayElimArr_16 (Array Int Int))) (let ((.cse12 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_16))) (let ((.cse17 (select .cse12 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (let ((.cse11 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse13 (select .cse17 .cse5))) (or (= (select .cse11 (select (select .cse12 .cse13) .cse5)) 1) (forall ((v_prenex_10 Int)) (let ((.cse14 (+ v_prenex_10 4))) (or (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select v_arrayElimArr_16 .cse14))) (forall ((v_prenex_9 Int)) (let ((.cse15 (store .cse12 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse17 .cse4 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))) (.cse16 (+ v_prenex_9 4))) (or (= (select .cse11 (select (select .cse15 (select (select .cse15 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) .cse14)) .cse16)) 1) (= (select .cse11 (select (select .cse15 .cse13) .cse16)) 1)))))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimArr_16 (Array Int Int))) (let ((.cse19 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_16))) (let ((.cse20 (select .cse19 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (let ((.cse18 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse21 (select .cse20 .cse5))) (or (forall ((v_prenex_10 Int)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select v_arrayElimArr_16 (+ v_prenex_10 4))))) (forall ((v_prenex_9 Int)) (= (select .cse18 (select (select (store .cse19 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse20 .cse4 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|)) .cse21) (+ v_prenex_9 4))) 1)) (= (select .cse18 (select (select .cse19 .cse21) .cse5)) 1))))))))) .cse6) (or .cse9 (and (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_prenex_6 Int) (v_arrayElimArr_12 (Array Int Int))) (let ((.cse22 (select v_arrayElimArr_12 (+ v_prenex_6 4)))) (or (not (= .cse22 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= (select (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1) (select (select (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_12) .cse22) .cse5)) 1)))) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) (forall ((v_arrayElimArr_12 (Array Int Int))) (let ((.cse23 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse24 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_12))) (or (= (select .cse23 (select (select .cse24 (select (select .cse24 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse5)) .cse5)) 1) (forall ((v_prenex_6 Int)) (let ((.cse25 (select v_arrayElimArr_12 (+ v_prenex_6 4)))) (or (not (= .cse25 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= (select .cse23 (select (select .cse24 .cse25) .cse5)) 1))))))))))) (or (forall ((v_arrayElimArr_15 (Array Int Int)) (v_prenex_2 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int) (v_prenex_3 Int) (v_arrayElimCell_102 Int)) (let ((.cse26 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse27 (let ((.cse28 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_15))) (let ((.cse29 (select .cse28 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (select (store .cse28 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse29 .cse4 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|)) (select .cse29 .cse5)))))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select v_arrayElimArr_15 (+ v_prenex_3 4)))) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) (= (select .cse26 (select .cse27 (+ v_prenex_2 4))) 1) (= (select .cse26 (select .cse27 (+ v_arrayElimCell_102 4))) 1)))) .cse6) (or .cse6 (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int) (v_arrayElimArr_16 (Array Int Int)) (v_prenex_10 Int) (v_prenex_9 Int)) (let ((.cse31 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_16))) (let ((.cse35 (select .cse31 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (let ((.cse33 (+ v_prenex_10 4)) (.cse32 (store .cse31 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse35 .cse4 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))) (.cse30 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse34 (select .cse35 .cse5))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (= (select .cse30 (select (select .cse31 (select (select .cse32 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) .cse33)) .cse5)) 1) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select v_arrayElimArr_16 .cse33))) (= (select .cse30 (select (select .cse32 .cse34) (+ v_prenex_9 4))) 1) (= (select .cse30 (select (select .cse31 .cse34) .cse5)) 1))))))) (or .cse9 (and (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimArr_16 (Array Int Int)) (v_prenex_10 Int)) (let ((.cse37 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_16))) (let ((.cse42 (select .cse37 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (let ((.cse40 (store .cse37 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse42 .cse4 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))) (.cse39 (+ v_prenex_10 4))) (let ((.cse38 (select (select .cse40 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) .cse39)) (.cse36 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1))) (or (= (select .cse36 (select (select .cse37 .cse38) .cse5)) 1) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select v_arrayElimArr_16 .cse39))) (forall ((v_prenex_9 Int)) (let ((.cse41 (+ v_prenex_9 4))) (or (= (select .cse36 (select (select .cse40 .cse38) .cse41)) 1) (= (select .cse36 (select (select .cse40 (select .cse42 .cse5)) .cse41)) 1)))))))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimArr_16 (Array Int Int)) (v_prenex_10 Int) (v_prenex_9 Int)) (let ((.cse44 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_16))) (let ((.cse46 (store .cse44 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select .cse44 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse4 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))) (.cse47 (+ v_prenex_10 4))) (let ((.cse43 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse45 (select (select .cse46 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) .cse47))) (or (= (select .cse43 (select (select .cse44 .cse45) .cse5)) 1) (= (select .cse43 (select (select .cse46 .cse45) (+ v_prenex_9 4))) 1) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select v_arrayElimArr_16 .cse47)))))))))))) (or .cse9 (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int) (v_arrayElimArr_16 (Array Int Int)) (v_prenex_10 Int) (v_prenex_9 Int)) (let ((.cse49 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_16))) (let ((.cse55 (select .cse49 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (let ((.cse51 (store .cse49 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse55 .cse4 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))) (.cse53 (+ v_prenex_10 4))) (let ((.cse50 (select (select .cse51 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) .cse53)) (.cse52 (+ v_prenex_9 4)) (.cse48 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse54 (select .cse55 .cse5))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (= (select .cse48 (select (select .cse49 .cse50) .cse5)) 1) (= (select .cse48 (select (select .cse51 .cse50) .cse52)) 1) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select v_arrayElimArr_16 .cse53))) (= (select .cse48 (select (select .cse51 .cse54) .cse52)) 1) (= (select .cse48 (select (select .cse49 .cse54) .cse5)) 1)))))))) (or .cse6 (and (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) (forall ((v_arrayElimArr_15 (Array Int Int)) (v_prenex_2 Int) (v_prenex_3 Int) (v_arrayElimCell_102 Int)) (let ((.cse56 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse57 (let ((.cse58 (let ((.cse59 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_15)) (.cse60 (select v_arrayElimArr_15 (+ v_prenex_3 4)))) (store .cse59 .cse60 (store (select .cse59 .cse60) .cse4 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))))) (select .cse58 (select (select .cse58 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse5))))) (or (= (select .cse56 (select .cse57 (+ v_arrayElimCell_102 4))) 1) (= (select .cse56 (select .cse57 (+ v_prenex_2 4))) 1)))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimArr_10 (Array Int Int)) (v_prenex_12 Int) (v_prenex_11 Int) (v_prenex_13 Int)) (let ((.cse61 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse62 (let ((.cse63 (let ((.cse64 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_10)) (.cse65 (select v_arrayElimArr_10 (+ v_prenex_13 4)))) (store .cse64 .cse65 (store (select .cse64 .cse65) .cse4 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))))) (select .cse63 (select (select .cse63 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse5))))) (or (= (select .cse61 (select .cse62 (+ v_prenex_11 4))) 1) (= v_prenex_13 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) (= (select .cse61 (select .cse62 (+ v_prenex_12 4))) 1)))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (forall ((v_arrayElimArr_14 (Array Int Int)) (v_arrayElimCell_101 Int) (|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (let ((.cse66 (select v_arrayElimArr_14 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4)))) (or (= .cse66 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (= (select (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1) (select (let ((.cse67 (let ((.cse68 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_14))) (store .cse68 .cse66 (store (select .cse68 .cse66) .cse4 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))))) (select .cse67 (select (select .cse67 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse5))) (+ v_arrayElimCell_101 4))) 1)))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_prenex_7 Int) (v_arrayElimArr_13 (Array Int Int)) (v_prenex_8 Int)) (let ((.cse69 (select v_arrayElimArr_13 (+ v_prenex_8 4)))) (or (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse69) (= (select (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1) (select (let ((.cse70 (let ((.cse71 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_13))) (store .cse71 .cse69 (store (select .cse71 .cse69) .cse4 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))))) (select .cse70 (select (select .cse70 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse5))) (+ v_prenex_7 4))) 1) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| v_prenex_8)))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_prenex_6 Int) (v_arrayElimArr_12 (Array Int Int))) (or (= (select v_arrayElimArr_12 (+ v_prenex_6 4)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (= (select (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1) (select (let ((.cse72 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_12))) (select .cse72 (select (select .cse72 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse5))) .cse5)) 1))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimArr_16 (Array Int Int)) (v_prenex_10 Int) (v_prenex_9 Int)) (let ((.cse76 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_16)) (.cse77 (+ v_prenex_10 4))) (let ((.cse74 (let ((.cse78 (select v_arrayElimArr_16 .cse77))) (store .cse76 .cse78 (store (select .cse76 .cse78) .cse4 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))))) (let ((.cse73 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse75 (select (select .cse74 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse5))) (or (= (select .cse73 (select (select .cse74 .cse75) (+ v_prenex_9 4))) 1) (= (select .cse73 (select (select .cse76 (select (select .cse74 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) .cse77)) .cse5)) 1) (= (select .cse73 (select (select .cse76 .cse75) .cse5)) 1)))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimArr_16 (Array Int Int)) (v_prenex_10 Int) (v_prenex_9 Int)) (let ((.cse83 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_16)) (.cse85 (+ v_prenex_10 4))) (let ((.cse80 (let ((.cse86 (select v_arrayElimArr_16 .cse85))) (store .cse83 .cse86 (store (select .cse83 .cse86) .cse4 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))))) (let ((.cse84 (select (select .cse80 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) .cse85)) (.cse82 (+ v_prenex_9 4)) (.cse79 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse81 (select (select .cse80 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse5))) (or (= (select .cse79 (select (select .cse80 .cse81) .cse82)) 1) (= (select .cse79 (select (select .cse83 .cse84) .cse5)) 1) (= (select .cse79 (select (select .cse80 .cse84) .cse82)) 1) (= (select .cse79 (select (select .cse83 .cse81) .cse5)) 1)))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimArr_11 (Array Int Int)) (v_prenex_4 Int)) (let ((.cse92 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_11))) (let ((.cse91 (select .cse92 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (let ((.cse87 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse88 (store .cse92 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse91 .cse4 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))) (.cse90 (+ v_prenex_4 4))) (or (forall ((v_prenex_5 Int)) (let ((.cse89 (+ v_prenex_5 4))) (or (= (select .cse87 (select (select .cse88 (select (select .cse88 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) .cse89)) .cse90)) 1) (not (= (select v_arrayElimArr_11 .cse89) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))))) (= (select .cse87 (select (select .cse88 (select .cse91 .cse5)) .cse90)) 1)))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimArr_16 (Array Int Int)) (v_prenex_10 Int) (v_prenex_9 Int)) (let ((.cse96 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_16))) (let ((.cse94 (let ((.cse97 (select v_arrayElimArr_16 (+ v_prenex_10 4)))) (store .cse96 .cse97 (store (select .cse96 .cse97) .cse4 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))))) (let ((.cse93 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse95 (select (select .cse94 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse5))) (or (= (select .cse93 (select (select .cse94 .cse95) (+ v_prenex_9 4))) 1) (= (select .cse93 (select (select .cse96 .cse95) .cse5)) 1)))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimArr_16 (Array Int Int)) (v_prenex_10 Int) (v_prenex_9 Int)) (let ((.cse103 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_16)) (.cse102 (+ v_prenex_10 4))) (let ((.cse99 (let ((.cse104 (select v_arrayElimArr_16 .cse102))) (store .cse103 .cse104 (store (select .cse103 .cse104) .cse4 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))))) (let ((.cse101 (+ v_prenex_9 4)) (.cse98 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse100 (select (select .cse99 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse5))) (or (= (select .cse98 (select (select .cse99 .cse100) .cse101)) 1) (= (select .cse98 (select (select .cse99 (select (select .cse99 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) .cse102)) .cse101)) 1) (= (select .cse98 (select (select .cse103 .cse100) .cse5)) 1)))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimArr_11 (Array Int Int)) (v_prenex_4 Int) (v_prenex_5 Int)) (or (= (select (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1) (select (let ((.cse105 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_11))) (let ((.cse106 (select .cse105 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (select (store .cse105 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse106 .cse4 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|)) (select .cse106 .cse5)))) (+ v_prenex_4 4))) 1) (not (= (select v_arrayElimArr_11 (+ v_prenex_5 4)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_prenex_6 Int) (v_arrayElimArr_12 (Array Int Int))) (let ((.cse108 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse109 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_12)) (.cse107 (select v_arrayElimArr_12 (+ v_prenex_6 4)))) (or (= .cse107 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (= (select .cse108 (select (select .cse109 (select (select .cse109 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse5)) .cse5)) 1) (= (select .cse108 (select (select .cse109 .cse107) .cse5)) 1)))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_prenex_7 Int) (v_arrayElimArr_13 (Array Int Int)) (v_prenex_8 Int)) (let ((.cse114 (+ v_prenex_8 4))) (let ((.cse110 (select v_arrayElimArr_13 .cse114))) (let ((.cse111 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse112 (let ((.cse115 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_13))) (store .cse115 .cse110 (store (select .cse115 .cse110) .cse4 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|)))) (.cse113 (+ v_prenex_7 4))) (or (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse110) (= (select .cse111 (select (select .cse112 (select (select .cse112 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse5)) .cse113)) 1) (= (select .cse111 (select (select .cse112 (select (select .cse112 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) .cse114)) .cse113)) 1) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| v_prenex_8)))))))))) (or .cse6 (forall ((v_arrayElimArr_11 (Array Int Int)) (v_prenex_4 Int) (v_prenex_5 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (= (select (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1) (select (let ((.cse116 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_11))) (let ((.cse117 (select .cse116 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (select (store .cse116 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse117 .cse4 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|)) (select .cse117 .cse5)))) (+ v_prenex_4 4))) 1) (not (= (select v_arrayElimArr_11 (+ v_prenex_5 4)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))))) (or (forall ((v_arrayElimArr_11 (Array Int Int)) (v_prenex_4 Int) (v_prenex_5 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (let ((.cse123 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_11))) (let ((.cse120 (select .cse123 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (let ((.cse118 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse119 (store .cse123 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse120 .cse4 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))) (.cse121 (+ v_prenex_4 4)) (.cse122 (+ v_prenex_5 4))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (= (select .cse118 (select (select .cse119 (select .cse120 .cse5)) .cse121)) 1) (= (select .cse118 (select (select .cse119 (select (select .cse119 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) .cse122)) .cse121)) 1) (not (= (select v_arrayElimArr_11 .cse122) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))))))) .cse6) (or .cse9 (forall ((v_prenex_4 Int) (v_arrayElimArr_17 (Array Int Int))) (let ((.cse124 (+ v_prenex_4 4))) (or (= (select .cse7 (select v_arrayElimArr_17 .cse124)) 1) (= (select .cse7 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_17) (select v_arrayElimArr_17 .cse5)) .cse124)) 1) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select v_arrayElimArr_17 .cse4)))))) .cse10) (or (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int) (v_arrayElimArr_16 (Array Int Int)) (v_prenex_10 Int) (v_prenex_9 Int)) (let ((.cse126 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_16))) (let ((.cse130 (select .cse126 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (let ((.cse128 (store .cse126 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse130 .cse4 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))) (.cse129 (+ v_prenex_10 4))) (let ((.cse127 (select (select .cse128 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) .cse129)) (.cse125 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (= (select .cse125 (select (select .cse126 .cse127) .cse5)) 1) (= (select .cse125 (select (select .cse128 .cse127) (+ v_prenex_9 4))) 1) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select v_arrayElimArr_16 .cse129))) (= (select .cse125 (select (select .cse126 (select .cse130 .cse5)) .cse5)) 1))))))) .cse9) (or .cse6 (and (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) (forall ((v_arrayElimArr_15 (Array Int Int)) (v_prenex_2 Int) (v_prenex_3 Int) (v_arrayElimCell_102 Int) (v_arrayElimCell_108 Int)) (let ((.cse131 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse132 (let ((.cse133 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_15))) (let ((.cse134 (store (select .cse133 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ v_arrayElimCell_108 8) |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))) (select (store .cse133 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse134) (select .cse134 .cse5)))))) (or (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select v_arrayElimArr_15 (+ v_prenex_3 4)))) (= (select .cse131 (select .cse132 (+ v_arrayElimCell_102 4))) 1) (= 1 (select .cse131 (select .cse132 (+ v_prenex_2 4))))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimArr_16 (Array Int Int)) (v_arrayElimCell_108 Int)) (let ((.cse136 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_16))) (let ((.cse138 (store (select .cse136 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ v_arrayElimCell_108 8) |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))) (let ((.cse135 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse137 (select .cse138 .cse5))) (or (forall ((v_prenex_10 Int)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select v_arrayElimArr_16 (+ v_prenex_10 4))))) (= (select .cse135 (select (select .cse136 .cse137) (+ v_arrayElimCell_108 4))) 1) (forall ((v_prenex_9 Int)) (= (select .cse135 (select (select (store .cse136 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse138) .cse137) (+ v_prenex_9 4))) 1))))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_prenex_6 Int) (v_arrayElimArr_12 (Array Int Int)) (v_arrayElimCell_108 Int)) (let ((.cse140 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse141 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_12)) (.cse139 (select v_arrayElimArr_12 (+ v_prenex_6 4))) (.cse142 (+ v_arrayElimCell_108 4))) (or (= .cse139 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (= (select .cse140 (select (select .cse141 (select (select .cse141 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse5)) .cse142)) 1) (= (select .cse140 (select (select .cse141 .cse139) .cse142)) 1)))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimArr_16 (Array Int Int)) (v_prenex_10 Int) (v_arrayElimCell_108 Int) (v_prenex_9 Int)) (let ((.cse146 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_16))) (let ((.cse144 (let ((.cse147 (select v_arrayElimArr_16 (+ v_prenex_10 4)))) (store .cse146 .cse147 (store (select .cse146 .cse147) (+ v_arrayElimCell_108 8) |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))))) (let ((.cse143 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse145 (select (select .cse144 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse5))) (or (= (select .cse143 (select (select .cse144 .cse145) (+ v_prenex_9 4))) 1) (= (select .cse143 (select (select .cse146 .cse145) (+ v_arrayElimCell_108 4))) 1)))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimArr_11 (Array Int Int)) (v_prenex_4 Int) (v_prenex_5 Int) (v_arrayElimCell_108 Int)) (or (= (select (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1) (select (let ((.cse148 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_11))) (let ((.cse149 (store (select .cse148 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ v_arrayElimCell_108 8) |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))) (select (store .cse148 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse149) (select .cse149 .cse5)))) (+ v_prenex_4 4))) 1) (not (= (select v_arrayElimArr_11 (+ v_prenex_5 4)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimArr_10 (Array Int Int)) (v_prenex_12 Int) (v_prenex_11 Int) (v_prenex_13 Int) (v_arrayElimCell_108 Int)) (let ((.cse150 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse151 (let ((.cse152 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_10))) (let ((.cse153 (store (select .cse152 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ v_arrayElimCell_108 8) |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))) (select (store .cse152 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse153) (select .cse153 .cse5)))))) (or (= (select .cse150 (select .cse151 (+ v_prenex_12 4))) 1) (= v_prenex_13 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) (not (= (select v_arrayElimArr_10 (+ v_prenex_13 4)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= (select .cse150 (select .cse151 (+ v_prenex_11 4))) 1)))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimArr_16 (Array Int Int)) (v_prenex_10 Int) (v_arrayElimCell_108 Int) (v_prenex_9 Int)) (let ((.cse159 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_16)) (.cse158 (+ v_prenex_10 4))) (let ((.cse155 (let ((.cse160 (select v_arrayElimArr_16 .cse158))) (store .cse159 .cse160 (store (select .cse159 .cse160) (+ v_arrayElimCell_108 8) |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))))) (let ((.cse157 (+ v_prenex_9 4)) (.cse154 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse156 (select (select .cse155 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse5))) (or (= (select .cse154 (select (select .cse155 .cse156) .cse157)) 1) (= (select .cse154 (select (select .cse155 (select (select .cse155 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) .cse158)) .cse157)) 1) (= (select .cse154 (select (select .cse159 .cse156) (+ v_arrayElimCell_108 4))) 1)))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimArr_10 (Array Int Int)) (v_prenex_12 Int) (v_prenex_11 Int) (v_prenex_13 Int) (v_arrayElimCell_108 Int)) (let ((.cse161 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse162 (let ((.cse163 (let ((.cse164 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_10)) (.cse165 (select v_arrayElimArr_10 (+ v_prenex_13 4)))) (store .cse164 .cse165 (store (select .cse164 .cse165) (+ v_arrayElimCell_108 8) |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))))) (select .cse163 (select (select .cse163 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse5))))) (or (= v_prenex_13 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) (= (select .cse161 (select .cse162 (+ v_prenex_12 4))) 1) (= (select .cse161 (select .cse162 (+ v_prenex_11 4))) 1)))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_prenex_7 Int) (v_arrayElimArr_13 (Array Int Int)) (v_arrayElimCell_108 Int) (v_prenex_8 Int)) (let ((.cse166 (select v_arrayElimArr_13 (+ v_prenex_8 4)))) (or (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse166) (= (select (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1) (select (let ((.cse167 (let ((.cse168 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_13))) (store .cse168 .cse166 (store (select .cse168 .cse166) (+ v_arrayElimCell_108 8) |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))))) (select .cse167 (select (select .cse167 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse5))) (+ v_prenex_7 4))) 1) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| v_prenex_8)))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) (forall ((v_arrayElimArr_15 (Array Int Int)) (v_prenex_2 Int) (v_prenex_3 Int) (v_arrayElimCell_102 Int) (v_arrayElimCell_108 Int)) (let ((.cse169 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse170 (let ((.cse171 (let ((.cse172 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_15)) (.cse173 (select v_arrayElimArr_15 (+ v_prenex_3 4)))) (store .cse172 .cse173 (store (select .cse172 .cse173) (+ v_arrayElimCell_108 8) |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))))) (select .cse171 (select (select .cse171 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse5))))) (or (= (select .cse169 (select .cse170 (+ v_arrayElimCell_102 4))) 1) (= (select .cse169 (select .cse170 (+ v_prenex_2 4))) 1)))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimArr_16 (Array Int Int)) (v_arrayElimCell_108 Int)) (let ((.cse175 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_16))) (let ((.cse180 (store (select .cse175 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ v_arrayElimCell_108 8) |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))) (let ((.cse176 (select .cse180 .cse5)) (.cse174 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1))) (or (= (select .cse174 (select (select .cse175 .cse176) (+ v_arrayElimCell_108 4))) 1) (forall ((v_prenex_10 Int)) (let ((.cse177 (+ v_prenex_10 4))) (or (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select v_arrayElimArr_16 .cse177))) (forall ((v_prenex_9 Int)) (let ((.cse178 (store .cse175 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse180)) (.cse179 (+ v_prenex_9 4))) (or (= (select .cse174 (select (select .cse178 .cse176) .cse179)) 1) (= (select .cse174 (select (select .cse178 (select (select .cse178 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) .cse177)) .cse179)) 1)))))))))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) (forall ((v_arrayElimArr_14 (Array Int Int)) (v_arrayElimCell_101 Int) (v_arrayElimCell_108 Int) (|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (let ((.cse183 (select v_arrayElimArr_14 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4)))) (or (= (select (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1) (select (let ((.cse181 (let ((.cse182 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_14))) (store .cse182 .cse183 (store (select .cse182 .cse183) (+ v_arrayElimCell_108 8) |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))))) (select .cse181 (select (select .cse181 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse5))) (+ v_arrayElimCell_101 4))) 1) (= .cse183 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_prenex_7 Int) (v_arrayElimArr_13 (Array Int Int)) (v_arrayElimCell_108 Int) (v_prenex_8 Int)) (let ((.cse188 (+ v_prenex_8 4))) (let ((.cse184 (select v_arrayElimArr_13 .cse188))) (let ((.cse185 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse186 (let ((.cse189 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_13))) (store .cse189 .cse184 (store (select .cse189 .cse184) (+ v_arrayElimCell_108 8) |v_ULTIMATE.start_node_create_~temp~0#1.base_31|)))) (.cse187 (+ v_prenex_7 4))) (or (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse184) (= (select .cse185 (select (select .cse186 (select (select .cse186 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse5)) .cse187)) 1) (= (select .cse185 (select (select .cse186 (select (select .cse186 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) .cse188)) .cse187)) 1) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| v_prenex_8)))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimArr_16 (Array Int Int)) (v_arrayElimCell_108 Int)) (let ((.cse192 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_16))) (let ((.cse198 (store (select .cse192 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ v_arrayElimCell_108 8) |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))) (let ((.cse191 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse196 (select .cse198 .cse5)) (.cse194 (+ v_arrayElimCell_108 4))) (or (forall ((v_prenex_10 Int)) (let ((.cse195 (store .cse192 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse198)) (.cse190 (+ v_prenex_10 4))) (let ((.cse193 (select (select .cse195 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) .cse190))) (or (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select v_arrayElimArr_16 .cse190))) (= (select .cse191 (select (select .cse192 .cse193) .cse194)) 1) (forall ((v_prenex_9 Int)) (let ((.cse197 (+ v_prenex_9 4))) (or (= (select .cse191 (select (select .cse195 .cse196) .cse197)) 1) (= (select .cse191 (select (select .cse195 .cse193) .cse197)) 1)))))))) (= (select .cse191 (select (select .cse192 .cse196) .cse194)) 1)))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimArr_11 (Array Int Int)) (v_prenex_4 Int) (v_arrayElimCell_108 Int)) (let ((.cse204 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_11))) (let ((.cse201 (store (select .cse204 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ v_arrayElimCell_108 8) |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))) (let ((.cse199 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse200 (store .cse204 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse201)) (.cse202 (+ v_prenex_4 4))) (or (= (select .cse199 (select (select .cse200 (select .cse201 .cse5)) .cse202)) 1) (forall ((v_prenex_5 Int)) (let ((.cse203 (+ v_prenex_5 4))) (or (= (select .cse199 (select (select .cse200 (select (select .cse200 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) .cse203)) .cse202)) 1) (not (= (select v_arrayElimArr_11 .cse203) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))))))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimArr_16 (Array Int Int)) (v_prenex_10 Int) (v_arrayElimCell_108 Int) (v_prenex_9 Int)) (let ((.cse210 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_16)) (.cse212 (+ v_prenex_10 4))) (let ((.cse206 (let ((.cse213 (select v_arrayElimArr_16 .cse212))) (store .cse210 .cse213 (store (select .cse210 .cse213) (+ v_arrayElimCell_108 8) |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))))) (let ((.cse208 (+ v_prenex_9 4)) (.cse207 (select (select .cse206 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse5)) (.cse205 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse209 (select (select .cse206 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) .cse212)) (.cse211 (+ v_arrayElimCell_108 4))) (or (= (select .cse205 (select (select .cse206 .cse207) .cse208)) 1) (= (select .cse205 (select (select .cse206 .cse209) .cse208)) 1) (= (select .cse205 (select (select .cse210 .cse207) .cse211)) 1) (= (select .cse205 (select (select .cse210 .cse209) .cse211)) 1)))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimArr_16 (Array Int Int)) (v_prenex_10 Int) (v_arrayElimCell_108 Int) (v_prenex_9 Int)) (let ((.cse217 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_16)) (.cse219 (+ v_prenex_10 4))) (let ((.cse215 (let ((.cse220 (select v_arrayElimArr_16 .cse219))) (store .cse217 .cse220 (store (select .cse217 .cse220) (+ v_arrayElimCell_108 8) |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))))) (let ((.cse216 (select (select .cse215 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse5)) (.cse214 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse218 (+ v_arrayElimCell_108 4))) (or (= (select .cse214 (select (select .cse215 .cse216) (+ v_prenex_9 4))) 1) (= (select .cse214 (select (select .cse217 .cse216) .cse218)) 1) (= (select .cse214 (select (select .cse217 (select (select .cse215 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) .cse219)) .cse218)) 1)))))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_prenex_6 Int) (v_arrayElimArr_12 (Array Int Int)) (v_arrayElimCell_108 Int)) (or (= (select v_arrayElimArr_12 (+ v_prenex_6 4)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (= (select (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1) (select (let ((.cse221 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_12))) (select .cse221 (select (select .cse221 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse5))) (+ v_arrayElimCell_108 4))) 1))))) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimArr_16 (Array Int Int)) (v_prenex_10 Int) (v_arrayElimCell_108 Int) (v_prenex_9 Int)) (let ((.cse226 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_16))) (let ((.cse228 (store (select .cse226 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ v_arrayElimCell_108 8) |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))) (let ((.cse223 (store .cse226 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse228)) (.cse225 (+ v_prenex_10 4)) (.cse222 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse224 (select .cse228 .cse5)) (.cse227 (+ v_arrayElimCell_108 4))) (or (= (select .cse222 (select (select .cse223 .cse224) (+ v_prenex_9 4))) 1) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select v_arrayElimArr_16 .cse225))) (= (select .cse222 (select (select .cse226 (select (select .cse223 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) .cse225)) .cse227)) 1) (= (select .cse222 (select (select .cse226 .cse224) .cse227)) 1)))))))))))) is different from true [2024-11-13 13:58:51,855 WARN L873 $PredicateComparison]: unable to prove that (or (let ((.cse110 (not (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))) (.cse111 (store |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 1)) (.cse109 (< |c_ULTIMATE.start_main_~#s~0#1.offset| 0)) (.cse5 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) (.cse4 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (.cse6 (< |c_ULTIMATE.start_main_~#s~0#1.offset| 1))) (and (or (forall ((v_arrayElimArr_10 (Array Int Int)) (v_ArrVal_2190 (Array Int Int)) (v_prenex_12 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int) (v_prenex_11 Int) (v_prenex_13 Int)) (let ((.cse0 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse1 (let ((.cse2 (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2190) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_10))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (select (store .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse3 .cse4 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|)) (select .cse3 .cse5)))))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (= v_prenex_13 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) (= (select .cse0 (select .cse1 (+ v_prenex_12 4))) 1) (= (select .cse0 (select .cse1 (+ v_prenex_11 4))) 1) (not (= (select v_arrayElimArr_10 (+ v_prenex_13 4)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))))) .cse6) (or (and (forall ((v_ArrVal_2190 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimArr_16 (Array Int Int)) (v_prenex_10 Int) (v_arrayElimCell_108 Int) (v_prenex_9 Int)) (let ((.cse8 (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2190) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_16))) (let ((.cse13 (store (select .cse8 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ v_arrayElimCell_108 8) |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))) (let ((.cse10 (+ v_arrayElimCell_108 4)) (.cse12 (+ v_prenex_10 4)) (.cse7 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse11 (store .cse8 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse13)) (.cse9 (select .cse13 .cse5))) (or (= (select .cse7 (select (select .cse8 .cse9) .cse10)) 1) (= (select .cse7 (select (select .cse8 (select (select .cse11 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) .cse12)) .cse10)) 1) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select v_arrayElimArr_16 .cse12))) (= (select .cse7 (select (select .cse11 .cse9) (+ v_prenex_9 4))) 1)))))))) (forall ((v_ArrVal_2190 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimArr_16 (Array Int Int)) (v_arrayElimCell_108 Int)) (let ((.cse15 (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2190) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_16))) (let ((.cse17 (store (select .cse15 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ v_arrayElimCell_108 8) |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))) (let ((.cse14 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse16 (select .cse17 .cse5))) (or (= (select .cse14 (select (select .cse15 .cse16) (+ v_arrayElimCell_108 4))) 1) (forall ((v_prenex_10 Int)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select v_arrayElimArr_16 (+ v_prenex_10 4))))) (forall ((v_prenex_9 Int)) (= (select .cse14 (select (select (store .cse15 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse17) .cse16) (+ v_prenex_9 4))) 1))))))))) (forall ((v_ArrVal_2190 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) (forall ((v_arrayElimArr_15 (Array Int Int)) (v_prenex_2 Int) (v_prenex_3 Int) (v_arrayElimCell_102 Int) (v_arrayElimCell_108 Int)) (let ((.cse18 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse19 (let ((.cse20 (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2190) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_15))) (let ((.cse21 (store (select .cse20 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ v_arrayElimCell_108 8) |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))) (select (store .cse20 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse21) (select .cse21 .cse5)))))) (or (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select v_arrayElimArr_15 (+ v_prenex_3 4)))) (= (select .cse18 (select .cse19 (+ v_arrayElimCell_102 4))) 1) (= (select .cse18 (select .cse19 (+ v_prenex_2 4))) 1)))))) (forall ((v_ArrVal_2190 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (forall ((v_arrayElimArr_16 (Array Int Int)) (v_prenex_10 Int) (v_arrayElimCell_108 Int) (v_prenex_9 Int)) (let ((.cse23 (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2190) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_16)) (.cse29 (+ v_prenex_10 4))) (let ((.cse26 (let ((.cse30 (select v_arrayElimArr_16 .cse29))) (store .cse23 .cse30 (store (select .cse23 .cse30) (+ v_arrayElimCell_108 8) |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))))) (let ((.cse24 (select (select .cse26 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse5)) (.cse25 (+ v_arrayElimCell_108 4)) (.cse22 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse28 (select (select .cse26 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) .cse29)) (.cse27 (+ v_prenex_9 4))) (or (= (select .cse22 (select (select .cse23 .cse24) .cse25)) 1) (= (select .cse22 (select (select .cse26 .cse24) .cse27)) 1) (= (select .cse22 (select (select .cse23 .cse28) .cse25)) 1) (= (select .cse22 (select (select .cse26 .cse28) .cse27)) 1)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)))) (forall ((v_ArrVal_2190 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimArr_16 (Array Int Int)) (v_prenex_10 Int) (v_arrayElimCell_108 Int) (v_prenex_9 Int)) (let ((.cse32 (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2190) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_16)) (.cse36 (+ v_prenex_10 4))) (let ((.cse34 (let ((.cse37 (select v_arrayElimArr_16 .cse36))) (store .cse32 .cse37 (store (select .cse32 .cse37) (+ v_arrayElimCell_108 8) |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))))) (let ((.cse33 (select (select .cse34 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse5)) (.cse31 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse35 (+ v_prenex_9 4))) (or (= (select .cse31 (select (select .cse32 .cse33) (+ v_arrayElimCell_108 4))) 1) (= (select .cse31 (select (select .cse34 .cse33) .cse35)) 1) (= (select .cse31 (select (select .cse34 (select (select .cse34 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) .cse36)) .cse35)) 1)))))))) (forall ((v_ArrVal_2190 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimArr_16 (Array Int Int)) (v_prenex_10 Int) (v_arrayElimCell_108 Int) (v_prenex_9 Int)) (let ((.cse39 (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2190) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_16))) (let ((.cse41 (let ((.cse42 (select v_arrayElimArr_16 (+ v_prenex_10 4)))) (store .cse39 .cse42 (store (select .cse39 .cse42) (+ v_arrayElimCell_108 8) |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))))) (let ((.cse38 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse40 (select (select .cse41 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse5))) (or (= (select .cse38 (select (select .cse39 .cse40) (+ v_arrayElimCell_108 4))) 1) (= (select .cse38 (select (select .cse41 .cse40) (+ v_prenex_9 4))) 1)))))))) (forall ((v_ArrVal_2190 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_prenex_6 Int) (v_arrayElimArr_12 (Array Int Int)) (v_arrayElimCell_108 Int)) (let ((.cse44 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse45 (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2190) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_12)) (.cse43 (select v_arrayElimArr_12 (+ v_prenex_6 4))) (.cse46 (+ v_arrayElimCell_108 4))) (or (= .cse43 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (= (select .cse44 (select (select .cse45 (select (select .cse45 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse5)) .cse46)) 1) (= (select .cse44 (select (select .cse45 .cse43) .cse46)) 1)))))) (forall ((v_ArrVal_2190 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimArr_14 (Array Int Int)) (v_arrayElimCell_101 Int) (v_arrayElimCell_108 Int) (|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (let ((.cse49 (select v_arrayElimArr_14 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4)))) (or (= (select (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1) (select (let ((.cse47 (let ((.cse48 (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2190) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_14))) (store .cse48 .cse49 (store (select .cse48 .cse49) (+ v_arrayElimCell_108 8) |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))))) (select .cse47 (select (select .cse47 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse5))) (+ v_arrayElimCell_101 4))) 1) (= .cse49 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))) (forall ((v_ArrVal_2190 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimArr_16 (Array Int Int)) (v_arrayElimCell_108 Int)) (let ((.cse51 (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2190) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_16))) (let ((.cse58 (store (select .cse51 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ v_arrayElimCell_108 8) |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))) (let ((.cse53 (+ v_arrayElimCell_108 4)) (.cse52 (select .cse58 .cse5)) (.cse50 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1))) (or (= (select .cse50 (select (select .cse51 .cse52) .cse53)) 1) (forall ((v_prenex_10 Int)) (let ((.cse55 (store .cse51 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse58)) (.cse57 (+ v_prenex_10 4))) (let ((.cse54 (select (select .cse55 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) .cse57))) (or (= (select .cse50 (select (select .cse51 .cse54) .cse53)) 1) (forall ((v_prenex_9 Int)) (let ((.cse56 (+ v_prenex_9 4))) (or (= (select .cse50 (select (select .cse55 .cse52) .cse56)) 1) (= (select .cse50 (select (select .cse55 .cse54) .cse56)) 1)))) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select v_arrayElimArr_16 .cse57)))))))))))))) (forall ((v_ArrVal_2190 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimArr_16 (Array Int Int)) (v_arrayElimCell_108 Int)) (let ((.cse60 (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2190) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_16))) (let ((.cse65 (store (select .cse60 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ v_arrayElimCell_108 8) |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))) (let ((.cse61 (select .cse65 .cse5)) (.cse59 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1))) (or (= (select .cse59 (select (select .cse60 .cse61) (+ v_arrayElimCell_108 4))) 1) (forall ((v_prenex_10 Int)) (let ((.cse64 (+ v_prenex_10 4))) (or (forall ((v_prenex_9 Int)) (let ((.cse62 (store .cse60 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse65)) (.cse63 (+ v_prenex_9 4))) (or (= (select .cse59 (select (select .cse62 .cse61) .cse63)) 1) (= (select .cse59 (select (select .cse62 (select (select .cse62 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) .cse64)) .cse63)) 1)))) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select v_arrayElimArr_16 .cse64))))))))))))) (forall ((v_ArrVal_2190 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimArr_11 (Array Int Int)) (v_prenex_4 Int) (v_arrayElimCell_108 Int)) (let ((.cse71 (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2190) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_11))) (let ((.cse68 (store (select .cse71 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ v_arrayElimCell_108 8) |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))) (let ((.cse66 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse67 (store .cse71 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse68)) (.cse69 (+ v_prenex_4 4))) (or (= (select .cse66 (select (select .cse67 (select .cse68 .cse5)) .cse69)) 1) (forall ((v_prenex_5 Int)) (let ((.cse70 (+ v_prenex_5 4))) (or (= (select .cse66 (select (select .cse67 (select (select .cse67 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) .cse70)) .cse69)) 1) (not (= (select v_arrayElimArr_11 .cse70) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))))))))))) (forall ((v_ArrVal_2190 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimArr_11 (Array Int Int)) (v_prenex_4 Int) (v_prenex_5 Int) (v_arrayElimCell_108 Int)) (or (= (select (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1) (select (let ((.cse72 (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2190) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_11))) (let ((.cse73 (store (select .cse72 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ v_arrayElimCell_108 8) |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))) (select (store .cse72 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse73) (select .cse73 .cse5)))) (+ v_prenex_4 4))) 1) (not (= (select v_arrayElimArr_11 (+ v_prenex_5 4)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))))) (forall ((v_ArrVal_2190 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_prenex_7 Int) (v_arrayElimArr_13 (Array Int Int)) (v_arrayElimCell_108 Int) (v_prenex_8 Int)) (let ((.cse74 (select v_arrayElimArr_13 (+ v_prenex_8 4)))) (or (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse74) (= (select (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1) (select (let ((.cse75 (let ((.cse76 (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2190) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_13))) (store .cse76 .cse74 (store (select .cse76 .cse74) (+ v_arrayElimCell_108 8) |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))))) (select .cse75 (select (select .cse75 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse5))) (+ v_prenex_7 4))) 1) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| v_prenex_8)))))) (forall ((v_ArrVal_2190 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimArr_10 (Array Int Int)) (v_prenex_12 Int) (v_prenex_11 Int) (v_prenex_13 Int) (v_arrayElimCell_108 Int)) (let ((.cse77 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse78 (let ((.cse79 (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2190) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_10))) (let ((.cse80 (store (select .cse79 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ v_arrayElimCell_108 8) |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))) (select (store .cse79 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse80) (select .cse80 .cse5)))))) (or (= v_prenex_13 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) (= (select .cse77 (select .cse78 (+ v_prenex_11 4))) 1) (not (= (select v_arrayElimArr_10 (+ v_prenex_13 4)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= (select .cse77 (select .cse78 (+ v_prenex_12 4))) 1)))))) (forall ((v_ArrVal_2190 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimArr_16 (Array Int Int)) (v_prenex_10 Int) (v_arrayElimCell_108 Int) (v_prenex_9 Int)) (let ((.cse82 (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2190) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_16)) (.cse86 (+ v_prenex_10 4))) (let ((.cse85 (let ((.cse87 (select v_arrayElimArr_16 .cse86))) (store .cse82 .cse87 (store (select .cse82 .cse87) (+ v_arrayElimCell_108 8) |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))))) (let ((.cse83 (select (select .cse85 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse5)) (.cse81 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse84 (+ v_arrayElimCell_108 4))) (or (= (select .cse81 (select (select .cse82 .cse83) .cse84)) 1) (= (select .cse81 (select (select .cse85 .cse83) (+ v_prenex_9 4))) 1) (= (select .cse81 (select (select .cse82 (select (select .cse85 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) .cse86)) .cse84)) 1)))))))) (forall ((v_ArrVal_2190 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) (forall ((v_arrayElimArr_15 (Array Int Int)) (v_prenex_2 Int) (v_prenex_3 Int) (v_arrayElimCell_102 Int) (v_arrayElimCell_108 Int)) (let ((.cse88 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse89 (let ((.cse90 (let ((.cse91 (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2190) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_15)) (.cse92 (select v_arrayElimArr_15 (+ v_prenex_3 4)))) (store .cse91 .cse92 (store (select .cse91 .cse92) (+ v_arrayElimCell_108 8) |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))))) (select .cse90 (select (select .cse90 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse5))))) (or (= (select .cse88 (select .cse89 (+ v_arrayElimCell_102 4))) 1) (= (select .cse88 (select .cse89 (+ v_prenex_2 4))) 1)))))) (forall ((v_ArrVal_2190 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimArr_10 (Array Int Int)) (v_prenex_12 Int) (v_prenex_11 Int) (v_prenex_13 Int) (v_arrayElimCell_108 Int)) (let ((.cse93 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse94 (let ((.cse95 (let ((.cse96 (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2190) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_10)) (.cse97 (select v_arrayElimArr_10 (+ v_prenex_13 4)))) (store .cse96 .cse97 (store (select .cse96 .cse97) (+ v_arrayElimCell_108 8) |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))))) (select .cse95 (select (select .cse95 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse5))))) (or (= v_prenex_13 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) (= (select .cse93 (select .cse94 (+ v_prenex_12 4))) 1) (= (select .cse93 (select .cse94 (+ v_prenex_11 4))) 1)))))) (forall ((v_ArrVal_2190 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_prenex_7 Int) (v_arrayElimArr_13 (Array Int Int)) (v_arrayElimCell_108 Int) (v_prenex_8 Int)) (let ((.cse101 (+ v_prenex_8 4))) (let ((.cse98 (select v_arrayElimArr_13 .cse101))) (let ((.cse99 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse100 (let ((.cse103 (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2190) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_13))) (store .cse103 .cse98 (store (select .cse103 .cse98) (+ v_arrayElimCell_108 8) |v_ULTIMATE.start_node_create_~temp~0#1.base_31|)))) (.cse102 (+ v_prenex_7 4))) (or (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse98) (= (select .cse99 (select (select .cse100 (select (select .cse100 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) .cse101)) .cse102)) 1) (= (select .cse99 (select (select .cse100 (select (select .cse100 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse5)) .cse102)) 1) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| v_prenex_8)))))))) (forall ((v_ArrVal_2190 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_prenex_6 Int) (v_arrayElimArr_12 (Array Int Int)) (v_arrayElimCell_108 Int)) (or (= (select v_arrayElimArr_12 (+ v_prenex_6 4)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (= (select (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1) (select (let ((.cse104 (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2190) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_12))) (select .cse104 (select (select .cse104 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse5))) (+ v_arrayElimCell_108 4))) 1)))))) .cse6) (or (and (forall ((v_ArrVal_2190 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) (forall ((v_prenex_6 Int) (v_arrayElimArr_12 (Array Int Int))) (let ((.cse105 (select v_arrayElimArr_12 (+ v_prenex_6 4)))) (or (not (= .cse105 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= (select (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1) (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2190) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_12) .cse105) .cse5)) 1)))))) (forall ((v_ArrVal_2190 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimArr_12 (Array Int Int))) (let ((.cse106 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse107 (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2190) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_12))) (or (= (select .cse106 (select (select .cse107 (select (select .cse107 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse5)) .cse5)) 1) (forall ((v_prenex_6 Int)) (let ((.cse108 (select v_arrayElimArr_12 (+ v_prenex_6 4)))) (or (not (= .cse108 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= (select .cse106 (select (select .cse107 .cse108) .cse5)) 1))))))) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|)))) .cse109) (or .cse109 .cse110 (forall ((v_prenex_4 Int) (v_ArrVal_2190 (Array Int Int)) (v_arrayElimArr_17 (Array Int Int))) (let ((.cse112 (+ v_prenex_4 4))) (or (= (select .cse111 (select v_arrayElimArr_17 .cse112)) 1) (= (select .cse111 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2190) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_17) (select v_arrayElimArr_17 .cse5)) .cse112)) 1) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select v_arrayElimArr_17 .cse4))))))) (or .cse109 (forall ((v_ArrVal_2190 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int) (v_arrayElimArr_16 (Array Int Int)) (v_prenex_10 Int) (v_prenex_9 Int)) (let ((.cse114 (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2190) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_16))) (let ((.cse120 (select .cse114 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (let ((.cse118 (store .cse114 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse120 .cse4 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))) (.cse117 (+ v_prenex_10 4))) (let ((.cse115 (select .cse120 .cse5)) (.cse113 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse116 (select (select .cse118 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) .cse117)) (.cse119 (+ v_prenex_9 4))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (= (select .cse113 (select (select .cse114 .cse115) .cse5)) 1) (= (select .cse113 (select (select .cse114 .cse116) .cse5)) 1) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select v_arrayElimArr_16 .cse117))) (= (select .cse113 (select (select .cse118 .cse115) .cse119)) 1) (= (select .cse113 (select (select .cse118 .cse116) .cse119)) 1)))))))) (or .cse109 .cse110 (and (forall ((v_arrayElimCell_114 Int)) (= (select .cse111 v_arrayElimCell_114) 1)) (forall ((v_ArrVal_2190 (Array Int Int)) (v_arrayElimArr_18 (Array Int Int))) (or (forall ((v_prenex_5 Int)) (let ((.cse121 (select v_arrayElimArr_18 (+ v_prenex_5 4)))) (or (not (= .cse121 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (forall ((v_prenex_4 Int)) (= (select .cse111 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2190) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_18) .cse121) (+ v_prenex_4 4))) 1)) (= v_prenex_5 .cse5)))) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select v_arrayElimArr_18 .cse4))))))) (or (forall ((v_ArrVal_2190 (Array Int Int)) (v_arrayElimArr_15 (Array Int Int)) (v_prenex_2 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int) (v_prenex_3 Int) (v_arrayElimCell_102 Int)) (let ((.cse122 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse123 (let ((.cse124 (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2190) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_15))) (let ((.cse125 (select .cse124 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (select (store .cse124 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse125 .cse4 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|)) (select .cse125 .cse5)))))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (= (select .cse122 (select .cse123 (+ v_prenex_2 4))) 1) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select v_arrayElimArr_15 (+ v_prenex_3 4)))) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) (= (select .cse122 (select .cse123 (+ v_arrayElimCell_102 4))) 1)))) .cse6) (or .cse109 (forall ((v_ArrVal_2190 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int) (v_arrayElimArr_16 (Array Int Int)) (v_prenex_10 Int) (v_prenex_9 Int)) (let ((.cse127 (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2190) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_16))) (let ((.cse128 (select .cse127 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (let ((.cse131 (store .cse127 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse128 .cse4 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))) (.cse130 (+ v_prenex_10 4))) (let ((.cse126 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse129 (select (select .cse131 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) .cse130))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (= (select .cse126 (select (select .cse127 (select .cse128 .cse5)) .cse5)) 1) (= (select .cse126 (select (select .cse127 .cse129) .cse5)) 1) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select v_arrayElimArr_16 .cse130))) (= (select .cse126 (select (select .cse131 .cse129) (+ v_prenex_9 4))) 1)))))))) (or (forall ((v_ArrVal_2190 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int) (v_arrayElimArr_16 (Array Int Int)) (v_prenex_10 Int) (v_prenex_9 Int)) (let ((.cse133 (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2190) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_16))) (let ((.cse137 (select .cse133 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (let ((.cse136 (+ v_prenex_10 4)) (.cse132 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse135 (store .cse133 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse137 .cse4 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))) (.cse134 (select .cse137 .cse5))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (= (select .cse132 (select (select .cse133 .cse134) .cse5)) 1) (= (select .cse132 (select (select .cse133 (select (select .cse135 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) .cse136)) .cse5)) 1) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select v_arrayElimArr_16 .cse136))) (= (select .cse132 (select (select .cse135 .cse134) (+ v_prenex_9 4))) 1)))))) .cse6) (or (and (forall ((v_ArrVal_2190 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimArr_16 (Array Int Int))) (let ((.cse139 (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2190) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_16))) (let ((.cse144 (select .cse139 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (let ((.cse140 (select .cse144 .cse5)) (.cse138 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1))) (or (= (select .cse138 (select (select .cse139 .cse140) .cse5)) 1) (forall ((v_prenex_10 Int)) (let ((.cse143 (+ v_prenex_10 4))) (or (forall ((v_prenex_9 Int)) (let ((.cse141 (store .cse139 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse144 .cse4 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))) (.cse142 (+ v_prenex_9 4))) (or (= (select .cse138 (select (select .cse141 .cse140) .cse142)) 1) (= (select .cse138 (select (select .cse141 (select (select .cse141 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) .cse143)) .cse142)) 1)))) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select v_arrayElimArr_16 .cse143))))))))))))) (forall ((v_ArrVal_2190 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimArr_16 (Array Int Int))) (let ((.cse146 (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2190) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_16))) (let ((.cse147 (select .cse146 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (let ((.cse145 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse148 (select .cse147 .cse5))) (or (forall ((v_prenex_9 Int)) (= (select .cse145 (select (select (store .cse146 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse147 .cse4 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|)) .cse148) (+ v_prenex_9 4))) 1)) (= (select .cse145 (select (select .cse146 .cse148) .cse5)) 1) (forall ((v_prenex_10 Int)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select v_arrayElimArr_16 (+ v_prenex_10 4))))))))))))) .cse6) (or .cse109 (and (forall ((v_ArrVal_2190 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimArr_16 (Array Int Int)) (v_prenex_10 Int)) (let ((.cse154 (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2190) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_16))) (let ((.cse151 (select .cse154 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (let ((.cse150 (store .cse154 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse151 .cse4 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))) (.cse155 (+ v_prenex_10 4))) (let ((.cse149 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse153 (select (select .cse150 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) .cse155))) (or (forall ((v_prenex_9 Int)) (let ((.cse152 (+ v_prenex_9 4))) (or (= (select .cse149 (select (select .cse150 (select .cse151 .cse5)) .cse152)) 1) (= (select .cse149 (select (select .cse150 .cse153) .cse152)) 1)))) (= (select .cse149 (select (select .cse154 .cse153) .cse5)) 1) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select v_arrayElimArr_16 .cse155))))))))))) (forall ((v_ArrVal_2190 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimArr_16 (Array Int Int)) (v_prenex_10 Int) (v_prenex_9 Int)) (let ((.cse157 (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2190) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_16))) (let ((.cse160 (store .cse157 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select .cse157 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse4 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))) (.cse159 (+ v_prenex_10 4))) (let ((.cse156 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse158 (select (select .cse160 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) .cse159))) (or (= (select .cse156 (select (select .cse157 .cse158) .cse5)) 1) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select v_arrayElimArr_16 .cse159))) (= (select .cse156 (select (select .cse160 .cse158) (+ v_prenex_9 4))) 1)))))))))) (or (forall ((v_arrayElimArr_11 (Array Int Int)) (v_prenex_4 Int) (v_ArrVal_2190 (Array Int Int)) (v_prenex_5 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (= 1 (select (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1) (select (let ((.cse161 (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2190) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_11))) (let ((.cse162 (select .cse161 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (select (store .cse161 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse162 .cse4 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|)) (select .cse162 .cse5)))) (+ v_prenex_4 4)))) (not (= (select v_arrayElimArr_11 (+ v_prenex_5 4)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))) .cse6) (or (forall ((v_arrayElimArr_11 (Array Int Int)) (v_prenex_4 Int) (v_ArrVal_2190 (Array Int Int)) (v_prenex_5 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (let ((.cse168 (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2190) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_11))) (let ((.cse167 (select .cse168 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (let ((.cse163 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse164 (store .cse168 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse167 .cse4 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))) (.cse166 (+ v_prenex_4 4)) (.cse165 (+ v_prenex_5 4))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (= (select .cse163 (select (select .cse164 (select (select .cse164 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) .cse165)) .cse166)) 1) (= 1 (select .cse163 (select (select .cse164 (select .cse167 .cse5)) .cse166))) (not (= (select v_arrayElimArr_11 .cse165) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))))))) .cse6) (or (and (forall ((v_ArrVal_2190 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) (forall ((v_arrayElimArr_15 (Array Int Int)) (v_prenex_2 Int) (v_prenex_3 Int) (v_arrayElimCell_102 Int)) (let ((.cse169 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse170 (let ((.cse171 (let ((.cse172 (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2190) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_15)) (.cse173 (select v_arrayElimArr_15 (+ v_prenex_3 4)))) (store .cse172 .cse173 (store (select .cse172 .cse173) .cse4 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))))) (select .cse171 (select (select .cse171 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse5))))) (or (= (select .cse169 (select .cse170 (+ v_arrayElimCell_102 4))) 1) (= (select .cse169 (select .cse170 (+ v_prenex_2 4))) 1)))))) (forall ((v_ArrVal_2190 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimArr_16 (Array Int Int)) (v_prenex_10 Int) (v_prenex_9 Int)) (let ((.cse175 (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2190) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_16))) (let ((.cse177 (let ((.cse178 (select v_arrayElimArr_16 (+ v_prenex_10 4)))) (store .cse175 .cse178 (store (select .cse175 .cse178) .cse4 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))))) (let ((.cse174 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse176 (select (select .cse177 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse5))) (or (= (select .cse174 (select (select .cse175 .cse176) .cse5)) 1) (= (select .cse174 (select (select .cse177 .cse176) (+ v_prenex_9 4))) 1)))))))) (forall ((v_ArrVal_2190 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_prenex_7 Int) (v_arrayElimArr_13 (Array Int Int)) (v_prenex_8 Int)) (let ((.cse179 (select v_arrayElimArr_13 (+ v_prenex_8 4)))) (or (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse179) (= (select (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1) (select (let ((.cse180 (let ((.cse181 (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2190) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_13))) (store .cse181 .cse179 (store (select .cse181 .cse179) .cse4 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))))) (select .cse180 (select (select .cse180 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse5))) (+ v_prenex_7 4))) 1) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| v_prenex_8)))))) (forall ((v_ArrVal_2190 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimArr_11 (Array Int Int)) (v_prenex_4 Int) (v_prenex_5 Int)) (or (= 1 (select (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1) (select (let ((.cse182 (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2190) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_11))) (let ((.cse183 (select .cse182 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (select (store .cse182 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse183 .cse4 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|)) (select .cse183 .cse5)))) (+ v_prenex_4 4)))) (not (= (select v_arrayElimArr_11 (+ v_prenex_5 4)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))))) (forall ((v_ArrVal_2190 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) (forall ((v_arrayElimArr_14 (Array Int Int)) (v_arrayElimCell_101 Int) (|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (let ((.cse184 (select v_arrayElimArr_14 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4)))) (or (= .cse184 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (= (select (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1) (select (let ((.cse185 (let ((.cse186 (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2190) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_14))) (store .cse186 .cse184 (store (select .cse186 .cse184) .cse4 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))))) (select .cse185 (select (select .cse185 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse5))) (+ v_arrayElimCell_101 4))) 1)))))) (forall ((v_ArrVal_2190 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimArr_11 (Array Int Int)) (v_prenex_4 Int)) (let ((.cse192 (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2190) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_11))) (let ((.cse191 (select .cse192 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (let ((.cse187 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse188 (store .cse192 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse191 .cse4 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))) (.cse190 (+ v_prenex_4 4))) (or (forall ((v_prenex_5 Int)) (let ((.cse189 (+ v_prenex_5 4))) (or (= (select .cse187 (select (select .cse188 (select (select .cse188 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) .cse189)) .cse190)) 1) (not (= (select v_arrayElimArr_11 .cse189) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))))) (= 1 (select .cse187 (select (select .cse188 (select .cse191 .cse5)) .cse190)))))))))) (forall ((v_ArrVal_2190 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimArr_16 (Array Int Int)) (v_prenex_10 Int) (v_prenex_9 Int)) (let ((.cse197 (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2190) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_16)) (.cse195 (+ v_prenex_10 4))) (let ((.cse194 (let ((.cse199 (select v_arrayElimArr_16 .cse195))) (store .cse197 .cse199 (store (select .cse197 .cse199) .cse4 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))))) (let ((.cse193 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse198 (select (select .cse194 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse5)) (.cse196 (+ v_prenex_9 4))) (or (= (select .cse193 (select (select .cse194 (select (select .cse194 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) .cse195)) .cse196)) 1) (= (select .cse193 (select (select .cse197 .cse198) .cse5)) 1) (= (select .cse193 (select (select .cse194 .cse198) .cse196)) 1)))))))) (forall ((v_ArrVal_2190 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimArr_16 (Array Int Int)) (v_prenex_10 Int) (v_prenex_9 Int)) (let ((.cse201 (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2190) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_16)) (.cse206 (+ v_prenex_10 4))) (let ((.cse203 (let ((.cse207 (select v_arrayElimArr_16 .cse206))) (store .cse201 .cse207 (store (select .cse201 .cse207) .cse4 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))))) (let ((.cse202 (select (select .cse203 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) .cse206)) (.cse200 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse205 (select (select .cse203 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse5)) (.cse204 (+ v_prenex_9 4))) (or (= (select .cse200 (select (select .cse201 .cse202) .cse5)) 1) (= (select .cse200 (select (select .cse203 .cse202) .cse204)) 1) (= (select .cse200 (select (select .cse201 .cse205) .cse5)) 1) (= (select .cse200 (select (select .cse203 .cse205) .cse204)) 1)))))))) (forall ((v_ArrVal_2190 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (forall ((v_arrayElimArr_10 (Array Int Int)) (v_prenex_12 Int) (v_prenex_11 Int) (v_prenex_13 Int)) (let ((.cse208 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse209 (let ((.cse210 (let ((.cse211 (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2190) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_10)) (.cse212 (select v_arrayElimArr_10 (+ v_prenex_13 4)))) (store .cse211 .cse212 (store (select .cse211 .cse212) .cse4 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))))) (select .cse210 (select (select .cse210 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse5))))) (or (= (select .cse208 (select .cse209 (+ v_prenex_11 4))) 1) (= v_prenex_13 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) (= 1 (select .cse208 (select .cse209 (+ v_prenex_12 4))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)))) (forall ((v_ArrVal_2190 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_prenex_6 Int) (v_arrayElimArr_12 (Array Int Int))) (let ((.cse213 (select v_arrayElimArr_12 (+ v_prenex_6 4))) (.cse214 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse215 (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2190) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_12))) (or (= .cse213 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (= (select .cse214 (select (select .cse215 .cse213) .cse5)) 1) (= (select .cse214 (select (select .cse215 (select (select .cse215 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse5)) .cse5)) 1)))))) (forall ((v_ArrVal_2190 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimArr_16 (Array Int Int)) (v_prenex_10 Int) (v_prenex_9 Int)) (let ((.cse217 (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2190) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_16)) (.cse219 (+ v_prenex_10 4))) (let ((.cse218 (let ((.cse221 (select v_arrayElimArr_16 .cse219))) (store .cse217 .cse221 (store (select .cse217 .cse221) .cse4 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))))) (let ((.cse216 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse220 (select (select .cse218 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse5))) (or (= (select .cse216 (select (select .cse217 (select (select .cse218 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) .cse219)) .cse5)) 1) (= (select .cse216 (select (select .cse217 .cse220) .cse5)) 1) (= (select .cse216 (select (select .cse218 .cse220) (+ v_prenex_9 4))) 1)))))))) (forall ((v_ArrVal_2190 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_prenex_6 Int) (v_arrayElimArr_12 (Array Int Int))) (or (= (select v_arrayElimArr_12 (+ v_prenex_6 4)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (= (select (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1) (select (let ((.cse222 (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2190) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_12))) (select .cse222 (select (select .cse222 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse5))) .cse5)) 1))))) (forall ((v_ArrVal_2190 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_prenex_7 Int) (v_arrayElimArr_13 (Array Int Int)) (v_prenex_8 Int)) (let ((.cse227 (+ v_prenex_8 4))) (let ((.cse223 (select v_arrayElimArr_13 .cse227))) (let ((.cse224 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse225 (let ((.cse228 (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2190) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_13))) (store .cse228 .cse223 (store (select .cse228 .cse223) .cse4 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|)))) (.cse226 (+ v_prenex_7 4))) (or (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse223) (= (select .cse224 (select (select .cse225 (select (select .cse225 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse5)) .cse226)) 1) (= (select .cse224 (select (select .cse225 (select (select .cse225 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) .cse227)) .cse226)) 1) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| v_prenex_8))))))))) .cse6))) (not (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1))) is different from true [2024-11-13 13:59:00,253 WARN L873 $PredicateComparison]: unable to prove that (or (not (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1)) (let ((.cse45 (not (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))) (.cse46 (store |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 1)) (.cse7 (< |c_ULTIMATE.start_main_~#s~0#1.offset| 0)) (.cse4 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) (.cse5 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse3 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (.cse6 (< |c_ULTIMATE.start_main_~#s~0#1.offset| 1))) (and (or (forall ((v_ArrVal_2190 (Array Int Int)) (v_arrayElimArr_15 (Array Int Int)) (v_ArrVal_2188 Int) (v_prenex_2 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int) (v_prenex_3 Int) (v_arrayElimCell_102 Int)) (let ((.cse0 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse1 (let ((.cse2 (select (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse5 .cse3 v_ArrVal_2188)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2190) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_15) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (select (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2190) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_15) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse2 .cse3 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|)) (select .cse2 .cse4))))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select v_arrayElimArr_15 (+ v_prenex_3 4)))) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) (= (select .cse0 (select .cse1 (+ v_arrayElimCell_102 4))) 1) (= (select .cse0 (select .cse1 (+ v_prenex_2 4))) 1)))) .cse6) (or .cse7 (forall ((v_ArrVal_2190 (Array Int Int)) (v_ArrVal_2188 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int) (v_arrayElimArr_16 (Array Int Int)) (v_prenex_10 Int) (v_prenex_9 Int)) (let ((.cse9 (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse5 .cse3 v_ArrVal_2188)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2190) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_16))) (let ((.cse11 (select .cse9 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (let ((.cse12 (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2190) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_16) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse11 .cse3 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))) (.cse13 (+ v_prenex_10 4))) (let ((.cse8 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse10 (select (select .cse12 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) .cse13))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (= 1 (select .cse8 (select (select .cse9 .cse10) .cse4))) (= (select .cse8 (select (select .cse9 (select .cse11 .cse4)) .cse4)) 1) (= (select .cse8 (select (select .cse12 .cse10) (+ v_prenex_9 4))) 1) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select v_arrayElimArr_16 .cse13)))))))))) (or .cse7 (forall ((v_ArrVal_2190 (Array Int Int)) (v_ArrVal_2188 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int) (v_arrayElimArr_16 (Array Int Int)) (v_prenex_10 Int) (v_prenex_9 Int)) (let ((.cse15 (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse5 .cse3 v_ArrVal_2188)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2190) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_16))) (let ((.cse21 (select .cse15 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (let ((.cse18 (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2190) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_16) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse21 .cse3 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))) (.cse20 (+ v_prenex_10 4))) (let ((.cse16 (select (select .cse18 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) .cse20)) (.cse14 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse17 (select .cse21 .cse4)) (.cse19 (+ v_prenex_9 4))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (= 1 (select .cse14 (select (select .cse15 .cse16) .cse4))) (= (select .cse14 (select (select .cse15 .cse17) .cse4)) 1) (= (select .cse14 (select (select .cse18 .cse16) .cse19)) 1) (= (select .cse14 (select (select .cse18 .cse17) .cse19)) 1) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select v_arrayElimArr_16 .cse20)))))))))) (or (and (forall ((v_ArrVal_2190 (Array Int Int)) (v_ArrVal_2188 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimArr_16 (Array Int Int)) (v_prenex_10 Int)) (let ((.cse23 (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse5 .cse3 v_ArrVal_2188)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2190) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_16))) (let ((.cse27 (select .cse23 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (let ((.cse25 (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2190) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_16) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse27 .cse3 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))) (.cse28 (+ v_prenex_10 4))) (let ((.cse24 (select (select .cse25 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) .cse28)) (.cse22 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1))) (or (= 1 (select .cse22 (select (select .cse23 .cse24) .cse4))) (forall ((v_prenex_9 Int)) (let ((.cse26 (+ v_prenex_9 4))) (or (= (select .cse22 (select (select .cse25 .cse24) .cse26)) 1) (= (select .cse22 (select (select .cse25 (select .cse27 .cse4)) .cse26)) 1)))) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select v_arrayElimArr_16 .cse28))))))))))) (forall ((v_ArrVal_2190 (Array Int Int)) (v_ArrVal_2188 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimArr_16 (Array Int Int)) (v_prenex_10 Int) (v_prenex_9 Int)) (let ((.cse30 (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse5 .cse3 v_ArrVal_2188)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2190) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_16))) (let ((.cse32 (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2190) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_16) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select .cse30 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse3 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))) (.cse33 (+ v_prenex_10 4))) (let ((.cse29 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse31 (select (select .cse32 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) .cse33))) (or (= 1 (select .cse29 (select (select .cse30 .cse31) .cse4))) (= (select .cse29 (select (select .cse32 .cse31) (+ v_prenex_9 4))) 1) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select v_arrayElimArr_16 .cse33))))))))))) .cse7) (or (and (forall ((v_ArrVal_2190 (Array Int Int)) (v_ArrVal_2188 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimArr_16 (Array Int Int))) (let ((.cse35 (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse5 .cse3 v_ArrVal_2188)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2190) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_16))) (let ((.cse37 (select .cse35 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (let ((.cse34 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse36 (select .cse37 .cse4))) (or (= (select .cse34 (select (select .cse35 .cse36) .cse4)) 1) (forall ((v_prenex_10 Int)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select v_arrayElimArr_16 (+ v_prenex_10 4))))) (forall ((v_prenex_9 Int)) (= (select .cse34 (select (select (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2190) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_16) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse37 .cse3 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|)) .cse36) (+ v_prenex_9 4))) 1))))))))) (forall ((v_ArrVal_2190 (Array Int Int)) (v_ArrVal_2188 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimArr_16 (Array Int Int))) (let ((.cse39 (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse5 .cse3 v_ArrVal_2188)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2190) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_16))) (let ((.cse44 (select .cse39 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (let ((.cse38 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse40 (select .cse44 .cse4))) (or (= (select .cse38 (select (select .cse39 .cse40) .cse4)) 1) (forall ((v_prenex_10 Int)) (let ((.cse42 (+ v_prenex_10 4))) (or (forall ((v_prenex_9 Int)) (let ((.cse41 (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2190) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_16) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse44 .cse3 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))) (.cse43 (+ v_prenex_9 4))) (or (= (select .cse38 (select (select .cse41 (select (select .cse41 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) .cse42)) .cse43)) 1) (= (select .cse38 (select (select .cse41 .cse40) .cse43)) 1)))) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select v_arrayElimArr_16 .cse42)))))))))))))) .cse6) (or .cse7 .cse45 (forall ((v_prenex_4 Int) (v_ArrVal_2190 (Array Int Int)) (v_arrayElimArr_17 (Array Int Int))) (let ((.cse47 (+ v_prenex_4 4))) (or (= (select .cse46 (select v_arrayElimArr_17 .cse47)) 1) (= (select .cse46 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2190) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_17) (select v_arrayElimArr_17 .cse4)) .cse47)) 1) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select v_arrayElimArr_17 .cse3))))))) (or .cse6 (and (forall ((v_ArrVal_2190 (Array Int Int)) (v_ArrVal_2188 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimArr_10 (Array Int Int)) (v_prenex_12 Int) (v_prenex_11 Int) (v_prenex_13 Int)) (let ((.cse48 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse49 (let ((.cse50 (let ((.cse51 (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse5 .cse3 v_ArrVal_2188)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2190) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_10)) (.cse52 (select v_arrayElimArr_10 (+ v_prenex_13 4)))) (store .cse51 .cse52 (store (select .cse51 .cse52) .cse3 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))))) (select .cse50 (select (select .cse50 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse4))))) (or (= v_prenex_13 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) (= (select .cse48 (select .cse49 (+ v_prenex_11 4))) 1) (= (select .cse48 (select .cse49 (+ v_prenex_12 4))) 1)))))) (forall ((v_ArrVal_2190 (Array Int Int)) (v_ArrVal_2188 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimArr_16 (Array Int Int)) (v_prenex_10 Int) (v_prenex_9 Int)) (let ((.cse56 (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse5 .cse3 v_ArrVal_2188)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2190) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_16)) (.cse57 (+ v_prenex_10 4))) (let ((.cse54 (let ((.cse58 (select v_arrayElimArr_16 .cse57))) (store .cse56 .cse58 (store (select .cse56 .cse58) .cse3 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))))) (let ((.cse55 (select (select .cse54 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse4)) (.cse53 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1))) (or (= (select .cse53 (select (select .cse54 .cse55) (+ v_prenex_9 4))) 1) (= (select .cse53 (select (select .cse56 .cse55) .cse4)) 1) (= (select .cse53 (select (select .cse56 (select (select .cse54 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) .cse57)) .cse4)) 1)))))))) (forall ((v_ArrVal_2190 (Array Int Int)) (v_ArrVal_2188 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimArr_11 (Array Int Int)) (v_prenex_4 Int) (v_prenex_5 Int)) (or (= (select (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1) (select (let ((.cse59 (select (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse5 .cse3 v_ArrVal_2188)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2190) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_11) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (select (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2190) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_11) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse59 .cse3 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|)) (select .cse59 .cse4))) (+ v_prenex_4 4))) 1) (not (= (select v_arrayElimArr_11 (+ v_prenex_5 4)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))))) (forall ((v_ArrVal_2190 (Array Int Int)) (v_ArrVal_2188 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimArr_16 (Array Int Int)) (v_prenex_10 Int) (v_prenex_9 Int)) (let ((.cse65 (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse5 .cse3 v_ArrVal_2188)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2190) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_16)) (.cse66 (+ v_prenex_10 4))) (let ((.cse61 (let ((.cse67 (select v_arrayElimArr_16 .cse66))) (store .cse65 .cse67 (store (select .cse65 .cse67) .cse3 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))))) (let ((.cse63 (+ v_prenex_9 4)) (.cse64 (select (select .cse61 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse4)) (.cse60 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse62 (select (select .cse61 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) .cse66))) (or (= (select .cse60 (select (select .cse61 .cse62) .cse63)) 1) (= (select .cse60 (select (select .cse61 .cse64) .cse63)) 1) (= (select .cse60 (select (select .cse65 .cse64) .cse4)) 1) (= (select .cse60 (select (select .cse65 .cse62) .cse4)) 1)))))))) (forall ((v_ArrVal_2190 (Array Int Int)) (v_ArrVal_2188 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_prenex_6 Int) (v_arrayElimArr_12 (Array Int Int))) (or (= (select v_arrayElimArr_12 (+ v_prenex_6 4)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (= (select (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1) (select (let ((.cse68 (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse5 .cse3 v_ArrVal_2188)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2190) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_12))) (select .cse68 (select (select .cse68 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse4))) .cse4)) 1))))) (forall ((v_ArrVal_2190 (Array Int Int)) (v_ArrVal_2188 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimArr_11 (Array Int Int)) (v_prenex_4 Int)) (let ((.cse73 (select (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse5 .cse3 v_ArrVal_2188)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2190) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_11) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (let ((.cse69 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse70 (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2190) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_11) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse73 .cse3 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))) (.cse72 (+ v_prenex_4 4))) (or (forall ((v_prenex_5 Int)) (let ((.cse71 (+ v_prenex_5 4))) (or (= (select .cse69 (select (select .cse70 (select (select .cse70 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) .cse71)) .cse72)) 1) (not (= (select v_arrayElimArr_11 .cse71) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))))) (= (select .cse69 (select (select .cse70 (select .cse73 .cse4)) .cse72)) 1))))))) (forall ((v_ArrVal_2190 (Array Int Int)) (v_ArrVal_2188 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (forall ((v_arrayElimArr_15 (Array Int Int)) (v_prenex_2 Int) (v_prenex_3 Int) (v_arrayElimCell_102 Int)) (let ((.cse74 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse75 (let ((.cse76 (let ((.cse77 (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse5 .cse3 v_ArrVal_2188)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2190) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_15)) (.cse78 (select v_arrayElimArr_15 (+ v_prenex_3 4)))) (store .cse77 .cse78 (store (select .cse77 .cse78) .cse3 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))))) (select .cse76 (select (select .cse76 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse4))))) (or (= (select .cse74 (select .cse75 (+ v_prenex_2 4))) 1) (= (select .cse74 (select .cse75 (+ v_arrayElimCell_102 4))) 1)))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))) (forall ((v_ArrVal_2190 (Array Int Int)) (v_ArrVal_2188 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimArr_16 (Array Int Int)) (v_prenex_10 Int) (v_prenex_9 Int)) (let ((.cse82 (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse5 .cse3 v_ArrVal_2188)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2190) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_16))) (let ((.cse80 (let ((.cse83 (select v_arrayElimArr_16 (+ v_prenex_10 4)))) (store .cse82 .cse83 (store (select .cse82 .cse83) .cse3 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))))) (let ((.cse79 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse81 (select (select .cse80 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse4))) (or (= (select .cse79 (select (select .cse80 .cse81) (+ v_prenex_9 4))) 1) (= (select .cse79 (select (select .cse82 .cse81) .cse4)) 1)))))))) (forall ((v_ArrVal_2190 (Array Int Int)) (v_ArrVal_2188 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_prenex_7 Int) (v_arrayElimArr_13 (Array Int Int)) (v_prenex_8 Int)) (let ((.cse84 (select v_arrayElimArr_13 (+ v_prenex_8 4)))) (or (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse84) (= (select (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1) (select (let ((.cse85 (let ((.cse86 (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse5 .cse3 v_ArrVal_2188)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2190) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_13))) (store .cse86 .cse84 (store (select .cse86 .cse84) .cse3 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))))) (select .cse85 (select (select .cse85 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse4))) (+ v_prenex_7 4))) 1) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| v_prenex_8)))))) (forall ((v_ArrVal_2190 (Array Int Int)) (v_ArrVal_2188 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_prenex_6 Int) (v_arrayElimArr_12 (Array Int Int))) (let ((.cse88 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse89 (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse5 .cse3 v_ArrVal_2188)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2190) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_12)) (.cse87 (select v_arrayElimArr_12 (+ v_prenex_6 4)))) (or (= .cse87 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (= (select .cse88 (select (select .cse89 (select (select .cse89 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse4)) .cse4)) 1) (= (select .cse88 (select (select .cse89 .cse87) .cse4)) 1)))))) (forall ((v_ArrVal_2190 (Array Int Int)) (v_ArrVal_2188 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_prenex_7 Int) (v_arrayElimArr_13 (Array Int Int)) (v_prenex_8 Int)) (let ((.cse94 (+ v_prenex_8 4))) (let ((.cse90 (select v_arrayElimArr_13 .cse94))) (let ((.cse91 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse92 (let ((.cse95 (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse5 .cse3 v_ArrVal_2188)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2190) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_13))) (store .cse95 .cse90 (store (select .cse95 .cse90) .cse3 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|)))) (.cse93 (+ v_prenex_7 4))) (or (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse90) (= (select .cse91 (select (select .cse92 (select (select .cse92 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse4)) .cse93)) 1) (= (select .cse91 (select (select .cse92 (select (select .cse92 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) .cse94)) .cse93)) 1) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| v_prenex_8)))))))) (forall ((v_ArrVal_2190 (Array Int Int)) (v_ArrVal_2188 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) (forall ((v_arrayElimArr_14 (Array Int Int)) (v_arrayElimCell_101 Int) (|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (let ((.cse96 (select v_arrayElimArr_14 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4)))) (or (= .cse96 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (= (select (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1) (select (let ((.cse97 (let ((.cse98 (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse5 .cse3 v_ArrVal_2188)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2190) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_14))) (store .cse98 .cse96 (store (select .cse98 .cse96) .cse3 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))))) (select .cse97 (select (select .cse97 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse4))) (+ v_arrayElimCell_101 4))) 1)))))) (forall ((v_ArrVal_2190 (Array Int Int)) (v_ArrVal_2188 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimArr_16 (Array Int Int)) (v_prenex_10 Int) (v_prenex_9 Int)) (let ((.cse104 (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse5 .cse3 v_ArrVal_2188)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2190) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_16)) (.cse101 (+ v_prenex_10 4))) (let ((.cse100 (let ((.cse105 (select v_arrayElimArr_16 .cse101))) (store .cse104 .cse105 (store (select .cse104 .cse105) .cse3 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))))) (let ((.cse102 (+ v_prenex_9 4)) (.cse99 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse103 (select (select .cse100 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse4))) (or (= (select .cse99 (select (select .cse100 (select (select .cse100 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) .cse101)) .cse102)) 1) (= (select .cse99 (select (select .cse100 .cse103) .cse102)) 1) (= (select .cse99 (select (select .cse104 .cse103) .cse4)) 1)))))))))) (or .cse7 .cse45 (and (forall ((v_arrayElimCell_114 Int)) (= (select .cse46 v_arrayElimCell_114) 1)) (forall ((v_ArrVal_2190 (Array Int Int)) (v_arrayElimArr_18 (Array Int Int))) (or (forall ((v_prenex_5 Int)) (let ((.cse106 (select v_arrayElimArr_18 (+ v_prenex_5 4)))) (or (not (= .cse106 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (forall ((v_prenex_4 Int)) (= (select .cse46 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2190) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_18) .cse106) (+ v_prenex_4 4))) 1)) (= v_prenex_5 .cse4)))) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select v_arrayElimArr_18 .cse3))))))) (or (and (forall ((v_ArrVal_2190 (Array Int Int)) (v_ArrVal_2188 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (forall ((v_arrayElimArr_12 (Array Int Int))) (let ((.cse108 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse109 (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse5 .cse3 v_ArrVal_2188)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2190) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_12))) (or (forall ((v_prenex_6 Int)) (let ((.cse107 (select v_arrayElimArr_12 (+ v_prenex_6 4)))) (or (not (= .cse107 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= (select .cse108 (select (select .cse109 .cse107) .cse4)) 1)))) (= (select .cse108 (select (select .cse109 (select (select .cse109 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse4)) .cse4)) 1)))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))) (forall ((v_ArrVal_2190 (Array Int Int)) (v_ArrVal_2188 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) (forall ((v_prenex_6 Int) (v_arrayElimArr_12 (Array Int Int))) (let ((.cse110 (select v_arrayElimArr_12 (+ v_prenex_6 4)))) (or (not (= .cse110 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= (select (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1) (select (select (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse5 .cse3 v_ArrVal_2188)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2190) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_12) .cse110) .cse4)) 1))))))) .cse7) (or (forall ((v_arrayElimArr_11 (Array Int Int)) (v_prenex_4 Int) (v_ArrVal_2190 (Array Int Int)) (v_prenex_5 Int) (v_ArrVal_2188 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (let ((.cse115 (select (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse5 .cse3 v_ArrVal_2188)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2190) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_11) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (let ((.cse111 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse112 (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2190) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_11) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse115 .cse3 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))) (.cse114 (+ v_prenex_4 4)) (.cse113 (+ v_prenex_5 4))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (= (select .cse111 (select (select .cse112 (select (select .cse112 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) .cse113)) .cse114)) 1) (= (select .cse111 (select (select .cse112 (select .cse115 .cse4)) .cse114)) 1) (not (= (select v_arrayElimArr_11 .cse113) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))))) .cse6) (or (forall ((v_ArrVal_2190 (Array Int Int)) (v_ArrVal_2188 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int) (v_arrayElimArr_16 (Array Int Int)) (v_prenex_10 Int) (v_prenex_9 Int)) (let ((.cse117 (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse5 .cse3 v_ArrVal_2188)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2190) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_16))) (let ((.cse121 (select .cse117 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (let ((.cse116 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse118 (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2190) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_16) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse121 .cse3 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))) (.cse120 (select .cse121 .cse4)) (.cse119 (+ v_prenex_10 4))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (= 1 (select .cse116 (select (select .cse117 (select (select .cse118 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) .cse119)) .cse4))) (= (select .cse116 (select (select .cse117 .cse120) .cse4)) 1) (= (select .cse116 (select (select .cse118 .cse120) (+ v_prenex_9 4))) 1) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select v_arrayElimArr_16 .cse119)))))))) .cse6) (or (forall ((v_arrayElimArr_11 (Array Int Int)) (v_prenex_4 Int) (v_ArrVal_2190 (Array Int Int)) (v_prenex_5 Int) (v_ArrVal_2188 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (= (select (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1) (select (let ((.cse122 (select (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse5 .cse3 v_ArrVal_2188)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2190) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_11) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (select (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2190) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_11) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse122 .cse3 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|)) (select .cse122 .cse4))) (+ v_prenex_4 4))) 1) (not (= (select v_arrayElimArr_11 (+ v_prenex_5 4)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))) .cse6) (or (and (forall ((v_ArrVal_2190 (Array Int Int)) (v_ArrVal_2188 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimArr_16 (Array Int Int)) (v_arrayElimCell_108 Int)) (let ((.cse129 (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse5 .cse3 v_ArrVal_2188)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2190) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_16))) (let ((.cse128 (store (select .cse129 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ v_arrayElimCell_108 8) |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))) (let ((.cse124 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse127 (select .cse128 .cse4))) (or (forall ((v_prenex_10 Int)) (let ((.cse123 (+ v_prenex_10 4))) (or (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select v_arrayElimArr_16 .cse123))) (forall ((v_prenex_9 Int)) (let ((.cse125 (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2190) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_16) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse128)) (.cse126 (+ v_prenex_9 4))) (or (= (select .cse124 (select (select .cse125 (select (select .cse125 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) .cse123)) .cse126)) 1) (= (select .cse124 (select (select .cse125 .cse127) .cse126)) 1))))))) (= 1 (select .cse124 (select (select .cse129 .cse127) (+ v_arrayElimCell_108 4))))))))))) (forall ((v_ArrVal_2190 (Array Int Int)) (v_ArrVal_2188 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimArr_10 (Array Int Int)) (v_prenex_12 Int) (v_prenex_11 Int) (v_prenex_13 Int) (v_arrayElimCell_108 Int)) (let ((.cse130 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse131 (let ((.cse132 (let ((.cse133 (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse5 .cse3 v_ArrVal_2188)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2190) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_10)) (.cse134 (select v_arrayElimArr_10 (+ v_prenex_13 4)))) (store .cse133 .cse134 (store (select .cse133 .cse134) (+ v_arrayElimCell_108 8) |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))))) (select .cse132 (select (select .cse132 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse4))))) (or (= (select .cse130 (select .cse131 (+ v_prenex_12 4))) 1) (= v_prenex_13 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) (= (select .cse130 (select .cse131 (+ v_prenex_11 4))) 1)))))) (forall ((v_ArrVal_2190 (Array Int Int)) (v_ArrVal_2188 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimArr_16 (Array Int Int)) (v_prenex_10 Int) (v_arrayElimCell_108 Int) (v_prenex_9 Int)) (let ((.cse136 (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse5 .cse3 v_ArrVal_2188)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2190) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_16))) (let ((.cse138 (let ((.cse139 (select v_arrayElimArr_16 (+ v_prenex_10 4)))) (store .cse136 .cse139 (store (select .cse136 .cse139) (+ v_arrayElimCell_108 8) |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))))) (let ((.cse135 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse137 (select (select .cse138 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse4))) (or (= (select .cse135 (select (select .cse136 .cse137) (+ v_arrayElimCell_108 4))) 1) (= (select .cse135 (select (select .cse138 .cse137) (+ v_prenex_9 4))) 1)))))))) (forall ((v_ArrVal_2190 (Array Int Int)) (v_ArrVal_2188 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimArr_11 (Array Int Int)) (v_prenex_4 Int) (v_arrayElimCell_108 Int)) (let ((.cse144 (store (select (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse5 .cse3 v_ArrVal_2188)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2190) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_11) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ v_arrayElimCell_108 8) |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))) (let ((.cse140 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse141 (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2190) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_11) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse144)) (.cse143 (+ v_prenex_4 4))) (or (forall ((v_prenex_5 Int)) (let ((.cse142 (+ v_prenex_5 4))) (or (= (select .cse140 (select (select .cse141 (select (select .cse141 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) .cse142)) .cse143)) 1) (not (= (select v_arrayElimArr_11 .cse142) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))))) (= (select .cse140 (select (select .cse141 (select .cse144 .cse4)) .cse143)) 1))))))) (forall ((v_ArrVal_2190 (Array Int Int)) (v_ArrVal_2188 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) (forall ((v_arrayElimArr_15 (Array Int Int)) (v_prenex_2 Int) (v_prenex_3 Int) (v_arrayElimCell_102 Int) (v_arrayElimCell_108 Int)) (let ((.cse145 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse146 (let ((.cse147 (store (select (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse5 .cse3 v_ArrVal_2188)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2190) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_15) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ v_arrayElimCell_108 8) |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))) (select (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2190) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_15) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse147) (select .cse147 .cse4))))) (or (= (select .cse145 (select .cse146 (+ v_prenex_2 4))) 1) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select v_arrayElimArr_15 (+ v_prenex_3 4)))) (= (select .cse145 (select .cse146 (+ v_arrayElimCell_102 4))) 1)))))) (forall ((v_ArrVal_2190 (Array Int Int)) (v_ArrVal_2188 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_prenex_6 Int) (v_arrayElimArr_12 (Array Int Int)) (v_arrayElimCell_108 Int)) (or (= (select v_arrayElimArr_12 (+ v_prenex_6 4)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (= (select (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1) (select (let ((.cse148 (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse5 .cse3 v_ArrVal_2188)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2190) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_12))) (select .cse148 (select (select .cse148 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse4))) (+ v_arrayElimCell_108 4))) 1))))) (forall ((v_ArrVal_2190 (Array Int Int)) (v_ArrVal_2188 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) (forall ((v_arrayElimArr_15 (Array Int Int)) (v_prenex_2 Int) (v_prenex_3 Int) (v_arrayElimCell_102 Int) (v_arrayElimCell_108 Int)) (let ((.cse149 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse150 (let ((.cse151 (let ((.cse152 (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse5 .cse3 v_ArrVal_2188)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2190) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_15)) (.cse153 (select v_arrayElimArr_15 (+ v_prenex_3 4)))) (store .cse152 .cse153 (store (select .cse152 .cse153) (+ v_arrayElimCell_108 8) |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))))) (select .cse151 (select (select .cse151 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse4))))) (or (= (select .cse149 (select .cse150 (+ v_arrayElimCell_102 4))) 1) (= (select .cse149 (select .cse150 (+ v_prenex_2 4))) 1)))))) (forall ((v_ArrVal_2190 (Array Int Int)) (v_ArrVal_2188 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimArr_16 (Array Int Int)) (v_prenex_10 Int) (v_arrayElimCell_108 Int) (v_prenex_9 Int)) (let ((.cse155 (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse5 .cse3 v_ArrVal_2188)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2190) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_16)) (.cse161 (+ v_prenex_10 4))) (let ((.cse158 (let ((.cse162 (select v_arrayElimArr_16 .cse161))) (store .cse155 .cse162 (store (select .cse155 .cse162) (+ v_arrayElimCell_108 8) |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))))) (let ((.cse156 (select (select .cse158 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) .cse161)) (.cse157 (+ v_arrayElimCell_108 4)) (.cse154 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse160 (select (select .cse158 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse4)) (.cse159 (+ v_prenex_9 4))) (or (= (select .cse154 (select (select .cse155 .cse156) .cse157)) 1) (= (select .cse154 (select (select .cse158 .cse156) .cse159)) 1) (= (select .cse154 (select (select .cse155 .cse160) .cse157)) 1) (= (select .cse154 (select (select .cse158 .cse160) .cse159)) 1)))))))) (forall ((v_ArrVal_2190 (Array Int Int)) (v_ArrVal_2188 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimArr_16 (Array Int Int)) (v_prenex_10 Int) (v_arrayElimCell_108 Int) (v_prenex_9 Int)) (let ((.cse164 (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse5 .cse3 v_ArrVal_2188)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2190) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_16)) (.cse166 (+ v_prenex_10 4))) (let ((.cse165 (let ((.cse169 (select v_arrayElimArr_16 .cse166))) (store .cse164 .cse169 (store (select .cse164 .cse169) (+ v_arrayElimCell_108 8) |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))))) (let ((.cse167 (+ v_arrayElimCell_108 4)) (.cse163 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse168 (select (select .cse165 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse4))) (or (= (select .cse163 (select (select .cse164 (select (select .cse165 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) .cse166)) .cse167)) 1) (= (select .cse163 (select (select .cse164 .cse168) .cse167)) 1) (= (select .cse163 (select (select .cse165 .cse168) (+ v_prenex_9 4))) 1)))))))) (forall ((v_ArrVal_2190 (Array Int Int)) (v_ArrVal_2188 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_prenex_6 Int) (v_arrayElimArr_12 (Array Int Int)) (v_arrayElimCell_108 Int)) (let ((.cse170 (select v_arrayElimArr_12 (+ v_prenex_6 4))) (.cse171 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse172 (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse5 .cse3 v_ArrVal_2188)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2190) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_12)) (.cse173 (+ v_arrayElimCell_108 4))) (or (= .cse170 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (= (select .cse171 (select (select .cse172 .cse170) .cse173)) 1) (= (select .cse171 (select (select .cse172 (select (select .cse172 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse4)) .cse173)) 1)))))) (forall ((v_ArrVal_2190 (Array Int Int)) (v_ArrVal_2188 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (forall ((v_arrayElimArr_11 (Array Int Int)) (v_prenex_4 Int) (v_prenex_5 Int) (v_arrayElimCell_108 Int)) (or (= (select (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1) (select (let ((.cse174 (store (select (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse5 .cse3 v_ArrVal_2188)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2190) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_11) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ v_arrayElimCell_108 8) |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))) (select (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2190) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_11) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse174) (select .cse174 .cse4))) (+ v_prenex_4 4))) 1) (not (= (select v_arrayElimArr_11 (+ v_prenex_5 4)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)))) (forall ((v_ArrVal_2190 (Array Int Int)) (v_ArrVal_2188 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimArr_16 (Array Int Int)) (v_arrayElimCell_108 Int)) (let ((.cse178 (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse5 .cse3 v_ArrVal_2188)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2190) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_16))) (let ((.cse176 (store (select .cse178 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ v_arrayElimCell_108 8) |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))) (let ((.cse175 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse177 (select .cse176 .cse4))) (or (forall ((v_prenex_10 Int)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select v_arrayElimArr_16 (+ v_prenex_10 4))))) (forall ((v_prenex_9 Int)) (= (select .cse175 (select (select (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2190) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_16) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse176) .cse177) (+ v_prenex_9 4))) 1)) (= 1 (select .cse175 (select (select .cse178 .cse177) (+ v_arrayElimCell_108 4))))))))))) (forall ((v_ArrVal_2190 (Array Int Int)) (v_ArrVal_2188 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimArr_16 (Array Int Int)) (v_arrayElimCell_108 Int)) (let ((.cse180 (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse5 .cse3 v_ArrVal_2188)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2190) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_16))) (let ((.cse187 (store (select .cse180 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ v_arrayElimCell_108 8) |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))) (let ((.cse179 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse186 (select .cse187 .cse4)) (.cse182 (+ v_arrayElimCell_108 4))) (or (forall ((v_prenex_10 Int)) (let ((.cse184 (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2190) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_16) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse187)) (.cse183 (+ v_prenex_10 4))) (let ((.cse181 (select (select .cse184 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) .cse183))) (or (= (select .cse179 (select (select .cse180 .cse181) .cse182)) 1) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select v_arrayElimArr_16 .cse183))) (forall ((v_prenex_9 Int)) (let ((.cse185 (+ v_prenex_9 4))) (or (= (select .cse179 (select (select .cse184 .cse181) .cse185)) 1) (= (select .cse179 (select (select .cse184 .cse186) .cse185)) 1)))))))) (= 1 (select .cse179 (select (select .cse180 .cse186) .cse182)))))))))) (forall ((v_ArrVal_2190 (Array Int Int)) (v_ArrVal_2188 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_prenex_7 Int) (v_arrayElimArr_13 (Array Int Int)) (v_arrayElimCell_108 Int) (v_prenex_8 Int)) (let ((.cse188 (select v_arrayElimArr_13 (+ v_prenex_8 4)))) (or (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse188) (= (select (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1) (select (let ((.cse189 (let ((.cse190 (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse5 .cse3 v_ArrVal_2188)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2190) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_13))) (store .cse190 .cse188 (store (select .cse190 .cse188) (+ v_arrayElimCell_108 8) |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))))) (select .cse189 (select (select .cse189 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse4))) (+ v_prenex_7 4))) 1) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| v_prenex_8)))))) (forall ((v_ArrVal_2190 (Array Int Int)) (v_ArrVal_2188 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_prenex_7 Int) (v_arrayElimArr_13 (Array Int Int)) (v_arrayElimCell_108 Int) (v_prenex_8 Int)) (let ((.cse195 (+ v_prenex_8 4))) (let ((.cse191 (select v_arrayElimArr_13 .cse195))) (let ((.cse192 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse193 (let ((.cse196 (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse5 .cse3 v_ArrVal_2188)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2190) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_13))) (store .cse196 .cse191 (store (select .cse196 .cse191) (+ v_arrayElimCell_108 8) |v_ULTIMATE.start_node_create_~temp~0#1.base_31|)))) (.cse194 (+ v_prenex_7 4))) (or (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse191) (= (select .cse192 (select (select .cse193 (select (select .cse193 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse4)) .cse194)) 1) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| v_prenex_8) (= (select .cse192 (select (select .cse193 (select (select .cse193 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) .cse195)) .cse194)) 1)))))))) (forall ((v_ArrVal_2190 (Array Int Int)) (v_ArrVal_2188 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimArr_16 (Array Int Int)) (v_prenex_10 Int) (v_arrayElimCell_108 Int) (v_prenex_9 Int)) (let ((.cse201 (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse5 .cse3 v_ArrVal_2188)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2190) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_16)) (.cse199 (+ v_prenex_10 4))) (let ((.cse198 (let ((.cse203 (select v_arrayElimArr_16 .cse199))) (store .cse201 .cse203 (store (select .cse201 .cse203) (+ v_arrayElimCell_108 8) |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))))) (let ((.cse197 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse202 (select (select .cse198 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse4)) (.cse200 (+ v_prenex_9 4))) (or (= (select .cse197 (select (select .cse198 (select (select .cse198 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) .cse199)) .cse200)) 1) (= (select .cse197 (select (select .cse201 .cse202) (+ v_arrayElimCell_108 4))) 1) (= (select .cse197 (select (select .cse198 .cse202) .cse200)) 1)))))))) (forall ((v_ArrVal_2190 (Array Int Int)) (v_ArrVal_2188 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) (forall ((v_arrayElimArr_14 (Array Int Int)) (v_arrayElimCell_101 Int) (v_arrayElimCell_108 Int) (|ULTIMATE.start_dll_prepend_~new_head~1#1.offset| Int)) (let ((.cse206 (select v_arrayElimArr_14 (+ |ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4)))) (or (= (select (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1) (select (let ((.cse204 (let ((.cse205 (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse5 .cse3 v_ArrVal_2188)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2190) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_14))) (store .cse205 .cse206 (store (select .cse205 .cse206) (+ v_arrayElimCell_108 8) |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))))) (select .cse204 (select (select .cse204 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse4))) (+ v_arrayElimCell_101 4))) 1) (= .cse206 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))))) (forall ((v_ArrVal_2190 (Array Int Int)) (v_ArrVal_2188 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (forall ((v_arrayElimArr_10 (Array Int Int)) (v_prenex_12 Int) (v_prenex_11 Int) (v_prenex_13 Int) (v_arrayElimCell_108 Int)) (let ((.cse207 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse208 (let ((.cse209 (store (select (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse5 .cse3 v_ArrVal_2188)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2190) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_10) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ v_arrayElimCell_108 8) |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))) (select (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2190) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_10) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse209) (select .cse209 .cse4))))) (or (= v_prenex_13 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) (= (select .cse207 (select .cse208 (+ v_prenex_12 4))) 1) (= (select .cse207 (select .cse208 (+ v_prenex_11 4))) 1) (not (= (select v_arrayElimArr_10 (+ v_prenex_13 4)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))))))) (forall ((v_ArrVal_2190 (Array Int Int)) (v_ArrVal_2188 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int)) (or (forall ((v_arrayElimArr_16 (Array Int Int)) (v_prenex_10 Int) (v_arrayElimCell_108 Int) (v_prenex_9 Int)) (let ((.cse211 (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse5 .cse3 v_ArrVal_2188)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2190) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_16))) (let ((.cse216 (store (select .cse211 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ v_arrayElimCell_108 8) |v_ULTIMATE.start_node_create_~temp~0#1.base_31|))) (let ((.cse213 (+ v_prenex_10 4)) (.cse212 (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2190) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_16) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse216)) (.cse210 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse215 (select .cse216 .cse4)) (.cse214 (+ v_arrayElimCell_108 4))) (or (= (select .cse210 (select (select .cse211 (select (select .cse212 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) .cse213)) .cse214)) 1) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select v_arrayElimArr_16 .cse213))) (= (select .cse210 (select (select .cse212 .cse215) (+ v_prenex_9 4))) 1) (= 1 (select .cse210 (select (select .cse211 .cse215) .cse214)))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0))))) .cse6) (or (forall ((v_arrayElimArr_10 (Array Int Int)) (v_ArrVal_2190 (Array Int Int)) (v_ArrVal_2188 Int) (v_prenex_12 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_31| Int) (v_prenex_11 Int) (v_prenex_13 Int)) (let ((.cse217 (store |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31| 1)) (.cse218 (let ((.cse219 (select (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse5 .cse3 v_ArrVal_2188)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2190) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_10) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (select (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2190) |v_ULTIMATE.start_node_create_~temp~0#1.base_31| v_arrayElimArr_10) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse219 .cse3 |v_ULTIMATE.start_node_create_~temp~0#1.base_31|)) (select .cse219 .cse4))))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_31|) 0)) (= v_prenex_13 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) (= (select .cse217 (select .cse218 (+ v_prenex_12 4))) 1) (= (select .cse217 (select .cse218 (+ v_prenex_11 4))) 1) (not (= (select v_arrayElimArr_10 (+ v_prenex_13 4)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))))) .cse6)))) is different from true [2024-11-13 13:59:00,784 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:59:00,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 45 [2024-11-13 13:59:00,801 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:59:00,816 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:59:00,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 46 [2024-11-13 13:59:00,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2024-11-13 13:59:00,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2024-11-13 13:59:00,954 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:59:00,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 102 treesize of output 77 [2024-11-13 13:59:00,969 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:59:00,977 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:59:01,061 INFO L349 Elim1Store]: treesize reduction 56, result has 13.8 percent of original size [2024-11-13 13:59:01,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 309 treesize of output 247 [2024-11-13 13:59:01,103 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:59:01,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 177 treesize of output 165 [2024-11-13 13:59:01,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 140 treesize of output 108 [2024-11-13 13:59:01,460 INFO L349 Elim1Store]: treesize reduction 144, result has 22.2 percent of original size [2024-11-13 13:59:01,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 5863 treesize of output 3315 [2024-11-13 13:59:01,639 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:59:01,640 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 5977 treesize of output 5807 [2024-11-13 13:59:01,889 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:59:01,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2723 treesize of output 2583 [2024-11-13 13:59:01,990 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:59:02,110 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:59:02,110 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 2647 treesize of output 2367 [2024-11-13 13:59:04,376 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-13 13:59:04,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 813 treesize of output 1 [2024-11-13 13:59:06,267 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:59:06,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 227 treesize of output 227 [2024-11-13 13:59:07,228 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:59:07,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 25 [2024-11-13 13:59:07,412 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:59:07,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 35 [2024-11-13 13:59:07,590 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:59:07,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 90 [2024-11-13 13:59:23,985 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:59:23,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2091 treesize of output 2075 [2024-11-13 14:03:55,705 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 14:03:55,958 INFO L349 Elim1Store]: treesize reduction 201, result has 27.7 percent of original size [2024-11-13 14:03:55,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 2906 treesize of output 2020 [2024-11-13 14:03:56,767 INFO L349 Elim1Store]: treesize reduction 97, result has 72.2 percent of original size [2024-11-13 14:03:56,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 9 new quantified variables, introduced 27 case distinctions, treesize of input 11516 treesize of output 11336 [2024-11-13 14:03:57,165 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 14:03:57,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 5210 treesize of output 4582 [2024-11-13 14:03:57,505 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 14:03:57,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1986 treesize of output 1834 [2024-11-13 14:04:00,870 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 14:04:00,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 274 treesize of output 270 [2024-11-13 14:04:01,877 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 14:04:01,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 188 treesize of output 184 [2024-11-13 14:04:02,425 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 14:04:02,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 210 treesize of output 202 [2024-11-13 14:04:02,867 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 14:04:02,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 602 treesize of output 570 [2024-11-13 14:04:05,951 INFO L349 Elim1Store]: treesize reduction 68, result has 31.3 percent of original size [2024-11-13 14:04:05,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 747 treesize of output 460 [2024-11-13 14:04:06,088 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 14:04:06,089 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 3955 treesize of output 3833 [2024-11-13 14:04:06,205 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 14:04:06,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1787 treesize of output 1667 [2024-11-13 14:04:06,323 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 14:04:06,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1711 treesize of output 1491 [2024-11-13 14:04:08,082 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 14:04:08,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 277 treesize of output 273 [2024-11-13 14:04:08,649 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 14:04:08,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 163 treesize of output 159 [2024-11-13 14:04:09,136 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 14:04:09,137 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 242 treesize of output 234 [2024-11-13 14:04:10,013 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 14:04:10,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 548 treesize of output 520 [2024-11-13 14:04:14,367 INFO L349 Elim1Store]: treesize reduction 68, result has 31.3 percent of original size [2024-11-13 14:04:14,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 5928 treesize of output 3340 [2024-11-13 14:04:14,493 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 14:04:14,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 1432 treesize of output 1448 [2024-11-13 14:04:14,614 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 14:04:14,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1372 treesize of output 1228 [2024-11-13 14:04:14,688 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 14:04:14,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1184 treesize of output 1104 [2024-11-13 14:04:16,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-11-13 14:04:16,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-11-13 14:04:17,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-11-13 14:04:20,414 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 14:04:20,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 484 treesize of output 448 [2024-11-13 14:04:25,235 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 14:04:25,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 62 treesize of output 53 [2024-11-13 14:04:25,346 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 14:04:25,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 1172 treesize of output 1074 [2024-11-13 14:04:25,408 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 14:04:25,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 854 treesize of output 734 [2024-11-13 14:04:25,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 731 treesize of output 663 [2024-11-13 14:04:27,676 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 14:04:27,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 281 treesize of output 181 [2024-11-13 14:04:28,098 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 14:04:28,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 15 case distinctions, treesize of input 617805 treesize of output 587503 [2024-11-13 14:04:37,878 WARN L286 SmtUtils]: Spent 9.77s on a formula simplification. DAG size of input: 1621 DAG size of output: 645 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:04:38,571 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 14:04:38,681 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 14:04:38,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 55035 treesize of output 45027 [2024-11-13 14:04:40,405 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 14:04:40,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 45215 treesize of output 40643 [2024-11-13 14:04:56,112 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-13 14:04:56,113 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12419 treesize of output 1 [2024-11-13 14:05:40,095 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-13 14:05:40,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1257 treesize of output 1