./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-ext-properties/test-0232_1-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-ext-properties/test-0232_1-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --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 f7b1141c3157e34a4974729c197a93a4b99ad75fc020122df5d99d43bcc85e27 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 13:19:22,939 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 13:19:23,015 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-12 13:19:23,021 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 13:19:23,022 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 13:19:23,057 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 13:19:23,058 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 13:19:23,058 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 13:19:23,059 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 13:19:23,060 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 13:19:23,060 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 13:19:23,061 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 13:19:23,061 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 13:19:23,062 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 13:19:23,064 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 13:19:23,065 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 13:19:23,065 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 13:19:23,065 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 13:19:23,065 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 13:19:23,066 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 13:19:23,066 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-12 13:19:23,070 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-12 13:19:23,070 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-12 13:19:23,071 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 13:19:23,071 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 13:19:23,071 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 13:19:23,071 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 13:19:23,072 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 13:19:23,072 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 13:19:23,072 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 13:19:23,072 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 13:19:23,072 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 13:19:23,073 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 13:19:23,073 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 13:19:23,073 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 13:19:23,073 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 13:19:23,073 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 13:19:23,074 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 13:19:23,074 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 13:19:23,074 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 13:19:23,076 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 13:19:23,077 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 13:19:23,077 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> f7b1141c3157e34a4974729c197a93a4b99ad75fc020122df5d99d43bcc85e27 [2024-11-12 13:19:23,316 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 13:19:23,342 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 13:19:23,345 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 13:19:23,346 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 13:19:23,346 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 13:19:23,348 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext-properties/test-0232_1-2.i [2024-11-12 13:19:24,757 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 13:19:24,999 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 13:19:25,000 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext-properties/test-0232_1-2.i [2024-11-12 13:19:25,016 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab25057c0/3b9d03b0960048cd93b9790c3f71f112/FLAG9d39cbdd8 [2024-11-12 13:19:25,029 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab25057c0/3b9d03b0960048cd93b9790c3f71f112 [2024-11-12 13:19:25,031 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 13:19:25,033 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 13:19:25,045 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 13:19:25,046 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 13:19:25,057 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 13:19:25,058 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:19:25" (1/1) ... [2024-11-12 13:19:25,059 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52aff066 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:19:25, skipping insertion in model container [2024-11-12 13:19:25,059 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:19:25" (1/1) ... [2024-11-12 13:19:25,112 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 13:19:25,417 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 13:19:25,427 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 13:19:25,464 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 13:19:25,493 INFO L204 MainTranslator]: Completed translation [2024-11-12 13:19:25,494 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:19:25 WrapperNode [2024-11-12 13:19:25,494 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 13:19:25,495 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 13:19:25,495 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 13:19:25,496 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 13:19:25,503 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:19:25" (1/1) ... [2024-11-12 13:19:25,515 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:19:25" (1/1) ... [2024-11-12 13:19:25,539 INFO L138 Inliner]: procedures = 126, calls = 33, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 99 [2024-11-12 13:19:25,540 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 13:19:25,541 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 13:19:25,541 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 13:19:25,541 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 13:19:25,551 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:19:25" (1/1) ... [2024-11-12 13:19:25,552 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:19:25" (1/1) ... [2024-11-12 13:19:25,555 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:19:25" (1/1) ... [2024-11-12 13:19:25,573 INFO L175 MemorySlicer]: Split 20 memory accesses to 3 slices as follows [2, 8, 10]. 50 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 5 writes are split as follows [0, 2, 3]. [2024-11-12 13:19:25,574 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:19:25" (1/1) ... [2024-11-12 13:19:25,574 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:19:25" (1/1) ... [2024-11-12 13:19:25,582 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:19:25" (1/1) ... [2024-11-12 13:19:25,585 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:19:25" (1/1) ... [2024-11-12 13:19:25,587 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:19:25" (1/1) ... [2024-11-12 13:19:25,588 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:19:25" (1/1) ... [2024-11-12 13:19:25,590 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 13:19:25,591 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 13:19:25,591 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 13:19:25,592 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 13:19:25,596 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:19:25" (1/1) ... [2024-11-12 13:19:25,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 13:19:25,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:19:25,631 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 13:19:25,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 13:19:25,687 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-12 13:19:25,687 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 13:19:25,687 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-12 13:19:25,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-12 13:19:25,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-12 13:19:25,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-12 13:19:25,688 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-12 13:19:25,688 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-12 13:19:25,689 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-12 13:19:25,689 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-12 13:19:25,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-12 13:19:25,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-12 13:19:25,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-12 13:19:25,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 13:19:25,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-12 13:19:25,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-12 13:19:25,691 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 13:19:25,692 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 13:19:25,847 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 13:19:25,849 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 13:19:26,146 INFO L? ?]: Removed 98 outVars from TransFormulas that were not future-live. [2024-11-12 13:19:26,146 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 13:19:26,163 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 13:19:26,164 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-12 13:19:26,164 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:19:26 BoogieIcfgContainer [2024-11-12 13:19:26,164 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 13:19:26,169 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 13:19:26,170 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 13:19:26,173 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 13:19:26,174 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 01:19:25" (1/3) ... [2024-11-12 13:19:26,174 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@97effef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:19:26, skipping insertion in model container [2024-11-12 13:19:26,175 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:19:25" (2/3) ... [2024-11-12 13:19:26,176 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@97effef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:19:26, skipping insertion in model container [2024-11-12 13:19:26,176 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:19:26" (3/3) ... [2024-11-12 13:19:26,177 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0232_1-2.i [2024-11-12 13:19:26,192 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 13:19:26,192 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 44 error locations. [2024-11-12 13:19:26,247 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 13:19:26,254 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;@44a05fd3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 13:19:26,255 INFO L334 AbstractCegarLoop]: Starting to check reachability of 44 error locations. [2024-11-12 13:19:26,259 INFO L276 IsEmpty]: Start isEmpty. Operand has 90 states, 45 states have (on average 2.111111111111111) 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-12 13:19:26,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-12 13:19:26,263 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:19:26,264 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-12 13:19:26,264 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-12 13:19:26,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:19:26,268 INFO L85 PathProgramCache]: Analyzing trace with hash 925637, now seen corresponding path program 1 times [2024-11-12 13:19:26,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:19:26,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066671474] [2024-11-12 13:19:26,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:19:26,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:19:26,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:19:26,598 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-12 13:19:26,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:19:26,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066671474] [2024-11-12 13:19:26,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066671474] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:19:26,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:19:26,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:19:26,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642460183] [2024-11-12 13:19:26,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:19:26,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 13:19:26,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:19:26,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 13:19:26,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 13:19:26,642 INFO L87 Difference]: Start difference. First operand has 90 states, 45 states have (on average 2.111111111111111) 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) Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:19:26,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:19:26,836 INFO L93 Difference]: Finished difference Result 84 states and 87 transitions. [2024-11-12 13:19:26,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 13:19:26,839 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-12 13:19:26,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:19:26,846 INFO L225 Difference]: With dead ends: 84 [2024-11-12 13:19:26,847 INFO L226 Difference]: Without dead ends: 82 [2024-11-12 13:19:26,848 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-12 13:19:26,854 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 83 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 13:19:26,855 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 81 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 13:19:26,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-12 13:19:26,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-11-12 13:19:26,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 44 states have (on average 1.9318181818181819) internal successors, (85), 81 states have internal predecessors, (85), 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-12 13:19:26,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 85 transitions. [2024-11-12 13:19:26,913 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 85 transitions. Word has length 4 [2024-11-12 13:19:26,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:19:26,914 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 85 transitions. [2024-11-12 13:19:26,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:19:26,914 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 85 transitions. [2024-11-12 13:19:26,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-12 13:19:26,914 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:19:26,915 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-12 13:19:26,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 13:19:26,919 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-12 13:19:26,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:19:26,920 INFO L85 PathProgramCache]: Analyzing trace with hash 925638, now seen corresponding path program 1 times [2024-11-12 13:19:26,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:19:26,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534909557] [2024-11-12 13:19:26,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:19:26,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:19:26,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:19:27,143 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-12 13:19:27,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:19:27,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534909557] [2024-11-12 13:19:27,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534909557] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:19:27,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:19:27,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:19:27,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369360534] [2024-11-12 13:19:27,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:19:27,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 13:19:27,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:19:27,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 13:19:27,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 13:19:27,149 INFO L87 Difference]: Start difference. First operand 82 states and 85 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:19:27,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:19:27,300 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2024-11-12 13:19:27,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 13:19:27,301 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-12 13:19:27,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:19:27,303 INFO L225 Difference]: With dead ends: 92 [2024-11-12 13:19:27,304 INFO L226 Difference]: Without dead ends: 92 [2024-11-12 13:19:27,305 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-12 13:19:27,306 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 74 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:19:27,307 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 86 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:19:27,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-12 13:19:27,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 83. [2024-11-12 13:19:27,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 49 states have (on average 1.816326530612245) internal successors, (89), 82 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-12 13:19:27,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 89 transitions. [2024-11-12 13:19:27,319 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 89 transitions. Word has length 4 [2024-11-12 13:19:27,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:19:27,321 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 89 transitions. [2024-11-12 13:19:27,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:19:27,321 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 89 transitions. [2024-11-12 13:19:27,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-12 13:19:27,322 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:19:27,322 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-12 13:19:27,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 13:19:27,323 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-12 13:19:27,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:19:27,325 INFO L85 PathProgramCache]: Analyzing trace with hash 28694727, now seen corresponding path program 1 times [2024-11-12 13:19:27,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:19:27,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657296608] [2024-11-12 13:19:27,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:19:27,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:19:27,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:19:27,391 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-12 13:19:27,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:19:27,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657296608] [2024-11-12 13:19:27,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657296608] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:19:27,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:19:27,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 13:19:27,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236079481] [2024-11-12 13:19:27,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:19:27,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:19:27,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:19:27,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:19:27,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:19:27,394 INFO L87 Difference]: Start difference. First operand 83 states and 89 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-12 13:19:27,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:19:27,465 INFO L93 Difference]: Finished difference Result 79 states and 85 transitions. [2024-11-12 13:19:27,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:19:27,467 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-12 13:19:27,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:19:27,468 INFO L225 Difference]: With dead ends: 79 [2024-11-12 13:19:27,468 INFO L226 Difference]: Without dead ends: 79 [2024-11-12 13:19:27,468 INFO L434 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-12 13:19:27,469 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 11 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:19:27,469 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 95 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:19:27,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-12 13:19:27,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-11-12 13:19:27,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 49 states have (on average 1.7346938775510203) internal successors, (85), 78 states have internal predecessors, (85), 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-12 13:19:27,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 85 transitions. [2024-11-12 13:19:27,479 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 85 transitions. Word has length 5 [2024-11-12 13:19:27,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:19:27,479 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 85 transitions. [2024-11-12 13:19:27,480 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-12 13:19:27,480 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 85 transitions. [2024-11-12 13:19:27,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-12 13:19:27,480 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:19:27,480 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-12 13:19:27,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 13:19:27,480 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-12 13:19:27,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:19:27,481 INFO L85 PathProgramCache]: Analyzing trace with hash 28694728, now seen corresponding path program 1 times [2024-11-12 13:19:27,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:19:27,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203805203] [2024-11-12 13:19:27,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:19:27,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:19:27,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:19:27,557 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-12 13:19:27,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:19:27,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203805203] [2024-11-12 13:19:27,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203805203] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:19:27,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:19:27,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 13:19:27,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184592091] [2024-11-12 13:19:27,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:19:27,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:19:27,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:19:27,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:19:27,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:19:27,559 INFO L87 Difference]: Start difference. First operand 79 states and 85 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-12 13:19:27,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:19:27,617 INFO L93 Difference]: Finished difference Result 75 states and 81 transitions. [2024-11-12 13:19:27,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:19:27,617 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-12 13:19:27,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:19:27,618 INFO L225 Difference]: With dead ends: 75 [2024-11-12 13:19:27,618 INFO L226 Difference]: Without dead ends: 75 [2024-11-12 13:19:27,619 INFO L434 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-12 13:19:27,620 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 11 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:19:27,620 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 101 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:19:27,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-11-12 13:19:27,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2024-11-12 13:19:27,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 49 states have (on average 1.653061224489796) internal successors, (81), 74 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-12 13:19:27,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 81 transitions. [2024-11-12 13:19:27,630 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 81 transitions. Word has length 5 [2024-11-12 13:19:27,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:19:27,630 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 81 transitions. [2024-11-12 13:19:27,630 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-12 13:19:27,630 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 81 transitions. [2024-11-12 13:19:27,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-12 13:19:27,631 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:19:27,631 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:19:27,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 13:19:27,631 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-12 13:19:27,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:19:27,632 INFO L85 PathProgramCache]: Analyzing trace with hash -1328641136, now seen corresponding path program 1 times [2024-11-12 13:19:27,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:19:27,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816871839] [2024-11-12 13:19:27,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:19:27,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:19:27,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:19:27,910 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-12 13:19:27,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:19:27,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816871839] [2024-11-12 13:19:27,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816871839] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:19:27,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:19:27,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 13:19:27,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64934854] [2024-11-12 13:19:27,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:19:27,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 13:19:27,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:19:27,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 13:19:27,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-12 13:19:27,915 INFO L87 Difference]: Start difference. First operand 75 states and 81 transitions. Second operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 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-12 13:19:28,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:19:28,087 INFO L93 Difference]: Finished difference Result 84 states and 90 transitions. [2024-11-12 13:19:28,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 13:19:28,087 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 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 10 [2024-11-12 13:19:28,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:19:28,088 INFO L225 Difference]: With dead ends: 84 [2024-11-12 13:19:28,088 INFO L226 Difference]: Without dead ends: 84 [2024-11-12 13:19:28,089 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-12 13:19:28,090 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 18 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:19:28,090 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 368 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:19:28,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-12 13:19:28,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 81. [2024-11-12 13:19:28,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 55 states have (on average 1.5818181818181818) internal successors, (87), 80 states have internal predecessors, (87), 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-12 13:19:28,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 87 transitions. [2024-11-12 13:19:28,095 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 87 transitions. Word has length 10 [2024-11-12 13:19:28,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:19:28,095 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 87 transitions. [2024-11-12 13:19:28,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 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-12 13:19:28,095 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 87 transitions. [2024-11-12 13:19:28,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-12 13:19:28,096 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:19:28,096 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:19:28,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 13:19:28,096 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-12 13:19:28,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:19:28,097 INFO L85 PathProgramCache]: Analyzing trace with hash 1868053176, now seen corresponding path program 1 times [2024-11-12 13:19:28,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:19:28,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807870070] [2024-11-12 13:19:28,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:19:28,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:19:28,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:19:28,253 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-12 13:19:28,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:19:28,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807870070] [2024-11-12 13:19:28,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807870070] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:19:28,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:19:28,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 13:19:28,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507835293] [2024-11-12 13:19:28,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:19:28,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 13:19:28,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:19:28,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 13:19:28,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 13:19:28,259 INFO L87 Difference]: Start difference. First operand 81 states and 87 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 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-12 13:19:28,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:19:28,393 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2024-11-12 13:19:28,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 13:19:28,394 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 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 17 [2024-11-12 13:19:28,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:19:28,394 INFO L225 Difference]: With dead ends: 92 [2024-11-12 13:19:28,395 INFO L226 Difference]: Without dead ends: 92 [2024-11-12 13:19:28,395 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-12 13:19:28,396 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 56 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:19:28,396 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 132 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:19:28,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-12 13:19:28,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 80. [2024-11-12 13:19:28,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 55 states have (on average 1.5636363636363637) internal successors, (86), 79 states have internal predecessors, (86), 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-12 13:19:28,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 86 transitions. [2024-11-12 13:19:28,402 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 86 transitions. Word has length 17 [2024-11-12 13:19:28,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:19:28,402 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 86 transitions. [2024-11-12 13:19:28,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 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-12 13:19:28,402 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 86 transitions. [2024-11-12 13:19:28,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-12 13:19:28,402 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:19:28,403 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:19:28,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 13:19:28,403 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-12 13:19:28,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:19:28,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1868053177, now seen corresponding path program 1 times [2024-11-12 13:19:28,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:19:28,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177689539] [2024-11-12 13:19:28,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:19:28,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:19:28,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:19:28,671 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-12 13:19:28,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:19:28,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177689539] [2024-11-12 13:19:28,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177689539] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:19:28,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:19:28,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 13:19:28,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243503304] [2024-11-12 13:19:28,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:19:28,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 13:19:28,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:19:28,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 13:19:28,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 13:19:28,673 INFO L87 Difference]: Start difference. First operand 80 states and 86 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 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-12 13:19:28,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:19:28,833 INFO L93 Difference]: Finished difference Result 92 states and 98 transitions. [2024-11-12 13:19:28,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 13:19:28,833 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 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 17 [2024-11-12 13:19:28,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:19:28,834 INFO L225 Difference]: With dead ends: 92 [2024-11-12 13:19:28,834 INFO L226 Difference]: Without dead ends: 92 [2024-11-12 13:19:28,834 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-12 13:19:28,835 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 58 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:19:28,835 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 164 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:19:28,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-12 13:19:28,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 79. [2024-11-12 13:19:28,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 55 states have (on average 1.5454545454545454) internal successors, (85), 78 states have internal predecessors, (85), 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-12 13:19:28,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 85 transitions. [2024-11-12 13:19:28,846 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 85 transitions. Word has length 17 [2024-11-12 13:19:28,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:19:28,846 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 85 transitions. [2024-11-12 13:19:28,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 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-12 13:19:28,847 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 85 transitions. [2024-11-12 13:19:28,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-12 13:19:28,847 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:19:28,847 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:19:28,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 13:19:28,848 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-12 13:19:28,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:19:28,848 INFO L85 PathProgramCache]: Analyzing trace with hash 2076126984, now seen corresponding path program 1 times [2024-11-12 13:19:28,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:19:28,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596323638] [2024-11-12 13:19:28,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:19:28,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:19:28,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:19:28,904 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-12 13:19:28,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:19:28,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596323638] [2024-11-12 13:19:28,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596323638] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:19:28,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:19:28,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 13:19:28,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665886303] [2024-11-12 13:19:28,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:19:28,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 13:19:28,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:19:28,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 13:19:28,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 13:19:28,906 INFO L87 Difference]: Start difference. First operand 79 states and 85 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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-12 13:19:28,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:19:28,923 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2024-11-12 13:19:28,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 13:19:28,923 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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 18 [2024-11-12 13:19:28,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:19:28,924 INFO L225 Difference]: With dead ends: 78 [2024-11-12 13:19:28,924 INFO L226 Difference]: Without dead ends: 78 [2024-11-12 13:19:28,924 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 13:19:28,925 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 59 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 13:19:28,925 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 150 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:19:28,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-12 13:19:28,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 74. [2024-11-12 13:19:28,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 50 states have (on average 1.52) internal successors, (76), 73 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-12 13:19:28,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 76 transitions. [2024-11-12 13:19:28,933 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 76 transitions. Word has length 18 [2024-11-12 13:19:28,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:19:28,933 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 76 transitions. [2024-11-12 13:19:28,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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-12 13:19:28,933 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 76 transitions. [2024-11-12 13:19:28,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-12 13:19:28,934 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:19:28,934 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:19:28,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-12 13:19:28,934 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-12 13:19:28,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:19:28,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1280939784, now seen corresponding path program 1 times [2024-11-12 13:19:28,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:19:28,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101854480] [2024-11-12 13:19:28,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:19:28,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:19:28,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:19:29,247 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-12 13:19:29,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:19:29,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101854480] [2024-11-12 13:19:29,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101854480] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:19:29,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:19:29,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 13:19:29,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113890160] [2024-11-12 13:19:29,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:19:29,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 13:19:29,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:19:29,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 13:19:29,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-12 13:19:29,249 INFO L87 Difference]: Start difference. First operand 74 states and 76 transitions. Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 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-12 13:19:29,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:19:29,391 INFO L93 Difference]: Finished difference Result 76 states and 78 transitions. [2024-11-12 13:19:29,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 13:19:29,392 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 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 20 [2024-11-12 13:19:29,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:19:29,393 INFO L225 Difference]: With dead ends: 76 [2024-11-12 13:19:29,393 INFO L226 Difference]: Without dead ends: 76 [2024-11-12 13:19:29,393 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-12 13:19:29,394 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 76 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:19:29,395 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 160 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:19:29,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-12 13:19:29,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 73. [2024-11-12 13:19:29,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 50 states have (on average 1.5) internal successors, (75), 72 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-12 13:19:29,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 75 transitions. [2024-11-12 13:19:29,402 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 75 transitions. Word has length 20 [2024-11-12 13:19:29,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:19:29,402 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 75 transitions. [2024-11-12 13:19:29,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 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-12 13:19:29,402 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 75 transitions. [2024-11-12 13:19:29,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-12 13:19:29,402 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:19:29,403 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:19:29,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-12 13:19:29,403 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-12 13:19:29,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:19:29,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1280939783, now seen corresponding path program 1 times [2024-11-12 13:19:29,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:19:29,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383589904] [2024-11-12 13:19:29,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:19:29,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:19:29,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:19:29,483 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-12 13:19:29,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:19:29,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383589904] [2024-11-12 13:19:29,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383589904] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:19:29,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:19:29,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 13:19:29,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068600034] [2024-11-12 13:19:29,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:19:29,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 13:19:29,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:19:29,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 13:19:29,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 13:19:29,486 INFO L87 Difference]: Start difference. First operand 73 states and 75 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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-12 13:19:29,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:19:29,564 INFO L93 Difference]: Finished difference Result 72 states and 74 transitions. [2024-11-12 13:19:29,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 13:19:29,565 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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 20 [2024-11-12 13:19:29,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:19:29,566 INFO L225 Difference]: With dead ends: 72 [2024-11-12 13:19:29,566 INFO L226 Difference]: Without dead ends: 72 [2024-11-12 13:19:29,566 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-12 13:19:29,567 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 7 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 164 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-12 13:19:29,567 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 164 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:19:29,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-12 13:19:29,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-11-12 13:19:29,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 50 states have (on average 1.48) internal successors, (74), 71 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-12 13:19:29,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 74 transitions. [2024-11-12 13:19:29,575 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 74 transitions. Word has length 20 [2024-11-12 13:19:29,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:19:29,575 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 74 transitions. [2024-11-12 13:19:29,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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-12 13:19:29,575 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 74 transitions. [2024-11-12 13:19:29,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-12 13:19:29,575 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:19:29,576 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:19:29,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-12 13:19:29,576 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-12 13:19:29,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:19:29,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1054427643, now seen corresponding path program 1 times [2024-11-12 13:19:29,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:19:29,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064261778] [2024-11-12 13:19:29,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:19:29,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:19:29,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:19:29,885 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-12 13:19:29,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:19:29,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064261778] [2024-11-12 13:19:29,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064261778] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:19:29,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:19:29,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 13:19:29,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173060940] [2024-11-12 13:19:29,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:19:29,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 13:19:29,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:19:29,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 13:19:29,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-12 13:19:29,888 INFO L87 Difference]: Start difference. First operand 72 states and 74 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 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-12 13:19:30,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:19:30,077 INFO L93 Difference]: Finished difference Result 112 states and 120 transitions. [2024-11-12 13:19:30,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-12 13:19:30,078 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 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-12 13:19:30,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:19:30,080 INFO L225 Difference]: With dead ends: 112 [2024-11-12 13:19:30,080 INFO L226 Difference]: Without dead ends: 112 [2024-11-12 13:19:30,080 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2024-11-12 13:19:30,081 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 42 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:19:30,081 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 239 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:19:30,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-12 13:19:30,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 85. [2024-11-12 13:19:30,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 63 states have (on average 1.3968253968253967) internal successors, (88), 84 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-12 13:19:30,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 88 transitions. [2024-11-12 13:19:30,084 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 88 transitions. Word has length 21 [2024-11-12 13:19:30,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:19:30,084 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 88 transitions. [2024-11-12 13:19:30,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 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-12 13:19:30,085 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 88 transitions. [2024-11-12 13:19:30,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-12 13:19:30,086 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:19:30,086 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:19:30,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-12 13:19:30,086 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-12 13:19:30,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:19:30,087 INFO L85 PathProgramCache]: Analyzing trace with hash -1672481337, now seen corresponding path program 1 times [2024-11-12 13:19:30,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:19:30,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135843886] [2024-11-12 13:19:30,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:19:30,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:19:30,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:19:30,496 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-12 13:19:30,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:19:30,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135843886] [2024-11-12 13:19:30,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135843886] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:19:30,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:19:30,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 13:19:30,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726939354] [2024-11-12 13:19:30,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:19:30,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 13:19:30,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:19:30,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 13:19:30,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-12 13:19:30,499 INFO L87 Difference]: Start difference. First operand 85 states and 88 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 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-12 13:19:30,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:19:30,770 INFO L93 Difference]: Finished difference Result 111 states and 119 transitions. [2024-11-12 13:19:30,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-12 13:19:30,771 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 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 22 [2024-11-12 13:19:30,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:19:30,772 INFO L225 Difference]: With dead ends: 111 [2024-11-12 13:19:30,772 INFO L226 Difference]: Without dead ends: 111 [2024-11-12 13:19:30,772 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2024-11-12 13:19:30,772 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 42 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 13:19:30,773 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 246 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 13:19:30,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-12 13:19:30,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 86. [2024-11-12 13:19:30,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 64 states have (on average 1.390625) internal successors, (89), 85 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-12 13:19:30,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 89 transitions. [2024-11-12 13:19:30,776 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 89 transitions. Word has length 22 [2024-11-12 13:19:30,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:19:30,777 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 89 transitions. [2024-11-12 13:19:30,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 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-12 13:19:30,777 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 89 transitions. [2024-11-12 13:19:30,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-12 13:19:30,777 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:19:30,777 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:19:30,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-12 13:19:30,780 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-12 13:19:30,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:19:30,781 INFO L85 PathProgramCache]: Analyzing trace with hash -428723026, now seen corresponding path program 1 times [2024-11-12 13:19:30,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:19:30,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240713696] [2024-11-12 13:19:30,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:19:30,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:19:30,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:19:31,080 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-12 13:19:31,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:19:31,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240713696] [2024-11-12 13:19:31,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240713696] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:19:31,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1221824333] [2024-11-12 13:19:31,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:19:31,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:19:31,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:19:31,083 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 13:19:31,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-12 13:19:31,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:19:31,202 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-12 13:19:31,216 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:19:31,331 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-12 13:19:31,374 INFO L349 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2024-11-12 13:19:31,374 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 23 treesize of output 24 [2024-11-12 13:19:31,400 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 25 treesize of output 13 [2024-11-12 13:19:31,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-12 13:19:31,472 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 25 treesize of output 13 [2024-11-12 13:19:31,476 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-12 13:19:31,476 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:19:31,609 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 38 treesize of output 34 [2024-11-12 13:19:32,037 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:19:32,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 135 treesize of output 339 [2024-11-12 13:19:32,537 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-12 13:19:32,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1221824333] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 13:19:32,538 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 13:19:32,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2024-11-12 13:19:32,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939527342] [2024-11-12 13:19:32,539 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 13:19:32,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-12 13:19:32,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:19:32,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-12 13:19:32,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2024-11-12 13:19:32,540 INFO L87 Difference]: Start difference. First operand 86 states and 89 transitions. Second operand has 16 states, 15 states have (on average 2.533333333333333) internal successors, (38), 16 states have internal predecessors, (38), 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-12 13:19:32,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:19:32,833 INFO L93 Difference]: Finished difference Result 88 states and 91 transitions. [2024-11-12 13:19:32,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 13:19:32,834 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.533333333333333) internal successors, (38), 16 states have internal predecessors, (38), 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-12 13:19:32,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:19:32,835 INFO L225 Difference]: With dead ends: 88 [2024-11-12 13:19:32,835 INFO L226 Difference]: Without dead ends: 88 [2024-11-12 13:19:32,835 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2024-11-12 13:19:32,836 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 87 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 13:19:32,836 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 271 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 13:19:32,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-12 13:19:32,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 85. [2024-11-12 13:19:32,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 64 states have (on average 1.375) internal successors, (88), 84 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-12 13:19:32,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 88 transitions. [2024-11-12 13:19:32,838 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 88 transitions. Word has length 22 [2024-11-12 13:19:32,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:19:32,839 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 88 transitions. [2024-11-12 13:19:32,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.533333333333333) internal successors, (38), 16 states have internal predecessors, (38), 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-12 13:19:32,839 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 88 transitions. [2024-11-12 13:19:32,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-12 13:19:32,839 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:19:32,839 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:19:32,858 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-12 13:19:33,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-12 13:19:33,044 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-12 13:19:33,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:19:33,045 INFO L85 PathProgramCache]: Analyzing trace with hash -428723025, now seen corresponding path program 1 times [2024-11-12 13:19:33,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:19:33,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814344885] [2024-11-12 13:19:33,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:19:33,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:19:33,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:19:33,419 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-12 13:19:33,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:19:33,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814344885] [2024-11-12 13:19:33,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814344885] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:19:33,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [880543022] [2024-11-12 13:19:33,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:19:33,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:19:33,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:19:33,422 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 13:19:33,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-12 13:19:33,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:19:33,535 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-12 13:19:33,538 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:19:33,636 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-12 13:19:33,639 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-12 13:19:33,693 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-12 13:19:33,694 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 24 treesize of output 27 [2024-11-12 13:19:33,709 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-12 13:19:33,709 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-12 13:19:33,737 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 19 [2024-11-12 13:19:33,742 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 26 treesize of output 14 [2024-11-12 13:19:33,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-12 13:19:33,776 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-12 13:19:33,829 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 19 [2024-11-12 13:19:33,832 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 26 treesize of output 14 [2024-11-12 13:19:33,854 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-12 13:19:33,854 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:19:34,096 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 66 treesize of output 62 [2024-11-12 13:19:34,104 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 102 treesize of output 94 [2024-11-12 13:19:34,131 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 32 treesize of output 28 [2024-11-12 13:19:34,279 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:19:34,279 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 64 treesize of output 134 [2024-11-12 13:19:34,294 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 68 treesize of output 64 [2024-11-12 13:19:34,454 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-12 13:19:34,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [880543022] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 13:19:34,455 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 13:19:34,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 22 [2024-11-12 13:19:34,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629652524] [2024-11-12 13:19:34,455 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 13:19:34,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-12 13:19:34,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:19:34,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-12 13:19:34,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=440, Unknown=0, NotChecked=0, Total=506 [2024-11-12 13:19:34,457 INFO L87 Difference]: Start difference. First operand 85 states and 88 transitions. Second operand has 23 states, 22 states have (on average 2.8181818181818183) internal successors, (62), 23 states have internal predecessors, (62), 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-12 13:19:35,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:19:35,029 INFO L93 Difference]: Finished difference Result 87 states and 90 transitions. [2024-11-12 13:19:35,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 13:19:35,030 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.8181818181818183) internal successors, (62), 23 states have internal predecessors, (62), 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-12 13:19:35,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:19:35,030 INFO L225 Difference]: With dead ends: 87 [2024-11-12 13:19:35,030 INFO L226 Difference]: Without dead ends: 87 [2024-11-12 13:19:35,031 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=138, Invalid=564, Unknown=0, NotChecked=0, Total=702 [2024-11-12 13:19:35,031 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 100 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 558 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 13:19:35,031 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 583 Invalid, 574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 558 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 13:19:35,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-12 13:19:35,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 84. [2024-11-12 13:19:35,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 64 states have (on average 1.359375) internal successors, (87), 83 states have internal predecessors, (87), 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-12 13:19:35,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 87 transitions. [2024-11-12 13:19:35,033 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 87 transitions. Word has length 22 [2024-11-12 13:19:35,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:19:35,034 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 87 transitions. [2024-11-12 13:19:35,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.8181818181818183) internal successors, (62), 23 states have internal predecessors, (62), 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-12 13:19:35,034 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 87 transitions. [2024-11-12 13:19:35,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-12 13:19:35,035 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:19:35,035 INFO L218 NwaCegarLoop]: trace histogram [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-12 13:19:35,051 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-12 13:19:35,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-12 13:19:35,239 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-12 13:19:35,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:19:35,239 INFO L85 PathProgramCache]: Analyzing trace with hash -307313795, now seen corresponding path program 1 times [2024-11-12 13:19:35,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:19:35,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309435406] [2024-11-12 13:19:35,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:19:35,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:19:35,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:19:35,477 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-12 13:19:35,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:19:35,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309435406] [2024-11-12 13:19:35,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309435406] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:19:35,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:19:35,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 13:19:35,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350431526] [2024-11-12 13:19:35,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:19:35,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 13:19:35,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:19:35,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 13:19:35,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-12 13:19:35,479 INFO L87 Difference]: Start difference. First operand 84 states and 87 transitions. Second operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 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-12 13:19:35,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:19:35,684 INFO L93 Difference]: Finished difference Result 98 states and 102 transitions. [2024-11-12 13:19:35,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-12 13:19:35,685 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 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 23 [2024-11-12 13:19:35,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:19:35,685 INFO L225 Difference]: With dead ends: 98 [2024-11-12 13:19:35,685 INFO L226 Difference]: Without dead ends: 98 [2024-11-12 13:19:35,686 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2024-11-12 13:19:35,686 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 24 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:19:35,687 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 189 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:19:35,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-12 13:19:35,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 85. [2024-11-12 13:19:35,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 65 states have (on average 1.353846153846154) internal successors, (88), 84 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-12 13:19:35,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 88 transitions. [2024-11-12 13:19:35,689 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 88 transitions. Word has length 23 [2024-11-12 13:19:35,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:19:35,689 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 88 transitions. [2024-11-12 13:19:35,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 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-12 13:19:35,689 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 88 transitions. [2024-11-12 13:19:35,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-12 13:19:35,690 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:19:35,690 INFO L218 NwaCegarLoop]: trace histogram [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-12 13:19:35,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-12 13:19:35,690 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-12 13:19:35,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:19:35,691 INFO L85 PathProgramCache]: Analyzing trace with hash -936792950, now seen corresponding path program 1 times [2024-11-12 13:19:35,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:19:35,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933630078] [2024-11-12 13:19:35,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:19:35,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:19:35,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:19:35,808 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-12 13:19:35,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:19:35,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933630078] [2024-11-12 13:19:35,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933630078] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:19:35,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:19:35,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 13:19:35,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169852941] [2024-11-12 13:19:35,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:19:35,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 13:19:35,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:19:35,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 13:19:35,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-12 13:19:35,810 INFO L87 Difference]: Start difference. First operand 85 states and 88 transitions. Second operand has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 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-12 13:19:35,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:19:35,924 INFO L93 Difference]: Finished difference Result 84 states and 87 transitions. [2024-11-12 13:19:35,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 13:19:35,925 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 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 24 [2024-11-12 13:19:35,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:19:35,925 INFO L225 Difference]: With dead ends: 84 [2024-11-12 13:19:35,925 INFO L226 Difference]: Without dead ends: 84 [2024-11-12 13:19:35,926 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-12 13:19:35,926 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 116 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:19:35,926 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 65 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:19:35,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-12 13:19:35,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-11-12 13:19:35,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 65 states have (on average 1.3384615384615384) internal successors, (87), 83 states have internal predecessors, (87), 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-12 13:19:35,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 87 transitions. [2024-11-12 13:19:35,929 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 87 transitions. Word has length 24 [2024-11-12 13:19:35,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:19:35,930 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 87 transitions. [2024-11-12 13:19:35,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 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-12 13:19:35,930 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 87 transitions. [2024-11-12 13:19:35,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-12 13:19:35,933 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:19:35,933 INFO L218 NwaCegarLoop]: trace histogram [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-12 13:19:35,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-12 13:19:35,933 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-12 13:19:35,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:19:35,935 INFO L85 PathProgramCache]: Analyzing trace with hash -936792949, now seen corresponding path program 1 times [2024-11-12 13:19:35,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:19:35,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844561913] [2024-11-12 13:19:35,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:19:35,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:19:35,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:19:35,992 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-12 13:19:35,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:19:35,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844561913] [2024-11-12 13:19:35,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844561913] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:19:35,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:19:35,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:19:35,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452064094] [2024-11-12 13:19:35,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:19:35,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 13:19:35,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:19:35,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 13:19:35,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-12 13:19:35,994 INFO L87 Difference]: Start difference. First operand 84 states and 87 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 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-12 13:19:36,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:19:36,034 INFO L93 Difference]: Finished difference Result 79 states and 82 transitions. [2024-11-12 13:19:36,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 13:19:36,035 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 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 24 [2024-11-12 13:19:36,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:19:36,035 INFO L225 Difference]: With dead ends: 79 [2024-11-12 13:19:36,035 INFO L226 Difference]: Without dead ends: 79 [2024-11-12 13:19:36,035 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-12 13:19:36,036 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 46 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 13:19:36,036 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 40 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:19:36,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-12 13:19:36,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-11-12 13:19:36,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 65 states have (on average 1.2615384615384615) internal successors, (82), 78 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-12 13:19:36,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 82 transitions. [2024-11-12 13:19:36,039 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 82 transitions. Word has length 24 [2024-11-12 13:19:36,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:19:36,040 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 82 transitions. [2024-11-12 13:19:36,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 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-12 13:19:36,040 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 82 transitions. [2024-11-12 13:19:36,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-12 13:19:36,040 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:19:36,040 INFO L218 NwaCegarLoop]: trace histogram [1, 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-12 13:19:36,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-12 13:19:36,041 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-12 13:19:36,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:19:36,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1024189665, now seen corresponding path program 1 times [2024-11-12 13:19:36,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:19:36,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846150665] [2024-11-12 13:19:36,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:19:36,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:19:36,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:19:36,133 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-12 13:19:36,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:19:36,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846150665] [2024-11-12 13:19:36,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846150665] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:19:36,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:19:36,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 13:19:36,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029687223] [2024-11-12 13:19:36,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:19:36,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 13:19:36,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:19:36,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 13:19:36,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 13:19:36,135 INFO L87 Difference]: Start difference. First operand 79 states and 82 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 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-12 13:19:36,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:19:36,191 INFO L93 Difference]: Finished difference Result 78 states and 81 transitions. [2024-11-12 13:19:36,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 13:19:36,191 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 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 25 [2024-11-12 13:19:36,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:19:36,192 INFO L225 Difference]: With dead ends: 78 [2024-11-12 13:19:36,192 INFO L226 Difference]: Without dead ends: 78 [2024-11-12 13:19:36,192 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-12 13:19:36,193 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 26 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 13:19:36,193 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 139 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:19:36,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-12 13:19:36,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-11-12 13:19:36,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 65 states have (on average 1.2461538461538462) internal successors, (81), 77 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-12 13:19:36,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2024-11-12 13:19:36,195 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 25 [2024-11-12 13:19:36,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:19:36,195 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2024-11-12 13:19:36,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 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-12 13:19:36,196 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2024-11-12 13:19:36,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-12 13:19:36,196 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:19:36,196 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 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-12 13:19:36,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-12 13:19:36,196 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-12 13:19:36,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:19:36,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1685108650, now seen corresponding path program 1 times [2024-11-12 13:19:36,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:19:36,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395823195] [2024-11-12 13:19:36,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:19:36,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:19:36,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:19:36,291 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-12 13:19:36,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:19:36,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395823195] [2024-11-12 13:19:36,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395823195] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:19:36,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:19:36,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 13:19:36,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372264160] [2024-11-12 13:19:36,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:19:36,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 13:19:36,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:19:36,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 13:19:36,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 13:19:36,294 INFO L87 Difference]: Start difference. First operand 78 states and 81 transitions. Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 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-12 13:19:36,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:19:36,380 INFO L93 Difference]: Finished difference Result 80 states and 83 transitions. [2024-11-12 13:19:36,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 13:19:36,380 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 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 26 [2024-11-12 13:19:36,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:19:36,381 INFO L225 Difference]: With dead ends: 80 [2024-11-12 13:19:36,381 INFO L226 Difference]: Without dead ends: 80 [2024-11-12 13:19:36,381 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-12 13:19:36,382 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 26 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:19:36,382 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 120 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:19:36,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-12 13:19:36,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 77. [2024-11-12 13:19:36,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 65 states have (on average 1.2307692307692308) internal successors, (80), 76 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-12 13:19:36,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 80 transitions. [2024-11-12 13:19:36,384 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 80 transitions. Word has length 26 [2024-11-12 13:19:36,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:19:36,384 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 80 transitions. [2024-11-12 13:19:36,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 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-12 13:19:36,384 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 80 transitions. [2024-11-12 13:19:36,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-12 13:19:36,385 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:19:36,385 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 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-12 13:19:36,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-12 13:19:36,385 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-12 13:19:36,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:19:36,386 INFO L85 PathProgramCache]: Analyzing trace with hash 698760707, now seen corresponding path program 1 times [2024-11-12 13:19:36,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:19:36,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838572601] [2024-11-12 13:19:36,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:19:36,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:19:36,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:19:36,748 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-12 13:19:36,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:19:36,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838572601] [2024-11-12 13:19:36,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838572601] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:19:36,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:19:36,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-12 13:19:36,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508207986] [2024-11-12 13:19:36,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:19:36,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-12 13:19:36,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:19:36,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-12 13:19:36,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-12 13:19:36,750 INFO L87 Difference]: Start difference. First operand 77 states and 80 transitions. Second operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:19:37,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:19:37,139 INFO L93 Difference]: Finished difference Result 97 states and 101 transitions. [2024-11-12 13:19:37,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-12 13:19:37,140 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-12 13:19:37,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:19:37,140 INFO L225 Difference]: With dead ends: 97 [2024-11-12 13:19:37,140 INFO L226 Difference]: Without dead ends: 97 [2024-11-12 13:19:37,141 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2024-11-12 13:19:37,141 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 66 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 13:19:37,141 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 238 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 13:19:37,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-12 13:19:37,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 81. [2024-11-12 13:19:37,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 69 states have (on average 1.2173913043478262) internal successors, (84), 80 states have internal predecessors, (84), 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-12 13:19:37,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 84 transitions. [2024-11-12 13:19:37,144 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 84 transitions. Word has length 27 [2024-11-12 13:19:37,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:19:37,144 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 84 transitions. [2024-11-12 13:19:37,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:19:37,144 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 84 transitions. [2024-11-12 13:19:37,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-12 13:19:37,145 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:19:37,145 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 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-12 13:19:37,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-12 13:19:37,145 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-12 13:19:37,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:19:37,145 INFO L85 PathProgramCache]: Analyzing trace with hash 186745549, now seen corresponding path program 1 times [2024-11-12 13:19:37,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:19:37,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447633606] [2024-11-12 13:19:37,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:19:37,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:19:37,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:19:37,286 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-12 13:19:37,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:19:37,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447633606] [2024-11-12 13:19:37,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447633606] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:19:37,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:19:37,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 13:19:37,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780988561] [2024-11-12 13:19:37,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:19:37,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 13:19:37,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:19:37,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 13:19:37,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 13:19:37,289 INFO L87 Difference]: Start difference. First operand 81 states and 84 transitions. Second operand has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 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-12 13:19:37,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:19:37,382 INFO L93 Difference]: Finished difference Result 80 states and 83 transitions. [2024-11-12 13:19:37,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 13:19:37,383 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 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-12 13:19:37,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:19:37,383 INFO L225 Difference]: With dead ends: 80 [2024-11-12 13:19:37,383 INFO L226 Difference]: Without dead ends: 80 [2024-11-12 13:19:37,383 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-12 13:19:37,384 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 68 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:19:37,384 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 88 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:19:37,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-12 13:19:37,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-11-12 13:19:37,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 69 states have (on average 1.2028985507246377) internal successors, (83), 79 states have internal predecessors, (83), 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-12 13:19:37,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 83 transitions. [2024-11-12 13:19:37,386 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 83 transitions. Word has length 28 [2024-11-12 13:19:37,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:19:37,386 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 83 transitions. [2024-11-12 13:19:37,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 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-12 13:19:37,387 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2024-11-12 13:19:37,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-12 13:19:37,387 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:19:37,387 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 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-12 13:19:37,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-12 13:19:37,387 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-12 13:19:37,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:19:37,388 INFO L85 PathProgramCache]: Analyzing trace with hash -973971529, now seen corresponding path program 1 times [2024-11-12 13:19:37,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:19:37,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605864739] [2024-11-12 13:19:37,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:19:37,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:19:37,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:19:38,338 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-12 13:19:38,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:19:38,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605864739] [2024-11-12 13:19:38,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605864739] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:19:38,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:19:38,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-12 13:19:38,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720690800] [2024-11-12 13:19:38,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:19:38,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-12 13:19:38,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:19:38,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-12 13:19:38,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2024-11-12 13:19:38,341 INFO L87 Difference]: Start difference. First operand 80 states and 83 transitions. Second operand has 16 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 16 states have internal predecessors, (32), 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-12 13:19:38,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:19:38,831 INFO L93 Difference]: Finished difference Result 117 states and 121 transitions. [2024-11-12 13:19:38,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-12 13:19:38,831 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 16 states have internal predecessors, (32), 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 32 [2024-11-12 13:19:38,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:19:38,832 INFO L225 Difference]: With dead ends: 117 [2024-11-12 13:19:38,832 INFO L226 Difference]: Without dead ends: 115 [2024-11-12 13:19:38,833 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2024-11-12 13:19:38,833 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 20 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 13:19:38,833 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 301 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 13:19:38,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-12 13:19:38,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 102. [2024-11-12 13:19:38,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 91 states have (on average 1.164835164835165) internal successors, (106), 101 states have internal predecessors, (106), 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-12 13:19:38,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 106 transitions. [2024-11-12 13:19:38,836 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 106 transitions. Word has length 32 [2024-11-12 13:19:38,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:19:38,836 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 106 transitions. [2024-11-12 13:19:38,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 16 states have internal predecessors, (32), 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-12 13:19:38,836 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 106 transitions. [2024-11-12 13:19:38,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-12 13:19:38,837 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:19:38,837 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 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-12 13:19:38,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-12 13:19:38,837 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-12 13:19:38,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:19:38,837 INFO L85 PathProgramCache]: Analyzing trace with hash -973970341, now seen corresponding path program 1 times [2024-11-12 13:19:38,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:19:38,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760689840] [2024-11-12 13:19:38,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:19:38,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:19:38,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:19:38,891 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-12 13:19:38,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:19:38,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760689840] [2024-11-12 13:19:38,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760689840] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:19:38,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:19:38,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 13:19:38,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995987172] [2024-11-12 13:19:38,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:19:38,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 13:19:38,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:19:38,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 13:19:38,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-12 13:19:38,893 INFO L87 Difference]: Start difference. First operand 102 states and 106 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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-12 13:19:38,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:19:38,906 INFO L93 Difference]: Finished difference Result 119 states and 123 transitions. [2024-11-12 13:19:38,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 13:19:38,906 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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 32 [2024-11-12 13:19:38,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:19:38,907 INFO L225 Difference]: With dead ends: 119 [2024-11-12 13:19:38,907 INFO L226 Difference]: Without dead ends: 103 [2024-11-12 13:19:38,907 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-12 13:19:38,907 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 14 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 13:19:38,908 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 154 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:19:38,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-12 13:19:38,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 86. [2024-11-12 13:19:38,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 75 states have (on average 1.1866666666666668) internal successors, (89), 85 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-12 13:19:38,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 89 transitions. [2024-11-12 13:19:38,910 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 89 transitions. Word has length 32 [2024-11-12 13:19:38,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:19:38,910 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 89 transitions. [2024-11-12 13:19:38,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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-12 13:19:38,910 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 89 transitions. [2024-11-12 13:19:38,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-12 13:19:38,911 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:19:38,911 INFO L218 NwaCegarLoop]: trace histogram [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] [2024-11-12 13:19:38,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-12 13:19:38,911 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-12 13:19:38,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:19:38,911 INFO L85 PathProgramCache]: Analyzing trace with hash 1880889347, now seen corresponding path program 1 times [2024-11-12 13:19:38,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:19:38,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717528224] [2024-11-12 13:19:38,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:19:38,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:19:38,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:19:39,883 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 13:19:39,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:19:39,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717528224] [2024-11-12 13:19:39,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717528224] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:19:39,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1190765948] [2024-11-12 13:19:39,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:19:39,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:19:39,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:19:39,887 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 13:19:39,889 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-12 13:19:40,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:19:40,026 INFO L256 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 80 conjuncts are in the unsatisfiable core [2024-11-12 13:19:40,030 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:19:40,142 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 11 treesize of output 7 [2024-11-12 13:19:40,210 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 11 treesize of output 7 [2024-11-12 13:19:40,220 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-12 13:19:40,281 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-12 13:19:40,281 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-12 13:19:40,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2024-11-12 13:19:40,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-12 13:19:40,581 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 19 treesize of output 11 [2024-11-12 13:19:40,825 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 13:19:40,832 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-12 13:19:40,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 54 [2024-11-12 13:19:40,960 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 39 treesize of output 16 [2024-11-12 13:19:40,969 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-12 13:19:41,239 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 38 treesize of output 22 [2024-11-12 13:19:41,296 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:19:41,296 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:19:41,903 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 84 treesize of output 76 [2024-11-12 13:19:41,906 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 130 treesize of output 122 [2024-11-12 13:19:42,549 INFO L349 Elim1Store]: treesize reduction 66, result has 77.3 percent of original size [2024-11-12 13:19:42,549 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 8 new quantified variables, introduced 28 case distinctions, treesize of input 1053 treesize of output 1206 [2024-11-12 13:19:42,724 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:19:42,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 476 treesize of output 630 [2024-11-12 13:20:04,332 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:20:04,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1190765948] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 13:20:04,333 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 13:20:04,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 18, 17] total 45 [2024-11-12 13:20:04,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463747627] [2024-11-12 13:20:04,333 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 13:20:04,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2024-11-12 13:20:04,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:20:04,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-11-12 13:20:04,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=248, Invalid=1822, Unknown=0, NotChecked=0, Total=2070 [2024-11-12 13:20:04,335 INFO L87 Difference]: Start difference. First operand 86 states and 89 transitions. Second operand has 46 states, 45 states have (on average 2.2888888888888888) internal successors, (103), 46 states have internal predecessors, (103), 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-12 13:20:05,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:20:05,904 INFO L93 Difference]: Finished difference Result 100 states and 104 transitions. [2024-11-12 13:20:05,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-12 13:20:05,905 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 2.2888888888888888) internal successors, (103), 46 states have internal predecessors, (103), 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 36 [2024-11-12 13:20:05,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:20:05,905 INFO L225 Difference]: With dead ends: 100 [2024-11-12 13:20:05,905 INFO L226 Difference]: Without dead ends: 100 [2024-11-12 13:20:05,907 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1002 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=656, Invalid=3376, Unknown=0, NotChecked=0, Total=4032 [2024-11-12 13:20:05,907 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 111 mSDsluCounter, 621 mSDsCounter, 0 mSdLazyCounter, 802 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 664 SdHoareTripleChecker+Invalid, 820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 802 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-12 13:20:05,907 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 664 Invalid, 820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 802 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-12 13:20:05,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-12 13:20:05,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 85. [2024-11-12 13:20:05,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 75 states have (on average 1.1733333333333333) internal successors, (88), 84 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-12 13:20:05,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 88 transitions. [2024-11-12 13:20:05,910 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 88 transitions. Word has length 36 [2024-11-12 13:20:05,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:20:05,910 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 88 transitions. [2024-11-12 13:20:05,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 2.2888888888888888) internal successors, (103), 46 states have internal predecessors, (103), 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-12 13:20:05,910 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 88 transitions. [2024-11-12 13:20:05,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-12 13:20:05,911 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:20:05,911 INFO L218 NwaCegarLoop]: trace histogram [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] [2024-11-12 13:20:05,929 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-12 13:20:06,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:20:06,116 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-12 13:20:06,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:20:06,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1821972289, now seen corresponding path program 1 times [2024-11-12 13:20:06,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:20:06,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154190920] [2024-11-12 13:20:06,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:20:06,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:20:06,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:20:07,045 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 13:20:07,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:20:07,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154190920] [2024-11-12 13:20:07,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154190920] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:20:07,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [865103875] [2024-11-12 13:20:07,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:20:07,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:20:07,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:20:07,048 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 13:20:07,049 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-12 13:20:07,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:20:07,191 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 63 conjuncts are in the unsatisfiable core [2024-11-12 13:20:07,197 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:20:07,321 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-12 13:20:07,383 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-12 13:20:07,393 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 11 treesize of output 7 [2024-11-12 13:20:07,462 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-12 13:20:07,462 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-12 13:20:07,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-12 13:20:07,597 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 29 treesize of output 28 [2024-11-12 13:20:07,743 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 19 treesize of output 11 [2024-11-12 13:20:07,947 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 13:20:07,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:20:07,957 INFO L349 Elim1Store]: treesize reduction 67, result has 4.3 percent of original size [2024-11-12 13:20:07,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 67 treesize of output 46 [2024-11-12 13:20:08,087 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 13:20:08,088 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 85 treesize of output 54 [2024-11-12 13:20:08,093 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 13:20:08,094 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-12 13:20:08,401 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 13:20:08,401 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 82 treesize of output 58 [2024-11-12 13:20:08,404 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 13:20:08,406 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:20:08,406 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 76 treesize of output 51 [2024-11-12 13:20:08,442 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-12 13:20:08,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 19 [2024-11-12 13:20:08,445 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:20:08,445 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:20:09,351 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2024-11-12 13:20:09,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 209 treesize of output 207 [2024-11-12 13:20:09,377 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:20:09,377 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 136 treesize of output 136 [2024-11-12 13:20:09,441 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2024-11-12 13:20:09,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 261 treesize of output 255 [2024-11-12 13:20:09,476 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:20:09,477 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 126 treesize of output 124 [2024-11-12 13:20:09,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-12 13:20:09,525 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-12 13:20:09,576 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:20:09,576 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 174 treesize of output 190 [2024-11-12 13:20:09,944 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:20:09,944 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 529 treesize of output 531 [2024-11-12 13:20:38,054 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse18 (< |c_ULTIMATE.start_main_~#list~0#1.offset| (+ 2 |c_ULTIMATE.start_append_~plist#1.offset|))) (.cse16 (< |c_ULTIMATE.start_main_~#list~0#1.offset| 1)) (.cse19 (< |c_ULTIMATE.start_append_~plist#1.offset| 1)) (.cse24 (< |c_ULTIMATE.start_main_~#list~0#1.offset| 0)) (.cse4 (+ 4 |c_ULTIMATE.start_append_~item~0#1.offset|))) (let ((.cse143 (forall ((v_arrayElimCell_72 Int) (|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_29| Int) (v_prenex_25 Int) (|v_ULTIMATE.start_append_~item~0#1.base_34| Int) (v_arrayElimCell_75 Int)) (let ((.cse338 (+ 4 v_arrayElimCell_75))) (or (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|) |v_ULTIMATE.start_append_~item~0#1.offset_29| v_arrayElimCell_72) (+ |v_ULTIMATE.start_append_~item~0#1.offset_29| 4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) v_prenex_25) .cse338) |c_#StackHeapBarrier|) (< v_arrayElimCell_75 0) (< (select (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_72) .cse338) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_29|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0)))))) (.cse12 (= |c_ULTIMATE.start_main_~#list~0#1.base| |c_ULTIMATE.start_append_~plist#1.base|)) (.cse47 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_append_~item~0#1.base|) .cse4)) (.cse0 (= |c_ULTIMATE.start_main_~#list~0#1.offset| |c_ULTIMATE.start_append_~plist#1.offset|)) (.cse331 (or .cse19 .cse24)) (.cse332 (or (< |c_ULTIMATE.start_main_~#list~0#1.offset| (+ |c_ULTIMATE.start_append_~plist#1.offset| 1)) .cse24)) (.cse324 (or .cse19 .cse16)) (.cse325 (or .cse16 .cse18))) (let ((.cse179 (and .cse331 .cse332 .cse324 .cse325)) (.cse147 (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_29| Int)) (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_34| Int)) (or (forall ((v_arrayElimCell_72 Int) (|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int)) (or (< (select (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_72) .cse4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (forall ((v_prenex_26 Int)) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|) |v_ULTIMATE.start_append_~item~0#1.offset_29| v_arrayElimCell_72) (+ |v_ULTIMATE.start_append_~item~0#1.offset_29| 4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) v_prenex_26) .cse4) |c_#StackHeapBarrier|)))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0)))) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_29|)))) (.cse32 (or .cse0 (forall ((v_arrayElimCell_72 Int) (|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_29| Int) (v_prenex_25 Int) (|v_ULTIMATE.start_append_~item~0#1.base_34| Int)) (or (< (select (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_72) .cse4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|) |v_ULTIMATE.start_append_~item~0#1.offset_29| v_arrayElimCell_72) (+ |v_ULTIMATE.start_append_~item~0#1.offset_29| 4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) v_prenex_25) .cse4) |c_#StackHeapBarrier|) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_29|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0)))))) (.cse80 (forall ((v_arrayElimCell_72 Int) (|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_29| Int) (|v_ULTIMATE.start_append_~item~0#1.base_34| Int) (v_arrayElimCell_75 Int)) (let ((.cse336 (+ 4 v_arrayElimCell_75)) (.cse337 (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|) |v_ULTIMATE.start_append_~item~0#1.offset_29| |c_ULTIMATE.start_append_~item~0#1.base|))) (or (< v_arrayElimCell_75 0) (< (select (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_72) .cse336) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_29|) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse337 (+ |v_ULTIMATE.start_append_~item~0#1.offset_29| 4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) v_arrayElimCell_72) .cse336) |c_#StackHeapBarrier|) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| .cse337) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0)))))) (.cse58 (forall ((v_arrayElimCell_72 Int) (|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_29| Int) (v_prenex_25 Int) (|v_ULTIMATE.start_append_~item~0#1.base_34| Int) (v_arrayElimCell_75 Int)) (let ((.cse335 (+ 4 v_arrayElimCell_75)) (.cse334 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|))) (or (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store (store .cse334 |v_ULTIMATE.start_append_~item~0#1.offset_29| v_arrayElimCell_72) (+ |v_ULTIMATE.start_append_~item~0#1.offset_29| 4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) v_prenex_25) .cse335) |c_#StackHeapBarrier|) (< v_arrayElimCell_75 0) (< (select (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_72) .cse335) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_29|) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse334 |v_ULTIMATE.start_append_~item~0#1.offset_29| |c_ULTIMATE.start_append_~item~0#1.base|)) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0)))))) (.cse25 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_34| Int)) (or (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0 |c_ULTIMATE.start_append_~item~0#1.base|)) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4) |c_#StackHeapBarrier|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0))))) (.cse264 (forall ((v_arrayElimCell_72 Int) (v_prenex_26 Int) (|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_29| Int) (|v_ULTIMATE.start_append_~item~0#1.base_34| Int)) (or (< (select (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_72) .cse4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_29|) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|) |v_ULTIMATE.start_append_~item~0#1.offset_29| v_arrayElimCell_72) (+ |v_ULTIMATE.start_append_~item~0#1.offset_29| 4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) v_prenex_26) .cse4) |c_#StackHeapBarrier|) (< .cse47 |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0))))) (.cse263 (forall ((v_arrayElimCell_72 Int) (|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_29| Int) (v_prenex_25 Int) (|v_ULTIMATE.start_append_~item~0#1.base_34| Int)) (or (< (select (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_72) .cse4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|) |v_ULTIMATE.start_append_~item~0#1.offset_29| v_arrayElimCell_72) (+ |v_ULTIMATE.start_append_~item~0#1.offset_29| 4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) v_prenex_25) .cse4) |c_#StackHeapBarrier|) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_29|) (< .cse47 |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0))))) (.cse43 (< |c_ULTIMATE.start_append_~plist#1.offset| 0)) (.cse45 (< |c_ULTIMATE.start_main_~#list~0#1.offset| |c_ULTIMATE.start_append_~plist#1.offset|)) (.cse46 (not .cse12)) (.cse14 (forall ((v_arrayElimCell_72 Int) (v_arrayElimCell_75 Int)) (or (< v_arrayElimCell_75 0) (< (select (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_72) (+ 4 v_arrayElimCell_75)) |c_#StackHeapBarrier|)))) (.cse112 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_34| Int)) (or (forall ((v_arrayElimCell_72 Int) (v_arrayElimCell_75 Int)) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0 v_arrayElimCell_72)) v_arrayElimCell_72) (+ 4 v_arrayElimCell_75)) |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0))))) (.cse161 (forall ((v_arrayElimCell_72 Int) (|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_29| Int) (|v_ULTIMATE.start_append_~item~0#1.base_34| Int) (v_arrayElimCell_75 Int)) (let ((.cse333 (+ 4 v_arrayElimCell_75))) (or (< v_arrayElimCell_75 0) (< (select (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_72) .cse333) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_29|) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|) |v_ULTIMATE.start_append_~item~0#1.offset_29| |c_ULTIMATE.start_append_~item~0#1.base|) (+ |v_ULTIMATE.start_append_~item~0#1.offset_29| 4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) v_arrayElimCell_72) .cse333) |c_#StackHeapBarrier|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0)))))) (.cse176 (and .cse331 .cse332)) (.cse184 (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_29| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_29|) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_34| Int)) (or (forall ((|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int) (v_arrayElimCell_75 Int)) (or (< v_arrayElimCell_75 0) (forall ((v_arrayElimCell_72 Int) (v_prenex_26 Int)) (let ((.cse330 (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|) |v_ULTIMATE.start_append_~item~0#1.offset_29| v_arrayElimCell_72)) (.cse329 (+ 4 v_arrayElimCell_75))) (or (< (select (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_72) .cse329) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| .cse330) v_arrayElimCell_72) .cse4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse330 (+ |v_ULTIMATE.start_append_~item~0#1.offset_29| 4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) v_prenex_26) .cse329) |c_#StackHeapBarrier|)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0))))))) (.cse140 (forall ((v_arrayElimCell_72 Int) (|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_29| Int) (v_prenex_25 Int) (|v_ULTIMATE.start_append_~item~0#1.base_34| Int) (v_arrayElimCell_75 Int)) (let ((.cse328 (+ 4 v_arrayElimCell_75)) (.cse327 (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|) |v_ULTIMATE.start_append_~item~0#1.offset_29| v_arrayElimCell_72))) (or (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse327 (+ |v_ULTIMATE.start_append_~item~0#1.offset_29| 4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) v_prenex_25) .cse328) |c_#StackHeapBarrier|) (< v_arrayElimCell_75 0) (< (select (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_72) .cse328) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| .cse327) v_arrayElimCell_72) .cse4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_29|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0)))))) (.cse129 (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_29| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_29|) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_34| Int)) (or (forall ((|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int) (v_arrayElimCell_75 Int)) (or (< v_arrayElimCell_75 0) (forall ((v_arrayElimCell_72 Int)) (let ((.cse326 (+ 4 v_arrayElimCell_75))) (or (< (select (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_72) .cse326) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (forall ((v_prenex_26 Int)) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|) |v_ULTIMATE.start_append_~item~0#1.offset_29| v_arrayElimCell_72) (+ |v_ULTIMATE.start_append_~item~0#1.offset_29| 4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) v_prenex_26) .cse326) |c_#StackHeapBarrier|))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0))))))) (.cse128 (or .cse143 .cse0)) (.cse1 (and .cse324 .cse325)) (.cse182 (forall ((v_arrayElimCell_72 Int) (|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_29| Int) (|v_ULTIMATE.start_append_~item~0#1.base_34| Int)) (or (< (select (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_72) .cse4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|) |v_ULTIMATE.start_append_~item~0#1.offset_29| |c_ULTIMATE.start_append_~item~0#1.base|) (+ |v_ULTIMATE.start_append_~item~0#1.offset_29| 4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) v_arrayElimCell_72) .cse4) |c_#StackHeapBarrier|) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_29|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0))))) (.cse165 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_34| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0)))) (.cse166 (forall ((v_arrayElimCell_72 Int)) (< (select (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_72) .cse4) |c_#StackHeapBarrier|)))) (let ((.cse11 (forall ((v_arrayElimCell_72 Int) (v_prenex_26 Int) (|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_29| Int) (|v_ULTIMATE.start_append_~item~0#1.base_34| Int) (v_arrayElimCell_75 Int)) (let ((.cse322 (+ 4 v_arrayElimCell_75)) (.cse323 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|))) (or (< v_arrayElimCell_75 0) (< (select (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_72) .cse322) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_29|) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store (store .cse323 |v_ULTIMATE.start_append_~item~0#1.offset_29| v_arrayElimCell_72) (+ |v_ULTIMATE.start_append_~item~0#1.offset_29| 4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) v_prenex_26) .cse322) |c_#StackHeapBarrier|) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse323 |v_ULTIMATE.start_append_~item~0#1.offset_29| |c_ULTIMATE.start_append_~item~0#1.base|)) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0)))))) (.cse7 (or (forall ((v_arrayElimCell_72 Int) (v_prenex_26 Int) (|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int) (v_arrayElimCell_84 Int) (|v_ULTIMATE.start_append_~item~0#1.offset_29| Int) (|v_ULTIMATE.start_append_~item~0#1.base_34| Int) (v_arrayElimCell_75 Int)) (let ((.cse321 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|))) (let ((.cse320 (store .cse321 |v_ULTIMATE.start_append_~item~0#1.offset_29| v_arrayElimCell_72))) (or (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| .cse320) v_arrayElimCell_72) (+ 4 v_arrayElimCell_75)) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (< v_arrayElimCell_84 0) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_29|) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse320 (+ |v_ULTIMATE.start_append_~item~0#1.offset_29| 4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) v_prenex_26) (+ 4 v_arrayElimCell_84)) |c_#StackHeapBarrier|) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse321 |v_ULTIMATE.start_append_~item~0#1.offset_29| |c_ULTIMATE.start_append_~item~0#1.base|)) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0)))))) .cse12)) (.cse102 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_34| Int)) (or (forall ((|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int)) (let ((.cse319 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|))) (or (< |v_ULTIMATE.start_append_#t~ite10#1.base_29| |c_#StackHeapBarrier|) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store (store .cse319 0 |c_ULTIMATE.start_append_~item~0#1.base|) 4 |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4) |c_#StackHeapBarrier|) (forall ((v_arrayElimCell_72 Int)) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse319 0 v_arrayElimCell_72)) v_arrayElimCell_72) .cse4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0))))) (.cse26 (or .cse165 .cse0 .cse24 .cse166)) (.cse27 (or .cse1 .cse182)) (.cse35 (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_29| Int)) (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_34| Int)) (or (forall ((v_arrayElimCell_72 Int) (|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int) (v_arrayElimCell_75 Int)) (let ((.cse318 (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|) |v_ULTIMATE.start_append_~item~0#1.offset_29| v_arrayElimCell_72))) (or (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| .cse318) v_arrayElimCell_72) (+ 4 v_arrayElimCell_75)) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse318 (+ |v_ULTIMATE.start_append_~item~0#1.offset_29| 4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4) |c_#StackHeapBarrier|)))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0)))) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_29|)))) (.cse36 (or .cse0 (forall ((v_arrayElimCell_72 Int) (|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_29| Int) (v_prenex_25 Int) (|v_ULTIMATE.start_append_~item~0#1.base_34| Int) (v_arrayElimCell_75 Int)) (let ((.cse317 (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|) |v_ULTIMATE.start_append_~item~0#1.offset_29| v_arrayElimCell_72))) (or (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| .cse317) v_arrayElimCell_72) (+ 4 v_arrayElimCell_75)) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse317 (+ |v_ULTIMATE.start_append_~item~0#1.offset_29| 4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) v_prenex_25) .cse4) |c_#StackHeapBarrier|) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_29|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0))))))) (.cse117 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_34| Int)) (or (forall ((v_arrayElimCell_72 Int)) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0 v_arrayElimCell_72)) v_arrayElimCell_72) .cse4) |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0))))) (.cse115 (forall ((v_arrayElimCell_72 Int) (|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int) (|v_ULTIMATE.start_append_~item~0#1.base_34| Int) (v_arrayElimCell_75 Int)) (let ((.cse316 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|)) (.cse315 (+ 4 v_arrayElimCell_75))) (or (< |v_ULTIMATE.start_append_#t~ite10#1.base_29| |c_#StackHeapBarrier|) (< v_arrayElimCell_75 0) (< (select (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_72) .cse315) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse316 0 v_arrayElimCell_72)) v_arrayElimCell_72) .cse4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store (store .cse316 0 |c_ULTIMATE.start_append_~item~0#1.base|) 4 |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) |c_ULTIMATE.start_append_~item~0#1.base|) .cse315) |c_#StackHeapBarrier|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0)))))) (.cse110 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_34| Int)) (or (forall ((v_arrayElimCell_72 Int) (v_arrayElimCell_75 Int)) (let ((.cse314 (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0 v_arrayElimCell_72)) v_arrayElimCell_72))) (or (< (select .cse314 .cse4) |c_#StackHeapBarrier|) (< (select .cse314 (+ 4 v_arrayElimCell_75)) |c_#StackHeapBarrier|)))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0))))) (.cse111 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_34| Int)) (or (forall ((|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int)) (or (< |v_ULTIMATE.start_append_#t~ite10#1.base_29| |c_#StackHeapBarrier|) (forall ((v_arrayElimCell_72 Int) (v_arrayElimCell_75 Int)) (let ((.cse313 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|))) (let ((.cse311 (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse313 0 v_arrayElimCell_72)) v_arrayElimCell_72)) (.cse312 (+ 4 v_arrayElimCell_75))) (or (< (select .cse311 .cse312) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (< (select .cse311 .cse4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store (store .cse313 0 |c_ULTIMATE.start_append_~item~0#1.base|) 4 |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) |c_ULTIMATE.start_append_~item~0#1.base|) .cse312) |c_#StackHeapBarrier|))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0))))) (.cse118 (or .cse1 (and .cse128 (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_29| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_29|) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_34| Int)) (or (forall ((|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int) (v_arrayElimCell_75 Int)) (or (< v_arrayElimCell_75 0) (forall ((v_arrayElimCell_72 Int) (v_prenex_26 Int)) (let ((.cse310 (+ 4 v_arrayElimCell_75))) (or (< (select (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_72) .cse310) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|) |v_ULTIMATE.start_append_~item~0#1.offset_29| v_arrayElimCell_72) (+ |v_ULTIMATE.start_append_~item~0#1.offset_29| 4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) v_prenex_26) .cse310) |c_#StackHeapBarrier|)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0))))))))) (.cse127 (and .cse128 .cse129)) (.cse162 (forall ((v_arrayElimCell_72 Int) (|v_ULTIMATE.start_append_~item~0#1.base_34| Int) (v_arrayElimCell_75 Int)) (or (< v_arrayElimCell_75 0) (< (select (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_72) (+ 4 v_arrayElimCell_75)) |c_#StackHeapBarrier|) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0 v_arrayElimCell_72)) v_arrayElimCell_72) .cse4) |c_#StackHeapBarrier|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0))))) (.cse130 (and .cse184 (or .cse140 .cse0))) (.cse116 (forall ((v_arrayElimCell_72 Int) (|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_29| Int) (|v_ULTIMATE.start_append_~item~0#1.base_34| Int) (v_arrayElimCell_75 Int)) (let ((.cse309 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|)) (.cse308 (+ 4 v_arrayElimCell_75))) (or (< |v_ULTIMATE.start_append_#t~ite10#1.base_29| |c_#StackHeapBarrier|) (< v_arrayElimCell_75 0) (< (select (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_72) .cse308) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse309 |v_ULTIMATE.start_append_~item~0#1.offset_29| v_arrayElimCell_72)) v_arrayElimCell_72) .cse4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_29|) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store (store .cse309 |v_ULTIMATE.start_append_~item~0#1.offset_29| |c_ULTIMATE.start_append_~item~0#1.base|) (+ |v_ULTIMATE.start_append_~item~0#1.offset_29| 4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) |c_ULTIMATE.start_append_~item~0#1.base|) .cse308) |c_#StackHeapBarrier|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0)))))) (.cse113 (forall ((v_arrayElimCell_72 Int) (|v_ULTIMATE.start_append_~item~0#1.offset_29| Int) (|v_ULTIMATE.start_append_~item~0#1.base_34| Int) (v_arrayElimCell_75 Int)) (or (< v_arrayElimCell_75 0) (< (select (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_72) (+ 4 v_arrayElimCell_75)) |c_#StackHeapBarrier|) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_29|) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|) |v_ULTIMATE.start_append_~item~0#1.offset_29| v_arrayElimCell_72)) v_arrayElimCell_72) .cse4) |c_#StackHeapBarrier|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0))))) (.cse171 (or .cse176 (forall ((v_arrayElimCell_72 Int) (|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int) (|v_ULTIMATE.start_append_~item~0#1.base_34| Int) (v_arrayElimCell_75 Int)) (let ((.cse307 (+ 4 v_arrayElimCell_75))) (or (< |v_ULTIMATE.start_append_#t~ite10#1.base_29| |c_#StackHeapBarrier|) (< v_arrayElimCell_75 0) (< (select (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_72) .cse307) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0 |c_ULTIMATE.start_append_~item~0#1.base|) 4 |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) |c_ULTIMATE.start_append_~item~0#1.base|) .cse307) |c_#StackHeapBarrier|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0))))))) (.cse30 (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_29| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_29|) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_34| Int)) (or (forall ((v_arrayElimCell_72 Int) (|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int)) (or (< (select (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_72) .cse4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|) |v_ULTIMATE.start_append_~item~0#1.offset_29| v_arrayElimCell_72) (+ |v_ULTIMATE.start_append_~item~0#1.offset_29| 4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4) |c_#StackHeapBarrier|))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0))))))) (.cse148 (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_29| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_29|) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_34| Int)) (or (forall ((v_arrayElimCell_72 Int) (|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int)) (or (< (select (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_72) .cse4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (forall ((v_prenex_25 Int)) (<= (+ (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|) |v_ULTIMATE.start_append_~item~0#1.offset_29| v_arrayElimCell_72) (+ |v_ULTIMATE.start_append_~item~0#1.offset_29| 4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) v_prenex_25) .cse4) 1) |c_#StackHeapBarrier|)))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0))))))) (.cse133 (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_29| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_29|) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_34| Int)) (or (forall ((|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int) (v_arrayElimCell_84 Int)) (or (forall ((v_arrayElimCell_72 Int)) (let ((.cse306 (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|) |v_ULTIMATE.start_append_~item~0#1.offset_29| v_arrayElimCell_72))) (or (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| .cse306) v_arrayElimCell_72) .cse4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse306 (+ |v_ULTIMATE.start_append_~item~0#1.offset_29| 4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_84)) |c_#StackHeapBarrier|)))) (< v_arrayElimCell_84 0))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0))))))) (.cse134 (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_29| Int)) (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_34| Int)) (or (forall ((v_arrayElimCell_72 Int) (|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int) (v_arrayElimCell_84 Int)) (let ((.cse305 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|))) (or (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse305 |v_ULTIMATE.start_append_~item~0#1.offset_29| v_arrayElimCell_72)) v_arrayElimCell_72) .cse4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (< v_arrayElimCell_84 0) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store (store .cse305 |v_ULTIMATE.start_append_~item~0#1.offset_29| |c_ULTIMATE.start_append_~item~0#1.base|) (+ |v_ULTIMATE.start_append_~item~0#1.offset_29| 4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) v_arrayElimCell_72) (+ 4 v_arrayElimCell_84)) |c_#StackHeapBarrier|)))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0)))) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_29|)))) (.cse135 (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_29| Int)) (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_34| Int)) (or (forall ((|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int)) (let ((.cse304 (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|) |v_ULTIMATE.start_append_~item~0#1.offset_29| |c_ULTIMATE.start_append_~item~0#1.base|))) (or (forall ((v_arrayElimCell_84 Int)) (or (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse304 (+ |v_ULTIMATE.start_append_~item~0#1.offset_29| 4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_84)) |c_#StackHeapBarrier|) (< v_arrayElimCell_84 0))) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| .cse304) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|)))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0)))) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_29|)))) (.cse136 (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_29| Int)) (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_34| Int)) (or (forall ((v_arrayElimCell_72 Int) (|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int) (v_arrayElimCell_84 Int)) (let ((.cse303 (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|) |v_ULTIMATE.start_append_~item~0#1.offset_29| v_arrayElimCell_72))) (or (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| .cse303) v_arrayElimCell_72) .cse4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (< v_arrayElimCell_84 0) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse303 (+ |v_ULTIMATE.start_append_~item~0#1.offset_29| 4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_84)) |c_#StackHeapBarrier|)))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0)))) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_29|)))) (.cse137 (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_29| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_29|) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_34| Int)) (or (forall ((|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int) (v_arrayElimCell_84 Int)) (or (forall ((v_arrayElimCell_72 Int) (v_prenex_25 Int)) (let ((.cse302 (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|) |v_ULTIMATE.start_append_~item~0#1.offset_29| v_arrayElimCell_72))) (or (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| .cse302) v_arrayElimCell_72) .cse4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse302 (+ |v_ULTIMATE.start_append_~item~0#1.offset_29| 4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) v_prenex_25) (+ 4 v_arrayElimCell_84)) |c_#StackHeapBarrier|)))) (< v_arrayElimCell_84 0))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0))))))) (.cse139 (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_29| Int)) (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_34| Int)) (or (forall ((v_arrayElimCell_72 Int) (|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int) (v_arrayElimCell_84 Int) (v_prenex_25 Int)) (let ((.cse301 (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|) |v_ULTIMATE.start_append_~item~0#1.offset_29| v_arrayElimCell_72))) (or (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| .cse301) v_arrayElimCell_72) .cse4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (< v_arrayElimCell_84 0) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse301 (+ |v_ULTIMATE.start_append_~item~0#1.offset_29| 4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) v_prenex_25) (+ 4 v_arrayElimCell_84)) |c_#StackHeapBarrier|)))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0)))) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_29|)))) (.cse152 (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_29| Int)) (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_34| Int)) (or (forall ((v_arrayElimCell_72 Int) (|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int) (v_arrayElimCell_84 Int) (v_arrayElimCell_75 Int)) (let ((.cse300 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|))) (or (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse300 |v_ULTIMATE.start_append_~item~0#1.offset_29| v_arrayElimCell_72)) v_arrayElimCell_72) (+ 4 v_arrayElimCell_75)) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (< v_arrayElimCell_84 0) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store (store .cse300 |v_ULTIMATE.start_append_~item~0#1.offset_29| |c_ULTIMATE.start_append_~item~0#1.base|) (+ |v_ULTIMATE.start_append_~item~0#1.offset_29| 4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) v_arrayElimCell_72) (+ 4 v_arrayElimCell_84)) |c_#StackHeapBarrier|)))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0)))) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_29|)))) (.cse156 (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_29| Int)) (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_34| Int)) (or (forall ((v_arrayElimCell_72 Int) (|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int) (v_arrayElimCell_84 Int) (v_arrayElimCell_75 Int)) (let ((.cse299 (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|) |v_ULTIMATE.start_append_~item~0#1.offset_29| v_arrayElimCell_72))) (or (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| .cse299) v_arrayElimCell_72) (+ 4 v_arrayElimCell_75)) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (< v_arrayElimCell_84 0) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse299 (+ |v_ULTIMATE.start_append_~item~0#1.offset_29| 4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_84)) |c_#StackHeapBarrier|)))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0)))) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_29|)))) (.cse157 (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_29| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_29|) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_34| Int)) (or (forall ((|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int) (v_arrayElimCell_84 Int) (v_arrayElimCell_75 Int)) (or (< v_arrayElimCell_84 0) (forall ((v_arrayElimCell_72 Int) (v_prenex_25 Int)) (let ((.cse298 (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|) |v_ULTIMATE.start_append_~item~0#1.offset_29| v_arrayElimCell_72))) (let ((.cse297 (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| .cse298) v_arrayElimCell_72))) (or (< (select .cse297 (+ 4 v_arrayElimCell_75)) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (< (select .cse297 .cse4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse298 (+ |v_ULTIMATE.start_append_~item~0#1.offset_29| 4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) v_prenex_25) (+ 4 v_arrayElimCell_84)) |c_#StackHeapBarrier|))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0))))))) (.cse158 (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_29| Int)) (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_34| Int)) (or (forall ((v_arrayElimCell_72 Int) (|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int) (v_arrayElimCell_84 Int) (v_prenex_25 Int) (v_arrayElimCell_75 Int)) (let ((.cse296 (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|) |v_ULTIMATE.start_append_~item~0#1.offset_29| v_arrayElimCell_72))) (or (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| .cse296) v_arrayElimCell_72) (+ 4 v_arrayElimCell_75)) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (< v_arrayElimCell_84 0) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse296 (+ |v_ULTIMATE.start_append_~item~0#1.offset_29| 4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) v_prenex_25) (+ 4 v_arrayElimCell_84)) |c_#StackHeapBarrier|)))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0)))) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_29|)))) (.cse121 (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_29| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_29|) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_34| Int)) (or (forall ((v_arrayElimCell_72 Int) (v_prenex_26 Int) (|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int) (v_arrayElimCell_75 Int)) (let ((.cse295 (+ 4 v_arrayElimCell_75))) (or (< v_arrayElimCell_75 0) (< (select (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_72) .cse295) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|) |v_ULTIMATE.start_append_~item~0#1.offset_29| v_arrayElimCell_72) (+ |v_ULTIMATE.start_append_~item~0#1.offset_29| 4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) v_prenex_26) .cse295) |c_#StackHeapBarrier|)))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0))))))) (.cse159 (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_29| Int)) (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_34| Int)) (or (forall ((|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int)) (let ((.cse294 (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|) |v_ULTIMATE.start_append_~item~0#1.offset_29| |c_ULTIMATE.start_append_~item~0#1.base|))) (or (forall ((v_arrayElimCell_75 Int)) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| .cse294) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_75)) |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) (forall ((v_arrayElimCell_84 Int)) (or (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse294 (+ |v_ULTIMATE.start_append_~item~0#1.offset_29| 4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_84)) |c_#StackHeapBarrier|) (< v_arrayElimCell_84 0)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0)))) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_29|)))) (.cse125 (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_29| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_29|) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_34| Int)) (or (forall ((v_arrayElimCell_72 Int) (v_prenex_26 Int) (|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int) (v_arrayElimCell_84 Int) (v_arrayElimCell_75 Int)) (let ((.cse293 (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|) |v_ULTIMATE.start_append_~item~0#1.offset_29| v_arrayElimCell_72))) (or (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| .cse293) v_arrayElimCell_72) (+ 4 v_arrayElimCell_75)) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (< v_arrayElimCell_84 0) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse293 (+ |v_ULTIMATE.start_append_~item~0#1.offset_29| 4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) v_prenex_26) (+ 4 v_arrayElimCell_84)) |c_#StackHeapBarrier|)))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0))))))) (.cse160 (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_29| Int)) (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_34| Int)) (or (forall ((|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int) (v_arrayElimCell_84 Int) (v_arrayElimCell_75 Int)) (or (forall ((v_arrayElimCell_72 Int)) (let ((.cse292 (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|) |v_ULTIMATE.start_append_~item~0#1.offset_29| v_arrayElimCell_72))) (let ((.cse291 (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| .cse292) v_arrayElimCell_72))) (or (< (select .cse291 (+ 4 v_arrayElimCell_75)) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (< (select .cse291 .cse4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse292 (+ |v_ULTIMATE.start_append_~item~0#1.offset_29| 4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_84)) |c_#StackHeapBarrier|))))) (< v_arrayElimCell_84 0))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0)))) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_29|)))) (.cse144 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_34| Int)) (or (forall ((v_arrayElimCell_72 Int) (|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int)) (or (< (select (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_72) .cse4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0 v_arrayElimCell_72) 4 |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4) |c_#StackHeapBarrier|))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0))))) (.cse145 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_34| Int)) (or (forall ((v_arrayElimCell_72 Int) (|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int)) (or (< (select (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_72) .cse4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (forall ((v_prenex_25 Int)) (<= (+ (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0 v_arrayElimCell_72) 4 |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) v_prenex_25) .cse4) 1) |c_#StackHeapBarrier|)))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0))))) (.cse149 (forall ((v_arrayElimCell_72 Int) (|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int) (|v_ULTIMATE.start_append_~item~0#1.base_34| Int)) (or (< (select (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_72) .cse4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0 |c_ULTIMATE.start_append_~item~0#1.base|) 4 |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) v_arrayElimCell_72) .cse4) |c_#StackHeapBarrier|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0))))) (.cse120 (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_29| Int)) (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_34| Int)) (or (forall ((|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int) (v_arrayElimCell_75 Int)) (or (< v_arrayElimCell_75 0) (forall ((v_arrayElimCell_72 Int)) (let ((.cse290 (+ 4 v_arrayElimCell_75))) (or (< (select (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_72) .cse290) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (forall ((v_prenex_25 Int)) (<= (+ (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|) |v_ULTIMATE.start_append_~item~0#1.offset_29| v_arrayElimCell_72) (+ |v_ULTIMATE.start_append_~item~0#1.offset_29| 4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) v_prenex_25) .cse290) 1) |c_#StackHeapBarrier|))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0)))) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_29|)))) (.cse150 (forall ((v_arrayElimCell_72 Int) (v_prenex_26 Int) (|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_29| Int) (|v_ULTIMATE.start_append_~item~0#1.base_34| Int) (v_arrayElimCell_75 Int)) (let ((.cse289 (+ 4 v_arrayElimCell_75))) (or (< v_arrayElimCell_75 0) (< (select (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_72) .cse289) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_29|) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|) |v_ULTIMATE.start_append_~item~0#1.offset_29| v_arrayElimCell_72) (+ |v_ULTIMATE.start_append_~item~0#1.offset_29| 4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) v_prenex_26) .cse289) |c_#StackHeapBarrier|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0)))))) (.cse114 (or .cse161 .cse1)) (.cse126 (or .cse24 (and (forall ((|v_ULTIMATE.start_append_~item~0#1.base_34| Int)) (or (forall ((|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int)) (or (< |v_ULTIMATE.start_append_#t~ite10#1.base_29| |c_#StackHeapBarrier|) (forall ((v_arrayElimCell_72 Int) (v_arrayElimCell_75 Int)) (let ((.cse287 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|)) (.cse288 (+ 4 v_arrayElimCell_75))) (or (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store (store .cse287 0 |c_ULTIMATE.start_append_~item~0#1.base|) 4 |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) v_arrayElimCell_72) .cse288) |c_#StackHeapBarrier|) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse287 0 v_arrayElimCell_72)) v_arrayElimCell_72) .cse288) |v_ULTIMATE.start_append_#t~ite10#1.base_29|)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0)))) .cse112))) (.cse122 (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_29| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_29|) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_34| Int)) (or (forall ((v_arrayElimCell_72 Int) (|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int) (v_arrayElimCell_75 Int)) (let ((.cse286 (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|) |v_ULTIMATE.start_append_~item~0#1.offset_29| v_arrayElimCell_72))) (or (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| .cse286) v_arrayElimCell_72) (+ 4 v_arrayElimCell_75)) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (forall ((v_arrayElimCell_84 Int)) (or (< v_arrayElimCell_84 0) (forall ((v_prenex_25 Int)) (<= (+ (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse286 (+ |v_ULTIMATE.start_append_~item~0#1.offset_29| 4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) v_prenex_25) (+ 4 v_arrayElimCell_84)) 1) |c_#StackHeapBarrier|))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0))))))) (.cse174 (or .cse165 .cse14 .cse24)) (.cse51 (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_29| Int)) (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_34| Int)) (or (forall ((|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int)) (or (< .cse47 |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (forall ((v_arrayElimCell_81 Int)) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|) |v_ULTIMATE.start_append_~item~0#1.offset_29| |c_ULTIMATE.start_append_~item~0#1.base|) (+ |v_ULTIMATE.start_append_~item~0#1.offset_29| 4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) v_arrayElimCell_81) .cse4) |c_#StackHeapBarrier|)))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0)))) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_29|)))) (.cse52 (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_29| Int)) (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_34| Int)) (or (forall ((|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int)) (or (forall ((v_arrayElimCell_72 Int) (v_prenex_25 Int)) (<= (+ (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|) |v_ULTIMATE.start_append_~item~0#1.offset_29| v_arrayElimCell_72) (+ |v_ULTIMATE.start_append_~item~0#1.offset_29| 4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) v_prenex_25) .cse4) 1) |c_#StackHeapBarrier|)) (< .cse47 |v_ULTIMATE.start_append_#t~ite10#1.base_29|))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0)))) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_29|)))) (.cse48 (or .cse43 .cse45 (forall ((v_arrayElimCell_72 Int) (|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_29| Int) (v_arrayElimCell_81 Int) (|v_ULTIMATE.start_append_~item~0#1.base_34| Int)) (or (< (select (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_72) .cse4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_29|) (< .cse47 |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|) |v_ULTIMATE.start_append_~item~0#1.offset_29| |c_ULTIMATE.start_append_~item~0#1.base|) (+ |v_ULTIMATE.start_append_~item~0#1.offset_29| 4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) v_arrayElimCell_81) .cse4) |c_#StackHeapBarrier|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0)))) .cse46)) (.cse50 (or .cse16 .cse263)) (.cse49 (or .cse16 .cse264 .cse12)) (.cse54 (forall ((v_arrayElimCell_72 Int) (|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_29| Int) (v_prenex_25 Int) (|v_ULTIMATE.start_append_~item~0#1.base_34| Int) (v_arrayElimCell_75 Int)) (let ((.cse285 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|))) (let ((.cse284 (+ 4 v_arrayElimCell_75)) (.cse283 (store .cse285 |v_ULTIMATE.start_append_~item~0#1.offset_29| v_arrayElimCell_72))) (or (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse283 (+ |v_ULTIMATE.start_append_~item~0#1.offset_29| 4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) v_prenex_25) .cse284) |c_#StackHeapBarrier|) (< v_arrayElimCell_75 0) (< (select (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_72) .cse284) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| .cse283) v_arrayElimCell_72) .cse4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_29|) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse285 |v_ULTIMATE.start_append_~item~0#1.offset_29| |c_ULTIMATE.start_append_~item~0#1.base|)) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0))))))) (.cse23 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_34| Int)) (let ((.cse282 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|))) (or (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse282 0 |c_ULTIMATE.start_append_~item~0#1.base|)) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4) |c_#StackHeapBarrier|) (forall ((v_arrayElimCell_72 Int) (v_arrayElimCell_75 Int)) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse282 0 v_arrayElimCell_72)) v_arrayElimCell_72) (+ 4 v_arrayElimCell_75)) |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0)))))) (.cse15 (or .cse25 .cse24)) (.cse17 (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_29| Int) (|v_ULTIMATE.start_append_~item~0#1.base_34| Int)) (or (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|) |v_ULTIMATE.start_append_~item~0#1.offset_29| |c_ULTIMATE.start_append_~item~0#1.base|)) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4) |c_#StackHeapBarrier|) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_29|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0))))) (.cse218 (or .cse0 .cse58)) (.cse249 (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_29| Int)) (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_34| Int)) (or (forall ((|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int)) (let ((.cse281 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|))) (or (forall ((v_arrayElimCell_75 Int)) (or (< v_arrayElimCell_75 0) (forall ((v_arrayElimCell_72 Int)) (let ((.cse280 (+ 4 v_arrayElimCell_75))) (or (< (select (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_72) .cse280) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (forall ((v_prenex_26 Int)) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store (store .cse281 |v_ULTIMATE.start_append_~item~0#1.offset_29| v_arrayElimCell_72) (+ |v_ULTIMATE.start_append_~item~0#1.offset_29| 4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) v_prenex_26) .cse280) |c_#StackHeapBarrier|))))))) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse281 |v_ULTIMATE.start_append_~item~0#1.offset_29| |c_ULTIMATE.start_append_~item~0#1.base|)) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|)))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0)))) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_29|)))) (.cse10 (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_29| Int)) (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_34| Int)) (or (forall ((|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int)) (let ((.cse279 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|))) (or (forall ((v_arrayElimCell_75 Int)) (or (< v_arrayElimCell_75 0) (forall ((v_arrayElimCell_72 Int)) (let ((.cse278 (+ 4 v_arrayElimCell_75))) (or (< (select (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_72) .cse278) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store (store .cse279 |v_ULTIMATE.start_append_~item~0#1.offset_29| v_arrayElimCell_72) (+ |v_ULTIMATE.start_append_~item~0#1.offset_29| 4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) |c_ULTIMATE.start_append_~item~0#1.base|) .cse278) |c_#StackHeapBarrier|)))))) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse279 |v_ULTIMATE.start_append_~item~0#1.offset_29| |c_ULTIMATE.start_append_~item~0#1.base|)) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|)))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0)))) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_29|)))) (.cse13 (or .cse1 .cse80)) (.cse5 (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_29| Int)) (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_34| Int)) (or (forall ((|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int)) (let ((.cse277 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|))) (or (forall ((v_arrayElimCell_72 Int) (v_arrayElimCell_75 Int)) (let ((.cse276 (store .cse277 |v_ULTIMATE.start_append_~item~0#1.offset_29| v_arrayElimCell_72))) (or (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| .cse276) v_arrayElimCell_72) (+ 4 v_arrayElimCell_75)) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (forall ((v_arrayElimCell_84 Int)) (or (< v_arrayElimCell_84 0) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse276 (+ |v_ULTIMATE.start_append_~item~0#1.offset_29| 4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_84)) |c_#StackHeapBarrier|)))))) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse277 |v_ULTIMATE.start_append_~item~0#1.offset_29| |c_ULTIMATE.start_append_~item~0#1.base|)) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|)))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0)))) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_29|)))) (.cse6 (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_29| Int)) (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_34| Int)) (or (forall ((|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int)) (let ((.cse274 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|))) (let ((.cse275 (store .cse274 |v_ULTIMATE.start_append_~item~0#1.offset_29| |c_ULTIMATE.start_append_~item~0#1.base|))) (or (forall ((v_arrayElimCell_72 Int) (v_arrayElimCell_75 Int)) (or (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse274 |v_ULTIMATE.start_append_~item~0#1.offset_29| v_arrayElimCell_72)) v_arrayElimCell_72) (+ 4 v_arrayElimCell_75)) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (forall ((v_arrayElimCell_84 Int)) (or (< v_arrayElimCell_84 0) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse275 (+ |v_ULTIMATE.start_append_~item~0#1.offset_29| 4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) v_arrayElimCell_72) (+ 4 v_arrayElimCell_84)) |c_#StackHeapBarrier|))))) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| .cse275) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0)))) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_29|)))) (.cse169 (and .cse147 .cse32)) (.cse28 (or .cse165 .cse179 .cse166)) (.cse31 (or (forall ((v_arrayElimCell_72 Int) (v_prenex_26 Int) (|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_29| Int) (|v_ULTIMATE.start_append_~item~0#1.base_34| Int)) (or (< (select (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_72) .cse4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_29|) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|) |v_ULTIMATE.start_append_~item~0#1.offset_29| v_arrayElimCell_72) (+ |v_ULTIMATE.start_append_~item~0#1.offset_29| 4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) v_prenex_26) .cse4) |c_#StackHeapBarrier|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0)))) .cse12)) (.cse167 (forall ((v_arrayElimCell_72 Int) (|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_29| Int) (|v_ULTIMATE.start_append_~item~0#1.base_34| Int)) (or (< (select (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_72) .cse4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (< |v_ULTIMATE.start_append_#t~ite10#1.base_29| |c_#StackHeapBarrier|) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|) |v_ULTIMATE.start_append_~item~0#1.offset_29| |c_ULTIMATE.start_append_~item~0#1.base|) (+ |v_ULTIMATE.start_append_~item~0#1.offset_29| 4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4) |c_#StackHeapBarrier|) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_29|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0))))) (.cse170 (forall ((v_arrayElimCell_72 Int) (|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int) (|v_ULTIMATE.start_append_~item~0#1.base_34| Int)) (or (< (select (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_72) .cse4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (< |v_ULTIMATE.start_append_#t~ite10#1.base_29| |c_#StackHeapBarrier|) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0 |c_ULTIMATE.start_append_~item~0#1.base|) 4 |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4) |c_#StackHeapBarrier|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0))))) (.cse197 (or (forall ((v_arrayElimCell_72 Int) (|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int) (|v_ULTIMATE.start_append_~item~0#1.base_34| Int) (v_arrayElimCell_75 Int)) (let ((.cse273 (+ 4 v_arrayElimCell_75))) (or (< v_arrayElimCell_75 0) (< (select (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_72) .cse273) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0 |c_ULTIMATE.start_append_~item~0#1.base|) 4 |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) v_arrayElimCell_72) .cse273) |c_#StackHeapBarrier|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0))))) .cse1)) (.cse119 (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_29| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_29|) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_34| Int)) (or (forall ((|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int) (v_arrayElimCell_75 Int)) (or (< v_arrayElimCell_75 0) (forall ((v_arrayElimCell_72 Int)) (let ((.cse272 (+ 4 v_arrayElimCell_75))) (or (< (select (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_72) .cse272) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|) |v_ULTIMATE.start_append_~item~0#1.offset_29| v_arrayElimCell_72) (+ |v_ULTIMATE.start_append_~item~0#1.offset_29| 4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) |c_ULTIMATE.start_append_~item~0#1.base|) .cse272) |c_#StackHeapBarrier|)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0))))))) (.cse123 (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_29| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_29|) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_34| Int)) (or (forall ((v_arrayElimCell_72 Int) (|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int) (v_arrayElimCell_75 Int)) (let ((.cse271 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|))) (or (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse271 |v_ULTIMATE.start_append_~item~0#1.offset_29| v_arrayElimCell_72)) v_arrayElimCell_72) (+ 4 v_arrayElimCell_75)) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (forall ((v_arrayElimCell_84 Int)) (or (< v_arrayElimCell_84 0) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store (store .cse271 |v_ULTIMATE.start_append_~item~0#1.offset_29| |c_ULTIMATE.start_append_~item~0#1.base|) (+ |v_ULTIMATE.start_append_~item~0#1.offset_29| 4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) v_arrayElimCell_72) (+ 4 v_arrayElimCell_84)) |c_#StackHeapBarrier|)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0))))))) (.cse189 (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_29| Int)) (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_34| Int)) (or (forall ((v_arrayElimCell_72 Int) (|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int) (v_arrayElimCell_75 Int)) (let ((.cse270 (+ 4 v_arrayElimCell_75))) (or (< v_arrayElimCell_75 0) (< (select (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_72) .cse270) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|) |v_ULTIMATE.start_append_~item~0#1.offset_29| |c_ULTIMATE.start_append_~item~0#1.base|) (+ |v_ULTIMATE.start_append_~item~0#1.offset_29| 4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) v_arrayElimCell_72) .cse270) |c_#StackHeapBarrier|)))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0)))) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_29|)))) (.cse172 (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_29| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_29|) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_34| Int)) (or (forall ((v_arrayElimCell_72 Int) (|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int) (v_arrayElimCell_75 Int)) (let ((.cse269 (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|) |v_ULTIMATE.start_append_~item~0#1.offset_29| v_arrayElimCell_72))) (or (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| .cse269) v_arrayElimCell_72) (+ 4 v_arrayElimCell_75)) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (forall ((v_arrayElimCell_84 Int)) (or (forall ((v_prenex_26 Int)) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse269 (+ |v_ULTIMATE.start_append_~item~0#1.offset_29| 4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) v_prenex_26) (+ 4 v_arrayElimCell_84)) |c_#StackHeapBarrier|)) (< v_arrayElimCell_84 0)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0))))))) (.cse124 (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_29| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_29|) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_34| Int)) (or (forall ((v_arrayElimCell_72 Int) (|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int) (v_arrayElimCell_75 Int)) (let ((.cse268 (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|) |v_ULTIMATE.start_append_~item~0#1.offset_29| v_arrayElimCell_72))) (or (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| .cse268) v_arrayElimCell_72) (+ 4 v_arrayElimCell_75)) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (forall ((v_arrayElimCell_84 Int)) (or (< v_arrayElimCell_84 0) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse268 (+ |v_ULTIMATE.start_append_~item~0#1.offset_29| 4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_84)) |c_#StackHeapBarrier|)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0))))))) (.cse173 (or .cse0 (forall ((v_arrayElimCell_72 Int) (|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int) (v_arrayElimCell_84 Int) (|v_ULTIMATE.start_append_~item~0#1.offset_29| Int) (v_prenex_25 Int) (|v_ULTIMATE.start_append_~item~0#1.base_34| Int) (v_arrayElimCell_75 Int)) (let ((.cse267 (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|) |v_ULTIMATE.start_append_~item~0#1.offset_29| v_arrayElimCell_72))) (or (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| .cse267) v_arrayElimCell_72) (+ 4 v_arrayElimCell_75)) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (< v_arrayElimCell_84 0) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse267 (+ |v_ULTIMATE.start_append_~item~0#1.offset_29| 4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) v_prenex_25) (+ 4 v_arrayElimCell_84)) |c_#StackHeapBarrier|) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_29|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0))))))) (.cse198 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_34| Int)) (or (forall ((|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int) (v_arrayElimCell_75 Int)) (or (< v_arrayElimCell_75 0) (forall ((v_arrayElimCell_72 Int)) (let ((.cse266 (+ 4 v_arrayElimCell_75))) (or (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0 v_arrayElimCell_72) 4 |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) |c_ULTIMATE.start_append_~item~0#1.base|) .cse266) |c_#StackHeapBarrier|) (< (select (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_72) .cse266) |v_ULTIMATE.start_append_#t~ite10#1.base_29|)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0))))) (.cse201 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_34| Int)) (or (forall ((|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int) (v_arrayElimCell_75 Int)) (or (< v_arrayElimCell_75 0) (forall ((v_arrayElimCell_72 Int)) (let ((.cse265 (+ 4 v_arrayElimCell_75))) (or (forall ((v_prenex_26 Int)) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0 v_arrayElimCell_72) 4 |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) v_prenex_26) .cse265) |c_#StackHeapBarrier|)) (< (select (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_72) .cse265) |v_ULTIMATE.start_append_#t~ite10#1.base_29|)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0))))) (.cse103 (or .cse264 .cse12)) (.cse104 (or .cse0 .cse263)) (.cse29 (and .cse0 .cse12)) (.cse53 (forall ((v_arrayElimCell_72 Int) (|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_29| Int) (|v_ULTIMATE.start_append_~item~0#1.base_34| Int)) (or (< (select (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_72) .cse4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|) |v_ULTIMATE.start_append_~item~0#1.offset_29| |c_ULTIMATE.start_append_~item~0#1.base|) (+ |v_ULTIMATE.start_append_~item~0#1.offset_29| 4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) v_arrayElimCell_72) .cse4) |c_#StackHeapBarrier|) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_29|) (< .cse47 |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0))))) (.cse180 (< .cse47 |c_#StackHeapBarrier|)) (.cse37 (< |c_ULTIMATE.start_append_~item~0#1.offset| 0))) (and (or .cse0 (and (or .cse1 (and (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_29| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_29|) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_34| Int)) (or (forall ((|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int)) (let ((.cse3 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|))) (or (forall ((v_arrayElimCell_72 Int) (v_arrayElimCell_75 Int)) (let ((.cse2 (store .cse3 |v_ULTIMATE.start_append_~item~0#1.offset_29| v_arrayElimCell_72))) (or (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| .cse2) v_arrayElimCell_72) (+ 4 v_arrayElimCell_75)) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (forall ((v_arrayElimCell_84 Int)) (or (< v_arrayElimCell_84 0) (forall ((v_prenex_25 Int)) (<= (+ (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse2 (+ |v_ULTIMATE.start_append_~item~0#1.offset_29| 4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) v_prenex_25) (+ 4 v_arrayElimCell_84)) 1) |c_#StackHeapBarrier|))))))) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse3 |v_ULTIMATE.start_append_~item~0#1.offset_29| |c_ULTIMATE.start_append_~item~0#1.base|)) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|)))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0)))))) .cse5 .cse6 .cse7)) (or (and (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_29| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_29|) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_34| Int)) (or (forall ((|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int)) (let ((.cse9 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|))) (or (forall ((v_arrayElimCell_75 Int)) (or (< v_arrayElimCell_75 0) (forall ((v_arrayElimCell_72 Int)) (let ((.cse8 (+ 4 v_arrayElimCell_75))) (or (< (select (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_72) .cse8) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (forall ((v_prenex_25 Int)) (<= (+ (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store (store .cse9 |v_ULTIMATE.start_append_~item~0#1.offset_29| v_arrayElimCell_72) (+ |v_ULTIMATE.start_append_~item~0#1.offset_29| 4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) v_prenex_25) .cse8) 1) |c_#StackHeapBarrier|))))))) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse9 |v_ULTIMATE.start_append_~item~0#1.offset_29| |c_ULTIMATE.start_append_~item~0#1.base|)) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|)))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0)))))) .cse10 (or .cse11 .cse12)) .cse1) .cse13 (or .cse14 (and .cse15 (or .cse16 .cse17 .cse18) (or .cse19 .cse16 .cse17))) (or (and (forall ((|v_ULTIMATE.start_append_~item~0#1.base_34| Int)) (or (forall ((|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int)) (let ((.cse22 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|))) (let ((.cse20 (store .cse22 0 |c_ULTIMATE.start_append_~item~0#1.base|))) (or (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| .cse20) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (< |v_ULTIMATE.start_append_#t~ite10#1.base_29| |c_#StackHeapBarrier|) (forall ((v_arrayElimCell_72 Int) (v_arrayElimCell_75 Int)) (let ((.cse21 (+ 4 v_arrayElimCell_75))) (or (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse20 4 |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) v_arrayElimCell_72) .cse21) |c_#StackHeapBarrier|) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse22 0 v_arrayElimCell_72)) v_arrayElimCell_72) .cse21) |v_ULTIMATE.start_append_#t~ite10#1.base_29|)))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0)))) .cse23) .cse24) (or .cse14 .cse25 .cse24))) (or (and (or (and .cse26 .cse27 .cse28) .cse29) (or .cse1 (and .cse30 .cse31 .cse32)) (or .cse1 (and (or (forall ((v_arrayElimCell_72 Int) (|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_29| Int) (|v_ULTIMATE.start_append_~item~0#1.base_34| Int) (v_arrayElimCell_75 Int)) (let ((.cse33 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|))) (or (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse33 |v_ULTIMATE.start_append_~item~0#1.offset_29| v_arrayElimCell_72)) v_arrayElimCell_72) (+ 4 v_arrayElimCell_75)) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store (store .cse33 |v_ULTIMATE.start_append_~item~0#1.offset_29| |c_ULTIMATE.start_append_~item~0#1.base|) (+ |v_ULTIMATE.start_append_~item~0#1.offset_29| 4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) v_arrayElimCell_72) .cse4) |c_#StackHeapBarrier|) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_29|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0))))) .cse29) (or (forall ((v_arrayElimCell_72 Int) (v_prenex_26 Int) (|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_29| Int) (|v_ULTIMATE.start_append_~item~0#1.base_34| Int) (v_arrayElimCell_75 Int)) (let ((.cse34 (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|) |v_ULTIMATE.start_append_~item~0#1.offset_29| v_arrayElimCell_72))) (or (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| .cse34) v_arrayElimCell_72) (+ 4 v_arrayElimCell_75)) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_29|) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse34 (+ |v_ULTIMATE.start_append_~item~0#1.offset_29| 4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) v_prenex_26) .cse4) |c_#StackHeapBarrier|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0))))) .cse12) .cse35 .cse36))) .cse37) (or (let ((.cse40 (forall ((v_arrayElimCell_72 Int) (|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int) (v_arrayElimCell_84 Int) (|v_ULTIMATE.start_append_~item~0#1.offset_29| Int) (v_prenex_25 Int) (|v_ULTIMATE.start_append_~item~0#1.base_34| Int)) (let ((.cse101 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|))) (let ((.cse100 (store .cse101 |v_ULTIMATE.start_append_~item~0#1.offset_29| v_arrayElimCell_72))) (or (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| .cse100) v_arrayElimCell_72) .cse4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (< v_arrayElimCell_84 0) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse100 (+ |v_ULTIMATE.start_append_~item~0#1.offset_29| 4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) v_prenex_25) (+ 4 v_arrayElimCell_84)) |c_#StackHeapBarrier|) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_29|) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse101 |v_ULTIMATE.start_append_~item~0#1.offset_29| |c_ULTIMATE.start_append_~item~0#1.base|)) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0))))))) (.cse44 (forall ((|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int) (v_arrayElimCell_84 Int) (|v_ULTIMATE.start_append_~item~0#1.offset_29| Int) (v_arrayElimCell_81 Int) (|v_ULTIMATE.start_append_~item~0#1.base_34| Int)) (let ((.cse99 (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|) |v_ULTIMATE.start_append_~item~0#1.offset_29| |c_ULTIMATE.start_append_~item~0#1.base|))) (or (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse99 (+ |v_ULTIMATE.start_append_~item~0#1.offset_29| 4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) v_arrayElimCell_81) (+ 4 v_arrayElimCell_84)) |c_#StackHeapBarrier|) (< v_arrayElimCell_84 0) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_29|) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| .cse99) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0)))))) (.cse38 (forall ((|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int) (v_arrayElimCell_84 Int) (|v_ULTIMATE.start_append_~item~0#1.offset_29| Int) (|v_ULTIMATE.start_append_~item~0#1.base_34| Int)) (let ((.cse98 (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|) |v_ULTIMATE.start_append_~item~0#1.offset_29| |c_ULTIMATE.start_append_~item~0#1.base|))) (or (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse98 (+ |v_ULTIMATE.start_append_~item~0#1.offset_29| 4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_84)) |c_#StackHeapBarrier|) (< v_arrayElimCell_84 0) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_29|) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| .cse98) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0)))))) (.cse39 (forall ((v_arrayElimCell_72 Int) (|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int) (v_arrayElimCell_84 Int) (|v_ULTIMATE.start_append_~item~0#1.offset_29| Int) (|v_ULTIMATE.start_append_~item~0#1.base_34| Int)) (let ((.cse97 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|))) (let ((.cse96 (store .cse97 |v_ULTIMATE.start_append_~item~0#1.offset_29| v_arrayElimCell_72))) (or (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| .cse96) v_arrayElimCell_72) .cse4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (< v_arrayElimCell_84 0) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_29|) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse96 (+ |v_ULTIMATE.start_append_~item~0#1.offset_29| 4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_84)) |c_#StackHeapBarrier|) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse97 |v_ULTIMATE.start_append_~item~0#1.offset_29| |c_ULTIMATE.start_append_~item~0#1.base|)) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0))))))) (.cse81 (forall ((v_arrayElimCell_72 Int) (|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int) (v_arrayElimCell_84 Int) (|v_ULTIMATE.start_append_~item~0#1.offset_29| Int) (|v_ULTIMATE.start_append_~item~0#1.base_34| Int)) (let ((.cse94 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|))) (let ((.cse95 (store .cse94 |v_ULTIMATE.start_append_~item~0#1.offset_29| |c_ULTIMATE.start_append_~item~0#1.base|))) (or (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse94 |v_ULTIMATE.start_append_~item~0#1.offset_29| v_arrayElimCell_72)) v_arrayElimCell_72) .cse4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (< v_arrayElimCell_84 0) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_29|) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse95 (+ |v_ULTIMATE.start_append_~item~0#1.offset_29| 4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) v_arrayElimCell_72) (+ 4 v_arrayElimCell_84)) |c_#StackHeapBarrier|) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| .cse95) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0))))))) (.cse86 (forall ((v_arrayElimCell_72 Int) (|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int) (v_arrayElimCell_84 Int) (|v_ULTIMATE.start_append_~item~0#1.offset_29| Int) (v_prenex_25 Int) (|v_ULTIMATE.start_append_~item~0#1.base_34| Int)) (let ((.cse93 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|))) (or (< v_arrayElimCell_84 0) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store (store .cse93 |v_ULTIMATE.start_append_~item~0#1.offset_29| v_arrayElimCell_72) (+ |v_ULTIMATE.start_append_~item~0#1.offset_29| 4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) v_prenex_25) (+ 4 v_arrayElimCell_84)) |c_#StackHeapBarrier|) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_29|) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse93 |v_ULTIMATE.start_append_~item~0#1.offset_29| |c_ULTIMATE.start_append_~item~0#1.base|)) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0)))))) (.cse89 (forall ((v_arrayElimCell_72 Int) (|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int) (v_arrayElimCell_84 Int) (|v_ULTIMATE.start_append_~item~0#1.offset_29| Int) (|v_ULTIMATE.start_append_~item~0#1.base_34| Int)) (let ((.cse92 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|))) (or (< v_arrayElimCell_84 0) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_29|) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store (store .cse92 |v_ULTIMATE.start_append_~item~0#1.offset_29| v_arrayElimCell_72) (+ |v_ULTIMATE.start_append_~item~0#1.offset_29| 4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_84)) |c_#StackHeapBarrier|) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse92 |v_ULTIMATE.start_append_~item~0#1.offset_29| |c_ULTIMATE.start_append_~item~0#1.base|)) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0))))))) (and (or .cse38 .cse16) (or .cse16 .cse39 .cse12) (or .cse16 .cse39) (or .cse40 .cse16 .cse12) (or (forall ((v_arrayElimCell_72 Int) (v_prenex_26 Int) (|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int) (v_arrayElimCell_84 Int) (|v_ULTIMATE.start_append_~item~0#1.offset_29| Int) (|v_ULTIMATE.start_append_~item~0#1.base_34| Int)) (let ((.cse42 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|))) (let ((.cse41 (store .cse42 |v_ULTIMATE.start_append_~item~0#1.offset_29| v_arrayElimCell_72))) (or (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| .cse41) v_arrayElimCell_72) .cse4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (< v_arrayElimCell_84 0) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_29|) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse41 (+ |v_ULTIMATE.start_append_~item~0#1.offset_29| 4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) v_prenex_26) (+ 4 v_arrayElimCell_84)) |c_#StackHeapBarrier|) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse42 |v_ULTIMATE.start_append_~item~0#1.offset_29| |c_ULTIMATE.start_append_~item~0#1.base|)) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0)))))) .cse16 .cse12) (or .cse43 .cse44 .cse45 .cse46) (or (and (or .cse16 (forall ((v_arrayElimCell_72 Int) (|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_29| Int) (|v_ULTIMATE.start_append_~item~0#1.base_34| Int)) (or (< (select (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_72) .cse4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|) |v_ULTIMATE.start_append_~item~0#1.offset_29| v_arrayElimCell_72) (+ |v_ULTIMATE.start_append_~item~0#1.offset_29| 4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4) |c_#StackHeapBarrier|) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_29|) (< .cse47 |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0))))) .cse48 .cse49 .cse50 (or (and .cse51 .cse52) .cse43 .cse45 .cse46) (or .cse53 .cse16 .cse12)) .cse37) (or .cse40 .cse16) (or (and (or .cse16 .cse54) (or .cse16 (forall ((v_arrayElimCell_72 Int) (|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_29| Int) (|v_ULTIMATE.start_append_~item~0#1.base_34| Int) (v_arrayElimCell_75 Int)) (let ((.cse57 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|))) (let ((.cse56 (store .cse57 |v_ULTIMATE.start_append_~item~0#1.offset_29| v_arrayElimCell_72)) (.cse55 (+ 4 v_arrayElimCell_75))) (or (< v_arrayElimCell_75 0) (< (select (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_72) .cse55) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| .cse56) v_arrayElimCell_72) .cse4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_29|) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse56 (+ |v_ULTIMATE.start_append_~item~0#1.offset_29| 4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) |c_ULTIMATE.start_append_~item~0#1.base|) .cse55) |c_#StackHeapBarrier|) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse57 |v_ULTIMATE.start_append_~item~0#1.offset_29| |c_ULTIMATE.start_append_~item~0#1.base|)) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0))))))) (or .cse16 .cse58) (or (forall ((v_arrayElimCell_72 Int) (|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_29| Int) (|v_ULTIMATE.start_append_~item~0#1.base_34| Int) (v_arrayElimCell_75 Int)) (let ((.cse59 (+ 4 v_arrayElimCell_75)) (.cse60 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|))) (or (< v_arrayElimCell_75 0) (< (select (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_72) .cse59) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_29|) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store (store .cse60 |v_ULTIMATE.start_append_~item~0#1.offset_29| v_arrayElimCell_72) (+ |v_ULTIMATE.start_append_~item~0#1.offset_29| 4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) |c_ULTIMATE.start_append_~item~0#1.base|) .cse59) |c_#StackHeapBarrier|) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse60 |v_ULTIMATE.start_append_~item~0#1.offset_29| |c_ULTIMATE.start_append_~item~0#1.base|)) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0))))) .cse16) (or .cse1 .cse11) (or .cse11 .cse16) (or (and (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_29| Int)) (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_34| Int)) (or (forall ((|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int)) (let ((.cse63 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|))) (or (forall ((v_arrayElimCell_84 Int) (v_arrayElimCell_75 Int)) (or (< v_arrayElimCell_84 0) (forall ((v_arrayElimCell_72 Int) (v_prenex_25 Int)) (let ((.cse62 (store .cse63 |v_ULTIMATE.start_append_~item~0#1.offset_29| v_arrayElimCell_72))) (let ((.cse61 (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| .cse62) v_arrayElimCell_72))) (or (< (select .cse61 (+ 4 v_arrayElimCell_75)) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (< (select .cse61 .cse4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse62 (+ |v_ULTIMATE.start_append_~item~0#1.offset_29| 4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) v_prenex_25) (+ 4 v_arrayElimCell_84)) |c_#StackHeapBarrier|))))))) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse63 |v_ULTIMATE.start_append_~item~0#1.offset_29| |c_ULTIMATE.start_append_~item~0#1.base|)) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|)))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0)))) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_29|))) (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_29| Int)) (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_34| Int)) (or (forall ((|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int)) (let ((.cse65 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|))) (or (forall ((v_arrayElimCell_72 Int) (v_prenex_26 Int) (v_arrayElimCell_84 Int) (v_arrayElimCell_75 Int)) (let ((.cse64 (store .cse65 |v_ULTIMATE.start_append_~item~0#1.offset_29| v_arrayElimCell_72))) (or (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| .cse64) v_arrayElimCell_72) (+ 4 v_arrayElimCell_75)) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (< v_arrayElimCell_84 0) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse64 (+ |v_ULTIMATE.start_append_~item~0#1.offset_29| 4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) v_prenex_26) (+ 4 v_arrayElimCell_84)) |c_#StackHeapBarrier|)))) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse65 |v_ULTIMATE.start_append_~item~0#1.offset_29| |c_ULTIMATE.start_append_~item~0#1.base|)) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|)))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0)))) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_29|))) (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_29| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_29|) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_34| Int)) (or (forall ((|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int)) (let ((.cse66 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|))) (let ((.cse67 (store .cse66 |v_ULTIMATE.start_append_~item~0#1.offset_29| |c_ULTIMATE.start_append_~item~0#1.base|))) (or (forall ((v_arrayElimCell_72 Int) (v_arrayElimCell_84 Int) (v_arrayElimCell_75 Int)) (or (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse66 |v_ULTIMATE.start_append_~item~0#1.offset_29| v_arrayElimCell_72)) v_arrayElimCell_72) (+ 4 v_arrayElimCell_75)) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (< v_arrayElimCell_84 0) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse67 (+ |v_ULTIMATE.start_append_~item~0#1.offset_29| 4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) v_arrayElimCell_72) (+ 4 v_arrayElimCell_84)) |c_#StackHeapBarrier|))) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| .cse67) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0)))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_29| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_29|) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_34| Int)) (or (forall ((|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int)) (let ((.cse70 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|))) (or (forall ((v_arrayElimCell_84 Int) (v_arrayElimCell_75 Int)) (or (forall ((v_arrayElimCell_72 Int)) (let ((.cse69 (store .cse70 |v_ULTIMATE.start_append_~item~0#1.offset_29| v_arrayElimCell_72))) (let ((.cse68 (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| .cse69) v_arrayElimCell_72))) (or (< (select .cse68 (+ 4 v_arrayElimCell_75)) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (< (select .cse68 .cse4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse69 (+ |v_ULTIMATE.start_append_~item~0#1.offset_29| 4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_84)) |c_#StackHeapBarrier|))))) (< v_arrayElimCell_84 0))) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse70 |v_ULTIMATE.start_append_~item~0#1.offset_29| |c_ULTIMATE.start_append_~item~0#1.base|)) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|)))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0)))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_29| Int)) (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_34| Int)) (or (forall ((|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int)) (let ((.cse72 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|))) (or (forall ((v_arrayElimCell_72 Int) (v_arrayElimCell_84 Int) (v_arrayElimCell_75 Int)) (let ((.cse71 (store .cse72 |v_ULTIMATE.start_append_~item~0#1.offset_29| v_arrayElimCell_72))) (or (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| .cse71) v_arrayElimCell_72) (+ 4 v_arrayElimCell_75)) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (< v_arrayElimCell_84 0) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse71 (+ |v_ULTIMATE.start_append_~item~0#1.offset_29| 4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_84)) |c_#StackHeapBarrier|)))) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse72 |v_ULTIMATE.start_append_~item~0#1.offset_29| |c_ULTIMATE.start_append_~item~0#1.base|)) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|)))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0)))) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_29|))) (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_29| Int)) (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_34| Int)) (or (forall ((|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int)) (let ((.cse74 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|))) (or (forall ((v_arrayElimCell_72 Int) (v_arrayElimCell_84 Int) (v_prenex_25 Int) (v_arrayElimCell_75 Int)) (let ((.cse73 (store .cse74 |v_ULTIMATE.start_append_~item~0#1.offset_29| v_arrayElimCell_72))) (or (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| .cse73) v_arrayElimCell_72) (+ 4 v_arrayElimCell_75)) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (< v_arrayElimCell_84 0) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse73 (+ |v_ULTIMATE.start_append_~item~0#1.offset_29| 4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) v_prenex_25) (+ 4 v_arrayElimCell_84)) |c_#StackHeapBarrier|)))) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse74 |v_ULTIMATE.start_append_~item~0#1.offset_29| |c_ULTIMATE.start_append_~item~0#1.base|)) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|)))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0)))) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_29|))) (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_29| Int)) (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_34| Int)) (or (forall ((|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int)) (let ((.cse76 (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|) |v_ULTIMATE.start_append_~item~0#1.offset_29| |c_ULTIMATE.start_append_~item~0#1.base|))) (let ((.cse75 (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| .cse76) |c_ULTIMATE.start_append_~item~0#1.base|))) (or (forall ((v_arrayElimCell_75 Int)) (< (select .cse75 (+ 4 v_arrayElimCell_75)) |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) (forall ((v_arrayElimCell_84 Int)) (or (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse76 (+ |v_ULTIMATE.start_append_~item~0#1.offset_29| 4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_84)) |c_#StackHeapBarrier|) (< v_arrayElimCell_84 0))) (< (select .cse75 .cse4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0)))) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_29|)))) .cse16) (or .cse16 (forall ((v_arrayElimCell_72 Int) (v_prenex_26 Int) (|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_29| Int) (|v_ULTIMATE.start_append_~item~0#1.base_34| Int) (v_arrayElimCell_75 Int)) (let ((.cse79 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|))) (let ((.cse78 (store .cse79 |v_ULTIMATE.start_append_~item~0#1.offset_29| v_arrayElimCell_72)) (.cse77 (+ 4 v_arrayElimCell_75))) (or (< v_arrayElimCell_75 0) (< (select (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_72) .cse77) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| .cse78) v_arrayElimCell_72) .cse4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_29|) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse78 (+ |v_ULTIMATE.start_append_~item~0#1.offset_29| 4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) v_prenex_26) .cse77) |c_#StackHeapBarrier|) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse79 |v_ULTIMATE.start_append_~item~0#1.offset_29| |c_ULTIMATE.start_append_~item~0#1.base|)) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0))))))) (or .cse16 .cse80)) .cse12) (or .cse40 .cse1) (or .cse81 .cse1) (or .cse43 .cse45 (and (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_29| Int)) (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_34| Int)) (or (forall ((|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int)) (let ((.cse83 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|))) (or (forall ((v_arrayElimCell_84 Int)) (or (< v_arrayElimCell_84 0) (forall ((v_arrayElimCell_72 Int)) (let ((.cse82 (store .cse83 |v_ULTIMATE.start_append_~item~0#1.offset_29| v_arrayElimCell_72))) (or (forall ((v_arrayElimCell_75 Int)) (<= (+ (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| .cse82) v_arrayElimCell_72) (+ 4 v_arrayElimCell_75)) 1) |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse82 (+ |v_ULTIMATE.start_append_~item~0#1.offset_29| 4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_84)) |c_#StackHeapBarrier|)))))) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse83 |v_ULTIMATE.start_append_~item~0#1.offset_29| |c_ULTIMATE.start_append_~item~0#1.base|)) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|)))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0)))) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_29|))) (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_29| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_29|) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_34| Int)) (or (forall ((|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int)) (let ((.cse85 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|))) (or (forall ((v_arrayElimCell_84 Int)) (or (forall ((v_arrayElimCell_72 Int) (v_prenex_25 Int)) (let ((.cse84 (store .cse85 |v_ULTIMATE.start_append_~item~0#1.offset_29| v_arrayElimCell_72))) (or (forall ((v_arrayElimCell_75 Int)) (<= (+ (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| .cse84) v_arrayElimCell_72) (+ 4 v_arrayElimCell_75)) 1) |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse84 (+ |v_ULTIMATE.start_append_~item~0#1.offset_29| 4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) v_prenex_25) (+ 4 v_arrayElimCell_84)) |c_#StackHeapBarrier|)))) (< v_arrayElimCell_84 0))) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse85 |v_ULTIMATE.start_append_~item~0#1.offset_29| |c_ULTIMATE.start_append_~item~0#1.base|)) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|)))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0)))))) (or .cse86 .cse46) (or .cse12 (forall ((v_arrayElimCell_72 Int) (|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int) (v_arrayElimCell_84 Int) (|v_ULTIMATE.start_append_~item~0#1.offset_29| Int) (|v_ULTIMATE.start_append_~item~0#1.base_34| Int) (v_arrayElimCell_75 Int)) (let ((.cse87 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|))) (let ((.cse88 (store .cse87 |v_ULTIMATE.start_append_~item~0#1.offset_29| |c_ULTIMATE.start_append_~item~0#1.base|))) (or (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse87 |v_ULTIMATE.start_append_~item~0#1.offset_29| v_arrayElimCell_72)) v_arrayElimCell_72) (+ 4 v_arrayElimCell_75)) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (< v_arrayElimCell_84 0) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_29|) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse88 (+ |v_ULTIMATE.start_append_~item~0#1.offset_29| 4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) v_arrayElimCell_72) (+ 4 v_arrayElimCell_84)) |c_#StackHeapBarrier|) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| .cse88) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0))))))) (or .cse89 .cse46) (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_29| Int)) (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_34| Int)) (or (forall ((v_arrayElimCell_84 Int)) (or (forall ((|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int)) (let ((.cse90 (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|) |v_ULTIMATE.start_append_~item~0#1.offset_29| |c_ULTIMATE.start_append_~item~0#1.base|))) (let ((.cse91 (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| .cse90) |c_ULTIMATE.start_append_~item~0#1.base|))) (or (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse90 (+ |v_ULTIMATE.start_append_~item~0#1.offset_29| 4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_84)) |c_#StackHeapBarrier|) (forall ((v_arrayElimCell_75 Int)) (<= (+ (select .cse91 (+ 4 v_arrayElimCell_75)) 1) |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) (< (select .cse91 .cse4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|))))) (< v_arrayElimCell_84 0))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0)))) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_29|))) (or .cse44 .cse46) (or .cse38 .cse46) .cse7)) (or .cse1 .cse39) (or .cse81 .cse16 .cse12) (or .cse43 .cse45 .cse86 .cse46) (or .cse89 .cse43 .cse45 .cse46))) .cse0) (or .cse0 .cse24 (and (or (forall ((v_arrayElimCell_72 Int) (|v_ULTIMATE.start_append_~item~0#1.base_34| Int)) (or (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0 v_arrayElimCell_72)) v_arrayElimCell_72) .cse4) |c_#StackHeapBarrier|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0)))) .cse12) .cse102)) (or .cse1 .cse37 (and .cse103 .cse104)) (or .cse0 (and (forall ((|v_ULTIMATE.start_append_~item~0#1.base_34| Int)) (let ((.cse105 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|))) (or (forall ((v_arrayElimCell_72 Int)) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse105 0 v_arrayElimCell_72)) v_arrayElimCell_72) .cse4) |c_#StackHeapBarrier|)) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse105 0 |c_ULTIMATE.start_append_~item~0#1.base|)) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4) |c_#StackHeapBarrier|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_34| Int)) (or (forall ((|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int)) (let ((.cse107 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|))) (let ((.cse106 (store .cse107 0 |c_ULTIMATE.start_append_~item~0#1.base|))) (or (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| .cse106) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (< |v_ULTIMATE.start_append_#t~ite10#1.base_29| |c_#StackHeapBarrier|) (forall ((v_arrayElimCell_72 Int)) (or (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse107 0 v_arrayElimCell_72)) v_arrayElimCell_72) .cse4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse106 4 |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) v_arrayElimCell_72) .cse4) |c_#StackHeapBarrier|))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0))))) .cse24) (or (let ((.cse146 (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_29| Int)) (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_34| Int)) (or (forall ((v_arrayElimCell_72 Int) (v_prenex_26 Int) (|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int)) (or (< (select (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_72) .cse4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|) |v_ULTIMATE.start_append_~item~0#1.offset_29| v_arrayElimCell_72) (+ |v_ULTIMATE.start_append_~item~0#1.offset_29| 4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) v_prenex_26) .cse4) |c_#StackHeapBarrier|))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0)))) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_29|))))) (and (or .cse24 (and (or .cse0 (forall ((v_arrayElimCell_72 Int) (|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int) (|v_ULTIMATE.start_append_~item~0#1.base_34| Int) (v_arrayElimCell_75 Int)) (let ((.cse108 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|)) (.cse109 (+ 4 v_arrayElimCell_75))) (or (< |v_ULTIMATE.start_append_#t~ite10#1.base_29| |c_#StackHeapBarrier|) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse108 0 v_arrayElimCell_72)) v_arrayElimCell_72) .cse109) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store (store .cse108 0 |c_ULTIMATE.start_append_~item~0#1.base|) 4 |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) |c_ULTIMATE.start_append_~item~0#1.base|) .cse109) |c_#StackHeapBarrier|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0)))))) .cse110 .cse111 .cse112)) (or .cse113 .cse16) .cse114 (or .cse24 .cse115) (or .cse16 .cse116) (or (and .cse102 .cse117) .cse24) .cse118 (or (and (or .cse1 (and .cse119 .cse120 .cse121)) (or .cse1 (and .cse122 .cse123 .cse124 .cse125)) .cse126) .cse0) (or .cse16 .cse127) (or (and .cse119 .cse128 .cse129) .cse1) (or .cse130 .cse16) (or .cse0 (and (or (forall ((v_arrayElimCell_72 Int) (|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_29| Int) (|v_ULTIMATE.start_append_~item~0#1.base_34| Int) (v_arrayElimCell_75 Int)) (let ((.cse132 (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|) |v_ULTIMATE.start_append_~item~0#1.offset_29| v_arrayElimCell_72)) (.cse131 (+ 4 v_arrayElimCell_75))) (or (< v_arrayElimCell_75 0) (< (select (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_72) .cse131) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| .cse132) v_arrayElimCell_72) .cse4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_29|) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse132 (+ |v_ULTIMATE.start_append_~item~0#1.offset_29| 4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) |c_ULTIMATE.start_append_~item~0#1.base|) .cse131) |c_#StackHeapBarrier|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0))))) .cse16) (or .cse16 (and .cse133 .cse134 .cse135 .cse136 .cse137 (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_29| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_29|) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_34| Int)) (or (forall ((v_arrayElimCell_72 Int) (v_prenex_26 Int) (|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int) (v_arrayElimCell_84 Int)) (let ((.cse138 (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|) |v_ULTIMATE.start_append_~item~0#1.offset_29| v_arrayElimCell_72))) (or (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| .cse138) v_arrayElimCell_72) .cse4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (< v_arrayElimCell_84 0) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse138 (+ |v_ULTIMATE.start_append_~item~0#1.offset_29| 4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) v_prenex_26) (+ 4 v_arrayElimCell_84)) |c_#StackHeapBarrier|)))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0)))))) .cse139)) (or .cse140 .cse16) (or (forall ((v_arrayElimCell_72 Int) (v_prenex_26 Int) (|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_29| Int) (|v_ULTIMATE.start_append_~item~0#1.base_34| Int) (v_arrayElimCell_75 Int)) (let ((.cse142 (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|) |v_ULTIMATE.start_append_~item~0#1.offset_29| v_arrayElimCell_72)) (.cse141 (+ 4 v_arrayElimCell_75))) (or (< v_arrayElimCell_75 0) (< (select (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_72) .cse141) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| .cse142) v_arrayElimCell_72) .cse4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_29|) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse142 (+ |v_ULTIMATE.start_append_~item~0#1.offset_29| 4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) v_prenex_26) .cse141) |c_#StackHeapBarrier|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0))))) .cse16) (or .cse143 .cse16) (or (and (or (and (forall ((|v_ULTIMATE.start_append_~item~0#1.base_34| Int)) (or (forall ((v_arrayElimCell_72 Int) (|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int)) (or (< (select (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_72) .cse4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (forall ((v_prenex_26 Int)) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0 v_arrayElimCell_72) 4 |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) v_prenex_26) .cse4) |c_#StackHeapBarrier|)))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0)))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_34| Int)) (or (forall ((v_arrayElimCell_72 Int) (v_prenex_26 Int) (|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int)) (or (< (select (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_72) .cse4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0 v_arrayElimCell_72) 4 |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) v_prenex_26) .cse4) |c_#StackHeapBarrier|))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0)))) .cse144 .cse145) .cse16) (or (and .cse30 .cse146 (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_29| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_29|) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_34| Int)) (or (forall ((v_arrayElimCell_72 Int) (|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int)) (or (< (select (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_72) .cse4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|) |v_ULTIMATE.start_append_~item~0#1.offset_29| |c_ULTIMATE.start_append_~item~0#1.base|) (+ |v_ULTIMATE.start_append_~item~0#1.offset_29| 4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) v_arrayElimCell_72) .cse4) |c_#StackHeapBarrier|))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0)))))) .cse147 .cse148) .cse16) (or .cse16 .cse149)) .cse37) (or .cse150 .cse16) (or .cse16 (forall ((v_arrayElimCell_72 Int) (|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_29| Int) (|v_ULTIMATE.start_append_~item~0#1.base_34| Int) (v_arrayElimCell_75 Int)) (let ((.cse151 (+ 4 v_arrayElimCell_75))) (or (< v_arrayElimCell_75 0) (< (select (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_72) .cse151) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_29|) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|) |v_ULTIMATE.start_append_~item~0#1.offset_29| v_arrayElimCell_72) (+ |v_ULTIMATE.start_append_~item~0#1.offset_29| 4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) |c_ULTIMATE.start_append_~item~0#1.base|) .cse151) |c_#StackHeapBarrier|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0)))))) (or .cse43 (and .cse152 (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_29| Int)) (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_34| Int)) (or (forall ((|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int)) (let ((.cse153 (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|) |v_ULTIMATE.start_append_~item~0#1.offset_29| |c_ULTIMATE.start_append_~item~0#1.base|))) (or (forall ((v_arrayElimCell_84 Int)) (or (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse153 (+ |v_ULTIMATE.start_append_~item~0#1.offset_29| 4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_84)) |c_#StackHeapBarrier|) (< v_arrayElimCell_84 0))) (forall ((v_arrayElimCell_75 Int)) (<= (+ (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| .cse153) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_75)) 1) |v_ULTIMATE.start_append_#t~ite10#1.base_29|))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0)))) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_29|))) (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_29| Int)) (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_34| Int)) (or (forall ((|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int) (v_arrayElimCell_84 Int)) (or (< v_arrayElimCell_84 0) (forall ((v_arrayElimCell_72 Int)) (let ((.cse154 (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|) |v_ULTIMATE.start_append_~item~0#1.offset_29| v_arrayElimCell_72))) (or (forall ((v_arrayElimCell_75 Int)) (<= (+ (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| .cse154) v_arrayElimCell_72) (+ 4 v_arrayElimCell_75)) 1) |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse154 (+ |v_ULTIMATE.start_append_~item~0#1.offset_29| 4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_84)) |c_#StackHeapBarrier|)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0)))) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_29|))) (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_29| Int)) (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_34| Int)) (or (forall ((|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int) (v_arrayElimCell_84 Int)) (or (forall ((v_arrayElimCell_72 Int) (v_prenex_25 Int)) (let ((.cse155 (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|) |v_ULTIMATE.start_append_~item~0#1.offset_29| v_arrayElimCell_72))) (or (forall ((v_arrayElimCell_75 Int)) (<= (+ (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| .cse155) v_arrayElimCell_72) (+ 4 v_arrayElimCell_75)) 1) |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse155 (+ |v_ULTIMATE.start_append_~item~0#1.offset_29| 4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) v_prenex_25) (+ 4 v_arrayElimCell_84)) |c_#StackHeapBarrier|)))) (< v_arrayElimCell_84 0))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0)))) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_29|))) .cse125) .cse45) (or (and .cse152 .cse156 .cse157 .cse158 .cse159 .cse125 .cse160) .cse16) (or .cse1 .cse150) (or .cse161 .cse16))) (or .cse162 .cse24) (or (and (or .cse1 (and .cse30 .cse146 .cse32)) .cse26 .cse27 (or (and (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_29| Int)) (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_34| Int)) (or (forall ((v_arrayElimCell_72 Int) (|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int) (v_arrayElimCell_75 Int)) (let ((.cse163 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|))) (or (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse163 |v_ULTIMATE.start_append_~item~0#1.offset_29| v_arrayElimCell_72)) v_arrayElimCell_72) (+ 4 v_arrayElimCell_75)) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store (store .cse163 |v_ULTIMATE.start_append_~item~0#1.offset_29| |c_ULTIMATE.start_append_~item~0#1.base|) (+ |v_ULTIMATE.start_append_~item~0#1.offset_29| 4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) v_arrayElimCell_72) .cse4) |c_#StackHeapBarrier|)))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0)))) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_29|))) .cse35 (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_29| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_29|) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_34| Int)) (or (forall ((v_arrayElimCell_72 Int) (v_prenex_26 Int) (|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int) (v_arrayElimCell_75 Int)) (let ((.cse164 (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|) |v_ULTIMATE.start_append_~item~0#1.offset_29| v_arrayElimCell_72))) (or (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| .cse164) v_arrayElimCell_72) (+ 4 v_arrayElimCell_75)) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse164 (+ |v_ULTIMATE.start_append_~item~0#1.offset_29| 4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) v_prenex_26) .cse4) |c_#StackHeapBarrier|)))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0)))))) .cse36) .cse1) .cse28) .cse37) (or (let ((.cse168 (and .cse146 .cse32))) (and (or .cse165 .cse24 .cse166) (or .cse167 .cse16) (or .cse1 .cse168) (or .cse16 .cse169) (or .cse16 .cse168) (or .cse24 .cse170))) .cse37) .cse171 (or (and .cse123 .cse172 .cse124 .cse173) .cse1) .cse174)) .cse12) (or (and (forall ((|v_ULTIMATE.start_append_~item~0#1.base_34| Int)) (or (forall ((|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int)) (or (< |v_ULTIMATE.start_append_#t~ite10#1.base_29| |c_#StackHeapBarrier|) (forall ((v_arrayElimCell_72 Int)) (let ((.cse175 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|))) (or (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse175 0 v_arrayElimCell_72)) v_arrayElimCell_72) .cse4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store (store .cse175 0 |c_ULTIMATE.start_append_~item~0#1.base|) 4 |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) v_arrayElimCell_72) .cse4) |c_#StackHeapBarrier|)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0)))) .cse117) .cse0 .cse24) (or (and (or .cse176 .cse115) (or (and .cse110 .cse111 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_34| Int)) (or (forall ((|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int)) (or (< |v_ULTIMATE.start_append_#t~ite10#1.base_29| |c_#StackHeapBarrier|) (forall ((v_arrayElimCell_72 Int) (v_arrayElimCell_75 Int)) (let ((.cse177 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|)) (.cse178 (+ 4 v_arrayElimCell_75))) (or (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse177 0 v_arrayElimCell_72)) v_arrayElimCell_72) .cse178) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store (store .cse177 0 |c_ULTIMATE.start_append_~item~0#1.base|) 4 |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) |c_ULTIMATE.start_append_~item~0#1.base|) .cse178) |c_#StackHeapBarrier|)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0)))) .cse112) .cse0 .cse24) (or .cse113 .cse16 .cse18) .cse118 (or .cse1 .cse127) (or .cse165 .cse179 .cse14) (or .cse162 .cse176) (or .cse130 .cse1) (or .cse19 .cse16 .cse116) (or .cse16 .cse18 .cse116) (or .cse19 .cse113 .cse16) .cse171) .cse12) (or .cse43 (and (<= (+ |c_ULTIMATE.start_append_~item~0#1.offset| 1) 0) (not .cse0)) .cse45 .cse46 (and .cse25 (or (and .cse51 .cse52 (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_29| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_29|) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_34| Int)) (or .cse180 (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0))))))) .cse0) (or (and (forall ((|v_ULTIMATE.start_append_~item~0#1.base_34| Int)) (or (forall ((|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int)) (or (< .cse47 |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (forall ((v_arrayElimCell_72 Int) (v_prenex_25 Int)) (<= (+ (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0 v_arrayElimCell_72) 4 |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) v_prenex_25) .cse4) 1) |c_#StackHeapBarrier|)))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0)))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_34| Int)) (or (forall ((|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int)) (or (forall ((v_arrayElimCell_81 Int)) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0 |c_ULTIMATE.start_append_~item~0#1.base|) 4 |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) v_arrayElimCell_81) .cse4) |c_#StackHeapBarrier|)) (< .cse47 |v_ULTIMATE.start_append_#t~ite10#1.base_29|))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0))))) .cse0))) (or (forall ((v_arrayElimCell_72 Int) (|v_ULTIMATE.start_append_~item~0#1.base_34| Int)) (let ((.cse181 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|))) (or (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse181 0 |c_ULTIMATE.start_append_~item~0#1.base|)) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4) |c_#StackHeapBarrier|) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse181 0 v_arrayElimCell_72)) v_arrayElimCell_72) .cse4) |c_#StackHeapBarrier|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0))))) .cse24) (or (and (or .cse165 .cse24 .cse180 .cse166) (or (and (forall ((|v_ULTIMATE.start_append_~item~0#1.base_34| Int)) (or (forall ((|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int)) (or (forall ((v_arrayElimCell_72 Int)) (or (< (select (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_72) .cse4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (forall ((v_prenex_26 Int)) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0 v_arrayElimCell_72) 4 |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) v_prenex_26) .cse4) |c_#StackHeapBarrier|)))) (< .cse47 |v_ULTIMATE.start_append_#t~ite10#1.base_29|))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0)))) (or .cse0 (forall ((v_arrayElimCell_72 Int) (|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int) (v_prenex_25 Int) (|v_ULTIMATE.start_append_~item~0#1.base_34| Int)) (or (< (select (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_72) .cse4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0 v_arrayElimCell_72) 4 |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) v_prenex_25) .cse4) |c_#StackHeapBarrier|) (< .cse47 |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0)))))) .cse16) (or .cse16 (and (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_29| Int)) (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_34| Int)) (or (forall ((|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int)) (or (forall ((v_arrayElimCell_72 Int)) (or (< (select (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_72) .cse4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (forall ((v_prenex_26 Int)) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|) |v_ULTIMATE.start_append_~item~0#1.offset_29| v_arrayElimCell_72) (+ |v_ULTIMATE.start_append_~item~0#1.offset_29| 4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) v_prenex_26) .cse4) |c_#StackHeapBarrier|)))) (< .cse47 |v_ULTIMATE.start_append_#t~ite10#1.base_29|))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0)))) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_29|))) (or .cse165 .cse180 .cse166) .cse104))) .cse37 .cse12) (or .cse165 .cse16 .cse180 .cse37 .cse166) (or .cse0 (and (or .cse1 (and (or (and .cse30 .cse31 (or .cse182 .cse12) .cse148) .cse37) .cse133 .cse134 .cse135 .cse136 .cse137 (or (forall ((v_arrayElimCell_72 Int) (v_prenex_26 Int) (v_arrayElimCell_84 Int) (|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_29| Int) (|v_ULTIMATE.start_append_~item~0#1.base_34| Int)) (let ((.cse183 (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|) |v_ULTIMATE.start_append_~item~0#1.offset_29| v_arrayElimCell_72))) (or (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| .cse183) v_arrayElimCell_72) .cse4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (< v_arrayElimCell_84 0) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_29|) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse183 (+ |v_ULTIMATE.start_append_~item~0#1.offset_29| 4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) v_prenex_26) (+ 4 v_arrayElimCell_84)) |c_#StackHeapBarrier|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0))))) .cse12) .cse139 (or (and .cse119 .cse152 .cse156 .cse120 .cse184 (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_29| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_29|) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_34| Int)) (or (forall ((|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int) (v_arrayElimCell_75 Int)) (or (forall ((v_arrayElimCell_72 Int)) (let ((.cse186 (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|) |v_ULTIMATE.start_append_~item~0#1.offset_29| v_arrayElimCell_72)) (.cse185 (+ 4 v_arrayElimCell_75))) (or (< (select (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_72) .cse185) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| .cse186) v_arrayElimCell_72) .cse4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse186 (+ |v_ULTIMATE.start_append_~item~0#1.offset_29| 4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) |c_ULTIMATE.start_append_~item~0#1.base|) .cse185) |c_#StackHeapBarrier|)))) (< v_arrayElimCell_75 0))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0)))))) .cse157 (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_29| Int)) (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_34| Int)) (or (forall ((|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int) (v_arrayElimCell_75 Int)) (or (< v_arrayElimCell_75 0) (forall ((v_arrayElimCell_72 Int)) (let ((.cse188 (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|) |v_ULTIMATE.start_append_~item~0#1.offset_29| v_arrayElimCell_72)) (.cse187 (+ 4 v_arrayElimCell_75))) (or (< (select (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_72) .cse187) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| .cse188) v_arrayElimCell_72) .cse4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (forall ((v_prenex_25 Int)) (<= (+ (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse188 (+ |v_ULTIMATE.start_append_~item~0#1.offset_29| 4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) v_prenex_25) .cse187) 1) |c_#StackHeapBarrier|))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0)))) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_29|))) .cse158 .cse189 .cse121 .cse159 .cse125 .cse129 .cse160) .cse12))) (or .cse1 (and (forall ((|v_ULTIMATE.start_append_~item~0#1.base_34| Int)) (or (forall ((|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int) (v_arrayElimCell_84 Int)) (or (forall ((v_arrayElimCell_72 Int)) (let ((.cse190 (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0 v_arrayElimCell_72))) (or (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse190 4 |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_84)) |c_#StackHeapBarrier|) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| .cse190) v_arrayElimCell_72) .cse4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|)))) (< v_arrayElimCell_84 0))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0)))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_34| Int)) (or (forall ((|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int)) (let ((.cse191 (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0 |c_ULTIMATE.start_append_~item~0#1.base|))) (or (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| .cse191) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (forall ((v_arrayElimCell_84 Int)) (or (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse191 4 |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_84)) |c_#StackHeapBarrier|) (< v_arrayElimCell_84 0)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0)))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_34| Int)) (or (forall ((v_arrayElimCell_72 Int) (|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int) (v_arrayElimCell_84 Int) (v_prenex_25 Int)) (let ((.cse192 (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0 v_arrayElimCell_72))) (or (< v_arrayElimCell_84 0) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| .cse192) v_arrayElimCell_72) .cse4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse192 4 |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) v_prenex_25) (+ 4 v_arrayElimCell_84)) |c_#StackHeapBarrier|)))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0)))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_34| Int)) (or (forall ((v_arrayElimCell_72 Int) (|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int) (v_arrayElimCell_84 Int)) (let ((.cse193 (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0 v_arrayElimCell_72))) (or (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse193 4 |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_84)) |c_#StackHeapBarrier|) (< v_arrayElimCell_84 0) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| .cse193) v_arrayElimCell_72) .cse4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|)))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0)))) (or (forall ((v_arrayElimCell_72 Int) (v_prenex_26 Int) (v_arrayElimCell_84 Int) (|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int) (|v_ULTIMATE.start_append_~item~0#1.base_34| Int)) (let ((.cse194 (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0 v_arrayElimCell_72))) (or (< v_arrayElimCell_84 0) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse194 4 |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) v_prenex_26) (+ 4 v_arrayElimCell_84)) |c_#StackHeapBarrier|) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| .cse194) v_arrayElimCell_72) .cse4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0))))) .cse12) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_34| Int)) (or (forall ((|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int) (v_arrayElimCell_84 Int)) (or (< v_arrayElimCell_84 0) (forall ((v_arrayElimCell_72 Int) (v_prenex_25 Int)) (let ((.cse195 (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0 v_arrayElimCell_72))) (or (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| .cse195) v_arrayElimCell_72) .cse4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse195 4 |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) v_prenex_25) (+ 4 v_arrayElimCell_84)) |c_#StackHeapBarrier|)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0)))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_34| Int)) (or (forall ((v_arrayElimCell_72 Int) (|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int) (v_arrayElimCell_84 Int)) (let ((.cse196 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|))) (or (< v_arrayElimCell_84 0) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store (store .cse196 0 |c_ULTIMATE.start_append_~item~0#1.base|) 4 |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) v_arrayElimCell_72) (+ 4 v_arrayElimCell_84)) |c_#StackHeapBarrier|) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse196 0 v_arrayElimCell_72)) v_arrayElimCell_72) .cse4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|)))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0)))))) (or (and .cse197 (or .cse1 (and .cse198 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_34| Int)) (or (forall ((|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int) (v_arrayElimCell_75 Int)) (or (forall ((v_arrayElimCell_72 Int) (v_prenex_26 Int)) (let ((.cse199 (+ 4 v_arrayElimCell_75)) (.cse200 (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0 v_arrayElimCell_72))) (or (< (select (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_72) .cse199) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse200 4 |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) v_prenex_26) .cse199) |c_#StackHeapBarrier|) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| .cse200) v_arrayElimCell_72) .cse4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|)))) (< v_arrayElimCell_75 0))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0)))) .cse201 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_34| Int)) (or (forall ((|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int) (v_arrayElimCell_75 Int)) (or (< v_arrayElimCell_75 0) (forall ((v_arrayElimCell_72 Int)) (let ((.cse203 (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0 v_arrayElimCell_72)) (.cse202 (+ 4 v_arrayElimCell_75))) (or (< (select (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_72) .cse202) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| .cse203) v_arrayElimCell_72) .cse4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (forall ((v_prenex_25 Int)) (<= (+ (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse203 4 |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) v_prenex_25) .cse202) 1) |c_#StackHeapBarrier|))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0)))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_34| Int)) (or (forall ((v_arrayElimCell_72 Int) (v_prenex_26 Int) (|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int) (v_arrayElimCell_75 Int)) (let ((.cse204 (+ 4 v_arrayElimCell_75))) (or (< v_arrayElimCell_75 0) (< (select (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_72) .cse204) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0 v_arrayElimCell_72) 4 |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) v_prenex_26) .cse204) |c_#StackHeapBarrier|)))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0)))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_34| Int)) (or (forall ((|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int) (v_arrayElimCell_75 Int)) (or (forall ((v_arrayElimCell_72 Int)) (let ((.cse206 (+ 4 v_arrayElimCell_75)) (.cse205 (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0 v_arrayElimCell_72))) (or (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse205 4 |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) |c_ULTIMATE.start_append_~item~0#1.base|) .cse206) |c_#StackHeapBarrier|) (< (select (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_72) .cse206) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| .cse205) v_arrayElimCell_72) .cse4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|)))) (< v_arrayElimCell_75 0))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0)))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_34| Int)) (or (forall ((|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int) (v_arrayElimCell_75 Int)) (or (< v_arrayElimCell_75 0) (forall ((v_arrayElimCell_72 Int)) (let ((.cse207 (+ 4 v_arrayElimCell_75))) (or (< (select (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_72) .cse207) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (forall ((v_prenex_25 Int)) (<= (+ (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0 v_arrayElimCell_72) 4 |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) v_prenex_25) .cse207) 1) |c_#StackHeapBarrier|))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0)))))) (or .cse1 (and (forall ((|v_ULTIMATE.start_append_~item~0#1.base_34| Int)) (or (forall ((|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int) (v_arrayElimCell_84 Int) (v_arrayElimCell_75 Int)) (or (< v_arrayElimCell_84 0) (forall ((v_arrayElimCell_72 Int)) (let ((.cse208 (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0 v_arrayElimCell_72))) (let ((.cse209 (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| .cse208) v_arrayElimCell_72))) (or (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse208 4 |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_84)) |c_#StackHeapBarrier|) (< (select .cse209 (+ 4 v_arrayElimCell_75)) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (< (select .cse209 .cse4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0)))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_34| Int)) (or (forall ((|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int) (v_arrayElimCell_84 Int) (v_arrayElimCell_75 Int)) (or (< v_arrayElimCell_84 0) (forall ((v_arrayElimCell_72 Int) (v_prenex_25 Int)) (let ((.cse211 (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0 v_arrayElimCell_72))) (let ((.cse210 (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| .cse211) v_arrayElimCell_72))) (or (< (select .cse210 (+ 4 v_arrayElimCell_75)) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (< (select .cse210 .cse4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse211 4 |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) v_prenex_25) (+ 4 v_arrayElimCell_84)) |c_#StackHeapBarrier|))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0)))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_34| Int)) (or (forall ((|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int)) (let ((.cse212 (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0 |c_ULTIMATE.start_append_~item~0#1.base|))) (or (forall ((v_arrayElimCell_75 Int)) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| .cse212) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_75)) |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) (forall ((v_arrayElimCell_84 Int)) (or (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse212 4 |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_84)) |c_#StackHeapBarrier|) (< v_arrayElimCell_84 0)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0)))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_34| Int)) (or (forall ((v_arrayElimCell_72 Int) (|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int) (v_arrayElimCell_84 Int) (v_prenex_25 Int) (v_arrayElimCell_75 Int)) (let ((.cse213 (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0 v_arrayElimCell_72))) (or (< v_arrayElimCell_84 0) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| .cse213) v_arrayElimCell_72) (+ 4 v_arrayElimCell_75)) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse213 4 |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) v_prenex_25) (+ 4 v_arrayElimCell_84)) |c_#StackHeapBarrier|)))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0)))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_34| Int)) (or (forall ((v_arrayElimCell_72 Int) (|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int) (v_arrayElimCell_84 Int) (v_arrayElimCell_75 Int)) (let ((.cse214 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|))) (or (< v_arrayElimCell_84 0) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store (store .cse214 0 |c_ULTIMATE.start_append_~item~0#1.base|) 4 |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) v_arrayElimCell_72) (+ 4 v_arrayElimCell_84)) |c_#StackHeapBarrier|) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse214 0 v_arrayElimCell_72)) v_arrayElimCell_72) (+ 4 v_arrayElimCell_75)) |v_ULTIMATE.start_append_#t~ite10#1.base_29|)))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0)))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_34| Int)) (or (forall ((v_arrayElimCell_72 Int) (|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int) (v_arrayElimCell_84 Int) (v_arrayElimCell_75 Int)) (let ((.cse215 (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0 v_arrayElimCell_72))) (or (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse215 4 |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_84)) |c_#StackHeapBarrier|) (< v_arrayElimCell_84 0) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| .cse215) v_arrayElimCell_72) (+ 4 v_arrayElimCell_75)) |v_ULTIMATE.start_append_#t~ite10#1.base_29|)))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0)))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_34| Int)) (or (forall ((v_arrayElimCell_72 Int) (v_prenex_26 Int) (|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int) (v_arrayElimCell_84 Int) (v_arrayElimCell_75 Int)) (let ((.cse216 (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0 v_arrayElimCell_72))) (or (< v_arrayElimCell_84 0) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse216 4 |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) v_prenex_26) (+ 4 v_arrayElimCell_84)) |c_#StackHeapBarrier|) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| .cse216) v_arrayElimCell_72) (+ 4 v_arrayElimCell_75)) |v_ULTIMATE.start_append_#t~ite10#1.base_29|)))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0))))))) .cse12) (or .cse37 (and (or .cse1 (and (or (forall ((v_arrayElimCell_72 Int) (v_prenex_26 Int) (|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int) (|v_ULTIMATE.start_append_~item~0#1.base_34| Int)) (or (< (select (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_72) .cse4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0 v_arrayElimCell_72) 4 |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) v_prenex_26) .cse4) |c_#StackHeapBarrier|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0)))) .cse12) .cse144 .cse145)) (or .cse1 .cse149 .cse12))))) (or .cse0 (and (or .cse1 (and .cse119 .cse120 (or .cse150 .cse12))) .cse114 .cse126 (or .cse1 (and .cse122 (or .cse12 (forall ((v_arrayElimCell_72 Int) (v_prenex_26 Int) (|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int) (v_arrayElimCell_84 Int) (|v_ULTIMATE.start_append_~item~0#1.offset_29| Int) (|v_ULTIMATE.start_append_~item~0#1.base_34| Int) (v_arrayElimCell_75 Int)) (let ((.cse217 (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|) |v_ULTIMATE.start_append_~item~0#1.offset_29| v_arrayElimCell_72))) (or (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| .cse217) v_arrayElimCell_72) (+ 4 v_arrayElimCell_75)) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (< v_arrayElimCell_84 0) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_29|) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse217 (+ |v_ULTIMATE.start_append_~item~0#1.offset_29| 4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) v_prenex_26) (+ 4 v_arrayElimCell_84)) |c_#StackHeapBarrier|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0)))))) .cse123 .cse124)) .cse174)) (or (and .cse51 .cse52 (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_29| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_29|) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_34| Int)) (or (forall ((|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int)) (or (< .cse47 |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (forall ((v_arrayElimCell_72 Int)) (<= (+ (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|) |v_ULTIMATE.start_append_~item~0#1.offset_29| v_arrayElimCell_72) (+ |v_ULTIMATE.start_append_~item~0#1.offset_29| 4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4) 1) |c_#StackHeapBarrier|)))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0))))))) .cse43 .cse45 .cse0 .cse46 .cse37) (or (and (or (and .cse48 .cse50) .cse0) .cse49) .cse37) (or .cse12 (and (or .cse1 (and .cse218 (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_29| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_29|) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_34| Int)) (or (forall ((|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int)) (let ((.cse220 (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|) |v_ULTIMATE.start_append_~item~0#1.offset_29| |c_ULTIMATE.start_append_~item~0#1.base|))) (or (< |v_ULTIMATE.start_append_#t~ite10#1.base_29| |c_#StackHeapBarrier|) (forall ((v_arrayElimCell_72 Int) (v_arrayElimCell_75 Int)) (let ((.cse219 (+ 4 v_arrayElimCell_75))) (or (< v_arrayElimCell_75 0) (< (select (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_72) .cse219) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse220 (+ |v_ULTIMATE.start_append_~item~0#1.offset_29| 4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) |c_ULTIMATE.start_append_~item~0#1.base|) .cse219) |c_#StackHeapBarrier|)))) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| .cse220) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|)))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0)))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_29| Int)) (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_34| Int)) (or (forall ((|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int)) (let ((.cse222 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|))) (or (forall ((v_arrayElimCell_75 Int)) (or (< v_arrayElimCell_75 0) (forall ((v_arrayElimCell_72 Int) (v_prenex_26 Int)) (let ((.cse221 (+ 4 v_arrayElimCell_75))) (or (< (select (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_72) .cse221) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store (store .cse222 |v_ULTIMATE.start_append_~item~0#1.offset_29| v_arrayElimCell_72) (+ |v_ULTIMATE.start_append_~item~0#1.offset_29| 4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) v_prenex_26) .cse221) |c_#StackHeapBarrier|)))))) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse222 |v_ULTIMATE.start_append_~item~0#1.offset_29| |c_ULTIMATE.start_append_~item~0#1.base|)) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|)))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0)))) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_29|))))) (or (forall ((v_arrayElimCell_72 Int) (|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_29| Int) (|v_ULTIMATE.start_append_~item~0#1.base_34| Int) (v_arrayElimCell_75 Int)) (let ((.cse224 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|))) (let ((.cse223 (+ 4 v_arrayElimCell_75)) (.cse225 (store .cse224 |v_ULTIMATE.start_append_~item~0#1.offset_29| |c_ULTIMATE.start_append_~item~0#1.base|))) (or (< |v_ULTIMATE.start_append_#t~ite10#1.base_29| |c_#StackHeapBarrier|) (< v_arrayElimCell_75 0) (< (select (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_72) .cse223) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse224 |v_ULTIMATE.start_append_~item~0#1.offset_29| v_arrayElimCell_72)) v_arrayElimCell_72) .cse4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_29|) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse225 (+ |v_ULTIMATE.start_append_~item~0#1.offset_29| 4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) |c_ULTIMATE.start_append_~item~0#1.base|) .cse223) |c_#StackHeapBarrier|) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| .cse225) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0)))))) .cse16) (or (forall ((v_arrayElimCell_72 Int) (|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int) (|v_ULTIMATE.start_append_~item~0#1.base_34| Int) (v_arrayElimCell_75 Int)) (let ((.cse228 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|))) (let ((.cse226 (store .cse228 0 |c_ULTIMATE.start_append_~item~0#1.base|)) (.cse227 (+ 4 v_arrayElimCell_75))) (or (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| .cse226) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (< |v_ULTIMATE.start_append_#t~ite10#1.base_29| |c_#StackHeapBarrier|) (< v_arrayElimCell_75 0) (< (select (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_72) .cse227) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse228 0 v_arrayElimCell_72)) v_arrayElimCell_72) .cse4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse226 4 |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) |c_ULTIMATE.start_append_~item~0#1.base|) .cse227) |c_#StackHeapBarrier|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0)))))) .cse24) (or .cse16 (and (or .cse0 .cse54) (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_29| Int)) (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_34| Int)) (or (forall ((|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int)) (let ((.cse231 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|))) (or (forall ((v_arrayElimCell_75 Int)) (or (< v_arrayElimCell_75 0) (forall ((v_arrayElimCell_72 Int) (v_prenex_26 Int)) (let ((.cse230 (store .cse231 |v_ULTIMATE.start_append_~item~0#1.offset_29| v_arrayElimCell_72)) (.cse229 (+ 4 v_arrayElimCell_75))) (or (< (select (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_72) .cse229) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| .cse230) v_arrayElimCell_72) .cse4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse230 (+ |v_ULTIMATE.start_append_~item~0#1.offset_29| 4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) v_prenex_26) .cse229) |c_#StackHeapBarrier|)))))) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse231 |v_ULTIMATE.start_append_~item~0#1.offset_29| |c_ULTIMATE.start_append_~item~0#1.base|)) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|)))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0)))) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_29|))))) (or (forall ((v_arrayElimCell_72 Int) (|v_ULTIMATE.start_append_~item~0#1.base_34| Int) (v_arrayElimCell_75 Int)) (let ((.cse232 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|))) (or (< v_arrayElimCell_75 0) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse232 0 |c_ULTIMATE.start_append_~item~0#1.base|)) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4) |c_#StackHeapBarrier|) (< (select (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_72) (+ 4 v_arrayElimCell_75)) |c_#StackHeapBarrier|) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse232 0 v_arrayElimCell_72)) v_arrayElimCell_72) .cse4) |c_#StackHeapBarrier|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0))))) .cse24) (or .cse16 (forall ((v_arrayElimCell_72 Int) (|v_ULTIMATE.start_append_~item~0#1.offset_29| Int) (|v_ULTIMATE.start_append_~item~0#1.base_34| Int) (v_arrayElimCell_75 Int)) (let ((.cse233 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|))) (or (< v_arrayElimCell_75 0) (< (select (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_72) (+ 4 v_arrayElimCell_75)) |c_#StackHeapBarrier|) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse233 |v_ULTIMATE.start_append_~item~0#1.offset_29| |c_ULTIMATE.start_append_~item~0#1.base|)) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4) |c_#StackHeapBarrier|) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_29|) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse233 |v_ULTIMATE.start_append_~item~0#1.offset_29| v_arrayElimCell_72)) v_arrayElimCell_72) .cse4) |c_#StackHeapBarrier|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0)))))) (or (forall ((v_arrayElimCell_72 Int) (|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int) (|v_ULTIMATE.start_append_~item~0#1.base_34| Int) (v_arrayElimCell_75 Int)) (let ((.cse234 (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0 |c_ULTIMATE.start_append_~item~0#1.base|)) (.cse235 (+ 4 v_arrayElimCell_75))) (or (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| .cse234) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (< |v_ULTIMATE.start_append_#t~ite10#1.base_29| |c_#StackHeapBarrier|) (< v_arrayElimCell_75 0) (< (select (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_72) .cse235) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse234 4 |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) |c_ULTIMATE.start_append_~item~0#1.base|) .cse235) |c_#StackHeapBarrier|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0))))) .cse176) (or (and (or (forall ((v_arrayElimCell_72 Int) (|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int) (|v_ULTIMATE.start_append_~item~0#1.base_34| Int) (v_arrayElimCell_75 Int)) (let ((.cse237 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|))) (let ((.cse236 (store .cse237 0 |c_ULTIMATE.start_append_~item~0#1.base|)) (.cse238 (+ 4 v_arrayElimCell_75))) (or (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| .cse236) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (< |v_ULTIMATE.start_append_#t~ite10#1.base_29| |c_#StackHeapBarrier|) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse237 0 v_arrayElimCell_72)) v_arrayElimCell_72) .cse238) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse236 4 |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) |c_ULTIMATE.start_append_~item~0#1.base|) .cse238) |c_#StackHeapBarrier|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0)))))) .cse0) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_34| Int)) (let ((.cse239 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|))) (or (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse239 0 |c_ULTIMATE.start_append_~item~0#1.base|)) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4) |c_#StackHeapBarrier|) (forall ((v_arrayElimCell_72 Int) (v_arrayElimCell_75 Int)) (let ((.cse240 (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse239 0 v_arrayElimCell_72)) v_arrayElimCell_72))) (or (< (select .cse240 .cse4) |c_#StackHeapBarrier|) (< (select .cse240 (+ 4 v_arrayElimCell_75)) |c_#StackHeapBarrier|)))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0))))) .cse23 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_34| Int)) (or (forall ((|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int)) (let ((.cse244 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|))) (let ((.cse241 (store .cse244 0 |c_ULTIMATE.start_append_~item~0#1.base|))) (or (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| .cse241) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (< |v_ULTIMATE.start_append_#t~ite10#1.base_29| |c_#StackHeapBarrier|) (forall ((v_arrayElimCell_72 Int) (v_arrayElimCell_75 Int)) (let ((.cse242 (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse244 0 v_arrayElimCell_72)) v_arrayElimCell_72)) (.cse243 (+ 4 v_arrayElimCell_75))) (or (< (select .cse242 .cse243) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (< (select .cse242 .cse4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse241 4 |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) |c_ULTIMATE.start_append_~item~0#1.base|) .cse243) |c_#StackHeapBarrier|)))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0))))) .cse24) (or .cse1 (and (forall ((|v_ULTIMATE.start_append_~item~0#1.base_34| Int)) (or (forall ((|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int)) (let ((.cse245 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|))) (or (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse245 0 |c_ULTIMATE.start_append_~item~0#1.base|)) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (forall ((v_arrayElimCell_75 Int)) (or (forall ((v_arrayElimCell_72 Int) (v_prenex_26 Int)) (let ((.cse246 (+ 4 v_arrayElimCell_75))) (or (< (select (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_72) .cse246) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store (store .cse245 0 v_arrayElimCell_72) 4 |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) v_prenex_26) .cse246) |c_#StackHeapBarrier|)))) (< v_arrayElimCell_75 0)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0)))) (or .cse0 (forall ((v_arrayElimCell_72 Int) (|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int) (v_prenex_25 Int) (|v_ULTIMATE.start_append_~item~0#1.base_34| Int) (v_arrayElimCell_75 Int)) (let ((.cse247 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|)) (.cse248 (+ 4 v_arrayElimCell_75))) (or (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse247 0 |c_ULTIMATE.start_append_~item~0#1.base|)) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (< v_arrayElimCell_75 0) (< (select (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_72) .cse248) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store (store .cse247 0 v_arrayElimCell_72) 4 |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) v_prenex_25) .cse248) |c_#StackHeapBarrier|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0)))))))) (or (and .cse15 (or .cse16 .cse17)) .cse14) (or .cse16 (and .cse218 .cse249)))) (or (and (or (and .cse218 .cse249 .cse10) .cse1) .cse13 (or (and (or .cse0 (forall ((v_arrayElimCell_72 Int) (|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int) (v_arrayElimCell_84 Int) (|v_ULTIMATE.start_append_~item~0#1.offset_29| Int) (v_prenex_25 Int) (|v_ULTIMATE.start_append_~item~0#1.base_34| Int) (v_arrayElimCell_75 Int)) (let ((.cse251 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|))) (let ((.cse250 (store .cse251 |v_ULTIMATE.start_append_~item~0#1.offset_29| v_arrayElimCell_72))) (or (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| .cse250) v_arrayElimCell_72) (+ 4 v_arrayElimCell_75)) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (< v_arrayElimCell_84 0) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse250 (+ |v_ULTIMATE.start_append_~item~0#1.offset_29| 4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) v_prenex_25) (+ 4 v_arrayElimCell_84)) |c_#StackHeapBarrier|) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_29|) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse251 |v_ULTIMATE.start_append_~item~0#1.offset_29| |c_ULTIMATE.start_append_~item~0#1.base|)) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0))))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_29| Int)) (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_34| Int)) (or (forall ((|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int)) (let ((.cse253 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|))) (or (forall ((v_arrayElimCell_72 Int) (v_arrayElimCell_75 Int)) (let ((.cse252 (store .cse253 |v_ULTIMATE.start_append_~item~0#1.offset_29| v_arrayElimCell_72))) (or (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| .cse252) v_arrayElimCell_72) (+ 4 v_arrayElimCell_75)) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (forall ((v_arrayElimCell_84 Int)) (or (forall ((v_prenex_26 Int)) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse252 (+ |v_ULTIMATE.start_append_~item~0#1.offset_29| 4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) v_prenex_26) (+ 4 v_arrayElimCell_84)) |c_#StackHeapBarrier|)) (< v_arrayElimCell_84 0)))))) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse253 |v_ULTIMATE.start_append_~item~0#1.offset_29| |c_ULTIMATE.start_append_~item~0#1.base|)) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|)))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0)))) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_29|))) .cse5 .cse6) .cse1)) .cse12) (or .cse37 (and (or (and (or .cse1 .cse169) .cse28) .cse12) (or (and .cse31 .cse32) .cse1) (or .cse165 .cse179 .cse12 .cse166) (or .cse167 .cse19 .cse16) (or .cse167 .cse16 .cse18) (or .cse176 .cse170))) (or (and .cse197 (or (and .cse119 .cse128 .cse123 .cse189 .cse172 .cse124 .cse129 .cse173) .cse1) (or .cse1 (and .cse198 .cse201 (or .cse0 (forall ((v_arrayElimCell_72 Int) (|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int) (v_prenex_25 Int) (|v_ULTIMATE.start_append_~item~0#1.base_34| Int) (v_arrayElimCell_75 Int)) (let ((.cse254 (+ 4 v_arrayElimCell_75))) (or (< v_arrayElimCell_75 0) (< (select (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_72) .cse254) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0 v_arrayElimCell_72) 4 |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) v_prenex_25) .cse254) |c_#StackHeapBarrier|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0)))))))) (or (and (forall ((|v_ULTIMATE.start_append_~item~0#1.base_34| Int)) (or (forall ((v_arrayElimCell_72 Int) (|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int) (v_arrayElimCell_75 Int)) (let ((.cse255 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|))) (or (forall ((v_arrayElimCell_84 Int)) (or (< v_arrayElimCell_84 0) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store (store .cse255 0 |c_ULTIMATE.start_append_~item~0#1.base|) 4 |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) v_arrayElimCell_72) (+ 4 v_arrayElimCell_84)) |c_#StackHeapBarrier|))) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse255 0 v_arrayElimCell_72)) v_arrayElimCell_72) (+ 4 v_arrayElimCell_75)) |v_ULTIMATE.start_append_#t~ite10#1.base_29|)))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0)))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_34| Int)) (or (forall ((v_arrayElimCell_72 Int) (|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int) (v_arrayElimCell_75 Int)) (let ((.cse256 (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0 v_arrayElimCell_72))) (or (forall ((v_arrayElimCell_84 Int)) (or (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse256 4 |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_84)) |c_#StackHeapBarrier|) (< v_arrayElimCell_84 0))) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| .cse256) v_arrayElimCell_72) (+ 4 v_arrayElimCell_75)) |v_ULTIMATE.start_append_#t~ite10#1.base_29|)))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0)))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_34| Int)) (or (forall ((v_arrayElimCell_72 Int) (|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int) (v_arrayElimCell_75 Int)) (let ((.cse257 (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0 v_arrayElimCell_72))) (or (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| .cse257) v_arrayElimCell_72) (+ 4 v_arrayElimCell_75)) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (forall ((v_arrayElimCell_84 Int)) (or (forall ((v_prenex_26 Int)) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse257 4 |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) v_prenex_26) (+ 4 v_arrayElimCell_84)) |c_#StackHeapBarrier|)) (< v_arrayElimCell_84 0)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0)))) (or .cse0 (forall ((v_arrayElimCell_72 Int) (|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int) (v_arrayElimCell_84 Int) (v_prenex_25 Int) (|v_ULTIMATE.start_append_~item~0#1.base_34| Int) (v_arrayElimCell_75 Int)) (let ((.cse258 (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0 v_arrayElimCell_72))) (or (< v_arrayElimCell_84 0) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| .cse258) v_arrayElimCell_72) (+ 4 v_arrayElimCell_75)) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse258 4 |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) v_prenex_25) (+ 4 v_arrayElimCell_84)) |c_#StackHeapBarrier|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0))))))) .cse1)) .cse12) (or (and (or (and (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_29| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_29|) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_34| Int)) (or (forall ((|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int)) (or (< .cse47 |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (forall ((v_arrayElimCell_72 Int)) (or (< (select (select |c_#memory_$Pointer$#1.base| v_arrayElimCell_72) .cse4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|) |v_ULTIMATE.start_append_~item~0#1.offset_29| v_arrayElimCell_72) (+ |v_ULTIMATE.start_append_~item~0#1.offset_29| 4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4) |c_#StackHeapBarrier|))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0)))))) .cse103 .cse104) .cse1) (or (and (or (forall ((v_arrayElimCell_72 Int) (v_prenex_26 Int) (|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_29| Int) (|v_ULTIMATE.start_append_~item~0#1.base_34| Int) (v_arrayElimCell_75 Int)) (let ((.cse259 (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|) |v_ULTIMATE.start_append_~item~0#1.offset_29| v_arrayElimCell_72))) (or (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| .cse259) v_arrayElimCell_72) (+ 4 v_arrayElimCell_75)) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_29|) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse259 (+ |v_ULTIMATE.start_append_~item~0#1.offset_29| 4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) v_prenex_26) .cse4) |c_#StackHeapBarrier|) (< .cse47 |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0))))) .cse12) (or (forall ((v_arrayElimCell_72 Int) (|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_29| Int) (|v_ULTIMATE.start_append_~item~0#1.base_34| Int) (v_arrayElimCell_75 Int)) (let ((.cse260 (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|))) (or (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse260 |v_ULTIMATE.start_append_~item~0#1.offset_29| v_arrayElimCell_72)) v_arrayElimCell_72) (+ 4 v_arrayElimCell_75)) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store (store .cse260 |v_ULTIMATE.start_append_~item~0#1.offset_29| |c_ULTIMATE.start_append_~item~0#1.base|) (+ |v_ULTIMATE.start_append_~item~0#1.offset_29| 4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) v_arrayElimCell_72) .cse4) |c_#StackHeapBarrier|) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_29|) (< .cse47 |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0))))) .cse29) (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_29| Int)) (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_34| Int)) (or (forall ((|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int)) (or (forall ((v_arrayElimCell_72 Int) (v_arrayElimCell_75 Int)) (let ((.cse261 (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|) |v_ULTIMATE.start_append_~item~0#1.offset_29| v_arrayElimCell_72))) (or (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| .cse261) v_arrayElimCell_72) (+ 4 v_arrayElimCell_75)) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse261 (+ |v_ULTIMATE.start_append_~item~0#1.offset_29| 4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4) |c_#StackHeapBarrier|)))) (< .cse47 |v_ULTIMATE.start_append_#t~ite10#1.base_29|))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0)))) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_29|))) (or .cse0 (forall ((v_arrayElimCell_72 Int) (|v_ULTIMATE.start_append_#t~ite10#1.base_29| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_29| Int) (v_prenex_25 Int) (|v_ULTIMATE.start_append_~item~0#1.base_34| Int) (v_arrayElimCell_75 Int)) (let ((.cse262 (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34|) |v_ULTIMATE.start_append_~item~0#1.offset_29| v_arrayElimCell_72))) (or (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| .cse262) v_arrayElimCell_72) (+ 4 v_arrayElimCell_75)) |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (< (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_append_~item~0#1.base_34| (store .cse262 (+ |v_ULTIMATE.start_append_~item~0#1.offset_29| 4) |v_ULTIMATE.start_append_#t~ite10#1.base_29|)) v_prenex_25) .cse4) |c_#StackHeapBarrier|) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_29|) (< .cse47 |v_ULTIMATE.start_append_#t~ite10#1.base_29|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_34|) 0))))))) .cse1) (or .cse29 (and (or .cse165 .cse0 .cse24 .cse180 .cse166) (or .cse53 .cse1) (or .cse165 .cse179 .cse180 .cse166)))) .cse37)))))) is different from true