./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 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.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.3.0-?-798a7b3-m [2025-03-04 07:34:33,048 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 07:34:33,106 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 07:34:33,110 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 07:34:33,110 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 07:34:33,131 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 07:34:33,132 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 07:34:33,132 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 07:34:33,132 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 07:34:33,132 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 07:34:33,132 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 07:34:33,132 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 07:34:33,133 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 07:34:33,133 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 07:34:33,133 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 07:34:33,133 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 07:34:33,133 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 07:34:33,133 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 07:34:33,133 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 07:34:33,133 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 07:34:33,133 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 07:34:33,133 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 07:34:33,133 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 07:34:33,133 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 07:34:33,133 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 07:34:33,133 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 07:34:33,133 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 07:34:33,134 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 07:34:33,134 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 07:34:33,135 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 07:34:33,135 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 07:34:33,135 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 07:34:33,135 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 07:34:33,135 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:34:33,136 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 07:34:33,136 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 07:34:33,136 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 07:34:33,136 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 07:34:33,136 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 07:34:33,136 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 07:34:33,136 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 07:34:33,136 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 07:34:33,136 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /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 [2025-03-04 07:34:33,382 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 07:34:33,390 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 07:34:33,392 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 07:34:33,393 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 07:34:33,394 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 07:34:33,395 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 [2025-03-04 07:34:34,541 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae5dc5a26/e11b8d7fcd4449b9ad38db4e43668f75/FLAGdd94fa556 [2025-03-04 07:34:34,821 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 07:34:34,822 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext-properties/test-0232_1-2.i [2025-03-04 07:34:34,830 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae5dc5a26/e11b8d7fcd4449b9ad38db4e43668f75/FLAGdd94fa556 [2025-03-04 07:34:35,119 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae5dc5a26/e11b8d7fcd4449b9ad38db4e43668f75 [2025-03-04 07:34:35,121 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 07:34:35,122 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 07:34:35,123 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 07:34:35,123 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 07:34:35,126 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 07:34:35,126 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:34:35" (1/1) ... [2025-03-04 07:34:35,127 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e6d6cd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:34:35, skipping insertion in model container [2025-03-04 07:34:35,127 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:34:35" (1/1) ... [2025-03-04 07:34:35,149 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 07:34:35,305 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:34:35,315 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 07:34:35,359 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:34:35,378 INFO L204 MainTranslator]: Completed translation [2025-03-04 07:34:35,378 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:34:35 WrapperNode [2025-03-04 07:34:35,379 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 07:34:35,380 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 07:34:35,380 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 07:34:35,380 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 07:34:35,385 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:34:35" (1/1) ... [2025-03-04 07:34:35,398 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:34:35" (1/1) ... [2025-03-04 07:34:35,420 INFO L138 Inliner]: procedures = 126, calls = 33, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 95 [2025-03-04 07:34:35,420 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 07:34:35,421 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 07:34:35,421 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 07:34:35,421 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 07:34:35,429 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:34:35" (1/1) ... [2025-03-04 07:34:35,429 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:34:35" (1/1) ... [2025-03-04 07:34:35,432 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:34:35" (1/1) ... [2025-03-04 07:34:35,450 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]. [2025-03-04 07:34:35,450 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:34:35" (1/1) ... [2025-03-04 07:34:35,451 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:34:35" (1/1) ... [2025-03-04 07:34:35,460 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:34:35" (1/1) ... [2025-03-04 07:34:35,461 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:34:35" (1/1) ... [2025-03-04 07:34:35,462 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:34:35" (1/1) ... [2025-03-04 07:34:35,466 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:34:35" (1/1) ... [2025-03-04 07:34:35,468 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 07:34:35,469 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 07:34:35,469 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 07:34:35,469 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 07:34:35,470 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:34:35" (1/1) ... [2025-03-04 07:34:35,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:34:35,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:34:35,504 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) [2025-03-04 07:34:35,507 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 [2025-03-04 07:34:35,526 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 07:34:35,526 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 07:34:35,526 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 07:34:35,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 07:34:35,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 07:34:35,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 07:34:35,527 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 07:34:35,527 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 07:34:35,527 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 07:34:35,527 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 07:34:35,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-04 07:34:35,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-04 07:34:35,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-04 07:34:35,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 07:34:35,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 07:34:35,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 07:34:35,528 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 07:34:35,528 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 07:34:35,626 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 07:34:35,628 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 07:34:35,886 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L541: call ULTIMATE.dealloc(main_~#list~0#1.base, main_~#list~0#1.offset);havoc main_~#list~0#1.base, main_~#list~0#1.offset; [2025-03-04 07:34:35,897 INFO L? ?]: Removed 98 outVars from TransFormulas that were not future-live. [2025-03-04 07:34:35,898 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 07:34:35,908 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 07:34:35,908 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 07:34:35,909 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:34:35 BoogieIcfgContainer [2025-03-04 07:34:35,909 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 07:34:35,910 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 07:34:35,910 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 07:34:35,914 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 07:34:35,915 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 07:34:35" (1/3) ... [2025-03-04 07:34:35,917 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c54fddd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:34:35, skipping insertion in model container [2025-03-04 07:34:35,917 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:34:35" (2/3) ... [2025-03-04 07:34:35,918 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c54fddd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:34:35, skipping insertion in model container [2025-03-04 07:34:35,918 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:34:35" (3/3) ... [2025-03-04 07:34:35,919 INFO L128 eAbstractionObserver]: Analyzing ICFG test-0232_1-2.i [2025-03-04 07:34:35,930 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 07:34:35,931 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test-0232_1-2.i that has 1 procedures, 88 locations, 1 initial locations, 2 loop locations, and 44 error locations. [2025-03-04 07:34:35,958 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 07:34:35,967 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;@76284c9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 07:34:35,967 INFO L334 AbstractCegarLoop]: Starting to check reachability of 44 error locations. [2025-03-04 07:34:35,970 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 43 states have (on average 2.13953488372093) internal successors, (92), 87 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:34:35,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-04 07:34:35,974 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:34:35,974 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-04 07:34:35,974 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-03-04 07:34:35,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:34:35,978 INFO L85 PathProgramCache]: Analyzing trace with hash 3754590, now seen corresponding path program 1 times [2025-03-04 07:34:35,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:34:35,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573932199] [2025-03-04 07:34:35,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:34:35,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:34:36,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 07:34:36,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 07:34:36,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:34:36,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:34:36,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:34:36,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:34:36,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573932199] [2025-03-04 07:34:36,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573932199] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:34:36,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:34:36,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:34:36,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903287792] [2025-03-04 07:34:36,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:34:36,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:34:36,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:34:36,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:34:36,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:34:36,278 INFO L87 Difference]: Start difference. First operand has 88 states, 43 states have (on average 2.13953488372093) internal successors, (92), 87 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) 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) [2025-03-04 07:34:36,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:34:36,442 INFO L93 Difference]: Finished difference Result 82 states and 85 transitions. [2025-03-04 07:34:36,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:34:36,444 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 [2025-03-04 07:34:36,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:34:36,448 INFO L225 Difference]: With dead ends: 82 [2025-03-04 07:34:36,448 INFO L226 Difference]: Without dead ends: 80 [2025-03-04 07:34:36,449 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 [2025-03-04 07:34:36,451 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 81 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 77 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.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:34:36,453 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 77 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:34:36,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-03-04 07:34:36,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2025-03-04 07:34:36,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 42 states have (on average 1.9761904761904763) 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) [2025-03-04 07:34:36,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 83 transitions. [2025-03-04 07:34:36,484 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 83 transitions. Word has length 4 [2025-03-04 07:34:36,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:34:36,484 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 83 transitions. [2025-03-04 07:34:36,484 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) [2025-03-04 07:34:36,484 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2025-03-04 07:34:36,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-04 07:34:36,484 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:34:36,484 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-04 07:34:36,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 07:34:36,486 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-03-04 07:34:36,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:34:36,487 INFO L85 PathProgramCache]: Analyzing trace with hash 3754591, now seen corresponding path program 1 times [2025-03-04 07:34:36,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:34:36,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489997576] [2025-03-04 07:34:36,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:34:36,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:34:36,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 07:34:36,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 07:34:36,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:34:36,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:34:36,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:34:36,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:34:36,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489997576] [2025-03-04 07:34:36,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489997576] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:34:36,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:34:36,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:34:36,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789037556] [2025-03-04 07:34:36,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:34:36,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:34:36,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:34:36,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:34:36,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:34:36,665 INFO L87 Difference]: Start difference. First operand 80 states and 83 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) [2025-03-04 07:34:36,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:34:36,797 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2025-03-04 07:34:36,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:34:36,797 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 [2025-03-04 07:34:36,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:34:36,798 INFO L225 Difference]: With dead ends: 89 [2025-03-04 07:34:36,798 INFO L226 Difference]: Without dead ends: 89 [2025-03-04 07:34:36,799 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 [2025-03-04 07:34:36,799 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 72 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 81 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 [2025-03-04 07:34:36,799 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 81 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:34:36,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-03-04 07:34:36,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 81. [2025-03-04 07:34:36,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 47 states have (on average 1.851063829787234) 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) [2025-03-04 07:34:36,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 87 transitions. [2025-03-04 07:34:36,806 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 87 transitions. Word has length 4 [2025-03-04 07:34:36,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:34:36,806 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 87 transitions. [2025-03-04 07:34:36,806 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) [2025-03-04 07:34:36,806 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 87 transitions. [2025-03-04 07:34:36,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-04 07:34:36,807 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:34:36,807 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 07:34:36,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 07:34:36,808 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-03-04 07:34:36,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:34:36,808 INFO L85 PathProgramCache]: Analyzing trace with hash 116392343, now seen corresponding path program 1 times [2025-03-04 07:34:36,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:34:36,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153979124] [2025-03-04 07:34:36,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:34:36,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:34:36,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 07:34:36,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 07:34:36,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:34:36,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:34:36,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:34:36,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:34:36,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153979124] [2025-03-04 07:34:36,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153979124] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:34:36,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:34:36,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:34:36,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53865731] [2025-03-04 07:34:36,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:34:36,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:34:36,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:34:36,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:34:36,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:34:36,868 INFO L87 Difference]: Start difference. First operand 81 states and 87 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) [2025-03-04 07:34:36,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:34:36,925 INFO L93 Difference]: Finished difference Result 77 states and 83 transitions. [2025-03-04 07:34:36,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:34:36,926 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 [2025-03-04 07:34:36,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:34:36,927 INFO L225 Difference]: With dead ends: 77 [2025-03-04 07:34:36,928 INFO L226 Difference]: Without dead ends: 77 [2025-03-04 07:34:36,928 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 [2025-03-04 07:34:36,929 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 11 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 91 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 [2025-03-04 07:34:36,929 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 91 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:34:36,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-03-04 07:34:36,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2025-03-04 07:34:36,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 47 states have (on average 1.7659574468085106) internal successors, (83), 76 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) [2025-03-04 07:34:36,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 83 transitions. [2025-03-04 07:34:36,933 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 83 transitions. Word has length 5 [2025-03-04 07:34:36,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:34:36,933 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 83 transitions. [2025-03-04 07:34:36,933 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) [2025-03-04 07:34:36,933 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 83 transitions. [2025-03-04 07:34:36,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-04 07:34:36,934 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:34:36,934 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 07:34:36,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 07:34:36,934 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-03-04 07:34:36,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:34:36,934 INFO L85 PathProgramCache]: Analyzing trace with hash 116392344, now seen corresponding path program 1 times [2025-03-04 07:34:36,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:34:36,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367454819] [2025-03-04 07:34:36,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:34:36,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:34:36,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 07:34:36,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 07:34:36,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:34:36,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:34:36,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:34:36,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:34:36,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367454819] [2025-03-04 07:34:36,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367454819] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:34:36,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:34:36,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:34:36,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436613473] [2025-03-04 07:34:36,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:34:36,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:34:36,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:34:36,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:34:36,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:34:36,992 INFO L87 Difference]: Start difference. First operand 77 states and 83 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) [2025-03-04 07:34:37,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:34:37,031 INFO L93 Difference]: Finished difference Result 73 states and 79 transitions. [2025-03-04 07:34:37,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:34:37,032 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 [2025-03-04 07:34:37,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:34:37,032 INFO L225 Difference]: With dead ends: 73 [2025-03-04 07:34:37,033 INFO L226 Difference]: Without dead ends: 73 [2025-03-04 07:34:37,033 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 [2025-03-04 07:34:37,033 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 11 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 97 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.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:34:37,034 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 97 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:34:37,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-03-04 07:34:37,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2025-03-04 07:34:37,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 47 states have (on average 1.6808510638297873) internal successors, (79), 72 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:34:37,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 79 transitions. [2025-03-04 07:34:37,037 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 79 transitions. Word has length 5 [2025-03-04 07:34:37,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:34:37,037 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 79 transitions. [2025-03-04 07:34:37,037 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) [2025-03-04 07:34:37,037 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 79 transitions. [2025-03-04 07:34:37,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-04 07:34:37,038 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:34:37,038 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:34:37,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 07:34:37,038 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-03-04 07:34:37,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:34:37,039 INFO L85 PathProgramCache]: Analyzing trace with hash -2004342055, now seen corresponding path program 1 times [2025-03-04 07:34:37,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:34:37,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088884836] [2025-03-04 07:34:37,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:34:37,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:34:37,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 07:34:37,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 07:34:37,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:34:37,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:34:37,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:34:37,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:34:37,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088884836] [2025-03-04 07:34:37,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088884836] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:34:37,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:34:37,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 07:34:37,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408141175] [2025-03-04 07:34:37,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:34:37,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 07:34:37,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:34:37,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 07:34:37,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:34:37,285 INFO L87 Difference]: Start difference. First operand 73 states and 79 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) [2025-03-04 07:34:37,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:34:37,452 INFO L93 Difference]: Finished difference Result 82 states and 88 transitions. [2025-03-04 07:34:37,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 07:34:37,452 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 [2025-03-04 07:34:37,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:34:37,453 INFO L225 Difference]: With dead ends: 82 [2025-03-04 07:34:37,453 INFO L226 Difference]: Without dead ends: 82 [2025-03-04 07:34:37,453 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-04 07:34:37,453 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 18 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 356 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 [2025-03-04 07:34:37,456 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 356 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:34:37,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-03-04 07:34:37,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 79. [2025-03-04 07:34:37,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 53 states have (on average 1.6037735849056605) 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) [2025-03-04 07:34:37,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 85 transitions. [2025-03-04 07:34:37,463 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 85 transitions. Word has length 10 [2025-03-04 07:34:37,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:34:37,463 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 85 transitions. [2025-03-04 07:34:37,463 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) [2025-03-04 07:34:37,463 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 85 transitions. [2025-03-04 07:34:37,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-04 07:34:37,464 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:34:37,464 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:34:37,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 07:34:37,464 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-03-04 07:34:37,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:34:37,464 INFO L85 PathProgramCache]: Analyzing trace with hash 1704882963, now seen corresponding path program 1 times [2025-03-04 07:34:37,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:34:37,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824511029] [2025-03-04 07:34:37,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:34:37,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:34:37,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 07:34:37,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 07:34:37,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:34:37,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:34:37,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:34:37,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:34:37,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824511029] [2025-03-04 07:34:37,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824511029] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:34:37,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:34:37,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 07:34:37,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239986159] [2025-03-04 07:34:37,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:34:37,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:34:37,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:34:37,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:34:37,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:34:37,621 INFO L87 Difference]: Start difference. First operand 79 states and 85 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:34:37,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:34:37,757 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2025-03-04 07:34:37,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:34:37,757 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-03-04 07:34:37,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:34:37,758 INFO L225 Difference]: With dead ends: 89 [2025-03-04 07:34:37,758 INFO L226 Difference]: Without dead ends: 89 [2025-03-04 07:34:37,758 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 [2025-03-04 07:34:37,758 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 55 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 125 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 [2025-03-04 07:34:37,759 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 125 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:34:37,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-03-04 07:34:37,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 78. [2025-03-04 07:34:37,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 53 states have (on average 1.5849056603773586) internal successors, (84), 77 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) [2025-03-04 07:34:37,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 84 transitions. [2025-03-04 07:34:37,762 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 84 transitions. Word has length 16 [2025-03-04 07:34:37,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:34:37,762 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 84 transitions. [2025-03-04 07:34:37,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:34:37,762 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 84 transitions. [2025-03-04 07:34:37,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-04 07:34:37,763 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:34:37,763 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:34:37,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 07:34:37,763 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-03-04 07:34:37,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:34:37,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1704882964, now seen corresponding path program 1 times [2025-03-04 07:34:37,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:34:37,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224387938] [2025-03-04 07:34:37,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:34:37,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:34:37,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 07:34:37,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 07:34:37,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:34:37,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:34:37,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:34:37,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:34:37,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224387938] [2025-03-04 07:34:37,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224387938] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:34:37,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:34:37,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 07:34:37,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626743845] [2025-03-04 07:34:37,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:34:37,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:34:37,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:34:37,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:34:37,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:34:37,960 INFO L87 Difference]: Start difference. First operand 78 states and 84 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:34:38,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:34:38,100 INFO L93 Difference]: Finished difference Result 89 states and 95 transitions. [2025-03-04 07:34:38,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:34:38,100 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-03-04 07:34:38,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:34:38,100 INFO L225 Difference]: With dead ends: 89 [2025-03-04 07:34:38,100 INFO L226 Difference]: Without dead ends: 89 [2025-03-04 07:34:38,101 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 [2025-03-04 07:34:38,101 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 57 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 155 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 [2025-03-04 07:34:38,101 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 155 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:34:38,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-03-04 07:34:38,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 77. [2025-03-04 07:34:38,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 53 states have (on average 1.5660377358490567) internal successors, (83), 76 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) [2025-03-04 07:34:38,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 83 transitions. [2025-03-04 07:34:38,107 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 83 transitions. Word has length 16 [2025-03-04 07:34:38,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:34:38,107 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 83 transitions. [2025-03-04 07:34:38,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:34:38,107 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 83 transitions. [2025-03-04 07:34:38,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-04 07:34:38,107 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:34:38,107 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:34:38,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 07:34:38,107 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-03-04 07:34:38,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:34:38,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1704882291, now seen corresponding path program 1 times [2025-03-04 07:34:38,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:34:38,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915925254] [2025-03-04 07:34:38,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:34:38,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:34:38,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 07:34:38,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 07:34:38,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:34:38,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:34:38,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:34:38,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:34:38,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915925254] [2025-03-04 07:34:38,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915925254] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:34:38,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:34:38,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:34:38,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541055957] [2025-03-04 07:34:38,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:34:38,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:34:38,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:34:38,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:34:38,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:34:38,182 INFO L87 Difference]: Start difference. First operand 77 states and 83 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:34:38,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:34:38,196 INFO L93 Difference]: Finished difference Result 76 states and 78 transitions. [2025-03-04 07:34:38,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:34:38,196 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-03-04 07:34:38,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:34:38,197 INFO L225 Difference]: With dead ends: 76 [2025-03-04 07:34:38,197 INFO L226 Difference]: Without dead ends: 76 [2025-03-04 07:34:38,197 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 [2025-03-04 07:34:38,197 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 59 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 145 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 [2025-03-04 07:34:38,197 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 145 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:34:38,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-03-04 07:34:38,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 72. [2025-03-04 07:34:38,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 48 states have (on average 1.5416666666666667) 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) [2025-03-04 07:34:38,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 74 transitions. [2025-03-04 07:34:38,200 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 74 transitions. Word has length 16 [2025-03-04 07:34:38,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:34:38,200 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 74 transitions. [2025-03-04 07:34:38,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:34:38,200 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 74 transitions. [2025-03-04 07:34:38,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-04 07:34:38,200 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:34:38,203 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:34:38,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 07:34:38,203 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-03-04 07:34:38,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:34:38,203 INFO L85 PathProgramCache]: Analyzing trace with hash -2114871009, now seen corresponding path program 1 times [2025-03-04 07:34:38,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:34:38,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27363229] [2025-03-04 07:34:38,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:34:38,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:34:38,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 07:34:38,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 07:34:38,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:34:38,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:34:38,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:34:38,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:34:38,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27363229] [2025-03-04 07:34:38,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27363229] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:34:38,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:34:38,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:34:38,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983518748] [2025-03-04 07:34:38,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:34:38,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:34:38,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:34:38,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:34:38,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:34:38,250 INFO L87 Difference]: Start difference. First operand 72 states and 74 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:34:38,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:34:38,321 INFO L93 Difference]: Finished difference Result 71 states and 73 transitions. [2025-03-04 07:34:38,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:34:38,322 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-03-04 07:34:38,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:34:38,322 INFO L225 Difference]: With dead ends: 71 [2025-03-04 07:34:38,322 INFO L226 Difference]: Without dead ends: 71 [2025-03-04 07:34:38,322 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 [2025-03-04 07:34:38,322 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 8 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:34:38,323 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 156 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:34:38,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-03-04 07:34:38,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2025-03-04 07:34:38,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 48 states have (on average 1.5208333333333333) internal successors, (73), 70 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:34:38,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 73 transitions. [2025-03-04 07:34:38,325 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 73 transitions. Word has length 19 [2025-03-04 07:34:38,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:34:38,325 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 73 transitions. [2025-03-04 07:34:38,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:34:38,325 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 73 transitions. [2025-03-04 07:34:38,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-04 07:34:38,325 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:34:38,327 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:34:38,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 07:34:38,327 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-03-04 07:34:38,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:34:38,328 INFO L85 PathProgramCache]: Analyzing trace with hash -2114871008, now seen corresponding path program 1 times [2025-03-04 07:34:38,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:34:38,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331468562] [2025-03-04 07:34:38,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:34:38,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:34:38,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 07:34:38,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 07:34:38,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:34:38,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:34:38,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:34:38,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:34:38,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331468562] [2025-03-04 07:34:38,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331468562] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:34:38,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:34:38,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 07:34:38,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272693125] [2025-03-04 07:34:38,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:34:38,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 07:34:38,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:34:38,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 07:34:38,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 07:34:38,612 INFO L87 Difference]: Start difference. First operand 71 states and 73 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:34:38,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:34:38,741 INFO L93 Difference]: Finished difference Result 73 states and 75 transitions. [2025-03-04 07:34:38,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 07:34:38,742 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-03-04 07:34:38,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:34:38,742 INFO L225 Difference]: With dead ends: 73 [2025-03-04 07:34:38,742 INFO L226 Difference]: Without dead ends: 73 [2025-03-04 07:34:38,742 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 [2025-03-04 07:34:38,743 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 40 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:34:38,743 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 194 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:34:38,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-03-04 07:34:38,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 70. [2025-03-04 07:34:38,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 48 states have (on average 1.5) internal successors, (72), 69 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:34:38,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 72 transitions. [2025-03-04 07:34:38,745 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 72 transitions. Word has length 19 [2025-03-04 07:34:38,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:34:38,746 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 72 transitions. [2025-03-04 07:34:38,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:34:38,746 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 72 transitions. [2025-03-04 07:34:38,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-04 07:34:38,746 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:34:38,746 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] [2025-03-04 07:34:38,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 07:34:38,747 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-03-04 07:34:38,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:34:38,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1136491826, now seen corresponding path program 1 times [2025-03-04 07:34:38,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:34:38,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708438431] [2025-03-04 07:34:38,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:34:38,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:34:38,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 07:34:38,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 07:34:38,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:34:38,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:34:39,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:34:39,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:34:39,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708438431] [2025-03-04 07:34:39,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708438431] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:34:39,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:34:39,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 07:34:39,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586708123] [2025-03-04 07:34:39,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:34:39,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 07:34:39,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:34:39,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 07:34:39,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-04 07:34:39,006 INFO L87 Difference]: Start difference. First operand 70 states and 72 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) [2025-03-04 07:34:39,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:34:39,187 INFO L93 Difference]: Finished difference Result 109 states and 117 transitions. [2025-03-04 07:34:39,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 07:34:39,188 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 [2025-03-04 07:34:39,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:34:39,188 INFO L225 Difference]: With dead ends: 109 [2025-03-04 07:34:39,188 INFO L226 Difference]: Without dead ends: 109 [2025-03-04 07:34:39,189 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 [2025-03-04 07:34:39,189 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 42 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:34:39,189 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 288 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:34:39,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-03-04 07:34:39,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 82. [2025-03-04 07:34:39,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 60 states have (on average 1.4166666666666667) 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) [2025-03-04 07:34:39,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 85 transitions. [2025-03-04 07:34:39,196 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 85 transitions. Word has length 20 [2025-03-04 07:34:39,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:34:39,198 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 85 transitions. [2025-03-04 07:34:39,198 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) [2025-03-04 07:34:39,198 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 85 transitions. [2025-03-04 07:34:39,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-04 07:34:39,198 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:34:39,198 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:34:39,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 07:34:39,199 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-03-04 07:34:39,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:34:39,199 INFO L85 PathProgramCache]: Analyzing trace with hash 1788391165, now seen corresponding path program 1 times [2025-03-04 07:34:39,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:34:39,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27088550] [2025-03-04 07:34:39,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:34:39,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:34:39,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 07:34:39,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 07:34:39,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:34:39,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:34:39,424 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:34:39,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:34:39,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27088550] [2025-03-04 07:34:39,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27088550] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:34:39,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2074837697] [2025-03-04 07:34:39,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:34:39,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:34:39,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:34:39,428 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) [2025-03-04 07:34:39,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 07:34:39,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 07:34:39,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 07:34:39,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:34:39,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:34:39,512 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-04 07:34:39,519 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:34:39,590 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 [2025-03-04 07:34:39,620 INFO L349 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2025-03-04 07:34:39,620 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 [2025-03-04 07:34:39,639 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 [2025-03-04 07:34:39,665 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 [2025-03-04 07:34:39,691 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 [2025-03-04 07:34:39,694 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:34:39,694 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:34:39,782 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 [2025-03-04 07:34:40,158 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:34:40,158 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 [2025-03-04 07:34:40,610 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:34:40,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2074837697] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:34:40,611 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:34:40,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2025-03-04 07:34:40,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107792390] [2025-03-04 07:34:40,611 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:34:40,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 07:34:40,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:34:40,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 07:34:40,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2025-03-04 07:34:40,612 INFO L87 Difference]: Start difference. First operand 82 states and 85 transitions. Second operand has 16 states, 15 states have (on average 2.4) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:34:40,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:34:40,921 INFO L93 Difference]: Finished difference Result 84 states and 87 transitions. [2025-03-04 07:34:40,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 07:34:40,921 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.4) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 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 [2025-03-04 07:34:40,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:34:40,922 INFO L225 Difference]: With dead ends: 84 [2025-03-04 07:34:40,922 INFO L226 Difference]: Without dead ends: 84 [2025-03-04 07:34:40,922 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2025-03-04 07:34:40,923 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 79 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:34:40,923 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 336 Invalid, 424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:34:40,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-03-04 07:34:40,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 81. [2025-03-04 07:34:40,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 60 states have (on average 1.4) 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) [2025-03-04 07:34:40,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 84 transitions. [2025-03-04 07:34:40,925 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 84 transitions. Word has length 21 [2025-03-04 07:34:40,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:34:40,925 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 84 transitions. [2025-03-04 07:34:40,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.4) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:34:40,925 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 84 transitions. [2025-03-04 07:34:40,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-04 07:34:40,925 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:34:40,925 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:34:40,933 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 07:34:41,126 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,SelfDestructingSolverStorable11 [2025-03-04 07:34:41,126 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-03-04 07:34:41,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:34:41,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1788391166, now seen corresponding path program 1 times [2025-03-04 07:34:41,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:34:41,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947517184] [2025-03-04 07:34:41,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:34:41,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:34:41,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 07:34:41,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 07:34:41,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:34:41,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:34:41,447 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:34:41,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:34:41,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947517184] [2025-03-04 07:34:41,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947517184] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:34:41,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [813796544] [2025-03-04 07:34:41,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:34:41,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:34:41,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:34:41,449 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) [2025-03-04 07:34:41,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 07:34:41,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 07:34:41,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 07:34:41,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:34:41,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:34:41,527 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-03-04 07:34:41,529 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:34:41,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 07:34:41,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-04 07:34:41,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:34:41,595 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-04 07:34:41,600 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 07:34:41,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 07:34:41,643 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 [2025-03-04 07:34:41,647 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 [2025-03-04 07:34:41,672 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-03-04 07:34:41,672 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 18 treesize of output 21 [2025-03-04 07:34:41,684 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-03-04 07:34:41,684 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 [2025-03-04 07:34:41,705 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 [2025-03-04 07:34:41,724 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 [2025-03-04 07:34:41,726 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 [2025-03-04 07:34:41,761 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 [2025-03-04 07:34:41,768 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 7 treesize of output 3 [2025-03-04 07:34:41,771 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:34:41,771 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:34:41,923 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 [2025-03-04 07:34:41,927 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 [2025-03-04 07:34:41,971 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 [2025-03-04 07:34:42,091 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:34:42,092 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 [2025-03-04 07:34:42,362 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:34:42,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [813796544] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:34:42,362 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:34:42,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2025-03-04 07:34:42,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014080672] [2025-03-04 07:34:42,362 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:34:42,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-04 07:34:42,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:34:42,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-04 07:34:42,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2025-03-04 07:34:42,363 INFO L87 Difference]: Start difference. First operand 81 states and 84 transitions. Second operand has 20 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 20 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:34:42,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:34:42,713 INFO L93 Difference]: Finished difference Result 83 states and 86 transitions. [2025-03-04 07:34:42,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 07:34:42,713 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 20 states have internal predecessors, (54), 0 states have call successors, (0), 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 [2025-03-04 07:34:42,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:34:42,714 INFO L225 Difference]: With dead ends: 83 [2025-03-04 07:34:42,714 INFO L226 Difference]: Without dead ends: 83 [2025-03-04 07:34:42,714 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=117, Invalid=435, Unknown=0, NotChecked=0, Total=552 [2025-03-04 07:34:42,714 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 52 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:34:42,715 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 319 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:34:42,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-03-04 07:34:42,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 80. [2025-03-04 07:34:42,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 60 states have (on average 1.3833333333333333) 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) [2025-03-04 07:34:42,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 83 transitions. [2025-03-04 07:34:42,719 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 83 transitions. Word has length 21 [2025-03-04 07:34:42,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:34:42,719 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 83 transitions. [2025-03-04 07:34:42,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 20 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:34:42,720 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2025-03-04 07:34:42,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-04 07:34:42,720 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:34:42,720 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] [2025-03-04 07:34:42,729 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 07:34:42,920 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,SelfDestructingSolverStorable12 [2025-03-04 07:34:42,920 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-03-04 07:34:42,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:34:42,921 INFO L85 PathProgramCache]: Analyzing trace with hash -871508227, now seen corresponding path program 1 times [2025-03-04 07:34:42,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:34:42,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014598433] [2025-03-04 07:34:42,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:34:42,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:34:42,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 07:34:42,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 07:34:42,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:34:42,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:34:43,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:34:43,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:34:43,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014598433] [2025-03-04 07:34:43,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014598433] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:34:43,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:34:43,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 07:34:43,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834323920] [2025-03-04 07:34:43,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:34:43,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 07:34:43,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:34:43,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 07:34:43,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-04 07:34:43,121 INFO L87 Difference]: Start difference. First operand 80 states and 83 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) [2025-03-04 07:34:43,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:34:43,308 INFO L93 Difference]: Finished difference Result 104 states and 112 transitions. [2025-03-04 07:34:43,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 07:34:43,309 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 [2025-03-04 07:34:43,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:34:43,309 INFO L225 Difference]: With dead ends: 104 [2025-03-04 07:34:43,309 INFO L226 Difference]: Without dead ends: 104 [2025-03-04 07:34:43,309 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 [2025-03-04 07:34:43,310 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 36 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:34:43,310 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 177 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:34:43,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-03-04 07:34:43,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 81. [2025-03-04 07:34:43,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 61 states have (on average 1.3770491803278688) 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) [2025-03-04 07:34:43,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 84 transitions. [2025-03-04 07:34:43,316 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 84 transitions. Word has length 21 [2025-03-04 07:34:43,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:34:43,316 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 84 transitions. [2025-03-04 07:34:43,316 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) [2025-03-04 07:34:43,316 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 84 transitions. [2025-03-04 07:34:43,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-04 07:34:43,317 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:34:43,317 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] [2025-03-04 07:34:43,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 07:34:43,317 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-03-04 07:34:43,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:34:43,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1246951252, now seen corresponding path program 1 times [2025-03-04 07:34:43,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:34:43,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159396873] [2025-03-04 07:34:43,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:34:43,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:34:43,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 07:34:43,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 07:34:43,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:34:43,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:34:43,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:34:43,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:34:43,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159396873] [2025-03-04 07:34:43,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159396873] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:34:43,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:34:43,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 07:34:43,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775289854] [2025-03-04 07:34:43,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:34:43,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 07:34:43,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:34:43,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 07:34:43,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-04 07:34:43,597 INFO L87 Difference]: Start difference. First operand 81 states and 84 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) [2025-03-04 07:34:43,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:34:43,767 INFO L93 Difference]: Finished difference Result 95 states and 99 transitions. [2025-03-04 07:34:43,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 07:34:43,767 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 [2025-03-04 07:34:43,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:34:43,767 INFO L225 Difference]: With dead ends: 95 [2025-03-04 07:34:43,767 INFO L226 Difference]: Without dead ends: 95 [2025-03-04 07:34:43,768 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 [2025-03-04 07:34:43,768 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 24 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 179 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 [2025-03-04 07:34:43,768 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 179 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:34:43,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-03-04 07:34:43,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 82. [2025-03-04 07:34:43,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 62 states have (on average 1.3709677419354838) 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) [2025-03-04 07:34:43,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 85 transitions. [2025-03-04 07:34:43,770 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 85 transitions. Word has length 22 [2025-03-04 07:34:43,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:34:43,770 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 85 transitions. [2025-03-04 07:34:43,770 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) [2025-03-04 07:34:43,770 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 85 transitions. [2025-03-04 07:34:43,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-04 07:34:43,770 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:34:43,770 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] [2025-03-04 07:34:43,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 07:34:43,773 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-03-04 07:34:43,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:34:43,774 INFO L85 PathProgramCache]: Analyzing trace with hash -783142, now seen corresponding path program 1 times [2025-03-04 07:34:43,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:34:43,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691057873] [2025-03-04 07:34:43,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:34:43,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:34:43,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 07:34:43,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 07:34:43,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:34:43,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:34:43,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:34:43,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:34:43,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691057873] [2025-03-04 07:34:43,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691057873] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:34:43,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:34:43,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 07:34:43,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100671482] [2025-03-04 07:34:43,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:34:43,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 07:34:43,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:34:43,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 07:34:43,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-04 07:34:43,914 INFO L87 Difference]: Start difference. First operand 82 states and 85 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) [2025-03-04 07:34:43,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:34:43,992 INFO L93 Difference]: Finished difference Result 81 states and 84 transitions. [2025-03-04 07:34:43,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:34:43,992 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 [2025-03-04 07:34:43,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:34:43,993 INFO L225 Difference]: With dead ends: 81 [2025-03-04 07:34:43,993 INFO L226 Difference]: Without dead ends: 81 [2025-03-04 07:34:43,993 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-04 07:34:43,993 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 77 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:34:43,993 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 59 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:34:43,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-03-04 07:34:43,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2025-03-04 07:34:43,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 62 states have (on average 1.3548387096774193) 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) [2025-03-04 07:34:43,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 84 transitions. [2025-03-04 07:34:43,996 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 84 transitions. Word has length 23 [2025-03-04 07:34:43,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:34:43,996 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 84 transitions. [2025-03-04 07:34:43,996 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) [2025-03-04 07:34:43,996 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 84 transitions. [2025-03-04 07:34:43,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-04 07:34:43,996 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:34:43,997 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] [2025-03-04 07:34:43,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 07:34:43,997 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-03-04 07:34:43,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:34:43,997 INFO L85 PathProgramCache]: Analyzing trace with hash -783141, now seen corresponding path program 1 times [2025-03-04 07:34:43,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:34:43,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180581059] [2025-03-04 07:34:43,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:34:43,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:34:44,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 07:34:44,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 07:34:44,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:34:44,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:34:44,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:34:44,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:34:44,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180581059] [2025-03-04 07:34:44,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180581059] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:34:44,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:34:44,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:34:44,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712416473] [2025-03-04 07:34:44,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:34:44,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:34:44,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:34:44,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:34:44,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:34:44,037 INFO L87 Difference]: Start difference. First operand 81 states and 84 transitions. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 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) [2025-03-04 07:34:44,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:34:44,068 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2025-03-04 07:34:44,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:34:44,069 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 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 [2025-03-04 07:34:44,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:34:44,070 INFO L225 Difference]: With dead ends: 76 [2025-03-04 07:34:44,070 INFO L226 Difference]: Without dead ends: 76 [2025-03-04 07:34:44,070 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 [2025-03-04 07:34:44,071 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 76 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:34:44,071 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 37 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:34:44,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-03-04 07:34:44,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2025-03-04 07:34:44,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 62 states have (on average 1.2741935483870968) internal successors, (79), 75 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:34:44,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2025-03-04 07:34:44,073 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 23 [2025-03-04 07:34:44,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:34:44,073 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2025-03-04 07:34:44,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 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) [2025-03-04 07:34:44,074 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2025-03-04 07:34:44,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-04 07:34:44,074 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:34:44,074 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] [2025-03-04 07:34:44,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 07:34:44,074 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-03-04 07:34:44,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:34:44,074 INFO L85 PathProgramCache]: Analyzing trace with hash -24277398, now seen corresponding path program 1 times [2025-03-04 07:34:44,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:34:44,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277528315] [2025-03-04 07:34:44,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:34:44,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:34:44,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 07:34:44,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 07:34:44,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:34:44,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:34:44,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:34:44,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:34:44,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277528315] [2025-03-04 07:34:44,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277528315] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:34:44,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:34:44,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:34:44,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419940457] [2025-03-04 07:34:44,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:34:44,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:34:44,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:34:44,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:34:44,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:34:44,144 INFO L87 Difference]: Start difference. First operand 76 states and 79 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 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) [2025-03-04 07:34:44,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:34:44,182 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions. [2025-03-04 07:34:44,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:34:44,183 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 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 [2025-03-04 07:34:44,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:34:44,183 INFO L225 Difference]: With dead ends: 75 [2025-03-04 07:34:44,183 INFO L226 Difference]: Without dead ends: 75 [2025-03-04 07:34:44,183 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 [2025-03-04 07:34:44,184 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 26 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 132 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 [2025-03-04 07:34:44,184 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 132 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:34:44,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-03-04 07:34:44,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2025-03-04 07:34:44,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 62 states have (on average 1.2580645161290323) internal successors, (78), 74 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:34:44,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 78 transitions. [2025-03-04 07:34:44,185 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 78 transitions. Word has length 24 [2025-03-04 07:34:44,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:34:44,185 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 78 transitions. [2025-03-04 07:34:44,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 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) [2025-03-04 07:34:44,185 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2025-03-04 07:34:44,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-04 07:34:44,186 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:34:44,186 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] [2025-03-04 07:34:44,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 07:34:44,186 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-03-04 07:34:44,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:34:44,186 INFO L85 PathProgramCache]: Analyzing trace with hash -752599336, now seen corresponding path program 1 times [2025-03-04 07:34:44,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:34:44,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541864404] [2025-03-04 07:34:44,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:34:44,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:34:44,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 07:34:44,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 07:34:44,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:34:44,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:34:44,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:34:44,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:34:44,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541864404] [2025-03-04 07:34:44,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541864404] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:34:44,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:34:44,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:34:44,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890890127] [2025-03-04 07:34:44,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:34:44,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:34:44,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:34:44,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:34:44,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:34:44,264 INFO L87 Difference]: Start difference. First operand 75 states and 78 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) [2025-03-04 07:34:44,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:34:44,331 INFO L93 Difference]: Finished difference Result 77 states and 80 transitions. [2025-03-04 07:34:44,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:34:44,331 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 [2025-03-04 07:34:44,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:34:44,331 INFO L225 Difference]: With dead ends: 77 [2025-03-04 07:34:44,331 INFO L226 Difference]: Without dead ends: 77 [2025-03-04 07:34:44,332 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 [2025-03-04 07:34:44,332 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 26 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 113 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 [2025-03-04 07:34:44,332 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 113 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:34:44,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-03-04 07:34:44,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 74. [2025-03-04 07:34:44,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 62 states have (on average 1.2419354838709677) internal successors, (77), 73 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:34:44,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2025-03-04 07:34:44,333 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 25 [2025-03-04 07:34:44,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:34:44,333 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2025-03-04 07:34:44,334 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) [2025-03-04 07:34:44,334 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2025-03-04 07:34:44,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-04 07:34:44,334 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:34:44,334 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] [2025-03-04 07:34:44,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 07:34:44,334 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-03-04 07:34:44,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:34:44,334 INFO L85 PathProgramCache]: Analyzing trace with hash -1855742936, now seen corresponding path program 1 times [2025-03-04 07:34:44,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:34:44,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441886070] [2025-03-04 07:34:44,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:34:44,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:34:44,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 07:34:44,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 07:34:44,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:34:44,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:34:44,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:34:44,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:34:44,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441886070] [2025-03-04 07:34:44,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441886070] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:34:44,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:34:44,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 07:34:44,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299778419] [2025-03-04 07:34:44,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:34:44,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 07:34:44,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:34:44,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 07:34:44,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-03-04 07:34:44,673 INFO L87 Difference]: Start difference. First operand 74 states and 77 transitions. Second operand has 12 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 12 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) [2025-03-04 07:34:44,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:34:44,966 INFO L93 Difference]: Finished difference Result 94 states and 98 transitions. [2025-03-04 07:34:44,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 07:34:44,966 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 12 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 [2025-03-04 07:34:44,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:34:44,967 INFO L225 Difference]: With dead ends: 94 [2025-03-04 07:34:44,967 INFO L226 Difference]: Without dead ends: 94 [2025-03-04 07:34:44,967 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2025-03-04 07:34:44,967 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 76 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:34:44,967 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 178 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:34:44,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-03-04 07:34:44,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 78. [2025-03-04 07:34:44,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 66 states have (on average 1.2272727272727273) 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) [2025-03-04 07:34:44,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2025-03-04 07:34:44,969 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 26 [2025-03-04 07:34:44,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:34:44,969 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2025-03-04 07:34:44,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 12 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) [2025-03-04 07:34:44,969 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2025-03-04 07:34:44,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-04 07:34:44,972 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:34:44,972 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] [2025-03-04 07:34:44,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 07:34:44,972 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-03-04 07:34:44,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:34:44,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1693456171, now seen corresponding path program 1 times [2025-03-04 07:34:44,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:34:44,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406463402] [2025-03-04 07:34:44,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:34:44,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:34:44,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 07:34:44,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 07:34:44,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:34:44,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:34:45,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:34:45,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:34:45,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406463402] [2025-03-04 07:34:45,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406463402] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:34:45,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:34:45,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 07:34:45,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462701319] [2025-03-04 07:34:45,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:34:45,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:34:45,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:34:45,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:34:45,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:34:45,092 INFO L87 Difference]: Start difference. First operand 78 states and 81 transitions. Second operand has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 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) [2025-03-04 07:34:45,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:34:45,165 INFO L93 Difference]: Finished difference Result 77 states and 80 transitions. [2025-03-04 07:34:45,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 07:34:45,166 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 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 [2025-03-04 07:34:45,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:34:45,166 INFO L225 Difference]: With dead ends: 77 [2025-03-04 07:34:45,166 INFO L226 Difference]: Without dead ends: 77 [2025-03-04 07:34:45,166 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 [2025-03-04 07:34:45,166 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 66 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 81 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 [2025-03-04 07:34:45,166 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 81 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:34:45,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-03-04 07:34:45,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2025-03-04 07:34:45,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 66 states have (on average 1.2121212121212122) 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) [2025-03-04 07:34:45,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 80 transitions. [2025-03-04 07:34:45,168 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 80 transitions. Word has length 27 [2025-03-04 07:34:45,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:34:45,168 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 80 transitions. [2025-03-04 07:34:45,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 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) [2025-03-04 07:34:45,168 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 80 transitions. [2025-03-04 07:34:45,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-04 07:34:45,169 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:34:45,169 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] [2025-03-04 07:34:45,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 07:34:45,169 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-03-04 07:34:45,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:34:45,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1066936125, now seen corresponding path program 1 times [2025-03-04 07:34:45,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:34:45,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272728554] [2025-03-04 07:34:45,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:34:45,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:34:45,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 07:34:45,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 07:34:45,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:34:45,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:34:45,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:34:45,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:34:45,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272728554] [2025-03-04 07:34:45,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272728554] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:34:45,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:34:45,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-04 07:34:45,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530953225] [2025-03-04 07:34:45,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:34:45,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 07:34:45,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:34:45,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 07:34:45,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2025-03-04 07:34:45,907 INFO L87 Difference]: Start difference. First operand 77 states and 80 transitions. Second operand has 16 states, 15 states have (on average 2.0) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:34:46,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:34:46,296 INFO L93 Difference]: Finished difference Result 112 states and 116 transitions. [2025-03-04 07:34:46,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 07:34:46,296 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.0) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2025-03-04 07:34:46,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:34:46,297 INFO L225 Difference]: With dead ends: 112 [2025-03-04 07:34:46,297 INFO L226 Difference]: Without dead ends: 111 [2025-03-04 07:34:46,297 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2025-03-04 07:34:46,298 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 20 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 07:34:46,298 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 243 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 07:34:46,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-03-04 07:34:46,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 98. [2025-03-04 07:34:46,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 87 states have (on average 1.1724137931034482) internal successors, (102), 97 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:34:46,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 102 transitions. [2025-03-04 07:34:46,305 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 102 transitions. Word has length 30 [2025-03-04 07:34:46,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:34:46,305 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 102 transitions. [2025-03-04 07:34:46,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.0) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:34:46,305 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 102 transitions. [2025-03-04 07:34:46,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-04 07:34:46,305 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:34:46,305 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] [2025-03-04 07:34:46,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-04 07:34:46,306 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-03-04 07:34:46,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:34:46,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1284739345, now seen corresponding path program 1 times [2025-03-04 07:34:46,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:34:46,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286402849] [2025-03-04 07:34:46,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:34:46,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:34:46,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 07:34:46,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 07:34:46,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:34:46,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:34:46,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:34:46,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:34:46,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286402849] [2025-03-04 07:34:46,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286402849] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:34:46,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:34:46,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 07:34:46,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587074797] [2025-03-04 07:34:46,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:34:46,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:34:46,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:34:46,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:34:46,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:34:46,354 INFO L87 Difference]: Start difference. First operand 98 states and 102 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:34:46,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:34:46,364 INFO L93 Difference]: Finished difference Result 115 states and 119 transitions. [2025-03-04 07:34:46,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:34:46,365 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2025-03-04 07:34:46,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:34:46,365 INFO L225 Difference]: With dead ends: 115 [2025-03-04 07:34:46,365 INFO L226 Difference]: Without dead ends: 99 [2025-03-04 07:34:46,365 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 [2025-03-04 07:34:46,365 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 14 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:34:46,365 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 156 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:34:46,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-03-04 07:34:46,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 82. [2025-03-04 07:34:46,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 71 states have (on average 1.1971830985915493) 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) [2025-03-04 07:34:46,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 85 transitions. [2025-03-04 07:34:46,367 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 85 transitions. Word has length 31 [2025-03-04 07:34:46,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:34:46,367 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 85 transitions. [2025-03-04 07:34:46,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:34:46,367 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 85 transitions. [2025-03-04 07:34:46,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-04 07:34:46,368 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:34:46,368 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-04 07:34:46,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-04 07:34:46,368 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2025-03-04 07:34:46,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:34:46,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1683144510, now seen corresponding path program 1 times [2025-03-04 07:34:46,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:34:46,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535563994] [2025-03-04 07:34:46,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:34:46,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:34:46,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-04 07:34:46,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 07:34:46,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:34:46,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:34:47,120 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:34:47,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:34:47,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535563994] [2025-03-04 07:34:47,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535563994] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:34:47,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2123187288] [2025-03-04 07:34:47,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:34:47,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:34:47,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:34:47,122 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) [2025-03-04 07:34:47,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 07:34:47,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-04 07:34:47,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 07:34:47,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:34:47,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:34:47,220 INFO L256 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 70 conjuncts are in the unsatisfiable core [2025-03-04 07:34:47,223 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:34:47,308 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 [2025-03-04 07:34:47,350 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 [2025-03-04 07:34:47,358 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 [2025-03-04 07:34:47,397 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-03-04 07:34:47,397 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 [2025-03-04 07:34:47,488 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 [2025-03-04 07:34:47,498 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 [2025-03-04 07:34:47,631 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 [2025-03-04 07:34:47,809 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 07:34:47,812 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-04 07:34:47,812 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 [2025-03-04 07:34:47,909 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 07:34:47,910 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 70 treesize of output 43 [2025-03-04 07:34:47,914 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 07:34:47,915 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 69 treesize of output 42 [2025-03-04 07:34:48,180 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 07:34:48,180 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 32 [2025-03-04 07:34:48,188 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 07:34:48,190 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:34:48,190 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 46 treesize of output 29 [2025-03-04 07:34:48,231 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:34:48,231 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:34:48,911 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2025-03-04 07:34:48,912 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 204 treesize of output 194 [2025-03-04 07:34:48,972 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2025-03-04 07:34:48,972 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 294 treesize of output 280 [2025-03-04 07:34:48,991 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:34:48,992 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 202 treesize of output 200 [2025-03-04 07:34:49,009 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:34:49,009 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 206 treesize of output 202 [2025-03-04 07:34:49,030 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 [2025-03-04 07:34:49,054 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 [2025-03-04 07:34:49,100 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:34:49,101 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 318 treesize of output 332 [2025-03-04 07:34:49,651 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:34:49,652 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 1589 treesize of output 1569 [2025-03-04 07:35:03,756 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse140 (< |c_ULTIMATE.start_append_~plist#1.offset| 1)) (.cse0 (< |c_ULTIMATE.start_main_~#list~0#1.offset| 1)) (.cse141 (< |c_ULTIMATE.start_main_~#list~0#1.offset| (+ 2 |c_ULTIMATE.start_append_~plist#1.offset|))) (.cse26 (+ 4 |c_ULTIMATE.start_append_~item~0#1.offset|)) (.cse69 (= |c_ULTIMATE.start_main_~#list~0#1.base| |c_ULTIMATE.start_append_~plist#1.base|))) (let ((.cse71 (< |c_ULTIMATE.start_append_~plist#1.offset| 0)) (.cse72 (< |c_ULTIMATE.start_main_~#list~0#1.offset| |c_ULTIMATE.start_append_~plist#1.offset|)) (.cse75 (not .cse69)) (.cse241 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int) (v_prenex_19 Int)) (let ((.cse351 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4))) (let ((.cse350 (let ((.cse352 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse352 .cse351 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse352) v_prenex_19) .cse26))))) (or (= (select .cse350 .cse26) 0) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse350) v_prenex_19) .cse351) 0) (= (select (select |c_#memory_$Pointer$#1.offset| v_prenex_19) .cse26) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))))) (.cse309 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int) (v_prenex_19 Int) (v_arrayElimCell_55 Int)) (let ((.cse348 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4)) (.cse346 (+ 4 v_arrayElimCell_55))) (let ((.cse347 (let ((.cse349 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_55))) (store .cse349 .cse348 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse349) v_prenex_19) .cse346))))) (or (= (select (select |c_#memory_$Pointer$#1.offset| v_prenex_19) .cse346) 0) (< v_arrayElimCell_55 0) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select .cse347 .cse346) 0) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse347) v_prenex_19) .cse348) 0)))))) (.cse18 (and (or .cse140 .cse0) (or .cse0 .cse141))) (.cse59 (< |c_ULTIMATE.start_main_~#list~0#1.offset| 0)) (.cse250 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (let ((.cse60 (or (forall ((v_prenex_18 Int) (v_arrayElimCell_55 Int)) (or (< v_arrayElimCell_55 0) (= (select (select |c_#memory_$Pointer$#1.offset| v_prenex_18) (+ 4 v_arrayElimCell_55)) 0))) .cse59 .cse250)) (.cse46 (forall ((v_prenex_13 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int) (v_arrayElimCell_55 Int)) (let ((.cse344 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4)) (.cse342 (+ 4 v_arrayElimCell_55))) (let ((.cse341 (let ((.cse345 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_55))) (store .cse345 .cse344 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse345) v_prenex_13) .cse342))))) (let ((.cse343 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse341) v_prenex_13))) (or (< v_arrayElimCell_55 0) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (= (select .cse341 .cse342) 0) (= (select .cse343 .cse342) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select .cse343 .cse344) 0))))))) (.cse11 (forall ((v_arrayElimCell_52 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int) (v_arrayElimCell_55 Int) (v_arrayElimCell_44 Int)) (or (< v_arrayElimCell_55 0) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (let ((.cse340 (+ 4 v_arrayElimCell_55))) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse339 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_55))) (store .cse339 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse339) v_arrayElimCell_44) .cse340)))) v_arrayElimCell_52) .cse340)) 0)))) (.cse48 (forall ((v_prenex_14 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int) (v_arrayElimCell_55 Int)) (or (= (let ((.cse338 (+ 4 v_arrayElimCell_55))) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse337 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_55))) (store .cse337 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse337) v_prenex_14) .cse338)))) v_prenex_14) .cse338)) 0) (< v_arrayElimCell_55 0) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (.cse40 (or (forall ((v_prenex_12 Int) (v_arrayElimCell_55 Int)) (or (< v_arrayElimCell_55 0) (= (select (select |c_#memory_$Pointer$#1.offset| v_prenex_12) (+ 4 v_arrayElimCell_55)) 0))) .cse59 .cse250)) (.cse42 (forall ((v_prenex_13 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int) (v_arrayElimCell_55 Int)) (let ((.cse335 (+ 4 v_arrayElimCell_55))) (let ((.cse334 (let ((.cse336 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_55))) (store .cse336 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse336) v_prenex_13) .cse335))))) (or (< v_arrayElimCell_55 0) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (= (select .cse334 .cse335) 0) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse334) v_prenex_13) .cse335) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))))) (.cse43 (or .cse59 (forall ((v_prenex_13 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_55 Int)) (let ((.cse332 (+ 4 v_arrayElimCell_55))) (let ((.cse331 (let ((.cse333 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_55))) (store .cse333 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse333) v_prenex_13) .cse332))))) (or (= (select .cse331 .cse332) 0) (< v_arrayElimCell_55 0) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse331) v_prenex_13) 4) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select |c_#memory_$Pointer$#1.offset| v_prenex_13) .cse332) 0))))))) (.cse45 (or .cse59 (forall ((v_prenex_13 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_55 Int)) (let ((.cse330 (+ 4 v_arrayElimCell_55))) (or (< v_arrayElimCell_55 0) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse329 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_55))) (store .cse329 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse329) v_prenex_13) .cse330)))) v_prenex_13) 4) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select |c_#memory_$Pointer$#1.offset| v_prenex_13) .cse330) 0)))))) (.cse47 (or (forall ((v_prenex_13 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_55 Int)) (let ((.cse327 (+ 4 v_arrayElimCell_55))) (let ((.cse326 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse328 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_55))) (store .cse328 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse328) v_prenex_13) .cse327)))) v_prenex_13))) (or (= (select .cse326 .cse327) 0) (< v_arrayElimCell_55 0) (= (select .cse326 4) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))))) .cse59)) (.cse34 (forall ((v_prenex_13 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int) (v_arrayElimCell_55 Int)) (let ((.cse324 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4)) (.cse323 (+ 4 v_arrayElimCell_55))) (let ((.cse322 (let ((.cse325 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_55))) (store .cse325 .cse324 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse325) v_prenex_13) .cse323))))) (or (< v_arrayElimCell_55 0) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (= (select .cse322 .cse323) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse322) v_prenex_13) .cse324) 0) (= (select (select |c_#memory_$Pointer$#1.offset| v_prenex_13) .cse323) 0)))))) (.cse61 (or (forall ((v_prenex_23 Int) (v_prenex_22 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int) (v_arrayElimCell_55 Int)) (or (< v_arrayElimCell_55 0) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (let ((.cse321 (+ 4 v_arrayElimCell_55))) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse320 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_55))) (store .cse320 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse320) v_prenex_23) .cse321)))) v_prenex_22) .cse321)) 0))) .cse18)) (.cse39 (forall ((v_prenex_15 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int) (v_arrayElimCell_55 Int)) (or (< v_arrayElimCell_55 0) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (let ((.cse319 (+ 4 v_arrayElimCell_55))) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse318 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_55))) (store .cse318 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse318) |c_ULTIMATE.start_append_~item~0#1.base|) .cse319)))) v_prenex_15) .cse319)) 0)))) (.cse33 (or .cse18 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int) (v_prenex_20 Int) (v_arrayElimCell_55 Int)) (or (< v_arrayElimCell_55 0) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (let ((.cse317 (+ 4 v_arrayElimCell_55))) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse316 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_55))) (store .cse316 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse316) v_prenex_20) .cse317)))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse317)) 0))))) (.cse62 (or .cse0 .cse309 .cse141)) (.cse63 (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_prenex_19 Int) (v_arrayElimCell_55 Int)) (let ((.cse314 (+ 4 v_arrayElimCell_55))) (or (= (select (select |c_#memory_$Pointer$#1.offset| v_prenex_19) .cse314) 0) (< v_arrayElimCell_55 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse315 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_55))) (store .cse315 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse315) v_prenex_19) .cse314)))) v_prenex_19) 4) 0)))) .cse59)) (.cse17 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int) (v_arrayElimCell_55 Int)) (or (< v_arrayElimCell_55 0) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (let ((.cse313 (+ 4 v_arrayElimCell_55))) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse312 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_55))) (store .cse312 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse312) |c_ULTIMATE.start_append_~item~0#1.base|) .cse313)))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse313)) 0)))) (.cse41 (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_55 Int)) (or (< v_arrayElimCell_55 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (let ((.cse311 (+ 4 v_arrayElimCell_55))) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse310 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_55))) (store .cse310 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse310) |c_ULTIMATE.start_append_~item~0#1.base|) .cse311)))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse311)) 0))) .cse59)) (.cse64 (or .cse140 .cse0 .cse309)) (.cse65 (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int) (v_prenex_19 Int) (v_arrayElimCell_55 Int)) (let ((.cse307 (+ 4 v_arrayElimCell_55))) (let ((.cse306 (let ((.cse308 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_55))) (store .cse308 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse308) v_prenex_19) .cse307))))) (or (< v_arrayElimCell_55 0) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse306) v_prenex_19) .cse307) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select .cse306 .cse307) 0))))) .cse18)) (.cse52 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_18 Int) (v_arrayElimCell_55 Int)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_55)) v_prenex_18) (+ 4 v_arrayElimCell_55)) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (.cse50 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_arrayElimCell_55 Int)) (= (let ((.cse305 (+ 4 v_arrayElimCell_55))) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse304 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_55))) (store .cse304 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse304) |c_ULTIMATE.start_append_~item~0#1.base|) .cse305)))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse305)) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (.cse51 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_13 Int) (v_arrayElimCell_55 Int)) (let ((.cse302 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_55))) (let ((.cse303 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse302) v_prenex_13) (+ 4 v_arrayElimCell_55)))) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse302 4 .cse303)) v_prenex_13) 4) 0) (= .cse303 0))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (.cse56 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_13 Int) (v_arrayElimCell_55 Int)) (let ((.cse301 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_55)) (.cse299 (+ 4 v_arrayElimCell_55))) (let ((.cse300 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse301) v_prenex_13) .cse299))) (let ((.cse298 (store .cse301 4 .cse300))) (or (= (select .cse298 .cse299) 0) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse298) v_prenex_13) 4) 0) (= .cse300 0)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (.cse57 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_13 Int) (v_arrayElimCell_55 Int)) (let ((.cse296 (+ 4 v_arrayElimCell_55))) (let ((.cse295 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse297 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_55))) (store .cse297 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse297) v_prenex_13) .cse296)))) v_prenex_13))) (or (= (select .cse295 .cse296) 0) (= (select .cse295 4) 0))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (.cse58 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_12 Int) (v_arrayElimCell_55 Int)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_55)) v_prenex_12) (+ 4 v_arrayElimCell_55)) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (.cse53 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_19 Int) (v_arrayElimCell_55 Int)) (let ((.cse294 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_55)) (.cse292 (+ 4 v_arrayElimCell_55))) (let ((.cse293 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse294) v_prenex_19) .cse292))) (let ((.cse291 (store .cse294 4 .cse293))) (or (= (select .cse291 .cse292) 0) (= .cse293 0) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse291) v_prenex_19) 4) 0)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (.cse54 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_19 Int) (v_arrayElimCell_55 Int)) (let ((.cse289 (+ 4 v_arrayElimCell_55))) (let ((.cse288 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse290 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_55))) (store .cse290 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse290) v_prenex_19) .cse289)))) v_prenex_19))) (or (= (select .cse288 .cse289) 0) (= (select .cse288 4) 0))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (.cse55 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_19 Int) (v_arrayElimCell_55 Int)) (let ((.cse287 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_55))) (let ((.cse286 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse287) v_prenex_19) (+ 4 v_arrayElimCell_55)))) (or (= .cse286 0) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse287 4 .cse286)) v_prenex_19) 4) 0))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (.cse32 (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_arrayElimCell_55 Int)) (or (< v_arrayElimCell_55 0) (forall ((v_prenex_20 Int) (v_arrayElimCell_43 Int)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse285 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_43))) (store .cse285 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse285) v_prenex_20) (+ 4 v_arrayElimCell_43))))) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_55)) 0)))))) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|)))) (.cse28 (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_arrayElimCell_55 Int)) (or (< v_arrayElimCell_55 0) (forall ((v_arrayElimCell_43 Int) (v_prenex_19 Int)) (let ((.cse282 (let ((.cse284 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_43))) (store .cse284 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse284) v_prenex_19) (+ 4 v_arrayElimCell_43))))) (.cse283 (+ 4 v_arrayElimCell_55))) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse282) v_prenex_19) .cse283) 0) (= (select .cse282 .cse283) 0)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|)))) (.cse20 (forall ((v_prenex_15 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int) (v_arrayElimCell_43 Int) (v_arrayElimCell_55 Int)) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse281 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_43))) (store .cse281 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse281) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_43))))) v_prenex_15) (+ 4 v_arrayElimCell_55)) 0) (< v_arrayElimCell_55 0) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (.cse29 (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_arrayElimCell_55 Int)) (or (< v_arrayElimCell_55 0) (forall ((v_prenex_23 Int) (v_prenex_22 Int) (v_arrayElimCell_43 Int)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse280 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_43))) (store .cse280 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse280) v_prenex_23) (+ 4 v_arrayElimCell_43))))) v_prenex_22) (+ 4 v_arrayElimCell_55)) 0))))))))) (.cse30 (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_arrayElimCell_55 Int)) (or (< v_arrayElimCell_55 0) (forall ((v_arrayElimCell_43 Int) (v_prenex_19 Int)) (let ((.cse279 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_43))) (let ((.cse278 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse279) v_prenex_19) (+ 4 v_arrayElimCell_43)))) (let ((.cse276 (store .cse279 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) .cse278)) (.cse277 (+ 4 v_arrayElimCell_55))) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse276) v_prenex_19) .cse277) 0) (= .cse278 0) (= (select .cse276 .cse277) 0)))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|)))) (.cse31 (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_arrayElimCell_55 Int)) (or (< v_arrayElimCell_55 0) (forall ((v_arrayElimCell_43 Int) (v_prenex_19 Int)) (let ((.cse275 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_43))) (let ((.cse271 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4)) (.cse273 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse275) v_prenex_19) (+ 4 v_arrayElimCell_43)))) (let ((.cse274 (store .cse275 .cse271 .cse273))) (let ((.cse270 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse274) v_prenex_19)) (.cse272 (+ 4 v_arrayElimCell_55))) (or (= (select .cse270 .cse271) 0) (= (select .cse270 .cse272) 0) (= .cse273 0) (= (select .cse274 .cse272) 0))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))))) (.cse66 (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_prenex_19 Int) (v_arrayElimCell_55 Int)) (let ((.cse268 (+ 4 v_arrayElimCell_55))) (let ((.cse267 (let ((.cse269 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_55))) (store .cse269 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse269) v_prenex_19) .cse268))))) (or (= (select .cse267 .cse268) 0) (= (select (select |c_#memory_$Pointer$#1.offset| v_prenex_19) .cse268) 0) (< v_arrayElimCell_55 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse267) v_prenex_19) 4) 0))))) .cse59)) (.cse139 (< |c_ULTIMATE.start_append_~item~0#1.offset| 0)) (.cse70 (or (and (or .cse59 .cse250 (forall ((v_prenex_12 Int)) (= (select (select |c_#memory_$Pointer$#1.offset| v_prenex_12) .cse26) 0))) (or .cse0 (forall ((v_arrayElimCell_52 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int) (v_arrayElimCell_44 Int)) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse251 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse251 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse251) v_arrayElimCell_44) .cse26)))) v_arrayElimCell_52) .cse26) 0) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (or .cse0 (forall ((v_prenex_13 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (let ((.cse253 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4))) (let ((.cse252 (let ((.cse254 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse254 .cse253 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse254) v_prenex_13) .cse26))))) (or (= (select (select |c_#memory_$Pointer$#1.offset| v_prenex_13) .cse26) 0) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (= (select .cse252 .cse26) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse252) v_prenex_13) .cse253) 0)))))) (or (forall ((v_prenex_14 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse255 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse255 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse255) v_prenex_14) .cse26)))) v_prenex_14) .cse26) 0))) .cse0) (or .cse0 (forall ((v_prenex_13 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (let ((.cse256 (let ((.cse257 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse257 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse257) v_prenex_13) .cse26))))) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse256) v_prenex_13) .cse26) 0) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (= (select .cse256 .cse26) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))))) (or (forall ((v_prenex_13 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (let ((.cse258 (let ((.cse259 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse259 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse259) v_prenex_13) .cse26))))) (or (= (select (select |c_#memory_$Pointer$#1.offset| v_prenex_13) .cse26) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse258) v_prenex_13) 4) 0) (= (select .cse258 .cse26) 0)))) .cse59) (or .cse0 (forall ((v_prenex_13 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (let ((.cse262 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4))) (let ((.cse261 (let ((.cse263 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse263 .cse262 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse263) v_prenex_13) .cse26))))) (let ((.cse260 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse261) v_prenex_13))) (or (= (select .cse260 .cse26) 0) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (= (select .cse261 .cse26) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select .cse260 .cse262) 0))))))) (or (forall ((v_prenex_13 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (let ((.cse264 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse265 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse265 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse265) v_prenex_13) .cse26)))) v_prenex_13))) (or (= (select .cse264 .cse26) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select .cse264 4) 0)))) .cse59) (or (forall ((v_prenex_13 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (= (select (select |c_#memory_$Pointer$#1.offset| v_prenex_13) .cse26) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse266 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse266 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse266) v_prenex_13) .cse26)))) v_prenex_13) 4) 0))) .cse59)) .cse69)) (.cse100 (or .cse59 .cse250 (forall ((v_prenex_18 Int)) (= (select (select |c_#memory_$Pointer$#1.offset| v_prenex_18) .cse26) 0)))) (.cse76 (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse249 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse249 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse249) |c_ULTIMATE.start_append_~item~0#1.base|) .cse26)))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse26) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) .cse0)) (.cse101 (or .cse18 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int) (v_prenex_19 Int)) (or (= (select (let ((.cse248 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse248 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse248) v_prenex_19) .cse26))) .cse26) 0) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (= (select (select |c_#memory_$Pointer$#1.offset| v_prenex_19) .cse26) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))))) (.cse85 (or .cse18 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_prenex_21 Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse247 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse247 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse247) |c_ULTIMATE.start_append_~item~0#1.base|) .cse26)))) v_prenex_21) .cse26) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))))) (.cse102 (or .cse241 .cse0 .cse141)) (.cse86 (or .cse71 .cse72 .cse75 (forall ((v_prenex_16 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse246 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse246 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse246) |c_ULTIMATE.start_append_~item~0#1.base|) .cse26)))) v_prenex_16) .cse26) 0))))) (.cse103 (or .cse59 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_prenex_19 Int)) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse245 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse245 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse245) v_prenex_19) .cse26)))) v_prenex_19) 4) 0) (= (select (select |c_#memory_$Pointer$#1.offset| v_prenex_19) .cse26) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))))) (.cse87 (or (forall ((v_prenex_15 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse244 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse244 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse244) |c_ULTIMATE.start_append_~item~0#1.base|) .cse26)))) v_prenex_15) .cse26) 0))) .cse0 .cse69)) (.cse88 (or .cse0 (forall ((v_prenex_17 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse243 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse243 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse243) |c_ULTIMATE.start_append_~item~0#1.base|) .cse26)))) v_prenex_17) .cse26) 0) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))))) (.cse109 (or .cse18 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int) (v_prenex_20 Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse242 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse242 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse242) v_prenex_20) .cse26)))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse26) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))))) (.cse104 (or .cse140 .cse241 .cse0)) (.cse105 (or .cse59 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_prenex_19 Int)) (let ((.cse239 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse240 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse240 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse240) v_prenex_19) .cse26)))) v_prenex_19))) (or (= (select .cse239 4) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= 0 (select .cse239 .cse26))))))) (.cse106 (or .cse18 (forall ((v_prenex_23 Int) (v_prenex_22 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse238 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse238 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse238) v_prenex_23) .cse26)))) v_prenex_22) .cse26) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))))) (.cse107 (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int) (v_prenex_19 Int)) (let ((.cse236 (let ((.cse237 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse237 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse237) v_prenex_19) .cse26))))) (or (= (select .cse236 .cse26) 0) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse236) v_prenex_19) .cse26) 0)))) .cse18)) (.cse108 (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_prenex_19 Int)) (let ((.cse234 (let ((.cse235 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse235 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse235) v_prenex_19) .cse26))))) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse234) v_prenex_19) 4) 0) (= (select (select |c_#memory_$Pointer$#1.offset| v_prenex_19) .cse26) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select .cse234 .cse26) 0)))) .cse59)) (.cse67 (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_prenex_19 Int) (v_arrayElimCell_55 Int)) (let ((.cse232 (+ 4 v_arrayElimCell_55))) (let ((.cse231 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse233 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_55))) (store .cse233 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse233) v_prenex_19) .cse232)))) v_prenex_19))) (or (< v_arrayElimCell_55 0) (= (select .cse231 .cse232) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select .cse231 4) 0))))) .cse59)) (.cse68 (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int) (v_prenex_19 Int) (v_arrayElimCell_55 Int)) (let ((.cse229 (+ 4 v_arrayElimCell_55))) (or (= (select (select |c_#memory_$Pointer$#1.offset| v_prenex_19) .cse229) 0) (< v_arrayElimCell_55 0) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (let ((.cse230 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_55))) (store .cse230 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse230) v_prenex_19) .cse229))) .cse229) 0)))) .cse18)) (.cse181 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse228 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse228 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse228) |c_ULTIMATE.start_append_~item~0#1.base|) .cse26)))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse26) 0)))) (.cse182 (or (and (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_prenex_13 Int)) (let ((.cse221 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse222 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse222 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse222) v_prenex_13) .cse26)))) v_prenex_13))) (or (= (select .cse221 .cse26) 0) (= (select .cse221 4) 0)))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_13 Int)) (let ((.cse224 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (let ((.cse223 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse224) v_prenex_13) .cse26))) (or (= .cse223 0) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse224 4 .cse223)) v_prenex_13) 4) 0))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_12 Int)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|)) v_prenex_12) .cse26) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_13 Int)) (let ((.cse227 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (let ((.cse225 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse227) v_prenex_13) .cse26))) (let ((.cse226 (store .cse227 4 .cse225))) (or (= .cse225 0) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse226) v_prenex_13) 4) 0) (= (select .cse226 .cse26) 0)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) .cse69)) (.cse27 (= |c_ULTIMATE.start_main_~#list~0#1.offset| |c_ULTIMATE.start_append_~plist#1.offset|)) (.cse183 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_19 Int)) (let ((.cse219 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (let ((.cse220 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse219) v_prenex_19) .cse26))) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse219 4 .cse220)) v_prenex_19) 4) 0) (= .cse220 0))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (.cse184 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_19 Int)) (let ((.cse218 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (let ((.cse217 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse218) v_prenex_19) .cse26))) (let ((.cse216 (store .cse218 4 .cse217))) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse216) v_prenex_19) 4) 0) (= .cse217 0) (= (select .cse216 .cse26) 0)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (.cse185 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_18 Int)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|)) v_prenex_18) .cse26) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (.cse186 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_prenex_19 Int)) (let ((.cse214 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse215 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse215 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse215) v_prenex_19) .cse26)))) v_prenex_19))) (or (= (select .cse214 4) 0) (= 0 (select .cse214 .cse26))))))))) (and (or (and (or .cse0 (forall ((v_prenex_13 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int) (v_arrayElimCell_43 Int) (v_arrayElimCell_55 Int)) (let ((.cse6 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_43))) (let ((.cse5 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4)) (.cse1 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse6) v_prenex_13) (+ 4 v_arrayElimCell_43)))) (let ((.cse2 (store .cse6 .cse5 .cse1))) (let ((.cse3 (+ 4 v_arrayElimCell_55)) (.cse4 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse2) v_prenex_13))) (or (= .cse1 0) (= (select .cse2 .cse3) 0) (< v_arrayElimCell_55 0) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (= (select .cse4 .cse3) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select .cse4 .cse5) 0)))))))) (or .cse0 (forall ((v_arrayElimCell_52 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int) (v_arrayElimCell_43 Int) (v_arrayElimCell_44 Int) (v_arrayElimCell_55 Int)) (or (< v_arrayElimCell_55 0) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse7 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_43))) (store .cse7 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse7) v_arrayElimCell_44) (+ 4 v_arrayElimCell_43))))) v_arrayElimCell_52) (+ 4 v_arrayElimCell_55)) 0) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (or (forall ((v_prenex_13 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int) (v_arrayElimCell_43 Int) (v_arrayElimCell_55 Int)) (let ((.cse8 (let ((.cse10 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_43))) (store .cse10 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse10) v_prenex_13) (+ 4 v_arrayElimCell_43))))) (.cse9 (+ 4 v_arrayElimCell_55))) (or (= (select .cse8 .cse9) 0) (< v_arrayElimCell_55 0) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse8) v_prenex_13) .cse9) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) .cse0) (or .cse0 .cse11) (or (forall ((v_prenex_13 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int) (v_arrayElimCell_43 Int) (v_arrayElimCell_55 Int)) (let ((.cse15 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4))) (let ((.cse12 (let ((.cse16 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_43))) (store .cse16 .cse15 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse16) v_prenex_13) (+ 4 v_arrayElimCell_43)))))) (let ((.cse13 (+ 4 v_arrayElimCell_55)) (.cse14 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse12) v_prenex_13))) (or (= (select .cse12 .cse13) 0) (< v_arrayElimCell_55 0) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (= (select .cse14 .cse13) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select .cse14 .cse15) 0)))))) .cse0) (or .cse17 .cse0) (or (and (or .cse18 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_prenex_21 Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int) (v_arrayElimCell_43 Int) (v_arrayElimCell_55 Int)) (or (< v_arrayElimCell_55 0) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse19 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_43))) (store .cse19 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse19) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_43))))) v_prenex_21) (+ 4 v_arrayElimCell_55)) 0)))) (or .cse20 .cse0) (or (forall ((v_prenex_17 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int) (v_arrayElimCell_43 Int) (v_arrayElimCell_55 Int)) (let ((.cse22 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4)) (.cse23 (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|)) (.cse24 (+ 4 v_arrayElimCell_55))) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse21 (store .cse23 |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_43))) (store .cse21 .cse22 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse21) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_43))))) v_prenex_17) .cse24) 0) (< v_arrayElimCell_55 0) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse25 (store .cse23 |v_ULTIMATE.start_append_~item~0#1.offset_23| |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse25 .cse22 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse25) |c_ULTIMATE.start_append_~item~0#1.base|) .cse26)))) v_prenex_17) .cse24) 0)))) .cse0)) .cse27) (or .cse18 (and (or (and .cse28 .cse29 .cse30 .cse31) .cse27) .cse32)) .cse33 (or .cse34 .cse0) (or (and (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_prenex_21 Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int) (v_arrayElimCell_55 Int)) (or (< v_arrayElimCell_55 0) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (let ((.cse36 (+ 4 v_arrayElimCell_55))) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse35 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_55))) (store .cse35 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse35) |c_ULTIMATE.start_append_~item~0#1.base|) .cse36)))) v_prenex_21) .cse36)) 0))) .cse18) (or .cse0 (forall ((v_prenex_17 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int) (v_arrayElimCell_55 Int)) (or (< v_arrayElimCell_55 0) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (= (let ((.cse38 (+ 4 v_arrayElimCell_55))) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse37 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_55))) (store .cse37 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse37) |c_ULTIMATE.start_append_~item~0#1.base|) .cse38)))) v_prenex_17) .cse38)) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (or .cse39 .cse0)) .cse27) .cse40 .cse41 (or .cse42 .cse0) .cse43 (or (forall ((v_prenex_14 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int) (v_arrayElimCell_43 Int) (v_arrayElimCell_55 Int)) (or (< v_arrayElimCell_55 0) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse44 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_43))) (store .cse44 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse44) v_prenex_14) (+ 4 v_arrayElimCell_43))))) v_prenex_14) (+ 4 v_arrayElimCell_55)) 0))) .cse0) .cse45 (or .cse0 .cse46) .cse47 (or .cse0 .cse48) (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int) (v_arrayElimCell_43 Int) (v_arrayElimCell_55 Int)) (or (< v_arrayElimCell_55 0) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse49 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_43))) (store .cse49 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse49) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_43))))) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_55)) 0) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) .cse0) (or (and .cse50 .cse51 (or .cse27 (and .cse52 .cse53 .cse54 .cse55)) .cse56 .cse57 .cse58) .cse59) (or .cse27 (and .cse60 .cse61 .cse62 .cse63 .cse64 .cse65 .cse66 .cse67 .cse68))) .cse69) (or (let ((.cse74 (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_prenex_17 Int)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse138 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse138 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse138) |c_ULTIMATE.start_append_~item~0#1.base|) .cse26)))) v_prenex_17) .cse26) 0)))))))) (and .cse70 (or .cse71 .cse72 (and (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_16 Int)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse73 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse73 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse73) |c_ULTIMATE.start_append_~item~0#1.base|) .cse26)))) v_prenex_16) .cse26) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))))) .cse74) .cse27 .cse75) .cse76 (or .cse18 (and (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_20 Int)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse77 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse77 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse77) v_prenex_20) .cse26)))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse26) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|))) (or (and (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_prenex_19 Int)) (let ((.cse80 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4))) (let ((.cse78 (let ((.cse81 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse81 .cse80 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse81) v_prenex_19) .cse26))))) (let ((.cse79 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse78) v_prenex_19))) (or (= (select .cse78 .cse26) 0) (= (select .cse79 .cse80) 0) (= (select .cse79 .cse26) 0)))))))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_prenex_19 Int)) (let ((.cse82 (let ((.cse83 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse83 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse83) v_prenex_19) .cse26))))) (or (= (select .cse82 .cse26) 0) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse82) v_prenex_19) .cse26) 0)))))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_23 Int) (v_prenex_22 Int)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse84 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse84 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse84) v_prenex_23) .cse26)))) v_prenex_22) .cse26) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))))) .cse27))) (or .cse27 (and .cse85 .cse86 .cse87 .cse88)) (or (and (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_13 Int)) (let ((.cse90 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4))) (let ((.cse89 (let ((.cse91 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse91 .cse90 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse91) v_prenex_13) .cse26))))) (or (= (select (select |c_#memory_$Pointer$#1.offset| v_prenex_13) .cse26) 0) (= (select .cse89 .cse26) 0) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse89) v_prenex_13) .cse90) 0))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_arrayElimCell_52 Int) (v_arrayElimCell_44 Int)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse92 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse92 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse92) v_arrayElimCell_44) .cse26)))) v_arrayElimCell_52) .cse26) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_14 Int)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse93 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse93 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse93) v_prenex_14) .cse26)))) v_prenex_14) .cse26) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|))) (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_13 Int)) (let ((.cse96 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4))) (let ((.cse95 (let ((.cse97 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse97 .cse96 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse97) v_prenex_13) .cse26))))) (let ((.cse94 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse95) v_prenex_13))) (or (= (select .cse94 .cse26) 0) (= (select .cse95 .cse26) 0) (= (select .cse94 .cse96) 0)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_13 Int)) (let ((.cse98 (let ((.cse99 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse99 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse99) v_prenex_13) .cse26))))) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse98) v_prenex_13) .cse26) 0) (= (select .cse98 .cse26) 0)))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))))) .cse0 .cse69) (or (and .cse100 .cse101 .cse102 .cse103 .cse104 .cse105 .cse106 .cse107 .cse108) .cse27) .cse109 (or .cse18 (and (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_arrayElimCell_43 Int)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse110 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_43))) (store .cse110 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse110) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_43))))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse26) 0)))) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|))) (or .cse27 (and (or .cse69 (forall ((v_prenex_15 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int) (v_arrayElimCell_43 Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse111 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_43))) (store .cse111 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse111) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_43))))) v_prenex_15) .cse26) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_prenex_21 Int) (v_arrayElimCell_43 Int)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse112 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_43))) (store .cse112 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse112) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_43))))) v_prenex_21) .cse26) 0)))))) .cse74)) (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_20 Int) (v_arrayElimCell_43 Int)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse113 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_43))) (store .cse113 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse113) v_prenex_20) (+ 4 v_arrayElimCell_43))))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse26) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))))) (or (and (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_13 Int) (v_arrayElimCell_43 Int)) (let ((.cse118 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_43))) (let ((.cse117 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4)) (.cse115 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse118) v_prenex_13) (+ 4 v_arrayElimCell_43)))) (let ((.cse114 (store .cse118 .cse117 .cse115))) (let ((.cse116 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse114) v_prenex_13))) (or (= (select .cse114 .cse26) 0) (= .cse115 0) (= (select .cse116 .cse117) 0) (= (select .cse116 .cse26) 0))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_arrayElimCell_52 Int) (v_arrayElimCell_43 Int) (v_arrayElimCell_44 Int)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse119 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_43))) (store .cse119 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse119) v_arrayElimCell_44) (+ 4 v_arrayElimCell_43))))) v_arrayElimCell_52) .cse26) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|))) (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_prenex_14 Int) (v_arrayElimCell_43 Int)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse120 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_43))) (store .cse120 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse120) v_prenex_14) (+ 4 v_arrayElimCell_43))))) v_prenex_14) .cse26) 0)))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_13 Int) (v_arrayElimCell_43 Int)) (let ((.cse121 (let ((.cse122 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_43))) (store .cse122 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse122) v_prenex_13) (+ 4 v_arrayElimCell_43)))))) (or (= (select .cse121 .cse26) 0) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse121) v_prenex_13) .cse26) 0)))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_prenex_13 Int) (v_arrayElimCell_43 Int)) (let ((.cse125 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4))) (let ((.cse123 (let ((.cse126 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_43))) (store .cse126 .cse125 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse126) v_prenex_13) (+ 4 v_arrayElimCell_43)))))) (let ((.cse124 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse123) v_prenex_13))) (or (= (select .cse123 .cse26) 0) (= (select .cse124 .cse125) 0) (= (select .cse124 .cse26) 0))))))))))) .cse69) (or (and (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_arrayElimCell_43 Int) (v_prenex_19 Int)) (let ((.cse131 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_43))) (let ((.cse129 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4)) (.cse130 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse131) v_prenex_19) (+ 4 v_arrayElimCell_43)))) (let ((.cse127 (store .cse131 .cse129 .cse130))) (let ((.cse128 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse127) v_prenex_19))) (or (= (select .cse127 .cse26) 0) (= (select .cse128 .cse129) 0) (= .cse130 0) (= (select .cse128 .cse26) 0))))))))) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|))) (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_23 Int) (v_prenex_22 Int) (v_arrayElimCell_43 Int)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse132 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_43))) (store .cse132 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse132) v_prenex_23) (+ 4 v_arrayElimCell_43))))) v_prenex_22) .cse26) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_arrayElimCell_43 Int) (v_prenex_19 Int)) (let ((.cse133 (let ((.cse134 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_43))) (store .cse134 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse134) v_prenex_19) (+ 4 v_arrayElimCell_43)))))) (or (= (select .cse133 .cse26) 0) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse133) v_prenex_19) .cse26) 0)))))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_arrayElimCell_43 Int) (v_prenex_19 Int)) (let ((.cse137 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_43))) (let ((.cse136 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse137) v_prenex_19) (+ 4 v_arrayElimCell_43)))) (let ((.cse135 (store .cse137 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) .cse136))) (or (= (select .cse135 .cse26) 0) (= .cse136 0) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse135) v_prenex_19) .cse26) 0)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|)))) .cse27))))) .cse139) (or (let ((.cse187 (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_arrayElimCell_55 Int)) (or (< v_arrayElimCell_55 0) (forall ((v_prenex_17 Int) (v_arrayElimCell_43 Int)) (let ((.cse210 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4)) (.cse211 (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|)) (.cse212 (+ 4 v_arrayElimCell_55))) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse209 (store .cse211 |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_43))) (store .cse209 .cse210 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse209) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_43))))) v_prenex_17) .cse212) 0) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse213 (store .cse211 |v_ULTIMATE.start_append_~item~0#1.offset_23| |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse213 .cse210 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse213) |c_ULTIMATE.start_append_~item~0#1.base|) .cse26)))) v_prenex_17) .cse212) 0)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))))))) (and .cse60 (or (and (or .cse18 .cse46) (or .cse18 .cse11) (or .cse18 .cse48) .cse40 (or .cse42 .cse18) .cse43 .cse45 .cse47 (or .cse34 .cse140 .cse0) (or .cse34 .cse0 .cse141)) .cse69) (or .cse18 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_prenex_21 Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int) (v_arrayElimCell_55 Int)) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse142 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse142 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse142) |c_ULTIMATE.start_append_~item~0#1.base|) .cse26)))) v_prenex_21) (+ 4 v_arrayElimCell_55)) 0) (< v_arrayElimCell_55 0) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) .cse61 (or .cse0 (forall ((v_prenex_15 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int) (v_arrayElimCell_55 Int)) (or (< v_arrayElimCell_55 0) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse143 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse143 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse143) |c_ULTIMATE.start_append_~item~0#1.base|) .cse26)))) v_prenex_15) (+ 4 v_arrayElimCell_55)) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) .cse69) (or (and (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_arrayElimCell_55 Int)) (or (< v_arrayElimCell_55 0) (forall ((v_prenex_21 Int)) (= (let ((.cse145 (+ 4 v_arrayElimCell_55))) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse144 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_55))) (store .cse144 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse144) |c_ULTIMATE.start_append_~item~0#1.base|) .cse145)))) v_prenex_21) .cse145)) 0)))))))) (or .cse39 .cse69) (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_arrayElimCell_55 Int)) (or (< v_arrayElimCell_55 0) (forall ((v_prenex_17 Int)) (= (let ((.cse147 (+ 4 v_arrayElimCell_55))) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse146 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_55))) (store .cse146 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse146) |c_ULTIMATE.start_append_~item~0#1.base|) .cse147)))) v_prenex_17) .cse147)) 0)))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|)))) .cse18) .cse33 .cse62 .cse63 (or .cse71 (forall ((v_prenex_16 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int) (v_arrayElimCell_55 Int)) (or (< v_arrayElimCell_55 0) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse148 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse148 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse148) |c_ULTIMATE.start_append_~item~0#1.base|) .cse26)))) v_prenex_16) (+ 4 v_arrayElimCell_55)) 0) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) .cse72 .cse75) (or (and (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_arrayElimCell_55 Int)) (or (< v_arrayElimCell_55 0) (forall ((v_prenex_13 Int)) (let ((.cse149 (let ((.cse151 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse151 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse151) v_prenex_13) .cse26)))) (.cse150 (+ 4 v_arrayElimCell_55))) (or (= (select .cse149 .cse150) 0) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse149) v_prenex_13) .cse150) 0)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|))) (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_arrayElimCell_55 Int)) (or (< v_arrayElimCell_55 0) (forall ((v_prenex_13 Int)) (let ((.cse157 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| |c_ULTIMATE.start_append_~item~0#1.offset|))) (let ((.cse155 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4)) (.cse156 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse157) v_prenex_13) .cse26))) (let ((.cse152 (store .cse157 .cse155 .cse156))) (let ((.cse154 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse152) v_prenex_13)) (.cse153 (+ 4 v_arrayElimCell_55))) (or (= (select .cse152 .cse153) 0) (= (select .cse154 .cse155) 0) (= (select .cse154 .cse153) 0) (= .cse156 0))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|))) (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_arrayElimCell_55 Int)) (or (forall ((v_prenex_14 Int)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse158 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse158 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse158) v_prenex_14) .cse26)))) v_prenex_14) (+ 4 v_arrayElimCell_55)) 0)) (< v_arrayElimCell_55 0))))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_arrayElimCell_55 Int)) (or (< v_arrayElimCell_55 0) (forall ((v_prenex_13 Int)) (let ((.cse162 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4))) (let ((.cse159 (let ((.cse163 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse163 .cse162 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse163) v_prenex_13) .cse26))))) (let ((.cse161 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse159) v_prenex_13)) (.cse160 (+ 4 v_arrayElimCell_55))) (or (= (select .cse159 .cse160) 0) (= (select .cse161 .cse162) 0) (= (select .cse161 .cse160) 0)))))))))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_arrayElimCell_55 Int)) (or (< v_arrayElimCell_55 0) (forall ((v_arrayElimCell_52 Int) (v_arrayElimCell_44 Int)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse164 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse164 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse164) v_arrayElimCell_44) .cse26)))) v_arrayElimCell_52) (+ 4 v_arrayElimCell_55)) 0)))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))))) .cse0 .cse69) (or .cse17 .cse0 .cse141) (or .cse0 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int) (v_arrayElimCell_55 Int)) (or (< v_arrayElimCell_55 0) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse165 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse165 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse165) |c_ULTIMATE.start_append_~item~0#1.base|) .cse26)))) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_55)) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) .cse41 .cse64 .cse65 (or (and (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_arrayElimCell_55 Int)) (or (< v_arrayElimCell_55 0) (forall ((v_prenex_23 Int) (v_prenex_22 Int)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse166 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse166 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse166) v_prenex_23) .cse26)))) v_prenex_22) (+ 4 v_arrayElimCell_55)) 0)))))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_arrayElimCell_55 Int)) (or (< v_arrayElimCell_55 0) (forall ((v_prenex_19 Int)) (let ((.cse167 (let ((.cse169 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse169 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse169) v_prenex_19) .cse26)))) (.cse168 (+ 4 v_arrayElimCell_55))) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse167) v_prenex_19) .cse168) 0) (= (select .cse167 .cse168) 0)))))))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_arrayElimCell_55 Int)) (or (forall ((v_prenex_19 Int)) (let ((.cse175 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| |c_ULTIMATE.start_append_~item~0#1.offset|))) (let ((.cse171 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4)) (.cse172 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse175) v_prenex_19) .cse26))) (let ((.cse174 (store .cse175 .cse171 .cse172))) (let ((.cse170 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse174) v_prenex_19)) (.cse173 (+ 4 v_arrayElimCell_55))) (or (= (select .cse170 .cse171) 0) (= .cse172 0) (= (select .cse170 .cse173) 0) (= (select .cse174 .cse173) 0))))))) (< v_arrayElimCell_55 0))))) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|))) (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_arrayElimCell_55 Int)) (or (< v_arrayElimCell_55 0) (forall ((v_prenex_20 Int)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse176 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse176 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse176) v_prenex_20) .cse26)))) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_55)) 0)))))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_arrayElimCell_55 Int)) (or (< v_arrayElimCell_55 0) (forall ((v_prenex_19 Int)) (let ((.cse180 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| |c_ULTIMATE.start_append_~item~0#1.offset|))) (let ((.cse177 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse180) v_prenex_19) .cse26))) (let ((.cse178 (store .cse180 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) .cse177)) (.cse179 (+ 4 v_arrayElimCell_55))) (or (= .cse177 0) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse178) v_prenex_19) .cse179) 0) (= (select .cse178 .cse179) 0)))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))))) .cse18) (or (and .cse52 .cse50 (or (and .cse51 .cse56 .cse57 .cse58) .cse69) .cse53 .cse54 .cse55) .cse59) (or (and .cse181 .cse182 .cse183 .cse184 .cse185 .cse186) .cse59) (or (and .cse32 .cse28 (or .cse20 .cse69) .cse29 .cse30 .cse187 .cse31 (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_arrayElimCell_55 Int)) (or (< v_arrayElimCell_55 0) (forall ((v_prenex_21 Int) (v_arrayElimCell_43 Int)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse188 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_43))) (store .cse188 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse188) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_43))))) v_prenex_21) (+ 4 v_arrayElimCell_55)) 0)))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|))) (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_arrayElimCell_55 Int)) (or (< v_arrayElimCell_55 0) (forall ((v_arrayElimCell_43 Int)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse189 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_43))) (store .cse189 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse189) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_43))))) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_55)) 0)))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))))) (or (and (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_arrayElimCell_55 Int)) (or (< v_arrayElimCell_55 0) (forall ((v_prenex_13 Int) (v_arrayElimCell_43 Int)) (let ((.cse193 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4))) (let ((.cse190 (let ((.cse194 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_43))) (store .cse194 .cse193 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse194) v_prenex_13) (+ 4 v_arrayElimCell_43)))))) (let ((.cse191 (+ 4 v_arrayElimCell_55)) (.cse192 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse190) v_prenex_13))) (or (= (select .cse190 .cse191) 0) (= (select .cse192 .cse191) 0) (= (select .cse192 .cse193) 0)))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_arrayElimCell_55 Int)) (or (< v_arrayElimCell_55 0) (forall ((v_prenex_14 Int) (v_arrayElimCell_43 Int)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse195 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_43))) (store .cse195 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse195) v_prenex_14) (+ 4 v_arrayElimCell_43))))) v_prenex_14) (+ 4 v_arrayElimCell_55)) 0)))))) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|))) (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_arrayElimCell_55 Int)) (or (forall ((v_prenex_13 Int) (v_arrayElimCell_43 Int)) (let ((.cse201 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_43))) (let ((.cse200 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4)) (.cse196 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse201) v_prenex_13) (+ 4 v_arrayElimCell_43)))) (let ((.cse197 (store .cse201 .cse200 .cse196))) (let ((.cse198 (+ 4 v_arrayElimCell_55)) (.cse199 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse197) v_prenex_13))) (or (= .cse196 0) (= (select .cse197 .cse198) 0) (= (select .cse199 .cse198) 0) (= (select .cse199 .cse200) 0))))))) (< v_arrayElimCell_55 0))))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_arrayElimCell_55 Int)) (or (forall ((v_prenex_13 Int) (v_arrayElimCell_43 Int)) (let ((.cse202 (let ((.cse204 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_43))) (store .cse204 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse204) v_prenex_13) (+ 4 v_arrayElimCell_43))))) (.cse203 (+ 4 v_arrayElimCell_55))) (or (= (select .cse202 .cse203) 0) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse202) v_prenex_13) .cse203) 0)))) (< v_arrayElimCell_55 0))))) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|))) (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_arrayElimCell_55 Int)) (or (< v_arrayElimCell_55 0) (forall ((v_arrayElimCell_52 Int) (v_arrayElimCell_43 Int) (v_arrayElimCell_44 Int)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse205 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_43))) (store .cse205 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse205) v_arrayElimCell_44) (+ 4 v_arrayElimCell_43))))) v_arrayElimCell_52) (+ 4 v_arrayElimCell_55)) 0)))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|)))) .cse69)) .cse18) (or (forall ((v_prenex_17 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int) (v_arrayElimCell_55 Int)) (or (< v_arrayElimCell_55 0) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse206 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse206 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse206) |c_ULTIMATE.start_append_~item~0#1.base|) .cse26)))) v_prenex_17) (+ 4 v_arrayElimCell_55)) 0))) .cse0) .cse66 (or .cse139 (and .cse70 .cse100 .cse76 .cse101 (or .cse181 .cse59) .cse85 .cse102 .cse86 .cse103 .cse87 .cse88 .cse109 .cse104 .cse105 .cse106 .cse107 .cse108)) (or .cse71 (and (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_arrayElimCell_55 Int)) (or (< v_arrayElimCell_55 0) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse207 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse207 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse207) |c_ULTIMATE.start_append_~item~0#1.base|) .cse26)))) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_55)) 0))))))) .cse187 (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_arrayElimCell_55 Int)) (or (< v_arrayElimCell_55 0) (forall ((v_prenex_16 Int)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse208 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse208 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse208) |c_ULTIMATE.start_append_~item~0#1.base|) .cse26)))) v_prenex_16) (+ 4 v_arrayElimCell_55)) 0))))))))) .cse72 .cse75) .cse67 .cse68)) .cse27) (or (and .cse181 .cse182 (or .cse27 (and .cse183 .cse184 .cse185 .cse186))) .cse59))))) is different from true