./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety/test-0232-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety/test-0232-2.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 d7d99b84861b7e58e44833cf97c5fb5fa14d1ad6f1b87526d3144a9659451e97 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 06:22:36,704 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 06:22:36,760 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-08 06:22:36,766 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 06:22:36,768 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 06:22:36,789 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 06:22:36,790 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 06:22:36,790 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 06:22:36,791 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 06:22:36,791 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 06:22:36,791 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 06:22:36,791 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 06:22:36,791 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 06:22:36,791 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 06:22:36,791 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 06:22:36,791 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 06:22:36,791 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 06:22:36,791 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 06:22:36,791 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 06:22:36,791 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 06:22:36,791 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 06:22:36,791 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 06:22:36,792 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-08 06:22:36,792 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 06:22:36,792 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 06:22:36,792 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 06:22:36,792 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 06:22:36,792 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 06:22:36,792 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 06:22:36,792 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 06:22:36,792 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 06:22:36,792 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 06:22:36,792 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 06:22:36,792 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 06:22:36,792 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 06:22:36,792 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 06:22:36,792 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 06:22:36,792 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 06:22:36,792 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 06:22:36,792 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 06:22:36,792 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 06:22:36,792 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 06:22:36,793 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-jdk21/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 -> d7d99b84861b7e58e44833cf97c5fb5fa14d1ad6f1b87526d3144a9659451e97 [2025-02-08 06:22:37,009 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 06:22:37,015 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 06:22:37,016 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 06:22:37,017 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 06:22:37,018 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 06:22:37,018 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/test-0232-2.i [2025-02-08 06:22:38,185 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/93e3f0e1e/69dc607c75b64e09b995a3b49e9393af/FLAGf7b2ae95c [2025-02-08 06:22:38,408 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 06:22:38,409 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/memsafety/test-0232-2.i [2025-02-08 06:22:38,420 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/93e3f0e1e/69dc607c75b64e09b995a3b49e9393af/FLAGf7b2ae95c [2025-02-08 06:22:38,441 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/93e3f0e1e/69dc607c75b64e09b995a3b49e9393af [2025-02-08 06:22:38,445 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 06:22:38,447 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 06:22:38,448 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 06:22:38,449 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 06:22:38,451 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 06:22:38,452 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 06:22:38" (1/1) ... [2025-02-08 06:22:38,454 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d299527 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:22:38, skipping insertion in model container [2025-02-08 06:22:38,454 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 06:22:38" (1/1) ... [2025-02-08 06:22:38,481 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 06:22:38,701 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 06:22:38,709 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 06:22:38,740 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 06:22:38,757 INFO L204 MainTranslator]: Completed translation [2025-02-08 06:22:38,758 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:22:38 WrapperNode [2025-02-08 06:22:38,758 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 06:22:38,759 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 06:22:38,759 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 06:22:38,759 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 06:22:38,763 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:22:38" (1/1) ... [2025-02-08 06:22:38,771 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:22:38" (1/1) ... [2025-02-08 06:22:38,787 INFO L138 Inliner]: procedures = 126, calls = 35, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 89 [2025-02-08 06:22:38,788 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 06:22:38,788 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 06:22:38,788 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 06:22:38,788 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 06:22:38,794 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:22:38" (1/1) ... [2025-02-08 06:22:38,794 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:22:38" (1/1) ... [2025-02-08 06:22:38,796 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:22:38" (1/1) ... [2025-02-08 06:22:38,808 INFO L175 MemorySlicer]: Split 22 memory accesses to 3 slices as follows [2, 12, 8]. 55 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 5 writes are split as follows [0, 3, 2]. [2025-02-08 06:22:38,808 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:22:38" (1/1) ... [2025-02-08 06:22:38,808 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:22:38" (1/1) ... [2025-02-08 06:22:38,813 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:22:38" (1/1) ... [2025-02-08 06:22:38,814 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:22:38" (1/1) ... [2025-02-08 06:22:38,815 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:22:38" (1/1) ... [2025-02-08 06:22:38,816 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:22:38" (1/1) ... [2025-02-08 06:22:38,817 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 06:22:38,819 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 06:22:38,819 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 06:22:38,819 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 06:22:38,823 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:22:38" (1/1) ... [2025-02-08 06:22:38,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 06:22:38,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:22:38,850 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 06:22:38,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 06:22:38,872 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 06:22:38,872 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 06:22:38,872 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 06:22:38,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-08 06:22:38,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-08 06:22:38,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-08 06:22:38,873 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-08 06:22:38,873 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-08 06:22:38,873 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-08 06:22:38,873 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 06:22:38,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-08 06:22:38,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-08 06:22:38,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-02-08 06:22:38,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 06:22:38,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 06:22:38,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 06:22:38,874 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 06:22:38,874 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 06:22:38,970 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 06:22:38,972 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 06:22:39,230 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L539: 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-02-08 06:22:39,246 INFO L? ?]: Removed 103 outVars from TransFormulas that were not future-live. [2025-02-08 06:22:39,246 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 06:22:39,255 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 06:22:39,256 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 06:22:39,256 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 06:22:39 BoogieIcfgContainer [2025-02-08 06:22:39,256 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 06:22:39,258 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 06:22:39,258 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 06:22:39,262 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 06:22:39,262 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 06:22:38" (1/3) ... [2025-02-08 06:22:39,262 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5000a0ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 06:22:39, skipping insertion in model container [2025-02-08 06:22:39,263 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:22:38" (2/3) ... [2025-02-08 06:22:39,263 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5000a0ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 06:22:39, skipping insertion in model container [2025-02-08 06:22:39,263 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 06:22:39" (3/3) ... [2025-02-08 06:22:39,264 INFO L128 eAbstractionObserver]: Analyzing ICFG test-0232-2.i [2025-02-08 06:22:39,274 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 06:22:39,275 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test-0232-2.i that has 1 procedures, 95 locations, 1 initial locations, 2 loop locations, and 48 error locations. [2025-02-08 06:22:39,300 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 06:22:39,312 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;@2d52fb0c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 06:22:39,313 INFO L334 AbstractCegarLoop]: Starting to check reachability of 48 error locations. [2025-02-08 06:22:39,316 INFO L276 IsEmpty]: Start isEmpty. Operand has 95 states, 46 states have (on average 2.1739130434782608) internal successors, (100), 94 states have internal predecessors, (100), 0 states have call successors, (0), 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-02-08 06:22:39,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-02-08 06:22:39,321 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:22:39,321 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-02-08 06:22:39,321 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-02-08 06:22:39,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:22:39,327 INFO L85 PathProgramCache]: Analyzing trace with hash 129025, now seen corresponding path program 1 times [2025-02-08 06:22:39,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:22:39,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002724738] [2025-02-08 06:22:39,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:22:39,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:22:39,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 06:22:39,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 06:22:39,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:22:39,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:22:39,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-02-08 06:22:39,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:22:39,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002724738] [2025-02-08 06:22:39,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002724738] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:22:39,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:22:39,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 06:22:39,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341948317] [2025-02-08 06:22:39,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:22:39,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 06:22:39,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:22:39,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 06:22:39,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:22:39,623 INFO L87 Difference]: Start difference. First operand has 95 states, 46 states have (on average 2.1739130434782608) internal successors, (100), 94 states have internal predecessors, (100), 0 states have call successors, (0), 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.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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-02-08 06:22:39,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:22:39,764 INFO L93 Difference]: Finished difference Result 87 states and 90 transitions. [2025-02-08 06:22:39,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 06:22:39,766 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2025-02-08 06:22:39,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:22:39,770 INFO L225 Difference]: With dead ends: 87 [2025-02-08 06:22:39,771 INFO L226 Difference]: Without dead ends: 85 [2025-02-08 06:22:39,772 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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-02-08 06:22:39,774 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 85 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:22:39,774 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 80 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:22:39,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-02-08 06:22:39,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2025-02-08 06:22:39,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 45 states have (on average 1.9555555555555555) internal successors, (88), 84 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:22:39,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 88 transitions. [2025-02-08 06:22:39,806 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 88 transitions. Word has length 3 [2025-02-08 06:22:39,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:22:39,806 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 88 transitions. [2025-02-08 06:22:39,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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-02-08 06:22:39,807 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 88 transitions. [2025-02-08 06:22:39,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-02-08 06:22:39,807 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:22:39,807 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-02-08 06:22:39,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 06:22:39,808 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-02-08 06:22:39,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:22:39,809 INFO L85 PathProgramCache]: Analyzing trace with hash 129026, now seen corresponding path program 1 times [2025-02-08 06:22:39,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:22:39,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393938872] [2025-02-08 06:22:39,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:22:39,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:22:39,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 06:22:39,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 06:22:39,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:22:39,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:22:39,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:22:39,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:22:39,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393938872] [2025-02-08 06:22:39,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393938872] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:22:39,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:22:39,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 06:22:39,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83185428] [2025-02-08 06:22:39,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:22:39,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 06:22:39,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:22:39,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 06:22:39,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:22:39,961 INFO L87 Difference]: Start difference. First operand 85 states and 88 transitions. Second operand has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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-02-08 06:22:40,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:22:40,066 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2025-02-08 06:22:40,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 06:22:40,067 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2025-02-08 06:22:40,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:22:40,067 INFO L225 Difference]: With dead ends: 74 [2025-02-08 06:22:40,067 INFO L226 Difference]: Without dead ends: 74 [2025-02-08 06:22:40,067 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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-02-08 06:22:40,068 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 89 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:22:40,068 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 66 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:22:40,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-02-08 06:22:40,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2025-02-08 06:22:40,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 45 states have (on average 1.711111111111111) 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-02-08 06:22:40,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2025-02-08 06:22:40,077 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 3 [2025-02-08 06:22:40,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:22:40,077 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2025-02-08 06:22:40,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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-02-08 06:22:40,077 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2025-02-08 06:22:40,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-08 06:22:40,078 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:22:40,078 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-08 06:22:40,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 06:22:40,078 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-02-08 06:22:40,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:22:40,079 INFO L85 PathProgramCache]: Analyzing trace with hash 3999837, now seen corresponding path program 1 times [2025-02-08 06:22:40,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:22:40,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017542620] [2025-02-08 06:22:40,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:22:40,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:22:40,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 06:22:40,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 06:22:40,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:22:40,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:22:40,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:22:40,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:22:40,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017542620] [2025-02-08 06:22:40,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017542620] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:22:40,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:22:40,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 06:22:40,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141648487] [2025-02-08 06:22:40,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:22:40,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:22:40,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:22:40,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:22:40,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:22:40,117 INFO L87 Difference]: Start difference. First operand 74 states and 77 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 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-02-08 06:22:40,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:22:40,180 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2025-02-08 06:22:40,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:22:40,181 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 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-02-08 06:22:40,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:22:40,182 INFO L225 Difference]: With dead ends: 70 [2025-02-08 06:22:40,182 INFO L226 Difference]: Without dead ends: 70 [2025-02-08 06:22:40,182 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-02-08 06:22:40,182 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 11 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:22:40,183 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 86 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:22:40,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-02-08 06:22:40,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2025-02-08 06:22:40,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 45 states have (on average 1.6222222222222222) internal successors, (73), 69 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-02-08 06:22:40,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2025-02-08 06:22:40,190 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 4 [2025-02-08 06:22:40,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:22:40,190 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2025-02-08 06:22:40,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 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-02-08 06:22:40,190 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2025-02-08 06:22:40,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-08 06:22:40,190 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:22:40,191 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-08 06:22:40,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 06:22:40,191 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-02-08 06:22:40,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:22:40,191 INFO L85 PathProgramCache]: Analyzing trace with hash 3999838, now seen corresponding path program 1 times [2025-02-08 06:22:40,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:22:40,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206585447] [2025-02-08 06:22:40,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:22:40,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:22:40,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 06:22:40,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 06:22:40,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:22:40,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:22:40,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:22:40,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:22:40,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206585447] [2025-02-08 06:22:40,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206585447] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:22:40,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:22:40,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 06:22:40,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727211432] [2025-02-08 06:22:40,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:22:40,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:22:40,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:22:40,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:22:40,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:22:40,237 INFO L87 Difference]: Start difference. First operand 70 states and 73 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 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-02-08 06:22:40,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:22:40,271 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2025-02-08 06:22:40,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:22:40,271 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 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-02-08 06:22:40,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:22:40,272 INFO L225 Difference]: With dead ends: 66 [2025-02-08 06:22:40,272 INFO L226 Difference]: Without dead ends: 66 [2025-02-08 06:22:40,272 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-02-08 06:22:40,273 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 11 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:22:40,273 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 97 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:22:40,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-02-08 06:22:40,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2025-02-08 06:22:40,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 45 states have (on average 1.5333333333333334) internal successors, (69), 65 states have internal predecessors, (69), 0 states have call successors, (0), 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-02-08 06:22:40,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 69 transitions. [2025-02-08 06:22:40,280 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 69 transitions. Word has length 4 [2025-02-08 06:22:40,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:22:40,280 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 69 transitions. [2025-02-08 06:22:40,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 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-02-08 06:22:40,280 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 69 transitions. [2025-02-08 06:22:40,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-08 06:22:40,281 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:22:40,281 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:22:40,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 06:22:40,281 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-02-08 06:22:40,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:22:40,281 INFO L85 PathProgramCache]: Analyzing trace with hash -422478436, now seen corresponding path program 1 times [2025-02-08 06:22:40,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:22:40,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432229834] [2025-02-08 06:22:40,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:22:40,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:22:40,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 06:22:40,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 06:22:40,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:22:40,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:22:40,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:22:40,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:22:40,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432229834] [2025-02-08 06:22:40,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432229834] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:22:40,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:22:40,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 06:22:40,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328533080] [2025-02-08 06:22:40,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:22:40,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 06:22:40,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:22:40,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 06:22:40,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 06:22:40,503 INFO L87 Difference]: Start difference. First operand 66 states and 69 transitions. Second operand has 7 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:22:40,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:22:40,636 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions. [2025-02-08 06:22:40,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 06:22:40,636 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-02-08 06:22:40,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:22:40,637 INFO L225 Difference]: With dead ends: 75 [2025-02-08 06:22:40,637 INFO L226 Difference]: Without dead ends: 75 [2025-02-08 06:22:40,637 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 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-02-08 06:22:40,638 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 18 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:22:40,638 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 345 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:22:40,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-02-08 06:22:40,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 72. [2025-02-08 06:22:40,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 51 states have (on average 1.4705882352941178) internal successors, (75), 71 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:22:40,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 75 transitions. [2025-02-08 06:22:40,641 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 75 transitions. Word has length 9 [2025-02-08 06:22:40,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:22:40,642 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 75 transitions. [2025-02-08 06:22:40,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:22:40,642 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 75 transitions. [2025-02-08 06:22:40,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-08 06:22:40,642 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:22:40,642 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:22:40,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 06:22:40,643 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-02-08 06:22:40,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:22:40,643 INFO L85 PathProgramCache]: Analyzing trace with hash 681695111, now seen corresponding path program 1 times [2025-02-08 06:22:40,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:22:40,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186436474] [2025-02-08 06:22:40,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:22:40,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:22:40,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-08 06:22:40,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-08 06:22:40,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:22:40,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:22:40,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:22:40,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:22:40,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186436474] [2025-02-08 06:22:40,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186436474] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:22:40,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:22:40,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 06:22:40,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354304514] [2025-02-08 06:22:40,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:22:40,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 06:22:40,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:22:40,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 06:22:40,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:22:40,768 INFO L87 Difference]: Start difference. First operand 72 states and 75 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-02-08 06:22:40,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:22:40,868 INFO L93 Difference]: Finished difference Result 90 states and 94 transitions. [2025-02-08 06:22:40,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 06:22:40,869 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-02-08 06:22:40,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:22:40,869 INFO L225 Difference]: With dead ends: 90 [2025-02-08 06:22:40,869 INFO L226 Difference]: Without dead ends: 90 [2025-02-08 06:22:40,870 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-02-08 06:22:40,870 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 58 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:22:40,870 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 121 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:22:40,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-02-08 06:22:40,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 71. [2025-02-08 06:22:40,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 51 states have (on average 1.4509803921568627) internal successors, (74), 70 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:22:40,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 74 transitions. [2025-02-08 06:22:40,873 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 74 transitions. Word has length 16 [2025-02-08 06:22:40,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:22:40,873 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 74 transitions. [2025-02-08 06:22:40,873 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-02-08 06:22:40,874 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 74 transitions. [2025-02-08 06:22:40,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-08 06:22:40,874 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:22:40,874 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:22:40,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 06:22:40,874 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-02-08 06:22:40,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:22:40,875 INFO L85 PathProgramCache]: Analyzing trace with hash 681695112, now seen corresponding path program 1 times [2025-02-08 06:22:40,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:22:40,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25859182] [2025-02-08 06:22:40,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:22:40,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:22:40,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-08 06:22:40,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-08 06:22:40,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:22:40,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:22:41,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:22:41,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:22:41,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25859182] [2025-02-08 06:22:41,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25859182] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:22:41,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:22:41,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 06:22:41,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840737115] [2025-02-08 06:22:41,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:22:41,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 06:22:41,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:22:41,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 06:22:41,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:22:41,138 INFO L87 Difference]: Start difference. First operand 71 states and 74 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-02-08 06:22:41,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:22:41,258 INFO L93 Difference]: Finished difference Result 90 states and 95 transitions. [2025-02-08 06:22:41,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 06:22:41,261 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-02-08 06:22:41,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:22:41,261 INFO L225 Difference]: With dead ends: 90 [2025-02-08 06:22:41,261 INFO L226 Difference]: Without dead ends: 90 [2025-02-08 06:22:41,261 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-02-08 06:22:41,262 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 60 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:22:41,262 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 161 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:22:41,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-02-08 06:22:41,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 70. [2025-02-08 06:22:41,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 51 states have (on average 1.4313725490196079) internal successors, (73), 69 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-02-08 06:22:41,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2025-02-08 06:22:41,268 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 16 [2025-02-08 06:22:41,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:22:41,269 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2025-02-08 06:22:41,269 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-02-08 06:22:41,269 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2025-02-08 06:22:41,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-08 06:22:41,270 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:22:41,270 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-02-08 06:22:41,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 06:22:41,270 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-02-08 06:22:41,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:22:41,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1773703025, now seen corresponding path program 1 times [2025-02-08 06:22:41,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:22:41,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464513033] [2025-02-08 06:22:41,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:22:41,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:22:41,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-08 06:22:41,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 06:22:41,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:22:41,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:22:41,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:22:41,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:22:41,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464513033] [2025-02-08 06:22:41,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464513033] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:22:41,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:22:41,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 06:22:41,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818387490] [2025-02-08 06:22:41,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:22:41,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 06:22:41,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:22:41,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 06:22:41,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:22:41,413 INFO L87 Difference]: Start difference. First operand 70 states and 73 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 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-02-08 06:22:41,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:22:41,520 INFO L93 Difference]: Finished difference Result 88 states and 92 transitions. [2025-02-08 06:22:41,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 06:22:41,520 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 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-02-08 06:22:41,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:22:41,521 INFO L225 Difference]: With dead ends: 88 [2025-02-08 06:22:41,521 INFO L226 Difference]: Without dead ends: 88 [2025-02-08 06:22:41,521 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-02-08 06:22:41,522 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 47 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:22:41,522 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 143 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:22:41,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-02-08 06:22:41,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 69. [2025-02-08 06:22:41,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 51 states have (on average 1.411764705882353) internal successors, (72), 68 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-02-08 06:22:41,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 72 transitions. [2025-02-08 06:22:41,524 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 72 transitions. Word has length 19 [2025-02-08 06:22:41,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:22:41,524 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 72 transitions. [2025-02-08 06:22:41,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 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-02-08 06:22:41,525 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2025-02-08 06:22:41,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-08 06:22:41,525 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:22:41,525 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-02-08 06:22:41,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 06:22:41,525 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-02-08 06:22:41,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:22:41,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1773703026, now seen corresponding path program 1 times [2025-02-08 06:22:41,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:22:41,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397469703] [2025-02-08 06:22:41,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:22:41,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:22:41,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-08 06:22:41,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 06:22:41,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:22:41,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:22:41,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:22:41,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:22:41,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397469703] [2025-02-08 06:22:41,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397469703] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:22:41,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:22:41,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 06:22:41,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622260681] [2025-02-08 06:22:41,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:22:41,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 06:22:41,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:22:41,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 06:22:41,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-08 06:22:41,760 INFO L87 Difference]: Start difference. First operand 69 states and 72 transitions. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 7 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-02-08 06:22:41,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:22:41,888 INFO L93 Difference]: Finished difference Result 88 states and 93 transitions. [2025-02-08 06:22:41,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 06:22:41,888 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 7 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-02-08 06:22:41,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:22:41,889 INFO L225 Difference]: With dead ends: 88 [2025-02-08 06:22:41,889 INFO L226 Difference]: Without dead ends: 88 [2025-02-08 06:22:41,889 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-02-08 06:22:41,890 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 61 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:22:41,890 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 164 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:22:41,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-02-08 06:22:41,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 68. [2025-02-08 06:22:41,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 51 states have (on average 1.392156862745098) internal successors, (71), 67 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:22:41,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2025-02-08 06:22:41,896 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 19 [2025-02-08 06:22:41,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:22:41,897 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2025-02-08 06:22:41,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 7 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-02-08 06:22:41,897 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2025-02-08 06:22:41,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-08 06:22:41,897 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:22:41,897 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-02-08 06:22:41,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 06:22:41,897 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-02-08 06:22:41,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:22:41,898 INFO L85 PathProgramCache]: Analyzing trace with hash 1772747728, now seen corresponding path program 1 times [2025-02-08 06:22:41,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:22:41,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64555827] [2025-02-08 06:22:41,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:22:41,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:22:41,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-08 06:22:41,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 06:22:41,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:22:41,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:22:41,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:22:41,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:22:41,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64555827] [2025-02-08 06:22:41,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64555827] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:22:41,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:22:41,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 06:22:41,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031207062] [2025-02-08 06:22:41,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:22:41,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 06:22:41,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:22:41,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 06:22:41,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:22:41,980 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand has 5 states, 5 states have (on average 3.8) 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-02-08 06:22:42,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:22:42,039 INFO L93 Difference]: Finished difference Result 71 states and 73 transitions. [2025-02-08 06:22:42,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 06:22:42,040 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) 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-02-08 06:22:42,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:22:42,040 INFO L225 Difference]: With dead ends: 71 [2025-02-08 06:22:42,040 INFO L226 Difference]: Without dead ends: 71 [2025-02-08 06:22:42,040 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-02-08 06:22:42,040 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 41 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:22:42,041 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 157 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:22:42,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-02-08 06:22:42,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 68. [2025-02-08 06:22:42,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 51 states have (on average 1.3725490196078431) internal successors, (70), 67 states have internal predecessors, (70), 0 states have call successors, (0), 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-02-08 06:22:42,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 70 transitions. [2025-02-08 06:22:42,042 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 70 transitions. Word has length 19 [2025-02-08 06:22:42,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:22:42,042 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 70 transitions. [2025-02-08 06:22:42,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) 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-02-08 06:22:42,043 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2025-02-08 06:22:42,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-08 06:22:42,043 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:22:42,043 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:22:42,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 06:22:42,043 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-02-08 06:22:42,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:22:42,047 INFO L85 PathProgramCache]: Analyzing trace with hash -740191549, now seen corresponding path program 1 times [2025-02-08 06:22:42,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:22:42,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228877281] [2025-02-08 06:22:42,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:22:42,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:22:42,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-08 06:22:42,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 06:22:42,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:22:42,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:22:42,300 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:22:42,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:22:42,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228877281] [2025-02-08 06:22:42,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228877281] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:22:42,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [544873477] [2025-02-08 06:22:42,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:22:42,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:22:42,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:22:42,305 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:22:42,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 06:22:42,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-08 06:22:42,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 06:22:42,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:22:42,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:22:42,395 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-02-08 06:22:42,399 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:22:42,474 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-02-08 06:22:42,508 INFO L349 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2025-02-08 06:22:42,508 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-02-08 06:22:42,534 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-02-08 06:22:42,561 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-02-08 06:22:42,599 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-02-08 06:22:42,602 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:22:42,602 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:22:42,701 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-02-08 06:22:43,064 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:22:43,064 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-02-08 06:22:43,531 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:22:43,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [544873477] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:22:43,531 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:22:43,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2025-02-08 06:22:43,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559589407] [2025-02-08 06:22:43,532 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:22:43,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-08 06:22:43,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:22:43,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-08 06:22:43,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2025-02-08 06:22:43,533 INFO L87 Difference]: Start difference. First operand 68 states and 70 transitions. Second operand has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 16 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:22:43,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:22:43,821 INFO L93 Difference]: Finished difference Result 70 states and 72 transitions. [2025-02-08 06:22:43,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 06:22:43,821 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 16 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-02-08 06:22:43,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:22:43,822 INFO L225 Difference]: With dead ends: 70 [2025-02-08 06:22:43,822 INFO L226 Difference]: Without dead ends: 70 [2025-02-08 06:22:43,822 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2025-02-08 06:22:43,822 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 60 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:22:43,822 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 340 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 06:22:43,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-02-08 06:22:43,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 67. [2025-02-08 06:22:43,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 51 states have (on average 1.3529411764705883) internal successors, (69), 66 states have internal predecessors, (69), 0 states have call successors, (0), 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-02-08 06:22:43,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 69 transitions. [2025-02-08 06:22:43,824 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 69 transitions. Word has length 20 [2025-02-08 06:22:43,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:22:43,825 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 69 transitions. [2025-02-08 06:22:43,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 16 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:22:43,825 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 69 transitions. [2025-02-08 06:22:43,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-08 06:22:43,825 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:22:43,825 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:22:43,833 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-08 06:22:44,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-02-08 06:22:44,030 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-02-08 06:22:44,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:22:44,031 INFO L85 PathProgramCache]: Analyzing trace with hash -740191548, now seen corresponding path program 1 times [2025-02-08 06:22:44,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:22:44,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921164051] [2025-02-08 06:22:44,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:22:44,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:22:44,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-08 06:22:44,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 06:22:44,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:22:44,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:22:44,317 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:22:44,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:22:44,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921164051] [2025-02-08 06:22:44,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921164051] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:22:44,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [107992629] [2025-02-08 06:22:44,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:22:44,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:22:44,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:22:44,319 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:22:44,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 06:22:44,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-08 06:22:44,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 06:22:44,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:22:44,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:22:44,394 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-02-08 06:22:44,398 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:22:44,494 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-02-08 06:22:44,498 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-02-08 06:22:44,534 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-02-08 06:22:44,534 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-02-08 06:22:44,541 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 24 treesize of output 19 [2025-02-08 06:22:44,562 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2025-02-08 06:22:44,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2025-02-08 06:22:44,593 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-02-08 06:22:44,600 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-02-08 06:22:44,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2025-02-08 06:22:44,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2025-02-08 06:22:44,662 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:22:44,662 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:22:44,848 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-02-08 06:22:44,851 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-02-08 06:22:44,876 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-02-08 06:22:44,992 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:22:44,993 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-02-08 06:22:45,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 64 [2025-02-08 06:22:45,104 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:22:45,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [107992629] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:22:45,105 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:22:45,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 22 [2025-02-08 06:22:45,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167125231] [2025-02-08 06:22:45,105 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:22:45,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-08 06:22:45,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:22:45,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-08 06:22:45,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=440, Unknown=0, NotChecked=0, Total=506 [2025-02-08 06:22:45,106 INFO L87 Difference]: Start difference. First operand 67 states and 69 transitions. Second operand has 23 states, 22 states have (on average 2.6363636363636362) internal successors, (58), 23 states have internal predecessors, (58), 0 states have call successors, (0), 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-02-08 06:22:45,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:22:45,490 INFO L93 Difference]: Finished difference Result 69 states and 71 transitions. [2025-02-08 06:22:45,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 06:22:45,491 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.6363636363636362) internal successors, (58), 23 states have internal predecessors, (58), 0 states have call successors, (0), 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-02-08 06:22:45,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:22:45,491 INFO L225 Difference]: With dead ends: 69 [2025-02-08 06:22:45,491 INFO L226 Difference]: Without dead ends: 69 [2025-02-08 06:22:45,492 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=138, Invalid=564, Unknown=0, NotChecked=0, Total=702 [2025-02-08 06:22:45,492 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 125 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:22:45,492 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 491 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 06:22:45,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-02-08 06:22:45,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 66. [2025-02-08 06:22:45,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 51 states have (on average 1.3333333333333333) internal successors, (68), 65 states have internal predecessors, (68), 0 states have call successors, (0), 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-02-08 06:22:45,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 68 transitions. [2025-02-08 06:22:45,494 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 68 transitions. Word has length 20 [2025-02-08 06:22:45,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:22:45,494 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 68 transitions. [2025-02-08 06:22:45,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.6363636363636362) internal successors, (58), 23 states have internal predecessors, (58), 0 states have call successors, (0), 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-02-08 06:22:45,494 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 68 transitions. [2025-02-08 06:22:45,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-08 06:22:45,494 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:22:45,494 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-02-08 06:22:45,504 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-08 06:22:45,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:22:45,702 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-02-08 06:22:45,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:22:45,702 INFO L85 PathProgramCache]: Analyzing trace with hash -849781054, now seen corresponding path program 1 times [2025-02-08 06:22:45,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:22:45,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528435505] [2025-02-08 06:22:45,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:22:45,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:22:45,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-08 06:22:45,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 06:22:45,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:22:45,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:22:45,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:22:45,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:22:45,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528435505] [2025-02-08 06:22:45,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528435505] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:22:45,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:22:45,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 06:22:45,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497214269] [2025-02-08 06:22:45,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:22:45,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 06:22:45,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:22:45,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 06:22:45,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-08 06:22:45,956 INFO L87 Difference]: Start difference. First operand 66 states and 68 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-02-08 06:22:46,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:22:46,085 INFO L93 Difference]: Finished difference Result 104 states and 110 transitions. [2025-02-08 06:22:46,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 06:22:46,089 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-02-08 06:22:46,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:22:46,089 INFO L225 Difference]: With dead ends: 104 [2025-02-08 06:22:46,089 INFO L226 Difference]: Without dead ends: 104 [2025-02-08 06:22:46,089 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-02-08 06:22:46,090 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 36 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:22:46,090 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 216 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:22:46,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-02-08 06:22:46,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 79. [2025-02-08 06:22:46,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 64 states have (on average 1.28125) internal successors, (82), 78 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:22:46,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 82 transitions. [2025-02-08 06:22:46,092 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 82 transitions. Word has length 20 [2025-02-08 06:22:46,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:22:46,092 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 82 transitions. [2025-02-08 06:22:46,092 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-02-08 06:22:46,092 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 82 transitions. [2025-02-08 06:22:46,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-08 06:22:46,092 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:22:46,092 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-02-08 06:22:46,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 06:22:46,092 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-02-08 06:22:46,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:22:46,098 INFO L85 PathProgramCache]: Analyzing trace with hash -573408881, now seen corresponding path program 1 times [2025-02-08 06:22:46,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:22:46,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097422562] [2025-02-08 06:22:46,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:22:46,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:22:46,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-08 06:22:46,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-08 06:22:46,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:22:46,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:22:46,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:22:46,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:22:46,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097422562] [2025-02-08 06:22:46,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097422562] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:22:46,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:22:46,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 06:22:46,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99268319] [2025-02-08 06:22:46,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:22:46,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 06:22:46,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:22:46,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 06:22:46,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-08 06:22:46,354 INFO L87 Difference]: Start difference. First operand 79 states and 82 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-02-08 06:22:46,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:22:46,510 INFO L93 Difference]: Finished difference Result 103 states and 109 transitions. [2025-02-08 06:22:46,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 06:22:46,511 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-02-08 06:22:46,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:22:46,511 INFO L225 Difference]: With dead ends: 103 [2025-02-08 06:22:46,511 INFO L226 Difference]: Without dead ends: 103 [2025-02-08 06:22:46,511 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-02-08 06:22:46,512 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 36 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:22:46,512 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 179 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:22:46,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-02-08 06:22:46,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 80. [2025-02-08 06:22:46,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 65 states have (on average 1.2769230769230768) 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-02-08 06:22:46,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 83 transitions. [2025-02-08 06:22:46,514 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 83 transitions. Word has length 21 [2025-02-08 06:22:46,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:22:46,514 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 83 transitions. [2025-02-08 06:22:46,514 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-02-08 06:22:46,514 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2025-02-08 06:22:46,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-08 06:22:46,514 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:22:46,514 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-02-08 06:22:46,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 06:22:46,515 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-02-08 06:22:46,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:22:46,515 INFO L85 PathProgramCache]: Analyzing trace with hash -595806112, now seen corresponding path program 1 times [2025-02-08 06:22:46,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:22:46,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620505520] [2025-02-08 06:22:46,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:22:46,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:22:46,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-08 06:22:46,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-08 06:22:46,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:22:46,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:22:46,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:22:46,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:22:46,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620505520] [2025-02-08 06:22:46,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620505520] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:22:46,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:22:46,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 06:22:46,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576206390] [2025-02-08 06:22:46,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:22:46,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 06:22:46,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:22:46,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 06:22:46,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-08 06:22:46,733 INFO L87 Difference]: Start difference. First operand 80 states and 83 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-02-08 06:22:46,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:22:46,928 INFO L93 Difference]: Finished difference Result 94 states and 98 transitions. [2025-02-08 06:22:46,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 06:22:46,928 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-02-08 06:22:46,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:22:46,930 INFO L225 Difference]: With dead ends: 94 [2025-02-08 06:22:46,930 INFO L226 Difference]: Without dead ends: 94 [2025-02-08 06:22:46,930 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-02-08 06:22:46,931 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 24 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:22:46,931 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 217 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:22:46,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-02-08 06:22:46,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 81. [2025-02-08 06:22:46,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 66 states have (on average 1.2727272727272727) 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-02-08 06:22:46,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 84 transitions. [2025-02-08 06:22:46,935 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 84 transitions. Word has length 22 [2025-02-08 06:22:46,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:22:46,936 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 84 transitions. [2025-02-08 06:22:46,936 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-02-08 06:22:46,936 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 84 transitions. [2025-02-08 06:22:46,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-08 06:22:46,936 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:22:46,936 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-02-08 06:22:46,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 06:22:46,936 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-02-08 06:22:46,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:22:46,937 INFO L85 PathProgramCache]: Analyzing trace with hash -1290120276, now seen corresponding path program 1 times [2025-02-08 06:22:46,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:22:46,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890778396] [2025-02-08 06:22:46,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:22:46,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:22:46,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-08 06:22:46,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 06:22:46,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:22:46,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:22:47,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:22:47,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:22:47,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890778396] [2025-02-08 06:22:47,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890778396] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:22:47,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:22:47,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 06:22:47,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031911448] [2025-02-08 06:22:47,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:22:47,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 06:22:47,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:22:47,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 06:22:47,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-08 06:22:47,029 INFO L87 Difference]: Start difference. First operand 81 states and 84 transitions. Second operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 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-02-08 06:22:47,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:22:47,109 INFO L93 Difference]: Finished difference Result 80 states and 83 transitions. [2025-02-08 06:22:47,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 06:22:47,110 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 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-02-08 06:22:47,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:22:47,110 INFO L225 Difference]: With dead ends: 80 [2025-02-08 06:22:47,110 INFO L226 Difference]: Without dead ends: 80 [2025-02-08 06:22:47,110 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-02-08 06:22:47,111 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 46 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:22:47,111 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 65 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:22:47,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-02-08 06:22:47,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2025-02-08 06:22:47,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 66 states have (on average 1.2575757575757576) 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-02-08 06:22:47,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 83 transitions. [2025-02-08 06:22:47,113 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 83 transitions. Word has length 23 [2025-02-08 06:22:47,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:22:47,113 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 83 transitions. [2025-02-08 06:22:47,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 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-02-08 06:22:47,113 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2025-02-08 06:22:47,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-08 06:22:47,113 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:22:47,113 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-02-08 06:22:47,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 06:22:47,114 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-02-08 06:22:47,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:22:47,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1339022882, now seen corresponding path program 1 times [2025-02-08 06:22:47,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:22:47,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625517356] [2025-02-08 06:22:47,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:22:47,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:22:47,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-08 06:22:47,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 06:22:47,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:22:47,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:22:47,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:22:47,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:22:47,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625517356] [2025-02-08 06:22:47,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625517356] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:22:47,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:22:47,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 06:22:47,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751018679] [2025-02-08 06:22:47,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:22:47,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 06:22:47,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:22:47,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 06:22:47,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:22:47,178 INFO L87 Difference]: Start difference. First operand 80 states and 83 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-02-08 06:22:47,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:22:47,218 INFO L93 Difference]: Finished difference Result 79 states and 82 transitions. [2025-02-08 06:22:47,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 06:22:47,219 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-02-08 06:22:47,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:22:47,219 INFO L225 Difference]: With dead ends: 79 [2025-02-08 06:22:47,219 INFO L226 Difference]: Without dead ends: 79 [2025-02-08 06:22:47,219 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-02-08 06:22:47,219 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 26 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:22:47,220 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 138 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:22:47,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-02-08 06:22:47,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2025-02-08 06:22:47,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 66 states have (on average 1.2424242424242424) internal successors, (82), 78 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:22:47,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 82 transitions. [2025-02-08 06:22:47,221 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 82 transitions. Word has length 24 [2025-02-08 06:22:47,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:22:47,221 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 82 transitions. [2025-02-08 06:22:47,221 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-02-08 06:22:47,221 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 82 transitions. [2025-02-08 06:22:47,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-08 06:22:47,221 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:22:47,221 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-02-08 06:22:47,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 06:22:47,222 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-02-08 06:22:47,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:22:47,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1439963626, now seen corresponding path program 1 times [2025-02-08 06:22:47,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:22:47,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240814279] [2025-02-08 06:22:47,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:22:47,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:22:47,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-08 06:22:47,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 06:22:47,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:22:47,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:22:47,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:22:47,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:22:47,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240814279] [2025-02-08 06:22:47,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240814279] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:22:47,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:22:47,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 06:22:47,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011722020] [2025-02-08 06:22:47,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:22:47,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 06:22:47,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:22:47,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 06:22:47,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:22:47,316 INFO L87 Difference]: Start difference. First operand 79 states and 82 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:22:47,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:22:47,371 INFO L93 Difference]: Finished difference Result 78 states and 81 transitions. [2025-02-08 06:22:47,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 06:22:47,371 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-02-08 06:22:47,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:22:47,372 INFO L225 Difference]: With dead ends: 78 [2025-02-08 06:22:47,372 INFO L226 Difference]: Without dead ends: 78 [2025-02-08 06:22:47,372 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-02-08 06:22:47,372 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 26 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:22:47,372 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 115 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:22:47,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-02-08 06:22:47,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2025-02-08 06:22:47,374 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-02-08 06:22:47,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2025-02-08 06:22:47,374 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 25 [2025-02-08 06:22:47,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:22:47,374 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2025-02-08 06:22:47,374 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-02-08 06:22:47,374 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2025-02-08 06:22:47,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-08 06:22:47,375 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:22:47,375 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-02-08 06:22:47,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-08 06:22:47,375 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-02-08 06:22:47,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:22:47,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1689199452, now seen corresponding path program 1 times [2025-02-08 06:22:47,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:22:47,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300289400] [2025-02-08 06:22:47,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:22:47,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:22:47,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-08 06:22:47,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 06:22:47,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:22:47,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:22:47,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:22:47,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:22:47,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300289400] [2025-02-08 06:22:47,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300289400] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:22:47,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:22:47,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-08 06:22:47,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095778922] [2025-02-08 06:22:47,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:22:47,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 06:22:47,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:22:47,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 06:22:47,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-02-08 06:22:47,654 INFO L87 Difference]: Start difference. First operand 78 states and 81 transitions. Second operand has 11 states, 10 states have (on average 2.6) internal successors, (26), 11 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-02-08 06:22:47,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:22:47,909 INFO L93 Difference]: Finished difference Result 98 states and 102 transitions. [2025-02-08 06:22:47,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-08 06:22:47,909 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 11 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-02-08 06:22:47,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:22:47,909 INFO L225 Difference]: With dead ends: 98 [2025-02-08 06:22:47,909 INFO L226 Difference]: Without dead ends: 98 [2025-02-08 06:22:47,910 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2025-02-08 06:22:47,910 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 80 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:22:47,910 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 181 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:22:47,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-02-08 06:22:47,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 82. [2025-02-08 06:22:47,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 70 states have (on average 1.2142857142857142) 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-02-08 06:22:47,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 85 transitions. [2025-02-08 06:22:47,912 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 85 transitions. Word has length 26 [2025-02-08 06:22:47,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:22:47,912 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 85 transitions. [2025-02-08 06:22:47,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 11 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-02-08 06:22:47,912 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 85 transitions. [2025-02-08 06:22:47,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-08 06:22:47,912 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:22:47,912 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-02-08 06:22:47,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-08 06:22:47,912 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-02-08 06:22:47,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:22:47,913 INFO L85 PathProgramCache]: Analyzing trace with hash 825575463, now seen corresponding path program 1 times [2025-02-08 06:22:47,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:22:47,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609311116] [2025-02-08 06:22:47,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:22:47,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:22:47,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-08 06:22:47,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-08 06:22:47,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:22:47,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:22:48,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:22:48,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:22:48,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609311116] [2025-02-08 06:22:48,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609311116] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:22:48,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:22:48,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 06:22:48,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228678815] [2025-02-08 06:22:48,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:22:48,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 06:22:48,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:22:48,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 06:22:48,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:22:48,033 INFO L87 Difference]: Start difference. First operand 82 states and 85 transitions. Second operand has 6 states, 5 states have (on average 5.4) internal successors, (27), 5 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-02-08 06:22:48,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:22:48,107 INFO L93 Difference]: Finished difference Result 81 states and 84 transitions. [2025-02-08 06:22:48,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 06:22:48,107 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 5 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-02-08 06:22:48,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:22:48,108 INFO L225 Difference]: With dead ends: 81 [2025-02-08 06:22:48,108 INFO L226 Difference]: Without dead ends: 81 [2025-02-08 06:22:48,108 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 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-02-08 06:22:48,108 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 70 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:22:48,109 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 86 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:22:48,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-02-08 06:22:48,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2025-02-08 06:22:48,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 70 states have (on average 1.2) 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-02-08 06:22:48,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 84 transitions. [2025-02-08 06:22:48,115 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 84 transitions. Word has length 27 [2025-02-08 06:22:48,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:22:48,116 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 84 transitions. [2025-02-08 06:22:48,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 5 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-02-08 06:22:48,116 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 84 transitions. [2025-02-08 06:22:48,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-02-08 06:22:48,116 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:22:48,116 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:22:48,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-08 06:22:48,116 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-02-08 06:22:48,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:22:48,117 INFO L85 PathProgramCache]: Analyzing trace with hash -2003136704, now seen corresponding path program 1 times [2025-02-08 06:22:48,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:22:48,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142108281] [2025-02-08 06:22:48,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:22:48,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:22:48,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-08 06:22:48,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-08 06:22:48,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:22:48,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:22:48,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:22:48,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:22:48,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142108281] [2025-02-08 06:22:48,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142108281] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:22:48,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:22:48,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-08 06:22:48,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622692787] [2025-02-08 06:22:48,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:22:48,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 06:22:48,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:22:48,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 06:22:48,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-02-08 06:22:48,545 INFO L87 Difference]: Start difference. First operand 81 states and 84 transitions. Second operand has 11 states, 11 states have (on average 3.0) internal successors, (33), 10 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:22:48,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:22:48,727 INFO L93 Difference]: Finished difference Result 109 states and 113 transitions. [2025-02-08 06:22:48,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 06:22:48,727 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 10 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-02-08 06:22:48,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:22:48,728 INFO L225 Difference]: With dead ends: 109 [2025-02-08 06:22:48,728 INFO L226 Difference]: Without dead ends: 109 [2025-02-08 06:22:48,728 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2025-02-08 06:22:48,729 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 31 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:22:48,729 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 340 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:22:48,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-02-08 06:22:48,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 105. [2025-02-08 06:22:48,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 94 states have (on average 1.1595744680851063) internal successors, (109), 104 states have internal predecessors, (109), 0 states have call successors, (0), 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-02-08 06:22:48,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 109 transitions. [2025-02-08 06:22:48,731 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 109 transitions. Word has length 33 [2025-02-08 06:22:48,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:22:48,732 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 109 transitions. [2025-02-08 06:22:48,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 10 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:22:48,732 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 109 transitions. [2025-02-08 06:22:48,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-02-08 06:22:48,732 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:22:48,732 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:22:48,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-08 06:22:48,732 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-02-08 06:22:48,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:22:48,733 INFO L85 PathProgramCache]: Analyzing trace with hash -2003136320, now seen corresponding path program 1 times [2025-02-08 06:22:48,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:22:48,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618907382] [2025-02-08 06:22:48,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:22:48,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:22:48,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-08 06:22:48,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-08 06:22:48,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:22:48,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:22:49,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:22:49,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:22:49,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618907382] [2025-02-08 06:22:49,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618907382] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:22:49,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:22:49,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-08 06:22:49,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890367515] [2025-02-08 06:22:49,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:22:49,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-08 06:22:49,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:22:49,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-08 06:22:49,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2025-02-08 06:22:49,465 INFO L87 Difference]: Start difference. First operand 105 states and 109 transitions. Second operand has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:22:49,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:22:49,856 INFO L93 Difference]: Finished difference Result 108 states and 111 transitions. [2025-02-08 06:22:49,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-08 06:22:49,856 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-02-08 06:22:49,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:22:49,857 INFO L225 Difference]: With dead ends: 108 [2025-02-08 06:22:49,857 INFO L226 Difference]: Without dead ends: 87 [2025-02-08 06:22:49,857 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2025-02-08 06:22:49,858 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 11 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 446 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 06:22:49,858 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 324 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 446 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 06:22:49,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-02-08 06:22:49,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2025-02-08 06:22:49,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 75 states have (on average 1.1866666666666668) internal successors, (89), 85 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:22:49,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 89 transitions. [2025-02-08 06:22:49,864 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 89 transitions. Word has length 33 [2025-02-08 06:22:49,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:22:49,864 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 89 transitions. [2025-02-08 06:22:49,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:22:49,864 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 89 transitions. [2025-02-08 06:22:49,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-02-08 06:22:49,864 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:22:49,864 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-02-08 06:22:49,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-08 06:22:49,865 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2025-02-08 06:22:49,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:22:49,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1932902990, now seen corresponding path program 1 times [2025-02-08 06:22:49,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:22:49,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937810208] [2025-02-08 06:22:49,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:22:49,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:22:49,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-08 06:22:49,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-08 06:22:49,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:22:49,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:22:50,562 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:22:50,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:22:50,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937810208] [2025-02-08 06:22:50,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937810208] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:22:50,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1597302377] [2025-02-08 06:22:50,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:22:50,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:22:50,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:22:50,565 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:22:50,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 06:22:50,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-08 06:22:50,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-08 06:22:50,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:22:50,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:22:50,672 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 75 conjuncts are in the unsatisfiable core [2025-02-08 06:22:50,675 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:22:50,786 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-02-08 06:22:50,836 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-02-08 06:22:50,842 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-02-08 06:22:50,890 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-02-08 06:22:50,891 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-02-08 06:22:50,988 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-02-08 06:22:50,997 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-02-08 06:22:51,132 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-02-08 06:22:51,320 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:22:51,324 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-02-08 06:22:51,324 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 48 treesize of output 52 [2025-02-08 06:22:51,409 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:22:51,410 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 64 treesize of output 37 [2025-02-08 06:22:51,416 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:22:51,417 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 55 treesize of output 39 [2025-02-08 06:22:51,584 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:22:51,585 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 38 treesize of output 22 [2025-02-08 06:22:51,593 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:22:51,595 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:22:51,595 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 15 treesize of output 10 [2025-02-08 06:22:51,634 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:22:51,637 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:22:52,165 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2025-02-08 06:22:52,166 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 182 treesize of output 180 [2025-02-08 06:22:52,215 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2025-02-08 06:22:52,216 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 286 treesize of output 272 [2025-02-08 06:22:52,237 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:22:52,237 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 196 treesize of output 194 [2025-02-08 06:22:52,259 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:22:52,259 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 190 treesize of output 188 [2025-02-08 06:22:52,279 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-02-08 06:22:52,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2025-02-08 06:22:52,329 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:22:52,330 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 306 treesize of output 320 [2025-02-08 06:22:53,073 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:22:53,074 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 1826 treesize of output 1798 [2025-02-08 06:23:04,409 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse14 (+ 4 |c_ULTIMATE.start_append_~item~0#1.offset|)) (.cse39 (< |c_ULTIMATE.start_main_~#list~0#1.offset| 1))) (let ((.cse316 (or (< |c_ULTIMATE.start_append_~plist#1.offset| 1) .cse39)) (.cse317 (or .cse39 (< |c_ULTIMATE.start_main_~#list~0#1.offset| (+ 2 |c_ULTIMATE.start_append_~plist#1.offset|)))) (.cse195 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_16 Int)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse411 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse411 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse411) |c_ULTIMATE.start_append_~item~0#1.base|) .cse14)))) v_prenex_16) .cse14) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (.cse196 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_16 Int)) (let ((.cse409 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse410 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse410 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse410) |c_ULTIMATE.start_append_~item~0#1.base|) .cse14)))) v_prenex_16))) (or (= (select .cse409 4) 0) (= (select .cse409 .cse14) 0)))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (.cse8 (= |c_ULTIMATE.start_main_~#list~0#1.base| |c_ULTIMATE.start_append_~plist#1.base|))) (let ((.cse220 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_25 Int) (v_arrayElimCell_42 Int) (v_arrayElimCell_55 Int)) (let ((.cse406 (let ((.cse408 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_42))) (store .cse408 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse408) v_prenex_25) (+ 4 v_arrayElimCell_42))))) (.cse407 (+ 4 v_arrayElimCell_55))) (or (= (select .cse406 .cse407) 0) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse406) v_prenex_25) .cse407) 0)))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (.cse254 (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_25 Int) (v_arrayElimCell_42 Int) (v_arrayElimCell_55 Int)) (let ((.cse405 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_42))) (let ((.cse404 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse405) v_prenex_25) (+ 4 v_arrayElimCell_42)))) (let ((.cse402 (store .cse405 4 .cse404)) (.cse403 (+ 4 v_arrayElimCell_55))) (or (= (select .cse402 .cse403) 0) (= 0 .cse404) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse402) v_prenex_25) .cse403) 0))))))))) (.cse255 (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_25 Int) (v_arrayElimCell_42 Int) (v_arrayElimCell_55 Int)) (let ((.cse401 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_42))) (let ((.cse399 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse401) v_prenex_25) (+ 4 v_arrayElimCell_42)))) (let ((.cse397 (store .cse401 4 .cse399))) (let ((.cse400 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse397) v_prenex_25)) (.cse398 (+ 4 v_arrayElimCell_55))) (or (= (select .cse397 .cse398) 0) (= 0 .cse399) (= (select .cse400 4) 0) (= (select .cse400 .cse398) 0)))))))))) (.cse256 (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_24 Int) (v_arrayElimCell_42 Int) (v_arrayElimCell_55 Int)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse396 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_42))) (store .cse396 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse396) v_prenex_24) (+ 4 v_arrayElimCell_42))))) v_prenex_24) (+ 4 v_arrayElimCell_55)) 0))))) (.cse64 (< |c_ULTIMATE.start_append_~plist#1.offset| 0)) (.cse65 (< |c_ULTIMATE.start_main_~#list~0#1.offset| |c_ULTIMATE.start_append_~plist#1.offset|)) (.cse40 (not .cse8)) (.cse66 (and .cse195 .cse196)) (.cse3 (and .cse316 .cse317)) (.cse68 (< |c_ULTIMATE.start_main_~#list~0#1.offset| 0))) (let ((.cse45 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_25 Int) (v_arrayElimCell_42 Int)) (let ((.cse394 (let ((.cse395 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_42))) (store .cse395 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse395) v_prenex_25) (+ 4 v_arrayElimCell_42)))))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse394) v_prenex_25) .cse14) 0) (= (select .cse394 .cse14) 0)))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (.cse46 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_25 Int) (v_arrayElimCell_42 Int)) (let ((.cse393 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_42))) (let ((.cse391 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse393) v_prenex_25) (+ 4 v_arrayElimCell_42)))) (let ((.cse392 (store .cse393 4 .cse391))) (or (= 0 .cse391) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse392) v_prenex_25) .cse14) 0) (= (select .cse392 .cse14) 0)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (.cse47 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_24 Int) (v_arrayElimCell_42 Int)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse390 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_42))) (store .cse390 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse390) v_prenex_24) (+ 4 v_arrayElimCell_42))))) v_prenex_24) .cse14) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (.cse48 (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_25 Int) (v_arrayElimCell_42 Int)) (let ((.cse389 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_42))) (let ((.cse386 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse389) v_prenex_25) (+ 4 v_arrayElimCell_42)))) (let ((.cse388 (store .cse389 4 .cse386))) (let ((.cse387 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse388) v_prenex_25))) (or (= 0 .cse386) (= (select .cse387 .cse14) 0) (= (select .cse388 .cse14) 0) (= (select .cse387 4) 0)))))))))) (.cse79 (forall ((v_prenex_26 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_43 Int)) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse385 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse385 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse385) v_arrayElimCell_43) .cse14)))) v_prenex_26) .cse14) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (.cse69 (or (forall ((v_prenex_25 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (let ((.cse383 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (let ((.cse384 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse383) v_prenex_25) .cse14))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse383 4 .cse384)) v_prenex_25) 4) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= 0 .cse384))))) .cse68)) (.cse70 (or (forall ((v_prenex_17 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|)) v_prenex_17) .cse14) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) .cse68)) (.cse72 (or .cse3 (forall ((v_prenex_25 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (let ((.cse381 (let ((.cse382 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse382 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse382) v_prenex_25) .cse14))))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse381) v_prenex_25) .cse14) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select .cse381 .cse14) 0)))))) (.cse76 (or .cse3 (forall ((v_prenex_25 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (let ((.cse379 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (let ((.cse380 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse379) v_prenex_25) .cse14))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (store .cse379 4 .cse380) .cse14) 0) (= 0 .cse380))))))) (.cse77 (or .cse68 (forall ((v_prenex_25 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (let ((.cse378 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (let ((.cse377 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse378) v_prenex_25) .cse14))) (let ((.cse376 (store .cse378 4 .cse377))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse376) v_prenex_25) 4) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select .cse376 .cse14) 0) (= 0 .cse377)))))))) (.cse78 (or .cse3 (forall ((v_prenex_24 Int) (|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)) (= 0 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse375 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse375 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse375) v_prenex_24) .cse14)))) v_prenex_24) .cse14)))))) (.cse71 (or .cse39 (forall ((v_prenex_14 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (let ((.cse373 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (let ((.cse374 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse373))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse373 4 (select (select .cse374 |c_ULTIMATE.start_append_~item~0#1.base|) .cse14))) v_prenex_14) .cse14) 0) (= (select (store .cse373 4 (select (select .cse374 v_prenex_14) .cse14)) .cse14) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))))))) (.cse73 (or .cse39 (forall ((v_prenex_15 Int) (|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$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse372 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse372 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse372) |c_ULTIMATE.start_append_~item~0#1.base|) .cse14)))) v_prenex_15) .cse14) 0))))) (.cse74 (or .cse64 .cse65 .cse40 .cse66)) (.cse75 (or .cse39 (forall ((v_prenex_14 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (let ((.cse370 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (let ((.cse371 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse370))) (let ((.cse369 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse370 4 (select (select .cse371 |c_ULTIMATE.start_append_~item~0#1.base|) .cse14))) v_prenex_14))) (or (= (select .cse369 .cse14) 0) (= (select .cse369 4) 0) (= (select (store .cse370 4 (select (select .cse371 v_prenex_14) .cse14)) .cse14) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))))))) (.cse17 (forall ((v_prenex_26 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_43 Int) (v_arrayElimCell_55 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (let ((.cse368 (+ 4 v_arrayElimCell_55))) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse367 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_55))) (store .cse367 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse367) v_arrayElimCell_43) .cse368)))) v_prenex_26) .cse368)) 0)))) (.cse1 (or .cse68 (forall ((v_arrayElimCell_52 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_55 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_55)) v_arrayElimCell_52) (+ 4 v_arrayElimCell_55)) 0))))) (.cse6 (forall ((v_prenex_13 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_55 Int)) (let ((.cse364 (+ 4 v_arrayElimCell_55))) (let ((.cse365 (let ((.cse366 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_55))) (store .cse366 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse366) v_prenex_13) .cse364))))) (let ((.cse363 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse365) v_prenex_13))) (or (= (select .cse363 4) 0) (= (select .cse363 .cse364) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select .cse365 .cse364) 0))))))) (.cse4 (or (forall ((v_prenex_13 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_55 Int)) (let ((.cse362 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_55)) (.cse361 (+ 4 v_arrayElimCell_55))) (let ((.cse360 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse362) v_prenex_13) .cse361))) (let ((.cse359 (store .cse362 4 .cse360))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse359) v_prenex_13) 4) 0) (= .cse360 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select .cse359 .cse361) 0)))))) .cse68)) (.cse0 (or .cse3 (forall ((v_prenex_25 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_55 Int)) (let ((.cse356 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_55)) (.cse358 (+ 4 v_arrayElimCell_55))) (let ((.cse357 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse356) v_prenex_25) .cse358))) (or (= (select (store .cse356 4 .cse357) .cse358) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= .cse357 0))))))) (.cse9 (or .cse3 (forall ((v_prenex_24 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_55 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (let ((.cse355 (+ 4 v_arrayElimCell_55))) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse354 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_55))) (store .cse354 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse354) v_prenex_24) .cse355)))) v_prenex_24) .cse355)) 0))))) (.cse10 (or (forall ((v_prenex_25 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_55 Int)) (let ((.cse352 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_55))) (let ((.cse353 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse352) v_prenex_25) (+ 4 v_arrayElimCell_55)))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse352 4 .cse353)) v_prenex_25) 4) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= .cse353 0))))) .cse68)) (.cse28 (or (forall ((v_prenex_25 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_55 Int)) (let ((.cse351 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_55)) (.cse349 (+ 4 v_arrayElimCell_55))) (let ((.cse350 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse351) v_prenex_25) .cse349))) (let ((.cse348 (store .cse351 4 .cse350))) (or (= (select .cse348 .cse349) 0) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse348) v_prenex_25) 4) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= .cse350 0)))))) .cse68)) (.cse30 (or (forall ((v_prenex_25 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_55 Int)) (let ((.cse346 (+ 4 v_arrayElimCell_55))) (let ((.cse345 (let ((.cse347 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_55))) (store .cse347 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse347) v_prenex_25) .cse346))))) (or (= (select .cse345 .cse346) 0) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse345) v_prenex_25) .cse346) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))))) .cse3)) (.cse31 (or (forall ((v_prenex_17 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_55 Int)) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_55)) v_prenex_17) (+ 4 v_arrayElimCell_55)) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) .cse68)) (.cse5 (forall ((v_prenex_13 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_55 Int)) (let ((.cse343 (+ 4 v_arrayElimCell_55))) (let ((.cse342 (let ((.cse344 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_55))) (store .cse344 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse344) v_prenex_13) .cse343))))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse342) v_prenex_13) .cse343) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select .cse342 .cse343) 0)))))) (.cse7 (or (forall ((v_prenex_13 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_55 Int)) (let ((.cse340 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_55))) (let ((.cse341 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse340) v_prenex_13) (+ 4 v_arrayElimCell_55)))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse340 4 .cse341)) v_prenex_13) 4) 0) (= .cse341 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))))) .cse68)) (.cse29 (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_55 Int)) (or (= (let ((.cse339 (+ 4 v_arrayElimCell_55))) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse338 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_55))) (store .cse338 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse338) |c_ULTIMATE.start_append_~item~0#1.base|) .cse339)))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse339)) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) .cse68)) (.cse2 (forall ((v_prenex_12 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_55 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (let ((.cse337 (+ 4 v_arrayElimCell_55))) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse336 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_55))) (store .cse336 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse336) v_prenex_12) .cse337)))) v_prenex_12) .cse337)) 0)))) (.cse43 (forall ((v_prenex_22 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_prenex_21 Int) (v_arrayElimCell_42 Int)) (let ((.cse334 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse333 (store .cse334 0 v_arrayElimCell_42))) (store .cse333 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse333) v_prenex_22) (+ 4 v_arrayElimCell_42))))) v_prenex_21) .cse14) 0) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse335 (store .cse334 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse335 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse335) |c_ULTIMATE.start_append_~item~0#1.base|) .cse14)))) v_prenex_21) .cse14) 0))))) (.cse82 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_14 Int) (v_arrayElimCell_42 Int)) (let ((.cse331 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|))) (let ((.cse329 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse332 (store .cse331 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse332 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse332) |c_ULTIMATE.start_append_~item~0#1.base|) .cse14)))) v_prenex_14))) (or (= (select .cse329 .cse14) 0) (= (select .cse329 4) 0) (= (select (let ((.cse330 (store .cse331 0 v_arrayElimCell_42))) (store .cse330 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse330) v_prenex_14) (+ 4 v_arrayElimCell_42)))) .cse14) 0))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (.cse83 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_14 Int) (v_arrayElimCell_42 Int)) (let ((.cse327 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse326 (store .cse327 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse326 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse326) |c_ULTIMATE.start_append_~item~0#1.base|) .cse14)))) v_prenex_14) .cse14) 0) (= (select (let ((.cse328 (store .cse327 0 v_arrayElimCell_42))) (store .cse328 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse328) v_prenex_14) (+ 4 v_arrayElimCell_42)))) .cse14) 0)))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (.cse84 (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_42 Int)) (let ((.cse324 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|))) (let ((.cse322 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse325 (store .cse324 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse325 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse325) |c_ULTIMATE.start_append_~item~0#1.base|) .cse14)))) v_prenex_14)) (.cse321 (+ 4 v_arrayElimCell_42))) (or (= (select (select |c_#memory_$Pointer$#2.offset| v_prenex_14) .cse321) 0) (= (select .cse322 .cse14) 0) (= (select .cse322 4) 0) (= (select (let ((.cse323 (store .cse324 0 v_arrayElimCell_42))) (store .cse323 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse323) v_prenex_14) .cse321))) .cse14) 0)))))))) (.cse85 (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_15 Int) (v_arrayElimCell_42 Int)) (let ((.cse319 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse318 (store .cse319 0 v_arrayElimCell_42))) (store .cse318 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse318) v_prenex_15) (+ 4 v_arrayElimCell_42))))) v_prenex_15) .cse14) 0) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse320 (store .cse319 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse320 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse320) |c_ULTIMATE.start_append_~item~0#1.base|) .cse14)))) v_prenex_15) .cse14) 0))))))) (.cse32 (= |c_ULTIMATE.start_main_~#list~0#1.offset| |c_ULTIMATE.start_append_~plist#1.offset|)) (.cse197 (and (or .cse39 .cse8) .cse316 .cse317)) (.cse132 (forall ((v_prenex_26 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_43 Int) (v_arrayElimCell_42 Int) (v_arrayElimCell_55 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse315 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_42))) (store .cse315 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse315) v_arrayElimCell_43) (+ 4 v_arrayElimCell_42))))) v_prenex_26) (+ 4 v_arrayElimCell_55)) 0)))) (.cse182 (or .cse3 (and .cse220 .cse254 .cse255 .cse256))) (.cse131 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_prenex_20 Int) (v_arrayElimCell_42 Int) (v_arrayElimCell_55 Int)) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse314 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_42))) (store .cse314 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse314) v_prenex_20) (+ 4 v_arrayElimCell_42))))) |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))))) (.cse192 (or (forall ((v_prenex_18 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_42 Int) (v_prenex_19 Int) (v_arrayElimCell_55 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= 0 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse313 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_42))) (store .cse313 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse313) v_prenex_19) (+ 4 v_arrayElimCell_42))))) v_prenex_18) (+ 4 v_arrayElimCell_55))))) .cse3)) (.cse189 (or (forall ((v_prenex_14 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_42 Int) (v_arrayElimCell_55 Int)) (let ((.cse310 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|))) (let ((.cse308 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse312 (store .cse310 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse312 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse312) |c_ULTIMATE.start_append_~item~0#1.base|) .cse14)))) v_prenex_14)) (.cse311 (+ 4 v_arrayElimCell_55))) (or (= (select .cse308 4) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (let ((.cse309 (store .cse310 0 v_arrayElimCell_42))) (store .cse309 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse309) v_prenex_14) (+ 4 v_arrayElimCell_42)))) .cse311) 0) (= (select .cse308 .cse311) 0))))) .cse39)) (.cse190 (or (forall ((v_prenex_14 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_42 Int) (v_arrayElimCell_55 Int)) (let ((.cse305 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|)) (.cse306 (+ 4 v_arrayElimCell_55))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (let ((.cse304 (store .cse305 0 v_arrayElimCell_42))) (store .cse304 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse304) v_prenex_14) (+ 4 v_arrayElimCell_42)))) .cse306) 0) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse307 (store .cse305 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse307 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse307) |c_ULTIMATE.start_append_~item~0#1.base|) .cse14)))) v_prenex_14) .cse306) 0)))) .cse39)) (.cse133 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_42 Int) (v_arrayElimCell_55 Int)) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse303 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_42))) (store .cse303 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse303) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_42))))) |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))))) (.cse191 (or .cse39 (forall ((v_prenex_15 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_42 Int) (v_arrayElimCell_55 Int)) (let ((.cse300 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|)) (.cse301 (+ 4 v_arrayElimCell_55))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse299 (store .cse300 0 v_arrayElimCell_42))) (store .cse299 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse299) v_prenex_15) (+ 4 v_arrayElimCell_42))))) v_prenex_15) .cse301) 0) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse302 (store .cse300 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse302 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse302) |c_ULTIMATE.start_append_~item~0#1.base|) .cse14)))) v_prenex_15) .cse301) 0)))))) (.cse193 (or (forall ((v_prenex_22 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_prenex_21 Int) (v_arrayElimCell_42 Int) (v_arrayElimCell_55 Int)) (let ((.cse296 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|)) (.cse297 (+ 4 v_arrayElimCell_55))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse295 (store .cse296 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse295 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse295) |c_ULTIMATE.start_append_~item~0#1.base|) .cse14)))) v_prenex_21) .cse297) 0) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse298 (store .cse296 0 v_arrayElimCell_42))) (store .cse298 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse298) v_prenex_22) (+ 4 v_arrayElimCell_42))))) v_prenex_21) .cse297) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) .cse39))) (and (or (and .cse0 (or (and .cse1 (or .cse2 .cse3) .cse4 (or .cse3 .cse5) (or .cse6 .cse3) .cse7) .cse8) .cse9 .cse10 (or .cse3 (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_20 Int) (v_arrayElimCell_55 Int)) (= (let ((.cse12 (+ 4 v_arrayElimCell_55))) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse11 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_55))) (store .cse11 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse11) v_prenex_20) .cse12)))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse12)) 0)))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_21 Int) (v_arrayElimCell_55 Int)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse13 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse13 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse13) |c_ULTIMATE.start_append_~item~0#1.base|) .cse14)))) v_prenex_21) (+ 4 v_arrayElimCell_55)) 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 (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_prenex_18 Int) (v_prenex_19 Int) (v_arrayElimCell_55 Int)) (= (let ((.cse16 (+ 4 v_arrayElimCell_55))) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse15 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_55))) (store .cse15 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse15) v_prenex_19) .cse16)))) v_prenex_18) .cse16)) 0)))) (or .cse17 .cse8))) (or (and (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_14 Int) (v_arrayElimCell_55 Int)) (let ((.cse21 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|))) (let ((.cse18 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse22 (store .cse21 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse22 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse22) |c_ULTIMATE.start_append_~item~0#1.base|) .cse14)))) v_prenex_14)) (.cse20 (+ 4 v_arrayElimCell_55))) (or (= (select .cse18 4) 0) (= (select (let ((.cse19 (store .cse21 0 v_arrayElimCell_55))) (store .cse19 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse19) v_prenex_14) .cse20))) .cse20) 0) (= (select .cse18 .cse20) 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_15 Int) (v_arrayElimCell_55 Int)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse23 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse23 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse23) |c_ULTIMATE.start_append_~item~0#1.base|) .cse14)))) v_prenex_15) (+ 4 v_arrayElimCell_55)) 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 (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_prenex_14 Int) (v_arrayElimCell_55 Int)) (let ((.cse26 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|)) (.cse25 (+ 4 v_arrayElimCell_55))) (or (= (select (let ((.cse24 (store .cse26 0 v_arrayElimCell_55))) (store .cse24 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse24) v_prenex_14) .cse25))) .cse25) 0) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse27 (store .cse26 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse27 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse27) |c_ULTIMATE.start_append_~item~0#1.base|) .cse14)))) v_prenex_14) .cse25) 0))))))) .cse3) .cse28 .cse29 .cse30 .cse31) .cse32) (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 ((.cse34 (let ((.cse35 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse35 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse35) v_prenex_13) .cse14))))) (let ((.cse33 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse34) v_prenex_13))) (or (= (select .cse33 4) 0) (= (select .cse34 .cse14) 0) (= 0 (select .cse33 .cse14)))))))) (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 ((.cse36 (let ((.cse37 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse37 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse37) v_prenex_13) .cse14))))) (or (= (select .cse36 .cse14) 0) (= 0 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse36) v_prenex_13) .cse14))))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_12 Int)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse38 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse38 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse38) v_prenex_12) .cse14)))) v_prenex_12) .cse14) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) .cse39 .cse8) (or .cse40 (and (or .cse3 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_42 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse41 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_42))) (store .cse41 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse41) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_42))))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse14) 0)))) (or (and (or .cse3 (forall ((v_prenex_18 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_42 Int) (v_prenex_19 Int)) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse42 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_42))) (store .cse42 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse42) v_prenex_19) (+ 4 v_arrayElimCell_42))))) v_prenex_18) .cse14) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (or .cse43 .cse39)) .cse32) (or .cse3 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_prenex_20 Int) (v_arrayElimCell_42 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse44 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_42))) (store .cse44 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse44) v_prenex_20) (+ 4 v_arrayElimCell_42))))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse14) 0)))) (or .cse32 (and (or .cse3 (and .cse45 .cse46 .cse47 .cse48)) (or .cse39 (forall ((v_prenex_15 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_42 Int)) (let ((.cse50 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse49 (store .cse50 0 v_arrayElimCell_42))) (store .cse49 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse49) v_prenex_15) (+ 4 v_arrayElimCell_42))))) v_prenex_15) .cse14) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse51 (store .cse50 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse51 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse51) |c_ULTIMATE.start_append_~item~0#1.base|) .cse14)))) v_prenex_15) .cse14) 0))))) (or .cse39 (forall ((v_prenex_14 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_42 Int)) (let ((.cse55 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|))) (let ((.cse53 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse56 (store .cse55 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse56 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse56) |c_ULTIMATE.start_append_~item~0#1.base|) .cse14)))) v_prenex_14)) (.cse52 (+ 4 v_arrayElimCell_42))) (or (= (select (select |c_#memory_$Pointer$#2.offset| v_prenex_14) .cse52) 0) (= (select .cse53 .cse14) 0) (= (select .cse53 4) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (let ((.cse54 (store .cse55 0 v_arrayElimCell_42))) (store .cse54 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse54) v_prenex_14) .cse52))) .cse14) 0)))))) (or (forall ((v_prenex_14 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_42 Int)) (let ((.cse59 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|))) (let ((.cse57 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse60 (store .cse59 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse60 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse60) |c_ULTIMATE.start_append_~item~0#1.base|) .cse14)))) v_prenex_14))) (or (= (select .cse57 .cse14) 0) (= (select .cse57 4) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (let ((.cse58 (store .cse59 0 v_arrayElimCell_42))) (store .cse58 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse58) v_prenex_14) (+ 4 v_arrayElimCell_42)))) .cse14) 0))))) .cse39) (or .cse39 (forall ((v_prenex_14 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_42 Int)) (let ((.cse62 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse61 (store .cse62 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse61 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse61) |c_ULTIMATE.start_append_~item~0#1.base|) .cse14)))) v_prenex_14) .cse14) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (let ((.cse63 (store .cse62 0 v_arrayElimCell_42))) (store .cse63 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse63) v_prenex_14) (+ 4 v_arrayElimCell_42)))) .cse14) 0))))) (or .cse64 .cse65 .cse66))))) (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse67 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse67 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse67) |c_ULTIMATE.start_append_~item~0#1.base|) .cse14)))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse14) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) .cse68) (or .cse32 (and .cse69 .cse70 .cse71 .cse72 .cse73 .cse74 .cse75 .cse76 .cse77 .cse78)) (or .cse39 .cse79 .cse8) (or .cse3 (and (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_20 Int) (v_arrayElimCell_42 Int)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse80 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_42))) (store .cse80 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse80) v_prenex_20) (+ 4 v_arrayElimCell_42))))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse14) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) (or (forall ((v_prenex_26 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_43 Int) (v_arrayElimCell_42 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse81 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_42))) (store .cse81 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse81) v_arrayElimCell_43) (+ 4 v_arrayElimCell_42))))) v_prenex_26) .cse14) 0))) .cse8) (or (and .cse45 .cse82 .cse83 .cse84 .cse46 .cse47 .cse48 .cse85) .cse32) (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_42 Int)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse86 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_42))) (store .cse86 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse86) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_42))))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse14) 0)))) (or (and (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_13 Int) (v_arrayElimCell_42 Int)) (let ((.cse87 (let ((.cse88 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_42))) (store .cse88 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse88) v_prenex_13) (+ 4 v_arrayElimCell_42)))))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse87) v_prenex_13) .cse14) 0) (= (select .cse87 .cse14) 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) (v_arrayElimCell_42 Int)) (let ((.cse90 (let ((.cse91 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_42))) (store .cse91 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse91) v_prenex_13) (+ 4 v_arrayElimCell_42)))))) (let ((.cse89 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse90) v_prenex_13))) (or (= (select .cse89 4) 0) (= (select .cse89 .cse14) 0) (= (select .cse90 .cse14) 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) (v_arrayElimCell_42 Int)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse92 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_42))) (store .cse92 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse92) v_prenex_12) (+ 4 v_arrayElimCell_42))))) v_prenex_12) .cse14) 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) (v_arrayElimCell_42 Int)) (let ((.cse96 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_42))) (let ((.cse93 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse96) v_prenex_13) (+ 4 v_arrayElimCell_42)))) (let ((.cse95 (store .cse96 4 .cse93))) (let ((.cse94 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse95) v_prenex_13))) (or (= .cse93 0) (= (select .cse94 4) 0) (= (select .cse94 .cse14) 0) (= (select .cse95 .cse14) 0))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) .cse8) (or .cse32 (and (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_22 Int) (v_prenex_21 Int) (v_arrayElimCell_42 Int)) (let ((.cse98 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse97 (store .cse98 0 v_arrayElimCell_42))) (store .cse97 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse97) v_prenex_22) (+ 4 v_arrayElimCell_42))))) v_prenex_21) .cse14) 0) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse99 (store .cse98 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse99 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse99) |c_ULTIMATE.start_append_~item~0#1.base|) .cse14)))) v_prenex_21) .cse14) 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_18 Int) (v_arrayElimCell_42 Int) (v_prenex_19 Int)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse100 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_42))) (store .cse100 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse100) v_prenex_19) (+ 4 v_arrayElimCell_42))))) v_prenex_18) .cse14) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))))))) (or .cse3 (and (or .cse79 .cse8) (or .cse32 (and (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_21 Int)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse101 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse101 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse101) |c_ULTIMATE.start_append_~item~0#1.base|) .cse14)))) v_prenex_21) .cse14) 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_18 Int) (v_prenex_19 Int)) (= 0 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse102 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse102 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse102) v_prenex_19) .cse14)))) v_prenex_18) .cse14))) (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 (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_prenex_20 Int)) (= 0 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse103 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse103 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse103) v_prenex_20) .cse14)))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse14))))))) (or (and (or .cse39 (forall ((v_prenex_12 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse104 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse104 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse104) v_prenex_12) .cse14)))) v_prenex_12) .cse14) 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 ((.cse105 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (let ((.cse106 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse105) v_prenex_13) .cse14))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse105 4 .cse106)) v_prenex_13) 4) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= .cse106 0))))) .cse68) (or (forall ((v_prenex_13 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (let ((.cse108 (let ((.cse109 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse109 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse109) v_prenex_13) .cse14))))) (let ((.cse107 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse108) v_prenex_13))) (or (= (select .cse107 4) 0) (= (select .cse108 .cse14) 0) (= 0 (select .cse107 .cse14)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))))) .cse39) (or (forall ((v_prenex_13 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (let ((.cse112 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (let ((.cse111 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse112) v_prenex_13) .cse14))) (let ((.cse110 (store .cse112 4 .cse111))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse110) v_prenex_13) 4) 0) (= (select .cse110 .cse14) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= .cse111 0)))))) .cse68) (or .cse39 (forall ((v_prenex_13 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (let ((.cse113 (let ((.cse114 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse114 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse114) v_prenex_13) .cse14))))) (or (= (select .cse113 .cse14) 0) (= 0 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse113) v_prenex_13) .cse14)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))))) (or (forall ((v_arrayElimCell_52 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|)) v_arrayElimCell_52) .cse14) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) .cse68)) .cse8) (or .cse32 (and (or .cse39 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_prenex_21 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse115 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse115 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse115) |c_ULTIMATE.start_append_~item~0#1.base|) .cse14)))) v_prenex_21) .cse14) 0)))) (or .cse3 (forall ((v_prenex_18 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_prenex_19 Int)) (or (= 0 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse116 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse116 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse116) v_prenex_19) .cse14)))) v_prenex_18) .cse14)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))))) (or (and .cse69 .cse70 .cse72 (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_15 Int)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse117 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse117 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse117) |c_ULTIMATE.start_append_~item~0#1.base|) .cse14)))) v_prenex_15) .cse14) 0)))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_14 Int)) (let ((.cse119 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (let ((.cse120 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse119))) (let ((.cse118 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse119 4 (select (select .cse120 |c_ULTIMATE.start_append_~item~0#1.base|) .cse14))) v_prenex_14))) (or (= (select .cse118 .cse14) 0) (= (select .cse118 4) 0) (= (select (store .cse119 4 (select (select .cse120 v_prenex_14) .cse14)) .cse14) 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_14 Int)) (let ((.cse121 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (let ((.cse122 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse121))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse121 4 (select (select .cse122 |c_ULTIMATE.start_append_~item~0#1.base|) .cse14))) v_prenex_14) .cse14) 0) (= (select (store .cse121 4 (select (select .cse122 v_prenex_14) .cse14)) .cse14) 0))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) .cse3) .cse76 .cse77 .cse78) .cse32) (or (and .cse71 .cse73 .cse74 .cse75 (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_24 Int)) (= 0 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse123 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse123 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse123) v_prenex_24) .cse14)))) v_prenex_24) .cse14))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_25 Int)) (let ((.cse124 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (let ((.cse125 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse124) v_prenex_25) .cse14))) (or (= (select (store .cse124 4 .cse125) .cse14) 0) (= 0 .cse125))))) (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_25 Int)) (let ((.cse128 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (let ((.cse127 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse128) v_prenex_25) .cse14))) (let ((.cse126 (store .cse128 4 .cse127))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse126) v_prenex_25) 4) 0) (= (select .cse126 .cse14) 0) (= 0 .cse127)))))) (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_25 Int)) (let ((.cse129 (let ((.cse130 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse130 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse130) v_prenex_25) .cse14))))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse129) v_prenex_25) .cse14) 0) (= (select .cse129 .cse14) 0)))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) .cse3)) .cse32) (or (and (or .cse131 .cse39) (or .cse132 .cse39) (or .cse133 .cse39) (or .cse17 .cse39) .cse1 (or (forall ((v_prenex_13 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_42 Int) (v_arrayElimCell_55 Int)) (let ((.cse138 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_42))) (let ((.cse136 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse138) v_prenex_13) (+ 4 v_arrayElimCell_42)))) (let ((.cse137 (store .cse138 4 .cse136))) (let ((.cse134 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse137) v_prenex_13)) (.cse135 (+ 4 v_arrayElimCell_55))) (or (= (select .cse134 .cse135) 0) (= .cse136 0) (= (select .cse134 4) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select .cse137 .cse135) 0))))))) .cse39) (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_prenex_20 Int) (v_arrayElimCell_55 Int)) (or (= (let ((.cse140 (+ 4 v_arrayElimCell_55))) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse139 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_55))) (store .cse139 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse139) v_prenex_20) .cse140)))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse140)) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) .cse39) (or (forall ((v_prenex_13 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_42 Int) (v_arrayElimCell_55 Int)) (let ((.cse143 (let ((.cse144 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_42))) (store .cse144 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse144) v_prenex_13) (+ 4 v_arrayElimCell_42)))))) (let ((.cse141 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse143) v_prenex_13)) (.cse142 (+ 4 v_arrayElimCell_55))) (or (= (select .cse141 .cse142) 0) (= (select .cse141 4) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select .cse143 .cse142) 0))))) .cse39) (or .cse6 .cse39) .cse4 (or (and .cse0 (or (forall ((v_prenex_14 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_55 Int)) (let ((.cse147 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|))) (let ((.cse145 (store .cse147 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (let ((.cse146 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse145) |c_ULTIMATE.start_append_~item~0#1.base|) .cse14))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse145 4 .cse146)) v_prenex_14) 4) 0) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse147 0 v_arrayElimCell_55)) v_prenex_14) (+ 4 v_arrayElimCell_55)) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= .cse146 0)))))) .cse68) .cse9 (or (forall ((v_prenex_23 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_55 Int)) (let ((.cse148 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse148 0 v_arrayElimCell_55)) v_prenex_23) (+ 4 v_arrayElimCell_55)) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse148 0 |c_ULTIMATE.start_append_~item~0#1.offset|)) |c_ULTIMATE.start_append_~item~0#1.base|) .cse14) 0)))) .cse68) .cse10 (or (forall ((v_prenex_14 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_55 Int)) (let ((.cse150 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|))) (let ((.cse153 (store .cse150 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (let ((.cse152 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse153) |c_ULTIMATE.start_append_~item~0#1.base|) .cse14))) (let ((.cse149 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse153 4 .cse152)) v_prenex_14)) (.cse151 (+ 4 v_arrayElimCell_55))) (or (= (select .cse149 4) 0) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse150 0 v_arrayElimCell_55)) v_prenex_14) .cse151) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= .cse152 0) (= (select .cse149 .cse151) 0))))))) .cse68) (or (forall ((v_prenex_15 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_55 Int)) (let ((.cse156 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|)) (.cse155 (+ 4 v_arrayElimCell_55))) (or (= 0 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse154 (store .cse156 0 v_arrayElimCell_55))) (store .cse154 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse154) v_prenex_15) .cse155)))) v_prenex_15) .cse155)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse157 (store .cse156 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse157 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse157) |c_ULTIMATE.start_append_~item~0#1.base|) .cse14)))) v_prenex_15) .cse155) 0)))) .cse39) (or .cse68 (forall ((v_prenex_14 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_55 Int)) (let ((.cse162 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|))) (let ((.cse163 (store .cse162 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (let ((.cse159 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse163) |c_ULTIMATE.start_append_~item~0#1.base|) .cse14))) (let ((.cse158 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse163 4 .cse159)) v_prenex_14)) (.cse161 (+ 4 v_arrayElimCell_55))) (or (= (select .cse158 4) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= .cse159 0) (= (select (let ((.cse160 (store .cse162 0 v_arrayElimCell_55))) (store .cse160 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse160) v_prenex_14) .cse161))) .cse161) 0) (= (select .cse158 .cse161) 0)))))))) .cse28 (or .cse39 (forall ((v_prenex_14 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_55 Int)) (let ((.cse167 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|))) (let ((.cse164 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse168 (store .cse167 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse168 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse168) |c_ULTIMATE.start_append_~item~0#1.base|) .cse14)))) v_prenex_14)) (.cse166 (+ 4 v_arrayElimCell_55))) (or (= (select .cse164 4) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (let ((.cse165 (store .cse167 0 v_arrayElimCell_55))) (store .cse165 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse165) v_prenex_14) .cse166))) .cse166) 0) (= (select .cse164 .cse166) 0)))))) .cse30 (or .cse39 (forall ((v_prenex_14 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_55 Int)) (let ((.cse171 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|)) (.cse170 (+ 4 v_arrayElimCell_55))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (let ((.cse169 (store .cse171 0 v_arrayElimCell_55))) (store .cse169 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse169) v_prenex_14) .cse170))) .cse170) 0) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse172 (store .cse171 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse172 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse172) |c_ULTIMATE.start_append_~item~0#1.base|) .cse14)))) v_prenex_14) .cse170) 0))))) .cse31) .cse32) (or (forall ((v_prenex_13 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_42 Int) (v_arrayElimCell_55 Int)) (let ((.cse173 (let ((.cse175 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_42))) (store .cse175 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse175) v_prenex_13) (+ 4 v_arrayElimCell_42))))) (.cse174 (+ 4 v_arrayElimCell_55))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse173) v_prenex_13) .cse174) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select .cse173 .cse174) 0)))) .cse39) (or .cse32 (and (or .cse3 (forall ((v_prenex_18 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_prenex_19 Int) (v_arrayElimCell_55 Int)) (or (= (let ((.cse177 (+ 4 v_arrayElimCell_55))) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse176 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_55))) (store .cse176 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse176) v_prenex_19) .cse177)))) v_prenex_18) .cse177)) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (or (forall ((v_prenex_22 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_prenex_21 Int) (v_arrayElimCell_55 Int)) (let ((.cse179 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|)) (.cse180 (+ 4 v_arrayElimCell_55))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse178 (store .cse179 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse178 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse178) |c_ULTIMATE.start_append_~item~0#1.base|) .cse14)))) v_prenex_21) .cse180) 0) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse181 (store .cse179 0 v_arrayElimCell_55))) (store .cse181 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse181) v_prenex_22) .cse180)))) v_prenex_21) .cse180) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) .cse39))) (or (and .cse182 (or .cse39 (forall ((v_prenex_14 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_42 Int) (v_arrayElimCell_55 Int)) (let ((.cse188 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|))) (let ((.cse185 (store .cse188 0 v_arrayElimCell_42))) (let ((.cse184 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse185) v_prenex_14) (+ 4 v_arrayElimCell_42))) (.cse183 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse187 (store .cse188 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse187 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse187) |c_ULTIMATE.start_append_~item~0#1.base|) .cse14)))) v_prenex_14)) (.cse186 (+ 4 v_arrayElimCell_55))) (or (= (select .cse183 4) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= .cse184 0) (= (select (store .cse185 4 .cse184) .cse186) 0) (= (select .cse183 .cse186) 0))))))) .cse189 .cse190 .cse191) .cse32) (or (and .cse192 .cse193) .cse32) (or (forall ((v_prenex_12 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_42 Int) (v_arrayElimCell_55 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse194 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_42))) (store .cse194 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse194) v_prenex_12) (+ 4 v_arrayElimCell_42))))) v_prenex_12) (+ 4 v_arrayElimCell_55)) 0))) .cse39) (or .cse5 .cse39) .cse7 .cse29 (or .cse2 .cse39)) .cse8) (or .cse64 .cse65 (and (or .cse43 .cse32) (or .cse32 (and .cse82 .cse83 .cse195 .cse84 .cse196 .cse85))) .cse40) (or .cse197 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_prenex_20 Int)) (or (= 0 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse198 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse198 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse198) v_prenex_20) .cse14)))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse14)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (or .cse32 (let ((.cse199 (and (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_16 Int) (v_arrayElimCell_55 Int)) (let ((.cse292 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse293 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse293 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse293) |c_ULTIMATE.start_append_~item~0#1.base|) .cse14)))) v_prenex_16))) (or (= (select .cse292 4) 0) (= (select .cse292 (+ 4 v_arrayElimCell_55)) 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 (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_prenex_16 Int) (v_arrayElimCell_55 Int)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse294 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse294 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse294) |c_ULTIMATE.start_append_~item~0#1.base|) .cse14)))) v_prenex_16) (+ 4 v_arrayElimCell_55)) 0))))))) (and (or .cse64 .cse65 .cse40 .cse199) (or .cse39 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_55 Int)) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse200 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse200 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse200) |c_ULTIMATE.start_append_~item~0#1.base|) .cse14)))) |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 .cse3 (and (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_25 Int) (v_arrayElimCell_55 Int)) (let ((.cse205 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (let ((.cse204 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse205) v_prenex_25) .cse14))) (let ((.cse202 (store .cse205 4 .cse204))) (let ((.cse201 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse202) v_prenex_25)) (.cse203 (+ 4 v_arrayElimCell_55))) (or (= (select .cse201 4) 0) (= (select .cse202 .cse203) 0) (= (select .cse201 .cse203) 0) (= 0 .cse204))))))) (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_25 Int) (v_arrayElimCell_55 Int)) (let ((.cse206 (let ((.cse208 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse208 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse208) v_prenex_25) .cse14)))) (.cse207 (+ 4 v_arrayElimCell_55))) (or (= (select .cse206 .cse207) 0) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse206) v_prenex_25) .cse207) 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_25 Int) (v_arrayElimCell_55 Int)) (let ((.cse212 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (let ((.cse211 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse212) v_prenex_25) .cse14))) (let ((.cse209 (store .cse212 4 .cse211)) (.cse210 (+ 4 v_arrayElimCell_55))) (or (= (select .cse209 .cse210) 0) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse209) v_prenex_25) .cse210) 0) (= 0 .cse211)))))) (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_24 Int) (v_arrayElimCell_55 Int)) (= 0 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse213 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse213 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse213) v_prenex_24) .cse14)))) v_prenex_24) (+ 4 v_arrayElimCell_55)))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))))) (or .cse39 (forall ((v_prenex_14 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_55 Int)) (let ((.cse214 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (let ((.cse215 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse214))) (let ((.cse217 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse214 4 (select (select .cse215 |c_ULTIMATE.start_append_~item~0#1.base|) .cse14))) v_prenex_14)) (.cse216 (+ 4 v_arrayElimCell_55))) (or (= (select (store .cse214 4 (select (select .cse215 v_prenex_14) .cse14)) .cse216) 0) (= (select .cse217 4) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select .cse217 .cse216) 0))))))) (or .cse3 (forall ((v_prenex_18 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_prenex_19 Int) (v_arrayElimCell_55 Int)) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse218 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse218 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse218) v_prenex_19) .cse14)))) v_prenex_18) (+ 4 v_arrayElimCell_55)) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_prenex_20 Int) (v_arrayElimCell_55 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse219 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse219 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse219) v_prenex_20) .cse14)))) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_55)) 0))) .cse197) (or (and .cse220 (or .cse8 (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) (v_arrayElimCell_42 Int) (v_arrayElimCell_55 Int)) (let ((.cse221 (let ((.cse223 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_42))) (store .cse223 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse223) v_prenex_13) (+ 4 v_arrayElimCell_42))))) (.cse222 (+ 4 v_arrayElimCell_55))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse221) v_prenex_13) .cse222) 0) (= (select .cse221 .cse222) 0)))))) (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_12 Int) (v_arrayElimCell_42 Int) (v_arrayElimCell_55 Int)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse224 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_42))) (store .cse224 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse224) v_prenex_12) (+ 4 v_arrayElimCell_42))))) v_prenex_12) (+ 4 v_arrayElimCell_55)) 0)))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_13 Int) (v_arrayElimCell_42 Int) (v_arrayElimCell_55 Int)) (let ((.cse229 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_42))) (let ((.cse227 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse229) v_prenex_13) (+ 4 v_arrayElimCell_42)))) (let ((.cse228 (store .cse229 4 .cse227))) (let ((.cse225 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse228) v_prenex_13)) (.cse226 (+ 4 v_arrayElimCell_55))) (or (= (select .cse225 .cse226) 0) (= .cse227 0) (= (select .cse225 4) 0) (= (select .cse228 .cse226) 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) (v_arrayElimCell_42 Int) (v_arrayElimCell_55 Int)) (let ((.cse232 (let ((.cse233 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_42))) (store .cse233 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse233) v_prenex_13) (+ 4 v_arrayElimCell_42)))))) (let ((.cse230 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse232) v_prenex_13)) (.cse231 (+ 4 v_arrayElimCell_55))) (or (= (select .cse230 .cse231) 0) (= (select .cse230 4) 0) (= (select .cse232 .cse231) 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 (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_prenex_20 Int) (v_arrayElimCell_42 Int) (v_arrayElimCell_55 Int)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse234 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_42))) (store .cse234 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse234) v_prenex_20) (+ 4 v_arrayElimCell_42))))) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_55)) 0)))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_18 Int) (v_arrayElimCell_42 Int) (v_prenex_19 Int) (v_arrayElimCell_55 Int)) (= 0 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse235 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_42))) (store .cse235 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse235) v_prenex_19) (+ 4 v_arrayElimCell_42))))) v_prenex_18) (+ 4 v_arrayElimCell_55)))) (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_22 Int) (v_prenex_21 Int) (v_arrayElimCell_42 Int) (v_arrayElimCell_55 Int)) (let ((.cse237 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|)) (.cse238 (+ 4 v_arrayElimCell_55))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse236 (store .cse237 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse236 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse236) |c_ULTIMATE.start_append_~item~0#1.base|) .cse14)))) v_prenex_21) .cse238) 0) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse239 (store .cse237 0 v_arrayElimCell_42))) (store .cse239 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse239) v_prenex_22) (+ 4 v_arrayElimCell_42))))) v_prenex_21) .cse238) 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 (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_prenex_14 Int) (v_arrayElimCell_42 Int) (v_arrayElimCell_55 Int)) (let ((.cse241 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|)) (.cse242 (+ 4 v_arrayElimCell_55))) (or (= (select (let ((.cse240 (store .cse241 0 v_arrayElimCell_42))) (store .cse240 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse240) v_prenex_14) (+ 4 v_arrayElimCell_42)))) .cse242) 0) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse243 (store .cse241 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse243 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse243) |c_ULTIMATE.start_append_~item~0#1.base|) .cse14)))) v_prenex_14) .cse242) 0)))))) (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_42 Int) (v_arrayElimCell_55 Int)) (let ((.cse247 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|))) (let ((.cse244 (+ 4 v_arrayElimCell_42)) (.cse245 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse249 (store .cse247 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse249 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse249) |c_ULTIMATE.start_append_~item~0#1.base|) .cse14)))) v_prenex_14)) (.cse248 (+ 4 v_arrayElimCell_55))) (or (= (select (select |c_#memory_$Pointer$#2.offset| v_prenex_14) .cse244) 0) (= (select .cse245 4) 0) (= (select (let ((.cse246 (store .cse247 0 v_arrayElimCell_42))) (store .cse246 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse246) v_prenex_14) .cse244))) .cse248) 0) (= (select .cse245 .cse248) 0))))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_15 Int) (v_arrayElimCell_42 Int) (v_arrayElimCell_55 Int)) (let ((.cse251 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|)) (.cse252 (+ 4 v_arrayElimCell_55))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse250 (store .cse251 0 v_arrayElimCell_42))) (store .cse250 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse250) v_prenex_15) (+ 4 v_arrayElimCell_42))))) v_prenex_15) .cse252) 0) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse253 (store .cse251 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse253 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse253) |c_ULTIMATE.start_append_~item~0#1.base|) .cse14)))) v_prenex_15) .cse252) 0)))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) .cse254 .cse255 .cse256 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_14 Int) (v_arrayElimCell_42 Int) (v_arrayElimCell_55 Int)) (let ((.cse259 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|))) (let ((.cse257 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse261 (store .cse259 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse261 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse261) |c_ULTIMATE.start_append_~item~0#1.base|) .cse14)))) v_prenex_14)) (.cse260 (+ 4 v_arrayElimCell_55))) (or (= (select .cse257 4) 0) (= (select (let ((.cse258 (store .cse259 0 v_arrayElimCell_42))) (store .cse258 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse258) v_prenex_14) (+ 4 v_arrayElimCell_42)))) .cse260) 0) (= (select .cse257 .cse260) 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_arrayElimCell_42 Int) (v_arrayElimCell_55 Int)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse262 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_42))) (store .cse262 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse262) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_42))))) |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 .cse132 .cse8)) .cse3) (or .cse39 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_prenex_21 Int) (v_arrayElimCell_55 Int)) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse263 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse263 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse263) |c_ULTIMATE.start_append_~item~0#1.base|) .cse14)))) v_prenex_21) (+ 4 v_arrayElimCell_55)) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (or .cse39 (forall ((v_prenex_14 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_55 Int)) (let ((.cse264 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (let ((.cse265 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse264)) (.cse266 (+ 4 v_arrayElimCell_55))) (or (= (select (store .cse264 4 (select (select .cse265 v_prenex_14) .cse14)) .cse266) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse264 4 (select (select .cse265 |c_ULTIMATE.start_append_~item~0#1.base|) .cse14))) v_prenex_14) .cse266) 0)))))) (or (forall ((v_prenex_15 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_55 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse267 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse267 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse267) |c_ULTIMATE.start_append_~item~0#1.base|) .cse14)))) v_prenex_15) (+ 4 v_arrayElimCell_55)) 0))) .cse39) (or .cse39 (forall ((v_prenex_26 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_43 Int) (v_arrayElimCell_55 Int)) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse268 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse268 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse268) v_arrayElimCell_43) .cse14)))) v_prenex_26) (+ 4 v_arrayElimCell_55)) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) .cse8) (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_12 Int) (v_arrayElimCell_55 Int)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse269 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse269 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse269) v_prenex_12) .cse14)))) v_prenex_12) (+ 4 v_arrayElimCell_55)) 0)))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_13 Int) (v_arrayElimCell_55 Int)) (let ((.cse271 (let ((.cse273 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse273 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse273) v_prenex_13) .cse14))))) (let ((.cse270 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse271) v_prenex_13)) (.cse272 (+ 4 v_arrayElimCell_55))) (or (= (select .cse270 4) 0) (= (select .cse271 .cse272) 0) (= (select .cse270 .cse272) 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) (v_arrayElimCell_55 Int)) (let ((.cse278 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (let ((.cse275 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse278) v_prenex_13) .cse14))) (let ((.cse276 (store .cse278 4 .cse275))) (let ((.cse274 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse276) v_prenex_13)) (.cse277 (+ 4 v_arrayElimCell_55))) (or (= (select .cse274 4) 0) (= .cse275 0) (= (select .cse276 .cse277) 0) (= (select .cse274 .cse277) 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) (v_arrayElimCell_55 Int)) (let ((.cse279 (let ((.cse281 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse281 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse281) v_prenex_13) .cse14)))) (.cse280 (+ 4 v_arrayElimCell_55))) (or (= (select .cse279 .cse280) 0) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse279) v_prenex_13) .cse280) 0)))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) .cse39 .cse8) (or (and .cse182 (or .cse131 .cse3) .cse192 .cse189 .cse190 (or .cse3 .cse133) (or .cse64 .cse65 .cse199) (or .cse39 (forall ((v_prenex_14 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_42 Int) (v_arrayElimCell_55 Int)) (let ((.cse285 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|))) (let ((.cse282 (+ 4 v_arrayElimCell_42)) (.cse283 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse287 (store .cse285 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse287 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse287) |c_ULTIMATE.start_append_~item~0#1.base|) .cse14)))) v_prenex_14)) (.cse286 (+ 4 v_arrayElimCell_55))) (or (= (select (select |c_#memory_$Pointer$#2.offset| v_prenex_14) .cse282) 0) (= (select .cse283 4) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (let ((.cse284 (store .cse285 0 v_arrayElimCell_42))) (store .cse284 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse284) v_prenex_14) .cse282))) .cse286) 0) (= (select .cse283 .cse286) 0)))))) .cse191 .cse193) .cse40) (or (forall ((v_prenex_14 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_55 Int)) (let ((.cse288 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (let ((.cse289 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse288))) (let ((.cse291 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse288 4 (select (select .cse289 |c_ULTIMATE.start_append_~item~0#1.base|) .cse14))) v_prenex_14)) (.cse290 (+ 4 v_arrayElimCell_55))) (or (= (select (store .cse288 4 (select (select .cse289 v_prenex_14) .cse14)) .cse290) 0) (= (select (select |c_#memory_$Pointer$#2.offset| v_prenex_14) .cse14) 0) (= (select .cse291 4) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select .cse291 .cse290) 0)))))) .cse39))))))))) is different from true