./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety/test-0232-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety/test-0232-3.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 01db24b1589b54f78ea9acc56548e9023dc94ca9b67a9629bccf00110df292f7 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 07:43:55,881 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 07:43:55,935 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-09 07:43:55,938 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 07:43:55,939 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 07:43:55,959 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 07:43:55,961 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 07:43:55,961 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 07:43:55,962 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 07:43:55,962 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 07:43:55,963 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 07:43:55,963 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 07:43:55,963 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 07:43:55,965 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 07:43:55,965 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 07:43:55,965 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 07:43:55,965 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 07:43:55,966 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 07:43:55,966 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 07:43:55,966 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 07:43:55,966 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 07:43:55,967 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 07:43:55,967 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 07:43:55,967 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 07:43:55,967 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 07:43:55,967 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 07:43:55,968 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 07:43:55,968 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 07:43:55,968 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 07:43:55,968 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 07:43:55,968 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 07:43:55,969 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 07:43:55,969 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 07:43:55,969 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:43:55,969 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 07:43:55,969 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 07:43:55,969 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 07:43:55,969 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 07:43:55,969 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 07:43:55,970 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 07:43:55,970 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 07:43:55,970 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 07:43:55,970 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 01db24b1589b54f78ea9acc56548e9023dc94ca9b67a9629bccf00110df292f7 [2024-11-09 07:43:56,205 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 07:43:56,223 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 07:43:56,225 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 07:43:56,226 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 07:43:56,226 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 07:43:56,227 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/test-0232-3.i [2024-11-09 07:43:57,405 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 07:43:57,594 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 07:43:57,595 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0232-3.i [2024-11-09 07:43:57,606 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb0652a2d/98b31dc4bcef4265a9055dece4addbb1/FLAG2b36ff3f7 [2024-11-09 07:43:57,617 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb0652a2d/98b31dc4bcef4265a9055dece4addbb1 [2024-11-09 07:43:57,619 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 07:43:57,620 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 07:43:57,620 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 07:43:57,621 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 07:43:57,625 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 07:43:57,626 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:43:57" (1/1) ... [2024-11-09 07:43:57,628 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18d3b2c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:43:57, skipping insertion in model container [2024-11-09 07:43:57,628 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:43:57" (1/1) ... [2024-11-09 07:43:57,655 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 07:43:57,909 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:43:57,920 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 07:43:57,952 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:43:57,977 INFO L204 MainTranslator]: Completed translation [2024-11-09 07:43:57,977 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:43:57 WrapperNode [2024-11-09 07:43:57,977 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 07:43:57,978 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 07:43:57,978 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 07:43:57,978 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 07:43:57,983 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:43:57" (1/1) ... [2024-11-09 07:43:57,995 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:43:57" (1/1) ... [2024-11-09 07:43:58,012 INFO L138 Inliner]: procedures = 126, calls = 38, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 98 [2024-11-09 07:43:58,012 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 07:43:58,013 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 07:43:58,013 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 07:43:58,014 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 07:43:58,023 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:43:57" (1/1) ... [2024-11-09 07:43:58,023 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:43:57" (1/1) ... [2024-11-09 07:43:58,028 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:43:57" (1/1) ... [2024-11-09 07:43:58,042 INFO L175 MemorySlicer]: Split 24 memory accesses to 3 slices as follows [2, 9, 13]. 54 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 5 writes are split as follows [0, 2, 3]. [2024-11-09 07:43:58,042 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:43:57" (1/1) ... [2024-11-09 07:43:58,042 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:43:57" (1/1) ... [2024-11-09 07:43:58,049 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:43:57" (1/1) ... [2024-11-09 07:43:58,051 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:43:57" (1/1) ... [2024-11-09 07:43:58,052 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:43:57" (1/1) ... [2024-11-09 07:43:58,053 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:43:57" (1/1) ... [2024-11-09 07:43:58,056 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 07:43:58,059 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 07:43:58,059 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 07:43:58,059 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 07:43:58,060 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:43:57" (1/1) ... [2024-11-09 07:43:58,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:43:58,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:43:58,084 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 07:43:58,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 07:43:58,118 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 07:43:58,118 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 07:43:58,118 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 07:43:58,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 07:43:58,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-09 07:43:58,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-09 07:43:58,118 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 07:43:58,119 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-09 07:43:58,119 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-09 07:43:58,119 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 07:43:58,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-09 07:43:58,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-09 07:43:58,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-09 07:43:58,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 07:43:58,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 07:43:58,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-09 07:43:58,119 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 07:43:58,119 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 07:43:58,213 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 07:43:58,215 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 07:43:58,469 INFO L? ?]: Removed 116 outVars from TransFormulas that were not future-live. [2024-11-09 07:43:58,469 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 07:43:58,482 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 07:43:58,483 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-09 07:43:58,483 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:43:58 BoogieIcfgContainer [2024-11-09 07:43:58,483 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 07:43:58,485 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 07:43:58,485 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 07:43:58,487 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 07:43:58,487 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 07:43:57" (1/3) ... [2024-11-09 07:43:58,488 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@335a69df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:43:58, skipping insertion in model container [2024-11-09 07:43:58,488 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:43:57" (2/3) ... [2024-11-09 07:43:58,488 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@335a69df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:43:58, skipping insertion in model container [2024-11-09 07:43:58,488 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:43:58" (3/3) ... [2024-11-09 07:43:58,490 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0232-3.i [2024-11-09 07:43:58,501 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 07:43:58,501 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 55 error locations. [2024-11-09 07:43:58,564 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 07:43:58,571 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;@2541408f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 07:43:58,572 INFO L334 AbstractCegarLoop]: Starting to check reachability of 55 error locations. [2024-11-09 07:43:58,577 INFO L276 IsEmpty]: Start isEmpty. Operand has 109 states, 53 states have (on average 2.169811320754717) internal successors, (115), 108 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:43:58,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-09 07:43:58,583 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:43:58,583 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-09 07:43:58,584 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-11-09 07:43:58,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:43:58,588 INFO L85 PathProgramCache]: Analyzing trace with hash 925637, now seen corresponding path program 1 times [2024-11-09 07:43:58,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:43:58,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935111927] [2024-11-09 07:43:58,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:43:58,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:43:58,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:43:58,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:43:58,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:43:58,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935111927] [2024-11-09 07:43:58,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935111927] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:43:58,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:43:58,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:43:58,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611765672] [2024-11-09 07:43:58,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:43:58,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:43:58,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:43:58,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:43:58,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:43:58,839 INFO L87 Difference]: Start difference. First operand has 109 states, 53 states have (on average 2.169811320754717) internal successors, (115), 108 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:43:58,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:43:58,980 INFO L93 Difference]: Finished difference Result 102 states and 107 transitions. [2024-11-09 07:43:58,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:43:58,982 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-09 07:43:58,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:43:58,987 INFO L225 Difference]: With dead ends: 102 [2024-11-09 07:43:58,987 INFO L226 Difference]: Without dead ends: 100 [2024-11-09 07:43:58,988 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:43:58,992 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 96 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:43:58,992 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 96 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:43:59,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-09 07:43:59,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2024-11-09 07:43:59,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 53 states have (on average 1.9811320754716981) internal successors, (105), 99 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:43:59,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 105 transitions. [2024-11-09 07:43:59,026 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 105 transitions. Word has length 4 [2024-11-09 07:43:59,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:43:59,026 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 105 transitions. [2024-11-09 07:43:59,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:43:59,026 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 105 transitions. [2024-11-09 07:43:59,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-09 07:43:59,026 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:43:59,026 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-09 07:43:59,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 07:43:59,027 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-11-09 07:43:59,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:43:59,027 INFO L85 PathProgramCache]: Analyzing trace with hash 925638, now seen corresponding path program 1 times [2024-11-09 07:43:59,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:43:59,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354487721] [2024-11-09 07:43:59,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:43:59,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:43:59,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:43:59,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:43:59,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:43:59,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354487721] [2024-11-09 07:43:59,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354487721] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:43:59,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:43:59,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:43:59,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437491948] [2024-11-09 07:43:59,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:43:59,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:43:59,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:43:59,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:43:59,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:43:59,202 INFO L87 Difference]: Start difference. First operand 100 states and 105 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:43:59,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:43:59,344 INFO L93 Difference]: Finished difference Result 121 states and 128 transitions. [2024-11-09 07:43:59,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:43:59,344 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-09 07:43:59,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:43:59,345 INFO L225 Difference]: With dead ends: 121 [2024-11-09 07:43:59,345 INFO L226 Difference]: Without dead ends: 121 [2024-11-09 07:43:59,346 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:43:59,346 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 87 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:43:59,347 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 108 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:43:59,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-09 07:43:59,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 103. [2024-11-09 07:43:59,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 61 states have (on average 1.8360655737704918) internal successors, (112), 102 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:43:59,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 112 transitions. [2024-11-09 07:43:59,354 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 112 transitions. Word has length 4 [2024-11-09 07:43:59,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:43:59,354 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 112 transitions. [2024-11-09 07:43:59,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:43:59,354 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 112 transitions. [2024-11-09 07:43:59,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-09 07:43:59,354 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:43:59,354 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-09 07:43:59,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 07:43:59,354 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-11-09 07:43:59,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:43:59,355 INFO L85 PathProgramCache]: Analyzing trace with hash 28694727, now seen corresponding path program 1 times [2024-11-09 07:43:59,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:43:59,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996602377] [2024-11-09 07:43:59,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:43:59,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:43:59,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:43:59,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:43:59,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:43:59,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996602377] [2024-11-09 07:43:59,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996602377] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:43:59,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:43:59,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:43:59,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701745348] [2024-11-09 07:43:59,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:43:59,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:43:59,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:43:59,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:43:59,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:43:59,400 INFO L87 Difference]: Start difference. First operand 103 states and 112 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:43:59,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:43:59,465 INFO L93 Difference]: Finished difference Result 99 states and 108 transitions. [2024-11-09 07:43:59,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:43:59,465 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-09 07:43:59,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:43:59,466 INFO L225 Difference]: With dead ends: 99 [2024-11-09 07:43:59,466 INFO L226 Difference]: Without dead ends: 99 [2024-11-09 07:43:59,466 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:43:59,467 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 11 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:43:59,467 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 121 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:43:59,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-09 07:43:59,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-11-09 07:43:59,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 61 states have (on average 1.7704918032786885) internal successors, (108), 98 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:43:59,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 108 transitions. [2024-11-09 07:43:59,476 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 108 transitions. Word has length 5 [2024-11-09 07:43:59,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:43:59,476 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 108 transitions. [2024-11-09 07:43:59,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:43:59,476 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 108 transitions. [2024-11-09 07:43:59,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-09 07:43:59,477 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:43:59,477 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-09 07:43:59,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 07:43:59,477 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-11-09 07:43:59,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:43:59,478 INFO L85 PathProgramCache]: Analyzing trace with hash 28694728, now seen corresponding path program 1 times [2024-11-09 07:43:59,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:43:59,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137925197] [2024-11-09 07:43:59,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:43:59,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:43:59,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:43:59,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:43:59,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:43:59,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137925197] [2024-11-09 07:43:59,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137925197] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:43:59,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:43:59,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:43:59,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321865830] [2024-11-09 07:43:59,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:43:59,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:43:59,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:43:59,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:43:59,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:43:59,545 INFO L87 Difference]: Start difference. First operand 99 states and 108 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:43:59,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:43:59,591 INFO L93 Difference]: Finished difference Result 95 states and 104 transitions. [2024-11-09 07:43:59,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:43:59,592 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-09 07:43:59,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:43:59,593 INFO L225 Difference]: With dead ends: 95 [2024-11-09 07:43:59,593 INFO L226 Difference]: Without dead ends: 95 [2024-11-09 07:43:59,594 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:43:59,595 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 11 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:43:59,597 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 128 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:43:59,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-09 07:43:59,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-11-09 07:43:59,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 61 states have (on average 1.7049180327868851) internal successors, (104), 94 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:43:59,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 104 transitions. [2024-11-09 07:43:59,604 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 104 transitions. Word has length 5 [2024-11-09 07:43:59,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:43:59,605 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 104 transitions. [2024-11-09 07:43:59,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:43:59,605 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 104 transitions. [2024-11-09 07:43:59,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-09 07:43:59,605 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:43:59,605 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:43:59,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 07:43:59,606 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-11-09 07:43:59,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:43:59,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1328641136, now seen corresponding path program 1 times [2024-11-09 07:43:59,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:43:59,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566638496] [2024-11-09 07:43:59,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:43:59,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:43:59,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:43:59,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:43:59,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:43:59,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566638496] [2024-11-09 07:43:59,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566638496] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:43:59,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:43:59,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 07:43:59,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647513939] [2024-11-09 07:43:59,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:43:59,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 07:43:59,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:43:59,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 07:43:59,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:43:59,831 INFO L87 Difference]: Start difference. First operand 95 states and 104 transitions. Second operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:43:59,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:43:59,964 INFO L93 Difference]: Finished difference Result 104 states and 113 transitions. [2024-11-09 07:43:59,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 07:43:59,964 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-09 07:43:59,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:43:59,965 INFO L225 Difference]: With dead ends: 104 [2024-11-09 07:43:59,965 INFO L226 Difference]: Without dead ends: 104 [2024-11-09 07:43:59,965 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-09 07:43:59,966 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 18 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:43:59,966 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 460 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:43:59,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-09 07:43:59,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 101. [2024-11-09 07:43:59,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 67 states have (on average 1.6417910447761195) internal successors, (110), 100 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:43:59,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 110 transitions. [2024-11-09 07:43:59,973 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 110 transitions. Word has length 10 [2024-11-09 07:43:59,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:43:59,973 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 110 transitions. [2024-11-09 07:43:59,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:43:59,973 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 110 transitions. [2024-11-09 07:43:59,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-09 07:43:59,974 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:43:59,974 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:43:59,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 07:43:59,976 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-11-09 07:43:59,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:43:59,977 INFO L85 PathProgramCache]: Analyzing trace with hash 2075015976, now seen corresponding path program 1 times [2024-11-09 07:43:59,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:43:59,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791483839] [2024-11-09 07:43:59,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:43:59,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:43:59,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:44:00,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:44:00,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:44:00,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791483839] [2024-11-09 07:44:00,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791483839] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:44:00,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:44:00,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:44:00,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249018567] [2024-11-09 07:44:00,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:44:00,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:44:00,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:44:00,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:44:00,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:44:00,098 INFO L87 Difference]: Start difference. First operand 101 states and 110 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:44:00,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:44:00,230 INFO L93 Difference]: Finished difference Result 121 states and 128 transitions. [2024-11-09 07:44:00,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:44:00,233 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-09 07:44:00,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:44:00,234 INFO L225 Difference]: With dead ends: 121 [2024-11-09 07:44:00,234 INFO L226 Difference]: Without dead ends: 121 [2024-11-09 07:44:00,234 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:44:00,235 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 68 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:44:00,235 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 165 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:44:00,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-09 07:44:00,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 100. [2024-11-09 07:44:00,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 67 states have (on average 1.626865671641791) internal successors, (109), 99 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) [2024-11-09 07:44:00,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 109 transitions. [2024-11-09 07:44:00,243 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 109 transitions. Word has length 18 [2024-11-09 07:44:00,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:44:00,243 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 109 transitions. [2024-11-09 07:44:00,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:44:00,243 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 109 transitions. [2024-11-09 07:44:00,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-09 07:44:00,244 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:44:00,244 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:44:00,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 07:44:00,244 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-11-09 07:44:00,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:44:00,244 INFO L85 PathProgramCache]: Analyzing trace with hash 2075015977, now seen corresponding path program 1 times [2024-11-09 07:44:00,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:44:00,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857238703] [2024-11-09 07:44:00,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:44:00,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:44:00,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:44:00,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:44:00,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:44:00,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857238703] [2024-11-09 07:44:00,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857238703] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:44:00,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:44:00,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:44:00,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399316170] [2024-11-09 07:44:00,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:44:00,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:44:00,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:44:00,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:44:00,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:44:00,442 INFO L87 Difference]: Start difference. First operand 100 states and 109 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:44:00,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:44:00,557 INFO L93 Difference]: Finished difference Result 122 states and 133 transitions. [2024-11-09 07:44:00,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:44:00,558 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-09 07:44:00,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:44:00,558 INFO L225 Difference]: With dead ends: 122 [2024-11-09 07:44:00,558 INFO L226 Difference]: Without dead ends: 122 [2024-11-09 07:44:00,559 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:44:00,560 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 77 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:44:00,562 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 169 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:44:00,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-09 07:44:00,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 99. [2024-11-09 07:44:00,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 67 states have (on average 1.6119402985074627) internal successors, (108), 98 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:44:00,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 108 transitions. [2024-11-09 07:44:00,568 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 108 transitions. Word has length 18 [2024-11-09 07:44:00,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:44:00,568 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 108 transitions. [2024-11-09 07:44:00,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:44:00,568 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 108 transitions. [2024-11-09 07:44:00,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 07:44:00,569 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:44:00,569 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:44:00,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 07:44:00,569 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-11-09 07:44:00,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:44:00,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1258101389, now seen corresponding path program 1 times [2024-11-09 07:44:00,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:44:00,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780847833] [2024-11-09 07:44:00,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:44:00,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:44:00,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:44:00,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:44:00,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:44:00,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780847833] [2024-11-09 07:44:00,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780847833] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:44:00,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:44:00,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:44:00,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289304809] [2024-11-09 07:44:00,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:44:00,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:44:00,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:44:00,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:44:00,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:44:00,682 INFO L87 Difference]: Start difference. First operand 99 states and 108 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:44:00,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:44:00,749 INFO L93 Difference]: Finished difference Result 94 states and 98 transitions. [2024-11-09 07:44:00,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:44:00,750 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-09 07:44:00,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:44:00,750 INFO L225 Difference]: With dead ends: 94 [2024-11-09 07:44:00,750 INFO L226 Difference]: Without dead ends: 94 [2024-11-09 07:44:00,750 INFO L431 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 [2024-11-09 07:44:00,751 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 43 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:44:00,751 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 224 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:44:00,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-09 07:44:00,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 91. [2024-11-09 07:44:00,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 59 states have (on average 1.6101694915254237) internal successors, (95), 90 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:44:00,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 95 transitions. [2024-11-09 07:44:00,757 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 95 transitions. Word has length 20 [2024-11-09 07:44:00,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:44:00,757 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 95 transitions. [2024-11-09 07:44:00,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:44:00,757 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 95 transitions. [2024-11-09 07:44:00,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-09 07:44:00,759 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:44:00,759 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:44:00,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 07:44:00,759 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-11-09 07:44:00,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:44:00,759 INFO L85 PathProgramCache]: Analyzing trace with hash -663319494, now seen corresponding path program 1 times [2024-11-09 07:44:00,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:44:00,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531989642] [2024-11-09 07:44:00,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:44:00,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:44:00,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:44:00,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:44:00,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:44:00,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531989642] [2024-11-09 07:44:00,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531989642] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:44:00,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:44:00,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:44:00,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936795534] [2024-11-09 07:44:00,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:44:00,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:44:00,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:44:00,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:44:00,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:44:00,824 INFO L87 Difference]: Start difference. First operand 91 states and 95 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:44:00,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:44:00,904 INFO L93 Difference]: Finished difference Result 90 states and 94 transitions. [2024-11-09 07:44:00,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:44:00,904 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-09 07:44:00,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:44:00,905 INFO L225 Difference]: With dead ends: 90 [2024-11-09 07:44:00,905 INFO L226 Difference]: Without dead ends: 90 [2024-11-09 07:44:00,905 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:44:00,906 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 8 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:44:00,906 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 208 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:44:00,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-09 07:44:00,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-11-09 07:44:00,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 59 states have (on average 1.5932203389830508) internal successors, (94), 89 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:44:00,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 94 transitions. [2024-11-09 07:44:00,908 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 94 transitions. Word has length 21 [2024-11-09 07:44:00,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:44:00,908 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 94 transitions. [2024-11-09 07:44:00,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:44:00,908 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 94 transitions. [2024-11-09 07:44:00,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-09 07:44:00,909 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:44:00,909 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:44:00,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 07:44:00,909 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-11-09 07:44:00,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:44:00,909 INFO L85 PathProgramCache]: Analyzing trace with hash -663319493, now seen corresponding path program 1 times [2024-11-09 07:44:00,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:44:00,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420007094] [2024-11-09 07:44:00,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:44:00,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:44:00,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:44:01,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:44:01,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:44:01,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420007094] [2024-11-09 07:44:01,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420007094] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:44:01,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:44:01,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 07:44:01,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914020427] [2024-11-09 07:44:01,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:44:01,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 07:44:01,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:44:01,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 07:44:01,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:44:01,147 INFO L87 Difference]: Start difference. First operand 90 states and 94 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:44:01,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:44:01,289 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2024-11-09 07:44:01,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 07:44:01,289 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-09 07:44:01,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:44:01,290 INFO L225 Difference]: With dead ends: 92 [2024-11-09 07:44:01,290 INFO L226 Difference]: Without dead ends: 92 [2024-11-09 07:44:01,290 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-09 07:44:01,290 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 40 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:44:01,290 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 269 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:44:01,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-09 07:44:01,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 89. [2024-11-09 07:44:01,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 59 states have (on average 1.576271186440678) internal successors, (93), 88 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:44:01,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 93 transitions. [2024-11-09 07:44:01,293 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 93 transitions. Word has length 21 [2024-11-09 07:44:01,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:44:01,293 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 93 transitions. [2024-11-09 07:44:01,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:44:01,293 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2024-11-09 07:44:01,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-09 07:44:01,293 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:44:01,293 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:44:01,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 07:44:01,294 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-11-09 07:44:01,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:44:01,294 INFO L85 PathProgramCache]: Analyzing trace with hash 911932203, now seen corresponding path program 1 times [2024-11-09 07:44:01,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:44:01,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416045775] [2024-11-09 07:44:01,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:44:01,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:44:01,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:44:01,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:44:01,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:44:01,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416045775] [2024-11-09 07:44:01,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416045775] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:44:01,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:44:01,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 07:44:01,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980910894] [2024-11-09 07:44:01,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:44:01,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 07:44:01,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:44:01,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 07:44:01,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:44:01,512 INFO L87 Difference]: Start difference. First operand 89 states and 93 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:44:01,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:44:01,690 INFO L93 Difference]: Finished difference Result 130 states and 140 transitions. [2024-11-09 07:44:01,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 07:44:01,690 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-11-09 07:44:01,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:44:01,691 INFO L225 Difference]: With dead ends: 130 [2024-11-09 07:44:01,691 INFO L226 Difference]: Without dead ends: 130 [2024-11-09 07:44:01,691 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2024-11-09 07:44:01,691 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 42 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:44:01,691 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 391 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:44:01,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-11-09 07:44:01,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 103. [2024-11-09 07:44:01,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 73 states have (on average 1.4794520547945205) internal successors, (108), 102 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:44:01,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 108 transitions. [2024-11-09 07:44:01,700 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 108 transitions. Word has length 22 [2024-11-09 07:44:01,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:44:01,700 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 108 transitions. [2024-11-09 07:44:01,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:44:01,700 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 108 transitions. [2024-11-09 07:44:01,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-09 07:44:01,701 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:44:01,701 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:44:01,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 07:44:01,701 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-11-09 07:44:01,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:44:01,701 INFO L85 PathProgramCache]: Analyzing trace with hash -428723026, now seen corresponding path program 1 times [2024-11-09 07:44:01,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:44:01,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837611549] [2024-11-09 07:44:01,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:44:01,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:44:01,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:44:01,919 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:44:01,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:44:01,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837611549] [2024-11-09 07:44:01,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837611549] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:44:01,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [707703820] [2024-11-09 07:44:01,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:44:01,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:44:01,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:44:01,922 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:44:01,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 07:44:02,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:44:02,036 INFO L255 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-09 07:44:02,040 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:44:02,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 07:44:02,187 INFO L349 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2024-11-09 07:44:02,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 24 [2024-11-09 07:44:02,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-09 07:44:02,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 07:44:02,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-09 07:44:02,278 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:44:02,279 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:44:02,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2024-11-09 07:44:02,691 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:44:02,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 135 treesize of output 339 [2024-11-09 07:44:03,082 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:44:03,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [707703820] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:44:03,083 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:44:03,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2024-11-09 07:44:03,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500128827] [2024-11-09 07:44:03,083 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:44:03,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-09 07:44:03,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:44:03,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-09 07:44:03,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2024-11-09 07:44:03,084 INFO L87 Difference]: Start difference. First operand 103 states and 108 transitions. Second operand has 16 states, 15 states have (on average 2.533333333333333) internal successors, (38), 16 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:44:03,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:44:03,417 INFO L93 Difference]: Finished difference Result 105 states and 110 transitions. [2024-11-09 07:44:03,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 07:44:03,418 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.533333333333333) internal successors, (38), 16 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-11-09 07:44:03,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:44:03,418 INFO L225 Difference]: With dead ends: 105 [2024-11-09 07:44:03,418 INFO L226 Difference]: Without dead ends: 105 [2024-11-09 07:44:03,419 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2024-11-09 07:44:03,419 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 60 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 536 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:44:03,419 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 497 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 536 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 07:44:03,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-09 07:44:03,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 102. [2024-11-09 07:44:03,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 73 states have (on average 1.4657534246575343) internal successors, (107), 101 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:44:03,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 107 transitions. [2024-11-09 07:44:03,421 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 107 transitions. Word has length 22 [2024-11-09 07:44:03,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:44:03,422 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 107 transitions. [2024-11-09 07:44:03,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.533333333333333) internal successors, (38), 16 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:44:03,422 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 107 transitions. [2024-11-09 07:44:03,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-09 07:44:03,425 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:44:03,425 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:44:03,440 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-09 07:44:03,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-09 07:44:03,626 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-11-09 07:44:03,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:44:03,627 INFO L85 PathProgramCache]: Analyzing trace with hash -428723025, now seen corresponding path program 1 times [2024-11-09 07:44:03,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:44:03,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590066216] [2024-11-09 07:44:03,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:44:03,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:44:03,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:44:03,903 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:44:03,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:44:03,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590066216] [2024-11-09 07:44:03,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590066216] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:44:03,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [420004953] [2024-11-09 07:44:03,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:44:03,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:44:03,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:44:03,905 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:44:03,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 07:44:03,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:44:03,985 INFO L255 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-09 07:44:03,987 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:44:04,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 07:44:04,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 07:44:04,113 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-09 07:44:04,114 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 27 [2024-11-09 07:44:04,126 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-09 07:44:04,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-11-09 07:44:04,149 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2024-11-09 07:44:04,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2024-11-09 07:44:04,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 07:44:04,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 07:44:04,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2024-11-09 07:44:04,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2024-11-09 07:44:04,232 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:44:04,232 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:44:04,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2024-11-09 07:44:04,434 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 62 [2024-11-09 07:44:04,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 94 [2024-11-09 07:44:04,572 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:44:04,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 64 treesize of output 134 [2024-11-09 07:44:04,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 64 [2024-11-09 07:44:04,744 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:44:04,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [420004953] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:44:04,746 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:44:04,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 22 [2024-11-09 07:44:04,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913869466] [2024-11-09 07:44:04,747 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:44:04,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-09 07:44:04,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:44:04,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-09 07:44:04,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=440, Unknown=0, NotChecked=0, Total=506 [2024-11-09 07:44:04,748 INFO L87 Difference]: Start difference. First operand 102 states and 107 transitions. Second operand has 23 states, 22 states have (on average 2.8181818181818183) internal successors, (62), 23 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:44:05,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:44:05,190 INFO L93 Difference]: Finished difference Result 104 states and 109 transitions. [2024-11-09 07:44:05,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 07:44:05,190 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.8181818181818183) internal successors, (62), 23 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-11-09 07:44:05,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:44:05,191 INFO L225 Difference]: With dead ends: 104 [2024-11-09 07:44:05,191 INFO L226 Difference]: Without dead ends: 104 [2024-11-09 07:44:05,191 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=138, Invalid=564, Unknown=0, NotChecked=0, Total=702 [2024-11-09 07:44:05,192 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 81 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 571 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:44:05,192 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 603 Invalid, 584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 571 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 07:44:05,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-09 07:44:05,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 101. [2024-11-09 07:44:05,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 73 states have (on average 1.452054794520548) internal successors, (106), 100 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:44:05,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 106 transitions. [2024-11-09 07:44:05,195 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 106 transitions. Word has length 22 [2024-11-09 07:44:05,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:44:05,195 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 106 transitions. [2024-11-09 07:44:05,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.8181818181818183) internal successors, (62), 23 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:44:05,195 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 106 transitions. [2024-11-09 07:44:05,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-09 07:44:05,196 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:44:05,196 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:44:05,209 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 07:44:05,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-09 07:44:05,401 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-11-09 07:44:05,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:44:05,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1794872678, now seen corresponding path program 1 times [2024-11-09 07:44:05,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:44:05,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17998599] [2024-11-09 07:44:05,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:44:05,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:44:05,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:44:05,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:44:05,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:44:05,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17998599] [2024-11-09 07:44:05,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17998599] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:44:05,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:44:05,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 07:44:05,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634397335] [2024-11-09 07:44:05,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:44:05,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 07:44:05,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:44:05,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 07:44:05,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:44:05,638 INFO L87 Difference]: Start difference. First operand 101 states and 106 transitions. Second operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:44:05,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:44:05,826 INFO L93 Difference]: Finished difference Result 125 states and 135 transitions. [2024-11-09 07:44:05,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 07:44:05,827 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-11-09 07:44:05,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:44:05,827 INFO L225 Difference]: With dead ends: 125 [2024-11-09 07:44:05,827 INFO L226 Difference]: Without dead ends: 125 [2024-11-09 07:44:05,828 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2024-11-09 07:44:05,828 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 36 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:44:05,828 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 280 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:44:05,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-11-09 07:44:05,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 102. [2024-11-09 07:44:05,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 74 states have (on average 1.445945945945946) internal successors, (107), 101 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:44:05,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 107 transitions. [2024-11-09 07:44:05,830 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 107 transitions. Word has length 23 [2024-11-09 07:44:05,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:44:05,830 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 107 transitions. [2024-11-09 07:44:05,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:44:05,831 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 107 transitions. [2024-11-09 07:44:05,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-09 07:44:05,831 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:44:05,831 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:44:05,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 07:44:05,831 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-11-09 07:44:05,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:44:05,831 INFO L85 PathProgramCache]: Analyzing trace with hash 193521933, now seen corresponding path program 1 times [2024-11-09 07:44:05,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:44:05,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466027261] [2024-11-09 07:44:05,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:44:05,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:44:05,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:44:05,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:44:05,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:44:05,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466027261] [2024-11-09 07:44:05,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466027261] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:44:06,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:44:06,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 07:44:06,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682819753] [2024-11-09 07:44:06,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:44:06,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 07:44:06,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:44:06,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 07:44:06,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:44:06,001 INFO L87 Difference]: Start difference. First operand 102 states and 107 transitions. Second operand has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:44:06,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:44:06,184 INFO L93 Difference]: Finished difference Result 116 states and 122 transitions. [2024-11-09 07:44:06,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 07:44:06,185 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-11-09 07:44:06,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:44:06,185 INFO L225 Difference]: With dead ends: 116 [2024-11-09 07:44:06,186 INFO L226 Difference]: Without dead ends: 116 [2024-11-09 07:44:06,186 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2024-11-09 07:44:06,186 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 24 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:44:06,186 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 241 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:44:06,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-09 07:44:06,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 103. [2024-11-09 07:44:06,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 75 states have (on average 1.44) internal successors, (108), 102 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:44:06,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 108 transitions. [2024-11-09 07:44:06,188 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 108 transitions. Word has length 24 [2024-11-09 07:44:06,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:44:06,188 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 108 transitions. [2024-11-09 07:44:06,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:44:06,190 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 108 transitions. [2024-11-09 07:44:06,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-09 07:44:06,191 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:44:06,191 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:44:06,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 07:44:06,191 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-11-09 07:44:06,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:44:06,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1704212733, now seen corresponding path program 1 times [2024-11-09 07:44:06,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:44:06,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956514519] [2024-11-09 07:44:06,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:44:06,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:44:06,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:44:06,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:44:06,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:44:06,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956514519] [2024-11-09 07:44:06,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956514519] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:44:06,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:44:06,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 07:44:06,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061893687] [2024-11-09 07:44:06,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:44:06,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 07:44:06,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:44:06,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 07:44:06,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:44:06,303 INFO L87 Difference]: Start difference. First operand 103 states and 108 transitions. Second operand has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:44:06,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:44:06,408 INFO L93 Difference]: Finished difference Result 102 states and 107 transitions. [2024-11-09 07:44:06,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:44:06,409 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-11-09 07:44:06,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:44:06,409 INFO L225 Difference]: With dead ends: 102 [2024-11-09 07:44:06,409 INFO L226 Difference]: Without dead ends: 102 [2024-11-09 07:44:06,409 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-09 07:44:06,410 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 57 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:44:06,410 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 80 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:44:06,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-09 07:44:06,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2024-11-09 07:44:06,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 75 states have (on average 1.4266666666666667) internal successors, (107), 101 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:44:06,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 107 transitions. [2024-11-09 07:44:06,411 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 107 transitions. Word has length 25 [2024-11-09 07:44:06,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:44:06,411 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 107 transitions. [2024-11-09 07:44:06,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:44:06,412 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 107 transitions. [2024-11-09 07:44:06,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-09 07:44:06,412 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:44:06,412 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:44:06,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 07:44:06,412 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-11-09 07:44:06,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:44:06,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1704212734, now seen corresponding path program 1 times [2024-11-09 07:44:06,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:44:06,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901327519] [2024-11-09 07:44:06,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:44:06,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:44:06,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:44:06,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:44:06,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:44:06,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901327519] [2024-11-09 07:44:06,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901327519] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:44:06,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:44:06,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:44:06,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079056258] [2024-11-09 07:44:06,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:44:06,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:44:06,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:44:06,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:44:06,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:44:06,450 INFO L87 Difference]: Start difference. First operand 102 states and 107 transitions. Second operand has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:44:06,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:44:06,486 INFO L93 Difference]: Finished difference Result 95 states and 99 transitions. [2024-11-09 07:44:06,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:44:06,486 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-11-09 07:44:06,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:44:06,487 INFO L225 Difference]: With dead ends: 95 [2024-11-09 07:44:06,487 INFO L226 Difference]: Without dead ends: 95 [2024-11-09 07:44:06,487 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:44:06,487 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 59 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:44:06,487 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 49 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:44:06,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-09 07:44:06,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-11-09 07:44:06,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 75 states have (on average 1.32) internal successors, (99), 94 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:44:06,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 99 transitions. [2024-11-09 07:44:06,489 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 99 transitions. Word has length 25 [2024-11-09 07:44:06,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:44:06,489 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 99 transitions. [2024-11-09 07:44:06,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:44:06,489 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 99 transitions. [2024-11-09 07:44:06,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-09 07:44:06,489 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:44:06,489 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:44:06,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 07:44:06,490 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-11-09 07:44:06,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:44:06,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1290987217, now seen corresponding path program 1 times [2024-11-09 07:44:06,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:44:06,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980741767] [2024-11-09 07:44:06,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:44:06,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:44:06,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:44:06,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:44:06,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:44:06,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980741767] [2024-11-09 07:44:06,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980741767] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:44:06,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:44:06,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:44:06,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511375920] [2024-11-09 07:44:06,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:44:06,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:44:06,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:44:06,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:44:06,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:44:06,560 INFO L87 Difference]: Start difference. First operand 95 states and 99 transitions. Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:44:06,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:44:06,603 INFO L93 Difference]: Finished difference Result 94 states and 98 transitions. [2024-11-09 07:44:06,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:44:06,604 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-11-09 07:44:06,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:44:06,604 INFO L225 Difference]: With dead ends: 94 [2024-11-09 07:44:06,604 INFO L226 Difference]: Without dead ends: 94 [2024-11-09 07:44:06,604 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:44:06,605 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 26 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:44:06,605 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 189 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:44:06,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-09 07:44:06,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-11-09 07:44:06,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 75 states have (on average 1.3066666666666666) internal successors, (98), 93 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:44:06,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 98 transitions. [2024-11-09 07:44:06,606 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 98 transitions. Word has length 26 [2024-11-09 07:44:06,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:44:06,606 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 98 transitions. [2024-11-09 07:44:06,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:44:06,607 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 98 transitions. [2024-11-09 07:44:06,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-09 07:44:06,607 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:44:06,607 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:44:06,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-09 07:44:06,607 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-11-09 07:44:06,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:44:06,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1365898173, now seen corresponding path program 1 times [2024-11-09 07:44:06,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:44:06,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011425402] [2024-11-09 07:44:06,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:44:06,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:44:06,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:44:06,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:44:06,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:44:06,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011425402] [2024-11-09 07:44:06,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011425402] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:44:06,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:44:06,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:44:06,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276151019] [2024-11-09 07:44:06,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:44:06,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:44:06,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:44:06,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:44:06,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:44:06,718 INFO L87 Difference]: Start difference. First operand 94 states and 98 transitions. Second operand has 5 states, 4 states have (on average 6.75) 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) [2024-11-09 07:44:06,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:44:06,789 INFO L93 Difference]: Finished difference Result 96 states and 100 transitions. [2024-11-09 07:44:06,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:44:06,790 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.75) 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 [2024-11-09 07:44:06,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:44:06,790 INFO L225 Difference]: With dead ends: 96 [2024-11-09 07:44:06,790 INFO L226 Difference]: Without dead ends: 96 [2024-11-09 07:44:06,790 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:44:06,791 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 26 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:44:06,791 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 164 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:44:06,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-09 07:44:06,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 93. [2024-11-09 07:44:06,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 75 states have (on average 1.2933333333333332) internal successors, (97), 92 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:44:06,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 97 transitions. [2024-11-09 07:44:06,793 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 97 transitions. Word has length 27 [2024-11-09 07:44:06,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:44:06,793 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 97 transitions. [2024-11-09 07:44:06,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.75) 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) [2024-11-09 07:44:06,793 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2024-11-09 07:44:06,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-09 07:44:06,793 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:44:06,793 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:44:06,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-09 07:44:06,794 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-11-09 07:44:06,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:44:06,794 INFO L85 PathProgramCache]: Analyzing trace with hash -606829485, now seen corresponding path program 1 times [2024-11-09 07:44:06,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:44:06,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652299980] [2024-11-09 07:44:06,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:44:06,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:44:06,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:44:07,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:44:07,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:44:07,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652299980] [2024-11-09 07:44:07,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652299980] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:44:07,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:44:07,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-09 07:44:07,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340456512] [2024-11-09 07:44:07,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:44:07,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 07:44:07,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:44:07,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 07:44:07,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-09 07:44:07,065 INFO L87 Difference]: Start difference. First operand 93 states and 97 transitions. Second operand has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:44:07,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:44:07,377 INFO L93 Difference]: Finished difference Result 113 states and 118 transitions. [2024-11-09 07:44:07,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-09 07:44:07,378 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-11-09 07:44:07,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:44:07,378 INFO L225 Difference]: With dead ends: 113 [2024-11-09 07:44:07,378 INFO L226 Difference]: Without dead ends: 113 [2024-11-09 07:44:07,379 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2024-11-09 07:44:07,379 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 78 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:44:07,379 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 228 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:44:07,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-09 07:44:07,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 97. [2024-11-09 07:44:07,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 79 states have (on average 1.2784810126582278) internal successors, (101), 96 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:44:07,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 101 transitions. [2024-11-09 07:44:07,383 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 101 transitions. Word has length 28 [2024-11-09 07:44:07,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:44:07,384 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 101 transitions. [2024-11-09 07:44:07,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:44:07,384 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 101 transitions. [2024-11-09 07:44:07,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-09 07:44:07,384 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:44:07,384 INFO L215 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] [2024-11-09 07:44:07,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-09 07:44:07,385 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-11-09 07:44:07,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:44:07,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1631844736, now seen corresponding path program 1 times [2024-11-09 07:44:07,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:44:07,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11958960] [2024-11-09 07:44:07,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:44:07,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:44:07,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:44:07,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:44:07,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:44:07,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11958960] [2024-11-09 07:44:07,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11958960] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:44:07,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:44:07,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:44:07,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943008483] [2024-11-09 07:44:07,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:44:07,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:44:07,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:44:07,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:44:07,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:44:07,521 INFO L87 Difference]: Start difference. First operand 97 states and 101 transitions. Second operand has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:44:07,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:44:07,610 INFO L93 Difference]: Finished difference Result 96 states and 100 transitions. [2024-11-09 07:44:07,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 07:44:07,611 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2024-11-09 07:44:07,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:44:07,611 INFO L225 Difference]: With dead ends: 96 [2024-11-09 07:44:07,611 INFO L226 Difference]: Without dead ends: 96 [2024-11-09 07:44:07,611 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-09 07:44:07,612 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 81 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:44:07,612 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 117 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:44:07,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-09 07:44:07,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-11-09 07:44:07,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 79 states have (on average 1.2658227848101267) internal successors, (100), 95 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) [2024-11-09 07:44:07,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 100 transitions. [2024-11-09 07:44:07,613 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 100 transitions. Word has length 29 [2024-11-09 07:44:07,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:44:07,614 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 100 transitions. [2024-11-09 07:44:07,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:44:07,614 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 100 transitions. [2024-11-09 07:44:07,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-09 07:44:07,614 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:44:07,614 INFO L215 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, 1] [2024-11-09 07:44:07,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-09 07:44:07,614 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-11-09 07:44:07,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:44:07,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1366744670, now seen corresponding path program 1 times [2024-11-09 07:44:07,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:44:07,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540119262] [2024-11-09 07:44:07,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:44:07,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:44:07,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:44:08,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:44:08,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:44:08,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540119262] [2024-11-09 07:44:08,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540119262] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:44:08,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:44:08,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-09 07:44:08,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734994228] [2024-11-09 07:44:08,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:44:08,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-09 07:44:08,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:44:08,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-09 07:44:08,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2024-11-09 07:44:08,470 INFO L87 Difference]: Start difference. First operand 96 states and 100 transitions. Second operand has 17 states, 16 states have (on average 2.125) internal successors, (34), 17 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:44:08,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:44:08,944 INFO L93 Difference]: Finished difference Result 146 states and 152 transitions. [2024-11-09 07:44:08,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-09 07:44:08,944 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.125) internal successors, (34), 17 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-11-09 07:44:08,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:44:08,945 INFO L225 Difference]: With dead ends: 146 [2024-11-09 07:44:08,945 INFO L226 Difference]: Without dead ends: 144 [2024-11-09 07:44:08,945 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2024-11-09 07:44:08,946 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 58 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:44:08,946 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 367 Invalid, 529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 528 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 07:44:08,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-11-09 07:44:08,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 120. [2024-11-09 07:44:08,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 103 states have (on average 1.2135922330097086) internal successors, (125), 119 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:44:08,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 125 transitions. [2024-11-09 07:44:08,948 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 125 transitions. Word has length 34 [2024-11-09 07:44:08,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:44:08,948 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 125 transitions. [2024-11-09 07:44:08,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.125) internal successors, (34), 17 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:44:08,948 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 125 transitions. [2024-11-09 07:44:08,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-09 07:44:08,948 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:44:08,948 INFO L215 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, 1] [2024-11-09 07:44:08,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-09 07:44:08,949 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-11-09 07:44:08,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:44:08,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1366745282, now seen corresponding path program 1 times [2024-11-09 07:44:08,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:44:08,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340086032] [2024-11-09 07:44:08,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:44:08,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:44:08,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:44:09,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:44:09,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:44:09,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340086032] [2024-11-09 07:44:09,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340086032] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:44:09,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:44:09,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-09 07:44:09,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863957626] [2024-11-09 07:44:09,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:44:09,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 07:44:09,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:44:09,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 07:44:09,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2024-11-09 07:44:09,384 INFO L87 Difference]: Start difference. First operand 120 states and 125 transitions. Second operand has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:44:09,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:44:09,609 INFO L93 Difference]: Finished difference Result 123 states and 127 transitions. [2024-11-09 07:44:09,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 07:44:09,610 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-11-09 07:44:09,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:44:09,610 INFO L225 Difference]: With dead ends: 123 [2024-11-09 07:44:09,610 INFO L226 Difference]: Without dead ends: 105 [2024-11-09 07:44:09,611 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=354, Unknown=0, NotChecked=0, Total=420 [2024-11-09 07:44:09,611 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 24 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:44:09,611 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 588 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:44:09,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-09 07:44:09,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 102. [2024-11-09 07:44:09,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 85 states have (on average 1.2470588235294118) internal successors, (106), 101 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:44:09,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 106 transitions. [2024-11-09 07:44:09,612 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 106 transitions. Word has length 34 [2024-11-09 07:44:09,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:44:09,612 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 106 transitions. [2024-11-09 07:44:09,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:44:09,613 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 106 transitions. [2024-11-09 07:44:09,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-09 07:44:09,613 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:44:09,613 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:44:09,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-09 07:44:09,613 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-11-09 07:44:09,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:44:09,614 INFO L85 PathProgramCache]: Analyzing trace with hash 762441251, now seen corresponding path program 1 times [2024-11-09 07:44:09,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:44:09,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587626728] [2024-11-09 07:44:09,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:44:09,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:44:09,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:44:10,258 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:44:10,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:44:10,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587626728] [2024-11-09 07:44:10,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587626728] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:44:10,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [830664073] [2024-11-09 07:44:10,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:44:10,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:44:10,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:44:10,260 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:44:10,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 07:44:10,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:44:10,358 INFO L255 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 71 conjuncts are in the unsatisfiable core [2024-11-09 07:44:10,360 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:44:10,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 07:44:10,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 07:44:10,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 07:44:10,550 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-09 07:44:10,551 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-11-09 07:44:10,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2024-11-09 07:44:10,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-09 07:44:10,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-09 07:44:10,980 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:44:10,984 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-09 07:44:10,984 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 [2024-11-09 07:44:11,061 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:44:11,062 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 34 treesize of output 22 [2024-11-09 07:44:11,067 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:44:11,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 31 [2024-11-09 07:44:11,256 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:44:11,256 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 [2024-11-09 07:44:11,265 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:44:11,267 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:44:11,267 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 [2024-11-09 07:44:11,306 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:44:11,307 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:44:15,834 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2024-11-09 07:44:15,835 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 [2024-11-09 07:44:15,889 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2024-11-09 07:44:15,889 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 [2024-11-09 07:44:15,907 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:44:15,907 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 [2024-11-09 07:44:15,927 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:44:15,927 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 [2024-11-09 07:44:15,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-09 07:44:15,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-09 07:44:15,998 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:44:15,998 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 [2024-11-09 07:44:17,010 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:44:17,011 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 2213 treesize of output 2175 [2024-11-09 07:44:33,845 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse342 (< |c_ULTIMATE.start_append_~plist#1.offset| 1)) (.cse65 (< |c_ULTIMATE.start_main_~#list~0#1.offset| 1))) (let ((.cse128 (< |c_ULTIMATE.start_main_~#list~0#1.offset| 0)) (.cse4 (= |c_ULTIMATE.start_main_~#list~0#1.base| |c_ULTIMATE.start_append_~plist#1.base|)) (.cse129 (or .cse342 .cse65)) (.cse130 (or .cse65 (< |c_ULTIMATE.start_main_~#list~0#1.offset| (+ 2 |c_ULTIMATE.start_append_~plist#1.offset|)))) (.cse2 (+ 4 |c_ULTIMATE.start_append_~item~0#1.offset|))) (let ((.cse315 (forall ((v_prenex_26 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (let ((.cse494 (let ((.cse495 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse495 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse495) v_prenex_26) .cse2))))) (let ((.cse493 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse494) v_prenex_26))) (or (= (select .cse493 4) 0) (= (select .cse493 .cse2) 0) (= (select .cse494 .cse2) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))))) (.cse316 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_prenex_20 Int)) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse492 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse492 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse492) v_prenex_20) .cse2)))) v_prenex_20) .cse2) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (.cse318 (and (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_22 Int)) (let ((.cse489 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (let ((.cse490 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse489 4 0)) v_prenex_22))) (or (= 0 (select (store .cse489 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse489) v_prenex_22) .cse2)) .cse2)) (= (select .cse490 4) 0) (= (select .cse490 .cse2) 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_22 Int)) (let ((.cse491 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (or (= 0 (select (store .cse491 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse491) v_prenex_22) .cse2)) .cse2)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse491 4 0)) v_prenex_22) .cse2) 0)))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))))) (.cse0 (and .cse129 .cse130)) (.cse46 (< |c_ULTIMATE.start_append_~plist#1.offset| 0)) (.cse47 (< |c_ULTIMATE.start_main_~#list~0#1.offset| |c_ULTIMATE.start_append_~plist#1.offset|)) (.cse48 (not .cse4)) (.cse49 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_24 Int)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|) 4 0)) v_prenex_24) .cse2) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (.cse60 (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)) (let ((.cse488 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|) 4 0)) v_prenex_24))) (or (= (select .cse488 .cse2) 0) (= (select .cse488 4) 0))))))) (.cse323 (or (forall ((v_prenex_27 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (let ((.cse487 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (let ((.cse486 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse487) v_prenex_27) .cse2))) (or (= .cse486 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse487 4 .cse486)) v_prenex_27) 4) 0))))) .cse128)) (.cse325 (forall ((v_prenex_27 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (let ((.cse484 (let ((.cse485 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse485 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse485) v_prenex_27) .cse2))))) (or (= (select .cse484 .cse2) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse484) v_prenex_27) .cse2) 0))))) (.cse322 (forall ((v_prenex_27 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (let ((.cse481 (let ((.cse483 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse483 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse483) v_prenex_27) .cse2))))) (let ((.cse482 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse481) v_prenex_27))) (or (= (select .cse481 .cse2) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select .cse482 .cse2) 0) (= (select .cse482 4) 0)))))) (.cse324 (or (forall ((v_prenex_27 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (let ((.cse479 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse480 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse480 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse480) v_prenex_27) .cse2)))) v_prenex_27))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select .cse479 .cse2) 0) (= (select .cse479 4) 0)))) .cse128))) (let ((.cse18 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_arrayElimCell_52 Int) (v_arrayElimCell_43 Int) (v_arrayElimCell_42 Int)) (let ((.cse478 (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|))) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse477 (store .cse478 0 v_arrayElimCell_42))) (store .cse477 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse477) v_arrayElimCell_43) (+ 4 v_arrayElimCell_42))))) v_arrayElimCell_52) .cse2) 0) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store (store .cse478 0 |c_ULTIMATE.start_append_~item~0#1.offset|) 4 0)) v_arrayElimCell_52) .cse2) 0)))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (.cse22 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_22 Int) (v_arrayElimCell_42 Int)) (let ((.cse475 (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|))) (let ((.cse474 (+ 4 v_arrayElimCell_42)) (.cse476 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store (store .cse475 0 |c_ULTIMATE.start_append_~item~0#1.offset|) 4 0)) v_prenex_22))) (or (= (select (let ((.cse473 (store .cse475 0 v_arrayElimCell_42))) (store .cse473 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse473) v_prenex_22) .cse474))) .cse2) 0) (= (select (select |c_#memory_$Pointer$#1.offset| v_prenex_22) .cse474) 0) (= (select .cse476 4) 0) (= (select .cse476 .cse2) 0))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (.cse23 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_22 Int) (v_arrayElimCell_42 Int)) (let ((.cse471 (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|))) (let ((.cse472 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store (store .cse471 0 |c_ULTIMATE.start_append_~item~0#1.offset|) 4 0)) v_prenex_22))) (or (= (select (let ((.cse470 (store .cse471 0 v_arrayElimCell_42))) (store .cse470 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse470) v_prenex_22) (+ 4 v_arrayElimCell_42)))) .cse2) 0) (= (select .cse472 4) 0) (= (select .cse472 .cse2) 0))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (.cse24 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_21 Int) (v_arrayElimCell_42 Int)) (let ((.cse469 (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|))) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse468 (store .cse469 0 v_arrayElimCell_42))) (store .cse468 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse468) v_prenex_21) (+ 4 v_arrayElimCell_42))))) v_prenex_21) .cse2) 0) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store (store .cse469 0 |c_ULTIMATE.start_append_~item~0#1.offset|) 4 0)) v_prenex_21) .cse2) 0)))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (.cse25 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_22 Int) (v_arrayElimCell_42 Int)) (let ((.cse467 (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|))) (or (= (select (let ((.cse466 (store .cse467 0 v_arrayElimCell_42))) (store .cse466 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse466) v_prenex_22) (+ 4 v_arrayElimCell_42)))) .cse2) 0) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store (store .cse467 0 |c_ULTIMATE.start_append_~item~0#1.offset|) 4 0)) v_prenex_22) .cse2) 0)))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (.cse50 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_prenex_24 Int) (v_arrayElimCell_54 Int)) (let ((.cse465 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|) 4 0)) v_prenex_24))) (or (= (select .cse465 (+ 4 v_arrayElimCell_54)) 0) (= (select .cse465 4) 0))))))) (.cse55 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_24 Int) (v_arrayElimCell_54 Int)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|) 4 0)) v_prenex_24) (+ 4 v_arrayElimCell_54)) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (.cse142 (forall ((v_prenex_16 Int) (v_prenex_15 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_54 Int) (v_arrayElimCell_42 Int)) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse464 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_42))) (store .cse464 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse464) v_prenex_16) (+ 4 v_arrayElimCell_42))))) v_prenex_15) (+ 4 v_arrayElimCell_54)) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (.cse144 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_prenex_20 Int) (v_arrayElimCell_54 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$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse463 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_42))) (store .cse463 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse463) v_prenex_20) (+ 4 v_arrayElimCell_42))))) v_prenex_20) (+ 4 v_arrayElimCell_54)) 0)))) (.cse80 (or (and .cse323 (or .cse65 .cse325) (or .cse65 .cse322) .cse324 (or (forall ((v_prenex_27 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (let ((.cse462 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (let ((.cse461 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse462) v_prenex_27) .cse2))) (let ((.cse460 (store .cse462 4 .cse461))) (or (= (select .cse460 .cse2) 0) (= .cse461 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse460) v_prenex_27) 4) 0)))))) .cse128)) .cse4)) (.cse86 (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_prenex_21 Int)) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|) 4 0)) v_prenex_21) .cse2) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) .cse65)) (.cse89 (or .cse46 .cse47 .cse48 (and .cse49 .cse60))) (.cse94 (or .cse0 (forall ((v_prenex_23 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse459 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse459 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse459) v_prenex_23) .cse2)))) v_prenex_23) .cse2) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))))) (.cse111 (or .cse318 .cse65)) (.cse112 (or .cse65 .cse316 .cse4)) (.cse125 (or .cse315 .cse128)) (.cse174 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_54 Int)) (or (= (let ((.cse458 (+ 4 v_arrayElimCell_54))) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse457 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_54))) (store .cse457 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse457) |c_ULTIMATE.start_append_~item~0#1.base|) .cse458)))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse458)) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (.cse162 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_54 Int) (v_prenex_19 Int)) (let ((.cse456 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_54)) (.cse455 (+ 4 v_arrayElimCell_54))) (let ((.cse454 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse456) v_prenex_19) .cse455))) (let ((.cse453 (store .cse456 4 .cse454))) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse453) v_prenex_19) 4) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= .cse454 0) (= (select .cse453 .cse455) 0))))))) (.cse164 (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_54 Int) (v_prenex_19 Int)) (let ((.cse451 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_54)) (.cse452 (+ 4 v_arrayElimCell_54))) (let ((.cse450 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse451) v_prenex_19) .cse452))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= .cse450 0) (= (select (store .cse451 4 .cse450) .cse452) 0))))) .cse0)) (.cse169 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_arrayElimCell_52 Int) (v_arrayElimCell_54 Int)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|) 4 0)) v_arrayElimCell_52) (+ 4 v_arrayElimCell_54)) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (.cse170 (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_prenex_13 Int) (v_arrayElimCell_54 Int)) (= (let ((.cse449 (+ 4 v_arrayElimCell_54))) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse448 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_54))) (store .cse448 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse448) v_prenex_13) .cse449)))) v_prenex_12) .cse449)) 0))))) (.cse171 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_prenex_17 Int) (v_arrayElimCell_54 Int)) (= (let ((.cse447 (+ 4 v_arrayElimCell_54))) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse446 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_54))) (store .cse446 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse446) v_prenex_17) .cse447)))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse447)) 0))))) (.cse165 (or .cse0 (forall ((v_prenex_18 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_54 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (let ((.cse445 (+ 4 v_arrayElimCell_54))) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse444 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_54))) (store .cse444 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse444) v_prenex_18) .cse445)))) v_prenex_18) .cse445)) 0))))) (.cse166 (or .cse0 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_54 Int) (v_prenex_19 Int)) (let ((.cse442 (+ 4 v_arrayElimCell_54))) (let ((.cse441 (let ((.cse443 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_54))) (store .cse443 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse443) v_prenex_19) .cse442))))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse441) v_prenex_19) .cse442) 0) (= (select .cse441 .cse442) 0))))))) (.cse132 (or (forall ((v_prenex_27 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_54 Int)) (let ((.cse438 (+ 4 v_arrayElimCell_54))) (let ((.cse437 (let ((.cse440 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_54))) (store .cse440 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse440) v_prenex_27) .cse438))))) (let ((.cse439 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse437) v_prenex_27))) (or (= (select .cse437 .cse438) 0) (= (select .cse439 4) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select .cse439 .cse438) 0)))))) .cse128)) (.cse133 (or (forall ((v_prenex_27 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_54 Int)) (let ((.cse435 (+ 4 v_arrayElimCell_54))) (let ((.cse434 (let ((.cse436 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_54))) (store .cse436 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse436) v_prenex_27) .cse435))))) (or (= (select .cse434 .cse435) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse434) v_prenex_27) .cse435) 0))))) .cse0)) (.cse134 (or (forall ((v_prenex_27 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_54 Int)) (let ((.cse433 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_54))) (let ((.cse432 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse433) v_prenex_27) (+ 4 v_arrayElimCell_54)))) (or (= .cse432 0) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse433 4 .cse432)) v_prenex_27) 4) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))))) .cse128)) (.cse152 (or (forall ((v_prenex_26 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_54 Int)) (let ((.cse430 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_54))) (let ((.cse431 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse430) v_prenex_26) (+ 4 v_arrayElimCell_54)))) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse430 4 .cse431)) v_prenex_26) 4) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= .cse431 0))))) .cse128)) (.cse153 (or (forall ((v_prenex_26 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_54 Int)) (let ((.cse429 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_54)) (.cse427 (+ 4 v_arrayElimCell_54))) (let ((.cse428 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse429) v_prenex_26) .cse427))) (let ((.cse426 (store .cse429 4 .cse428))) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse426) v_prenex_26) 4) 0) (= (select .cse426 .cse427) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= .cse428 0)))))) .cse128)) (.cse154 (or (and (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_22 Int) (v_arrayElimCell_54 Int)) (let ((.cse422 (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|))) (let ((.cse419 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store (store .cse422 0 |c_ULTIMATE.start_append_~item~0#1.offset|) 4 0)) v_prenex_22)) (.cse420 (+ 4 v_arrayElimCell_54))) (or (= (select .cse419 .cse420) 0) (= (select .cse419 4) 0) (= (select (let ((.cse421 (store .cse422 0 v_arrayElimCell_54))) (store .cse421 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse421) v_prenex_22) .cse420))) .cse420) 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_22 Int) (v_arrayElimCell_54 Int)) (let ((.cse423 (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|)) (.cse424 (+ 4 v_arrayElimCell_54))) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store (store .cse423 0 |c_ULTIMATE.start_append_~item~0#1.offset|) 4 0)) v_prenex_22) .cse424) 0) (= (select (let ((.cse425 (store .cse423 0 v_arrayElimCell_54))) (store .cse425 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse425) v_prenex_22) .cse424))) .cse424) 0)))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) .cse0)) (.cse159 (or .cse128 (forall ((v_prenex_29 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_54 Int)) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_54)) v_prenex_29) (+ 4 v_arrayElimCell_54)) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))))) (.cse155 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_23 Int) (v_arrayElimCell_54 Int)) (= (let ((.cse418 (+ 4 v_arrayElimCell_54))) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse417 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_54))) (store .cse417 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse417) v_prenex_23) .cse418)))) v_prenex_23) .cse418)) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (.cse156 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_prenex_21 Int) (v_arrayElimCell_54 Int)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|) 4 0)) v_prenex_21) (+ 4 v_arrayElimCell_54)) 0))))) (.cse160 (or .cse0 (forall ((v_prenex_26 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_54 Int)) (let ((.cse415 (+ 4 v_arrayElimCell_54))) (let ((.cse414 (let ((.cse416 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_54))) (store .cse416 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse416) v_prenex_26) .cse415))))) (or (= (select .cse414 .cse415) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse414) v_prenex_26) .cse415) 0))))))) (.cse161 (or (forall ((v_prenex_26 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_54 Int)) (let ((.cse412 (+ 4 v_arrayElimCell_54))) (let ((.cse411 (let ((.cse413 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_54))) (store .cse413 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse413) v_prenex_26) .cse412))))) (let ((.cse410 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse411) v_prenex_26))) (or (= (select .cse410 4) 0) (= (select .cse411 .cse412) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select .cse410 .cse412) 0)))))) .cse0)) (.cse168 (or (forall ((v_prenex_26 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_54 Int)) (let ((.cse408 (+ 4 v_arrayElimCell_54))) (let ((.cse407 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse409 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_54))) (store .cse409 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse409) v_prenex_26) .cse408)))) v_prenex_26))) (or (= (select .cse407 4) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select .cse407 .cse408) 0))))) .cse128)) (.cse135 (or (forall ((v_prenex_27 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_54 Int)) (let ((.cse405 (+ 4 v_arrayElimCell_54))) (let ((.cse404 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse406 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_54))) (store .cse406 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse406) v_prenex_27) .cse405)))) v_prenex_27))) (or (= (select .cse404 4) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select .cse404 .cse405) 0))))) .cse128)) (.cse141 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_arrayElimCell_54 Int) (v_arrayElimCell_42 Int)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse403 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_42))) (store .cse403 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse403) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_42))))) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_54)) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (.cse147 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_arrayElimCell_54 Int) (v_arrayElimCell_42 Int) (v_prenex_19 Int)) (let ((.cse400 (let ((.cse402 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_42))) (store .cse402 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse402) v_prenex_19) (+ 4 v_arrayElimCell_42))))) (.cse401 (+ 4 v_arrayElimCell_54))) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse400) v_prenex_19) .cse401) 0) (= (select .cse400 .cse401) 0)))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (.cse148 (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_arrayElimCell_54 Int) (v_arrayElimCell_42 Int)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse399 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_42))) (store .cse399 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse399) v_prenex_18) (+ 4 v_arrayElimCell_42))))) v_prenex_18) (+ 4 v_arrayElimCell_54)) 0))))) (.cse149 (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_54 Int) (v_arrayElimCell_42 Int) (v_prenex_19 Int)) (let ((.cse398 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_42))) (let ((.cse396 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse398) v_prenex_19) (+ 4 v_arrayElimCell_42)))) (let ((.cse397 (store .cse398 4 .cse396))) (let ((.cse394 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse397) v_prenex_19)) (.cse395 (+ 4 v_arrayElimCell_54))) (or (= (select .cse394 4) 0) (= (select .cse394 .cse395) 0) (= .cse396 0) (= (select .cse397 .cse395) 0)))))))))) (.cse53 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_arrayElimCell_52 Int) (v_arrayElimCell_54 Int) (v_arrayElimCell_43 Int) (v_arrayElimCell_42 Int)) (let ((.cse392 (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|)) (.cse393 (+ 4 v_arrayElimCell_54))) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse391 (store .cse392 0 v_arrayElimCell_42))) (store .cse391 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse391) v_arrayElimCell_43) (+ 4 v_arrayElimCell_42))))) v_arrayElimCell_52) .cse393) 0) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store (store .cse392 0 |c_ULTIMATE.start_append_~item~0#1.offset|) 4 0)) v_arrayElimCell_52) .cse393) 0)))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (.cse146 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_12 Int) (v_prenex_13 Int) (v_arrayElimCell_54 Int) (v_arrayElimCell_42 Int)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse390 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_42))) (store .cse390 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse390) v_prenex_13) (+ 4 v_arrayElimCell_42))))) v_prenex_12) (+ 4 v_arrayElimCell_54)) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (.cse151 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_prenex_17 Int) (v_arrayElimCell_54 Int) (v_arrayElimCell_42 Int)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse389 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_42))) (store .cse389 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse389) v_prenex_17) (+ 4 v_arrayElimCell_42))))) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_54)) 0))))) (.cse136 (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_26 Int) (v_arrayElimCell_54 Int) (v_arrayElimCell_42 Int)) (let ((.cse386 (let ((.cse388 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_42))) (store .cse388 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse388) v_prenex_26) (+ 4 v_arrayElimCell_42))))) (.cse387 (+ 4 v_arrayElimCell_54))) (or (= (select .cse386 .cse387) 0) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse386) v_prenex_26) .cse387) 0))))))) (.cse140 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_26 Int) (v_arrayElimCell_54 Int) (v_arrayElimCell_42 Int)) (let ((.cse385 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_42))) (let ((.cse384 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse385) v_prenex_26) (+ 4 v_arrayElimCell_42)))) (let ((.cse382 (store .cse385 4 .cse384))) (let ((.cse381 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse382) v_prenex_26)) (.cse383 (+ 4 v_arrayElimCell_54))) (or (= (select .cse381 4) 0) (= (select .cse382 .cse383) 0) (= .cse384 0) (= (select .cse381 .cse383) 0))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (.cse51 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_22 Int) (v_arrayElimCell_54 Int) (v_arrayElimCell_42 Int)) (let ((.cse378 (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|))) (let ((.cse377 (+ 4 v_arrayElimCell_42)) (.cse379 (+ 4 v_arrayElimCell_54)) (.cse380 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store (store .cse378 0 |c_ULTIMATE.start_append_~item~0#1.offset|) 4 0)) v_prenex_22))) (or (= (select (let ((.cse376 (store .cse378 0 v_arrayElimCell_42))) (store .cse376 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse376) v_prenex_22) .cse377))) .cse379) 0) (= (select (select |c_#memory_$Pointer$#1.offset| v_prenex_22) .cse377) 0) (= (select .cse380 .cse379) 0) (= (select .cse380 4) 0))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (.cse143 (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_26 Int) (v_arrayElimCell_54 Int) (v_arrayElimCell_42 Int)) (let ((.cse373 (let ((.cse375 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_42))) (store .cse375 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse375) v_prenex_26) (+ 4 v_arrayElimCell_42)))))) (let ((.cse372 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse373) v_prenex_26)) (.cse374 (+ 4 v_arrayElimCell_54))) (or (= (select .cse372 4) 0) (= (select .cse373 .cse374) 0) (= (select .cse372 .cse374) 0)))))))) (.cse137 (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_27 Int) (v_arrayElimCell_54 Int) (v_arrayElimCell_42 Int)) (let ((.cse371 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_42))) (let ((.cse367 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse371) v_prenex_27) (+ 4 v_arrayElimCell_42)))) (let ((.cse368 (store .cse371 4 .cse367))) (let ((.cse370 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse368) v_prenex_27)) (.cse369 (+ 4 v_arrayElimCell_54))) (or (= .cse367 0) (= (select .cse368 .cse369) 0) (= (select .cse370 4) 0) (= (select .cse370 .cse369) 0)))))))))) (.cse145 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_23 Int) (v_arrayElimCell_54 Int) (v_arrayElimCell_42 Int)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse366 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_42))) (store .cse366 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse366) v_prenex_23) (+ 4 v_arrayElimCell_42))))) v_prenex_23) (+ 4 v_arrayElimCell_54)) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (.cse54 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_22 Int) (v_arrayElimCell_54 Int) (v_arrayElimCell_42 Int)) (let ((.cse364 (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|)) (.cse365 (+ 4 v_arrayElimCell_54))) (or (= (select (let ((.cse363 (store .cse364 0 v_arrayElimCell_42))) (store .cse363 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse363) v_prenex_22) (+ 4 v_arrayElimCell_42)))) .cse365) 0) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store (store .cse364 0 |c_ULTIMATE.start_append_~item~0#1.offset|) 4 0)) v_prenex_22) .cse365) 0)))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (.cse138 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_27 Int) (v_arrayElimCell_54 Int) (v_arrayElimCell_42 Int)) (let ((.cse359 (let ((.cse362 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_42))) (store .cse362 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse362) v_prenex_27) (+ 4 v_arrayElimCell_42)))))) (let ((.cse361 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse359) v_prenex_27)) (.cse360 (+ 4 v_arrayElimCell_54))) (or (= (select .cse359 .cse360) 0) (= (select .cse361 4) 0) (= (select .cse361 .cse360) 0))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (.cse139 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_27 Int) (v_arrayElimCell_54 Int) (v_arrayElimCell_42 Int)) (let ((.cse356 (let ((.cse358 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_42))) (store .cse358 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse358) v_prenex_27) (+ 4 v_arrayElimCell_42))))) (.cse357 (+ 4 v_arrayElimCell_54))) (or (= (select .cse356 .cse357) 0) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse356) v_prenex_27) .cse357) 0)))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (.cse59 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_prenex_21 Int) (v_arrayElimCell_54 Int) (v_arrayElimCell_42 Int)) (let ((.cse354 (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|)) (.cse355 (+ 4 v_arrayElimCell_54))) (or (= 0 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse353 (store .cse354 0 v_arrayElimCell_42))) (store .cse353 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse353) v_prenex_21) (+ 4 v_arrayElimCell_42))))) v_prenex_21) .cse355)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store (store .cse354 0 |c_ULTIMATE.start_append_~item~0#1.offset|) 4 0)) v_prenex_21) .cse355) 0))))))) (.cse61 (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_22 Int) (v_arrayElimCell_54 Int) (v_arrayElimCell_42 Int)) (let ((.cse350 (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|))) (let ((.cse351 (+ 4 v_arrayElimCell_54)) (.cse352 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store (store .cse350 0 |c_ULTIMATE.start_append_~item~0#1.offset|) 4 0)) v_prenex_22))) (or (= (select (let ((.cse349 (store .cse350 0 v_arrayElimCell_42))) (store .cse349 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse349) v_prenex_22) (+ 4 v_arrayElimCell_42)))) .cse351) 0) (= (select .cse352 .cse351) 0) (= (select .cse352 4) 0)))))))) (.cse150 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_arrayElimCell_54 Int) (v_arrayElimCell_42 Int) (v_prenex_19 Int)) (let ((.cse348 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_42))) (let ((.cse347 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse348) v_prenex_19) (+ 4 v_arrayElimCell_42)))) (let ((.cse345 (store .cse348 4 .cse347)) (.cse346 (+ 4 v_arrayElimCell_54))) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse345) v_prenex_19) .cse346) 0) (= .cse347 0) (= (select .cse345 .cse346) 0)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (.cse167 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_54 Int) (v_prenex_19 Int)) (let ((.cse343 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_54))) (let ((.cse344 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse343) v_prenex_19) (+ 4 v_arrayElimCell_54)))) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse343 4 .cse344)) v_prenex_19) 4) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= .cse344 0)))))) (.cse163 (forall ((v_prenex_28 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_54 Int)) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_54)) v_prenex_28) (+ 4 v_arrayElimCell_54)) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (.cse298 (and (or .cse342 .cse128) (or (< |c_ULTIMATE.start_main_~#list~0#1.offset| (+ |c_ULTIMATE.start_append_~plist#1.offset| 1)) .cse128))) (.cse3 (forall ((v_prenex_16 Int) (v_prenex_15 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse341 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse341 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse341) v_prenex_16) .cse2)))) v_prenex_15) .cse2) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (.cse306 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_prenex_19 Int)) (let ((.cse340 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (let ((.cse339 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse340) v_prenex_19) .cse2))) (let ((.cse338 (store .cse340 4 .cse339))) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse338) v_prenex_19) 4) 0) (= .cse339 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select .cse338 .cse2) 0))))))) (.cse307 (forall ((v_prenex_18 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$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse337 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse337 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse337) v_prenex_18) .cse2)))) v_prenex_18) .cse2) 0)))) (.cse309 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_prenex_19 Int)) (let ((.cse335 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (let ((.cse336 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse335) v_prenex_19) .cse2))) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse335 4 .cse336)) v_prenex_19) 4) 0) (= .cse336 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))))) (.cse308 (forall ((v_prenex_28 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|)) v_prenex_28) .cse2) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (.cse305 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_prenex_19 Int)) (let ((.cse333 (let ((.cse334 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse334 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse334) v_prenex_19) .cse2))))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= 0 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse333) v_prenex_19) .cse2)) (= (select .cse333 .cse2) 0))))) (.cse82 (or (forall ((v_prenex_26 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (let ((.cse331 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (let ((.cse332 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse331) v_prenex_26) .cse2))) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse331 4 .cse332)) v_prenex_26) 4) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= .cse332 0))))) .cse128)) (.cse87 (or (forall ((v_prenex_26 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (let ((.cse329 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse330 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse330 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse330) v_prenex_26) .cse2)))) v_prenex_26))) (or (= (select .cse329 4) 0) (= (select .cse329 .cse2) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) .cse128)) (.cse91 (or .cse0 (forall ((v_prenex_26 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (let ((.cse327 (let ((.cse328 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse328 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse328) v_prenex_26) .cse2))))) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse327) v_prenex_26) .cse2) 0) (= (select .cse327 .cse2) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))))) (.cse96 (or (forall ((v_prenex_29 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$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|)) v_prenex_29) .cse2) 0))) .cse128)) (.cse78 (or (forall ((v_arrayElimCell_52 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|) 4 0)) v_arrayElimCell_52) .cse2) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) .cse65)) (.cse88 (or (forall ((v_prenex_12 Int) (v_prenex_13 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$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse326 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse326 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse326) v_prenex_13) .cse2)))) v_prenex_12) .cse2) 0))) .cse0)) (.cse126 (or .cse46 .cse47 (forall ((v_prenex_14 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$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|) 4 0)) v_prenex_14) .cse2) 0))) .cse48)) (.cse6 (= |c_ULTIMATE.start_main_~#list~0#1.offset| |c_ULTIMATE.start_append_~plist#1.offset|))) (and (or .cse0 (and (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_17 Int)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse1 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse1 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse1) v_prenex_17) .cse2)))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse2) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) (or .cse3 .cse4) (or (and (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_12 Int) (v_prenex_13 Int)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse5 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse5 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse5) v_prenex_13) .cse2)))) v_prenex_12) .cse2) 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_52 Int)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|) 4 0)) v_arrayElimCell_52) .cse2) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) .cse6))) (or .cse0 (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_17 Int) (v_arrayElimCell_42 Int)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse7 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_42))) (store .cse7 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse7) v_prenex_17) (+ 4 v_arrayElimCell_42))))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse2) 0)))) (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_18 Int) (v_arrayElimCell_42 Int)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse8 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_42))) (store .cse8 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse8) v_prenex_18) (+ 4 v_arrayElimCell_42))))) v_prenex_18) .cse2) 0)))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_arrayElimCell_42 Int) (v_prenex_19 Int)) (let ((.cse12 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_42))) (let ((.cse11 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse12) v_prenex_19) (+ 4 v_arrayElimCell_42)))) (let ((.cse10 (store .cse12 4 .cse11))) (let ((.cse9 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse10) v_prenex_19))) (or (= (select .cse9 4) 0) (= (select .cse9 .cse2) 0) (= (select .cse10 .cse2) 0) (= .cse11 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_prenex_19 Int)) (let ((.cse15 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_42))) (let ((.cse14 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse15) v_prenex_19) (+ 4 v_arrayElimCell_42)))) (let ((.cse13 (store .cse15 4 .cse14))) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse13) v_prenex_19) .cse2) 0) (= (select .cse13 .cse2) 0) (= .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_arrayElimCell_42 Int) (v_prenex_19 Int)) (let ((.cse16 (let ((.cse17 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_42))) (store .cse17 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse17) v_prenex_19) (+ 4 v_arrayElimCell_42)))))) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse16) v_prenex_19) .cse2) 0) (= (select .cse16 .cse2) 0)))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) .cse4) (or (and .cse18 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_12 Int) (v_prenex_13 Int) (v_arrayElimCell_42 Int)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse19 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_42))) (store .cse19 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse19) v_prenex_13) (+ 4 v_arrayElimCell_42))))) v_prenex_12) .cse2) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) .cse6) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_arrayElimCell_42 Int)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse20 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_42))) (store .cse20 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse20) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_42))))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse2) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) (or (forall ((v_prenex_16 Int) (v_prenex_15 Int) (|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$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse21 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_42))) (store .cse21 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse21) v_prenex_16) (+ 4 v_arrayElimCell_42))))) v_prenex_15) .cse2) 0))) .cse4) (or .cse6 (and .cse22 .cse23 .cse24 .cse25 (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_prenex_20 Int) (v_arrayElimCell_42 Int)) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse26 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_42))) (store .cse26 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse26) v_prenex_20) (+ 4 v_arrayElimCell_42))))) v_prenex_20) .cse2) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) .cse4) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_26 Int) (v_arrayElimCell_42 Int)) (let ((.cse30 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_42))) (let ((.cse29 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse30) v_prenex_26) (+ 4 v_arrayElimCell_42)))) (let ((.cse28 (store .cse30 4 .cse29))) (let ((.cse27 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse28) v_prenex_26))) (or (= (select .cse27 4) 0) (= (select .cse28 .cse2) 0) (= 0 (select .cse27 .cse2)) (= .cse29 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_26 Int) (v_arrayElimCell_42 Int)) (let ((.cse31 (let ((.cse32 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_42))) (store .cse32 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse32) v_prenex_26) (+ 4 v_arrayElimCell_42)))))) (or (= (select .cse31 .cse2) 0) (= 0 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse31) v_prenex_26) .cse2))))))) (or (and (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_27 Int) (v_arrayElimCell_42 Int)) (let ((.cse33 (let ((.cse34 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_42))) (store .cse34 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse34) v_prenex_27) (+ 4 v_arrayElimCell_42)))))) (or (= (select .cse33 .cse2) 0) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse33) v_prenex_27) .cse2) 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_27 Int) (v_arrayElimCell_42 Int)) (let ((.cse36 (let ((.cse37 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_42))) (store .cse37 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse37) v_prenex_27) (+ 4 v_arrayElimCell_42)))))) (let ((.cse35 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse36) v_prenex_27))) (or (= (select .cse35 4) 0) (= (select .cse36 .cse2) 0) (= (select .cse35 .cse2) 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_27 Int) (v_arrayElimCell_42 Int)) (let ((.cse41 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_42))) (let ((.cse38 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse41) v_prenex_27) (+ 4 v_arrayElimCell_42)))) (let ((.cse40 (store .cse41 4 .cse38))) (let ((.cse39 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse40) v_prenex_27))) (or (= .cse38 0) (= (select .cse39 4) 0) (= (select .cse40 .cse2) 0) (= (select .cse39 .cse2) 0)))))))))) .cse4) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_23 Int) (v_arrayElimCell_42 Int)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse42 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_42))) (store .cse42 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse42) v_prenex_23) (+ 4 v_arrayElimCell_42))))) v_prenex_23) .cse2) 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_26 Int) (v_arrayElimCell_42 Int)) (let ((.cse44 (let ((.cse45 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_42))) (store .cse45 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse45) v_prenex_26) (+ 4 v_arrayElimCell_42)))))) (let ((.cse43 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse44) v_prenex_26))) (or (= (select .cse43 4) 0) (= (select .cse44 .cse2) 0) (= 0 (select .cse43 .cse2)))))))))))) (or .cse46 .cse47 .cse48 (let ((.cse52 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_14 Int)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|) 4 0)) v_prenex_14) .cse2) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))))) (and (or (and .cse22 (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_54 Int)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|) 4 0)) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_54)) 0)))) .cse23 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_14 Int) (v_arrayElimCell_54 Int)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|) 4 0)) v_prenex_14) (+ 4 v_arrayElimCell_54)) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) .cse49 .cse18 .cse24 .cse50 .cse51 .cse25 .cse52 .cse53 .cse54 .cse55 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_17 Int) (v_arrayElimCell_54 Int) (v_arrayElimCell_42 Int)) (let ((.cse56 (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|)) (.cse57 (+ 4 v_arrayElimCell_54))) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store (store .cse56 0 |c_ULTIMATE.start_append_~item~0#1.offset|) 4 0)) |c_ULTIMATE.start_append_~item~0#1.base|) .cse57) 0) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse58 (store .cse56 0 v_arrayElimCell_42))) (store .cse58 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse58) v_prenex_17) (+ 4 v_arrayElimCell_42))))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse57) 0)))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) .cse59 .cse60 .cse61) .cse6) (or (and .cse18 .cse52) .cse6) (or (and .cse22 .cse23 .cse49 .cse24 .cse25 .cse60) .cse6)))) (or (let ((.cse79 (forall ((v_prenex_17 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_54 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse127 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse127 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse127) v_prenex_17) .cse2)))) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_54)) 0))))) (and (or (forall ((v_prenex_22 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_54 Int)) (let ((.cse62 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (let ((.cse63 (+ 4 v_arrayElimCell_54)) (.cse64 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse62 4 0)) v_prenex_22))) (or (= (select (store .cse62 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse62) v_prenex_22) .cse2)) .cse63) 0) (= (select .cse64 .cse63) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select .cse64 4) 0))))) .cse65) (or (and (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_26 Int) (v_arrayElimCell_54 Int)) (let ((.cse70 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (let ((.cse69 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse70) v_prenex_26) .cse2))) (let ((.cse68 (store .cse70 4 .cse69))) (let ((.cse66 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse68) v_prenex_26)) (.cse67 (+ 4 v_arrayElimCell_54))) (or (= (select .cse66 .cse67) 0) (= (select .cse66 4) 0) (= (select .cse68 .cse67) 0) (= .cse69 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_26 Int) (v_arrayElimCell_54 Int)) (let ((.cse71 (let ((.cse73 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse73 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse73) v_prenex_26) .cse2)))) (.cse72 (+ 4 v_arrayElimCell_54))) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse71) v_prenex_26) .cse72) 0) (= (select .cse71 .cse72) 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_26 Int) (v_arrayElimCell_54 Int)) (let ((.cse76 (let ((.cse77 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse77 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse77) v_prenex_26) .cse2))))) (let ((.cse74 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse76) v_prenex_26)) (.cse75 (+ 4 v_arrayElimCell_54))) (or (= (select .cse74 .cse75) 0) (= (select .cse74 4) 0) (= (select .cse76 .cse75) 0)))))))) .cse0) .cse78 (or .cse79 .cse65 .cse4) (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_54 Int)) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|) 4 0)) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_54)) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) .cse65) .cse80 (or (forall ((v_prenex_12 Int) (v_prenex_13 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_54 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse81 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse81 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse81) v_prenex_13) .cse2)))) v_prenex_12) (+ 4 v_arrayElimCell_54)) 0))) .cse0) .cse82 (or (forall ((v_prenex_22 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_54 Int)) (let ((.cse83 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (let ((.cse84 (+ 4 v_arrayElimCell_54)) (.cse85 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse83 4 0)) v_prenex_22))) (or (= (select (store .cse83 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse83) v_prenex_22) .cse2)) .cse84) 0) (= (select .cse85 .cse84) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select .cse85 4) 0) (= (select (select |c_#memory_$Pointer$#1.offset| v_prenex_22) .cse2) 0))))) .cse65) .cse86 (or .cse65 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_prenex_21 Int) (v_arrayElimCell_54 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|) 4 0)) v_prenex_21) (+ 4 v_arrayElimCell_54)) 0)))) .cse87 .cse88 .cse89 (or .cse65 .cse4 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_prenex_20 Int) (v_arrayElimCell_54 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse90 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse90 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse90) v_prenex_20) .cse2)))) v_prenex_20) (+ 4 v_arrayElimCell_54)) 0)))) .cse91 (or (forall ((v_prenex_22 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_54 Int)) (let ((.cse92 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|)) (.cse93 (+ 4 v_arrayElimCell_54))) (or (= (select (store .cse92 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse92) v_prenex_22) .cse2)) .cse93) 0) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse92 4 0)) v_prenex_22) .cse93) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) .cse65) .cse94 (or (forall ((v_prenex_16 Int) (v_prenex_15 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_54 Int)) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse95 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse95 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse95) v_prenex_16) .cse2)))) v_prenex_15) (+ 4 v_arrayElimCell_54)) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) .cse65 .cse4) (or .cse46 .cse47 .cse48 (and .cse50 .cse55)) .cse96 (or .cse65 (forall ((v_arrayElimCell_52 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_54 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|) 4 0)) v_arrayElimCell_52) (+ 4 v_arrayElimCell_54)) 0)))) (or .cse0 .cse79) (or (forall ((v_prenex_23 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_54 Int)) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse97 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse97 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse97) v_prenex_23) .cse2)))) v_prenex_23) (+ 4 v_arrayElimCell_54)) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) .cse0) (or .cse65 (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_arrayElimCell_54 Int) (v_prenex_19 Int)) (let ((.cse98 (let ((.cse100 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse100 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse100) v_prenex_19) .cse2)))) (.cse99 (+ 4 v_arrayElimCell_54))) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse98) v_prenex_19) .cse99) 0) (= (select .cse98 .cse99) 0)))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_18 Int) (v_arrayElimCell_54 Int)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse101 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse101 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse101) v_prenex_18) .cse2)))) v_prenex_18) (+ 4 v_arrayElimCell_54)) 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_arrayElimCell_54 Int) (v_prenex_19 Int)) (let ((.cse106 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (let ((.cse103 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse106) v_prenex_19) .cse2))) (let ((.cse105 (store .cse106 4 .cse103))) (let ((.cse102 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse105) v_prenex_19)) (.cse104 (+ 4 v_arrayElimCell_54))) (or (= (select .cse102 4) 0) (= .cse103 0) (= (select .cse102 .cse104) 0) (= (select .cse105 .cse104) 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_arrayElimCell_54 Int) (v_prenex_19 Int)) (let ((.cse110 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (let ((.cse107 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse110) v_prenex_19) .cse2))) (let ((.cse108 (store .cse110 4 .cse107)) (.cse109 (+ 4 v_arrayElimCell_54))) (or (= .cse107 0) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse108) v_prenex_19) .cse109) 0) (= (select .cse108 .cse109) 0))))))))) .cse4) .cse111 .cse112 (or .cse46 .cse47 .cse48 (forall ((v_prenex_14 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_54 Int)) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|) 4 0)) v_prenex_14) (+ 4 v_arrayElimCell_54)) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (or (and (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_27 Int) (v_arrayElimCell_54 Int)) (let ((.cse117 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (let ((.cse115 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse117) v_prenex_27) .cse2))) (let ((.cse113 (store .cse117 4 .cse115))) (let ((.cse116 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse113) v_prenex_27)) (.cse114 (+ 4 v_arrayElimCell_54))) (or (= (select .cse113 .cse114) 0) (= .cse115 0) (= (select .cse116 4) 0) (= (select .cse116 .cse114) 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_27 Int) (v_arrayElimCell_54 Int)) (let ((.cse118 (let ((.cse120 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse120 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse120) v_prenex_27) .cse2)))) (.cse119 (+ 4 v_arrayElimCell_54))) (or (= (select .cse118 .cse119) 0) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse118) v_prenex_27) .cse119) 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_27 Int) (v_arrayElimCell_54 Int)) (let ((.cse121 (let ((.cse124 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse124 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse124) v_prenex_27) .cse2))))) (let ((.cse123 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse121) v_prenex_27)) (.cse122 (+ 4 v_arrayElimCell_54))) (or (= (select .cse121 .cse122) 0) (= (select .cse123 4) 0) (= (select .cse123 .cse122) 0)))))))) .cse65 .cse4) .cse125 .cse126)) .cse6) (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|)) |c_ULTIMATE.start_append_~item~0#1.base|) .cse2) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) .cse128) (or (and (or .cse65 .cse4) .cse129 .cse130) (forall ((v_prenex_17 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$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse131 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse131 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse131) v_prenex_17) .cse2)))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse2) 0)))) (or (and (or (and .cse132 .cse133 .cse134 .cse135) .cse4) (or .cse0 (and .cse136 (or (and .cse137 .cse138 .cse139) .cse4) .cse140 .cse141 .cse51 (or .cse142 .cse4) .cse53 .cse143 (or .cse144 .cse4) .cse145 .cse54 .cse146 (or (and .cse147 .cse148 .cse149 .cse150) .cse4) .cse151 .cse59 .cse61)) .cse152 .cse153 .cse154 (or (and .cse155 .cse156 (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_prenex_20 Int) (v_arrayElimCell_54 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (let ((.cse158 (+ 4 v_arrayElimCell_54))) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse157 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_54))) (store .cse157 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse157) v_prenex_20) .cse158)))) v_prenex_20) .cse158)) 0))) .cse4)) .cse0) .cse159 .cse160 .cse161 (or (and (or .cse128 .cse162) (or .cse163 .cse128) .cse164 .cse165 .cse166 (or .cse128 .cse167)) .cse4) .cse168 (or .cse0 (and .cse169 .cse170 .cse171 (or (forall ((v_prenex_16 Int) (v_prenex_15 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_54 Int)) (or (= (let ((.cse173 (+ 4 v_arrayElimCell_54))) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse172 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_54))) (store .cse172 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse172) v_prenex_16) .cse173)))) v_prenex_15) .cse173)) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) .cse4))) (or .cse128 .cse174)) .cse6) (or (let ((.cse185 (or .cse0 (forall ((v_prenex_23 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_42 Int)) (or (= (let ((.cse297 (+ 4 v_arrayElimCell_42))) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse296 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_42))) (store .cse296 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse296) v_prenex_23) .cse297)))) v_prenex_23) .cse297)) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))))) (.cse186 (or (forall ((v_prenex_27 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_42 Int)) (let ((.cse294 (+ 4 v_arrayElimCell_42))) (let ((.cse293 (let ((.cse295 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_42))) (store .cse295 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse295) v_prenex_27) .cse294))))) (or (= (select .cse293 .cse294) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse293) v_prenex_27) .cse294) 0))))) .cse65)) (.cse190 (or .cse65 (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)) (= (let ((.cse292 (+ 4 v_arrayElimCell_42))) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse291 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_42))) (store .cse291 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse291) v_prenex_20) .cse292)))) v_prenex_20) .cse292)) 0))))) (.cse191 (forall ((v_prenex_27 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_42 Int)) (let ((.cse289 (+ 4 v_arrayElimCell_42))) (let ((.cse288 (let ((.cse290 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_42))) (store .cse290 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse290) v_prenex_27) .cse289))))) (let ((.cse287 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse288) v_prenex_27))) (or (= (select .cse287 4) 0) (= (select .cse288 .cse289) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select .cse287 .cse289) 0))))))) (.cse196 (or .cse65 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_prenex_21 Int) (v_arrayElimCell_42 Int)) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|) 4 0)) v_prenex_21) (+ 4 v_arrayElimCell_42)) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))))) (and (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_42 Int) (v_prenex_19 Int)) (let ((.cse176 (+ 4 v_arrayElimCell_42))) (let ((.cse175 (let ((.cse177 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_42))) (store .cse177 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse177) v_prenex_19) .cse176))))) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse175) v_prenex_19) .cse176) 0) (= (select .cse175 .cse176) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))))) .cse65) (or .cse6 (and (or .cse0 (and (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_26 Int) (v_arrayElimCell_42 Int)) (let ((.cse180 (+ 4 v_arrayElimCell_42))) (let ((.cse179 (let ((.cse181 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_42))) (store .cse181 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse181) v_prenex_26) .cse180))))) (let ((.cse178 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse179) v_prenex_26))) (or (= (select .cse178 4) 0) (= (select .cse179 .cse180) 0) (= (select .cse178 .cse180) 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_26 Int) (v_arrayElimCell_42 Int)) (let ((.cse183 (+ 4 v_arrayElimCell_42))) (let ((.cse182 (let ((.cse184 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_42))) (store .cse184 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse184) v_prenex_26) .cse183))))) (or (= (select .cse182 .cse183) 0) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse182) v_prenex_26) .cse183) 0))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))))) .cse185 .cse186 (or .cse65 (forall ((v_prenex_22 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_42 Int)) (let ((.cse187 (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|)) (.cse188 (+ 4 v_arrayElimCell_42))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store (store .cse187 0 |c_ULTIMATE.start_append_~item~0#1.offset|) 4 0)) v_prenex_22) .cse188) 0) (= (select (let ((.cse189 (store .cse187 0 v_arrayElimCell_42))) (store .cse189 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse189) v_prenex_22) .cse188))) .cse188) 0))))) .cse190 (or .cse65 .cse191) (or (forall ((v_prenex_22 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_42 Int)) (let ((.cse195 (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|))) (let ((.cse192 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store (store .cse195 0 |c_ULTIMATE.start_append_~item~0#1.offset|) 4 0)) v_prenex_22)) (.cse193 (+ 4 v_arrayElimCell_42))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select .cse192 4) 0) (= (select .cse192 .cse193) 0) (= (select (let ((.cse194 (store .cse195 0 v_arrayElimCell_42))) (store .cse194 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse194) v_prenex_22) .cse193))) .cse193) 0))))) .cse65) .cse196)) (or .cse6 (and (or (forall ((v_prenex_27 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_42 Int)) (let ((.cse198 (+ 4 v_arrayElimCell_42))) (let ((.cse197 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse199 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_42))) (store .cse199 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse199) v_prenex_27) .cse198)))) v_prenex_27))) (or (= (select .cse197 4) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select .cse197 .cse198) 0))))) .cse128) .cse185 .cse186 .cse190 (or .cse191 .cse128) (or (forall ((v_prenex_26 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_42 Int)) (let ((.cse201 (+ 4 v_arrayElimCell_42))) (let ((.cse200 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse202 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_42))) (store .cse202 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse202) v_prenex_26) .cse201)))) v_prenex_26))) (or (= (select .cse200 4) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select .cse200 .cse201) 0))))) .cse128) (or (and (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_22 Int) (v_arrayElimCell_42 Int)) (let ((.cse206 (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|))) (let ((.cse203 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store (store .cse206 0 |c_ULTIMATE.start_append_~item~0#1.offset|) 4 0)) v_prenex_22)) (.cse204 (+ 4 v_arrayElimCell_42))) (or (= (select .cse203 4) 0) (= (select .cse203 .cse204) 0) (= (select (let ((.cse205 (store .cse206 0 v_arrayElimCell_42))) (store .cse205 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse205) v_prenex_22) .cse204))) .cse204) 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_22 Int) (v_arrayElimCell_42 Int)) (let ((.cse207 (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|)) (.cse208 (+ 4 v_arrayElimCell_42))) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store (store .cse207 0 |c_ULTIMATE.start_append_~item~0#1.offset|) 4 0)) v_prenex_22) .cse208) 0) (= (select (let ((.cse209 (store .cse207 0 v_arrayElimCell_42))) (store .cse209 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse209) v_prenex_22) .cse208))) .cse208) 0))))))) .cse65) (or (forall ((v_prenex_26 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_42 Int)) (let ((.cse211 (+ 4 v_arrayElimCell_42))) (let ((.cse210 (let ((.cse212 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_42))) (store .cse212 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse212) v_prenex_26) .cse211))))) (or (= (select .cse210 .cse211) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse210) v_prenex_26) .cse211) 0))))) .cse0) (or (forall ((v_prenex_26 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_42 Int)) (let ((.cse213 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_42))) (let ((.cse214 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse213) v_prenex_26) (+ 4 v_arrayElimCell_42)))) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse213 4 .cse214)) v_prenex_26) 4) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= .cse214 0))))) .cse128) (or (forall ((v_prenex_29 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_42 Int)) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_42)) v_prenex_29) (+ 4 v_arrayElimCell_42)) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) .cse128) (or (forall ((v_prenex_26 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_42 Int)) (let ((.cse217 (+ 4 v_arrayElimCell_42))) (let ((.cse216 (let ((.cse218 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_42))) (store .cse218 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse218) v_prenex_26) .cse217))))) (let ((.cse215 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse216) v_prenex_26))) (or (= (select .cse215 4) 0) (= (select .cse216 .cse217) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select .cse215 .cse217) 0)))))) .cse128) (or .cse128 (forall ((v_prenex_27 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_42 Int)) (let ((.cse220 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_42))) (let ((.cse219 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse220) v_prenex_27) (+ 4 v_arrayElimCell_42)))) (or (= .cse219 0) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse220 4 .cse219)) v_prenex_27) 4) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))))) .cse196)) (or (forall ((v_prenex_18 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_42 Int)) (or (= (let ((.cse222 (+ 4 v_arrayElimCell_42))) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse221 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_42))) (store .cse221 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse221) v_prenex_18) .cse222)))) v_prenex_18) .cse222)) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) .cse65) (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_42 Int)) (or (= (let ((.cse224 (+ 4 v_arrayElimCell_42))) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse223 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_42))) (store .cse223 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse223) |c_ULTIMATE.start_append_~item~0#1.base|) .cse224)))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse224)) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) .cse65) (or .cse65 (forall ((v_prenex_16 Int) (v_prenex_15 Int) (|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)) (= (let ((.cse226 (+ 4 v_arrayElimCell_42))) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse225 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_42))) (store .cse225 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse225) v_prenex_16) .cse226)))) v_prenex_15) .cse226)) 0)))) (or .cse6 (and (or (forall ((v_arrayElimCell_52 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_42 Int)) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|) 4 0)) v_arrayElimCell_52) (+ 4 v_arrayElimCell_42)) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) .cse65) (or (forall ((v_prenex_12 Int) (v_prenex_13 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_42 Int)) (or (= (let ((.cse228 (+ 4 v_arrayElimCell_42))) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse227 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_42))) (store .cse227 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse227) v_prenex_13) .cse228)))) v_prenex_12) .cse228)) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) .cse0))) (or .cse65 (forall ((v_prenex_17 Int) (|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)) (= (let ((.cse230 (+ 4 v_arrayElimCell_42))) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse229 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_42))) (store .cse229 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse229) v_prenex_17) .cse230)))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse230)) 0)))) (or (forall ((v_prenex_28 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_42 Int)) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_42)) v_prenex_28) (+ 4 v_arrayElimCell_42)) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) .cse128) (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_42 Int) (v_prenex_19 Int)) (let ((.cse231 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_42))) (let ((.cse232 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse231) v_prenex_19) (+ 4 v_arrayElimCell_42)))) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store .cse231 4 .cse232)) v_prenex_19) 4) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= .cse232 0))))) .cse128) (or .cse65 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_42 Int) (v_prenex_19 Int)) (let ((.cse233 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_42)) (.cse235 (+ 4 v_arrayElimCell_42))) (let ((.cse234 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse233) v_prenex_19) .cse235))) (or (= (select (store .cse233 4 .cse234) .cse235) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= .cse234 0)))))) (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_42 Int) (v_prenex_19 Int)) (let ((.cse239 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_42)) (.cse237 (+ 4 v_arrayElimCell_42))) (let ((.cse238 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse239) v_prenex_19) .cse237))) (let ((.cse236 (store .cse239 4 .cse238))) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse236) v_prenex_19) 4) 0) (= (select .cse236 .cse237) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= .cse238 0)))))) .cse128) (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_42 Int)) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_42)) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_42)) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) .cse128) (or .cse6 (and (or (forall ((v_prenex_27 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_54 Int) (v_arrayElimCell_42 Int)) (let ((.cse240 (let ((.cse242 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_42))) (store .cse242 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse242) v_prenex_27) (+ 4 v_arrayElimCell_42))))) (.cse241 (+ 4 v_arrayElimCell_54))) (or (= (select .cse240 .cse241) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse240) v_prenex_27) .cse241) 0)))) .cse65) (or (forall ((v_prenex_27 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_54 Int) (v_arrayElimCell_42 Int)) (let ((.cse247 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_42))) (let ((.cse243 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse247) v_prenex_27) (+ 4 v_arrayElimCell_42)))) (let ((.cse244 (store .cse247 4 .cse243))) (let ((.cse246 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse244) v_prenex_27)) (.cse245 (+ 4 v_arrayElimCell_54))) (or (= .cse243 0) (= (select .cse244 .cse245) 0) (= (select .cse246 4) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select .cse246 .cse245) 0))))))) .cse65) (or .cse65 .cse142) (or .cse65 (forall ((v_prenex_22 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_54 Int) (v_arrayElimCell_42 Int)) (let ((.cse250 (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|))) (let ((.cse249 (+ 4 v_arrayElimCell_42)) (.cse251 (+ 4 v_arrayElimCell_54)) (.cse252 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store (store .cse250 0 |c_ULTIMATE.start_append_~item~0#1.offset|) 4 0)) v_prenex_22))) (or (= (select (let ((.cse248 (store .cse250 0 v_arrayElimCell_42))) (store .cse248 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse248) v_prenex_22) .cse249))) .cse251) 0) (= (select (select |c_#memory_$Pointer$#1.offset| v_prenex_22) .cse249) 0) (= (select .cse252 .cse251) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select .cse252 4) 0)))))) (or .cse65 (forall ((v_prenex_17 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_54 Int) (v_arrayElimCell_42 Int)) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse253 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_42))) (store .cse253 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse253) v_prenex_17) (+ 4 v_arrayElimCell_42))))) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_54)) 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_arrayElimCell_54 Int) (v_arrayElimCell_42 Int)) (let ((.cse255 (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|))) (let ((.cse256 (+ 4 v_arrayElimCell_54)) (.cse257 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store (store .cse255 0 |c_ULTIMATE.start_append_~item~0#1.offset|) 4 0)) v_prenex_22))) (or (= (select (let ((.cse254 (store .cse255 0 v_arrayElimCell_42))) (store .cse254 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse254) v_prenex_22) (+ 4 v_arrayElimCell_42)))) .cse256) 0) (= (select .cse257 .cse256) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select .cse257 4) 0))))) .cse65) (or (forall ((v_arrayElimCell_52 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_54 Int) (v_arrayElimCell_43 Int) (v_arrayElimCell_42 Int)) (let ((.cse259 (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|)) (.cse260 (+ 4 v_arrayElimCell_54))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse258 (store .cse259 0 v_arrayElimCell_42))) (store .cse258 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse258) v_arrayElimCell_43) (+ 4 v_arrayElimCell_42))))) v_arrayElimCell_52) .cse260) 0) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store (store .cse259 0 |c_ULTIMATE.start_append_~item~0#1.offset|) 4 0)) v_arrayElimCell_52) .cse260) 0)))) .cse65) (or .cse144 .cse65) (or .cse65 (forall ((v_prenex_27 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_54 Int) (v_arrayElimCell_42 Int)) (let ((.cse261 (let ((.cse264 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_42))) (store .cse264 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse264) v_prenex_27) (+ 4 v_arrayElimCell_42)))))) (let ((.cse263 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse261) v_prenex_27)) (.cse262 (+ 4 v_arrayElimCell_54))) (or (= (select .cse261 .cse262) 0) (= (select .cse263 4) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select .cse263 .cse262) 0)))))) (or .cse65 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_54 Int) (v_arrayElimCell_42 Int) (v_prenex_19 Int)) (let ((.cse265 (let ((.cse267 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_42))) (store .cse267 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse267) v_prenex_19) (+ 4 v_arrayElimCell_42))))) (.cse266 (+ 4 v_arrayElimCell_54))) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse265) v_prenex_19) .cse266) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select .cse265 .cse266) 0))))) (or .cse65 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_54 Int) (v_arrayElimCell_42 Int) (v_prenex_19 Int)) (let ((.cse271 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_42))) (let ((.cse270 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse271) v_prenex_19) (+ 4 v_arrayElimCell_42)))) (let ((.cse268 (store .cse271 4 .cse270)) (.cse269 (+ 4 v_arrayElimCell_54))) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse268) v_prenex_19) .cse269) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= .cse270 0) (= (select .cse268 .cse269) 0))))))) (or .cse65 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_prenex_21 Int) (v_arrayElimCell_54 Int) (v_arrayElimCell_42 Int)) (let ((.cse273 (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|)) (.cse274 (+ 4 v_arrayElimCell_54))) (or (= 0 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse272 (store .cse273 0 v_arrayElimCell_42))) (store .cse272 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse272) v_prenex_21) (+ 4 v_arrayElimCell_42))))) v_prenex_21) .cse274)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store (store .cse273 0 |c_ULTIMATE.start_append_~item~0#1.offset|) 4 0)) v_prenex_21) .cse274) 0))))) (or (forall ((v_prenex_12 Int) (v_prenex_13 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_54 Int) (v_arrayElimCell_42 Int)) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse275 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_42))) (store .cse275 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse275) v_prenex_13) (+ 4 v_arrayElimCell_42))))) v_prenex_12) (+ 4 v_arrayElimCell_54)) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) .cse0) (or (and .cse136 .cse140 .cse143) .cse0) (or .cse65 (forall ((v_prenex_18 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_54 Int) (v_arrayElimCell_42 Int)) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse276 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_42))) (store .cse276 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse276) v_prenex_18) (+ 4 v_arrayElimCell_42))))) v_prenex_18) (+ 4 v_arrayElimCell_54)) 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_arrayElimCell_54 Int) (v_arrayElimCell_42 Int)) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse277 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_42))) (store .cse277 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse277) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_42))))) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_54)) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) .cse65) (or .cse0 (forall ((v_prenex_23 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_54 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$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse278 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_42))) (store .cse278 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse278) v_prenex_23) (+ 4 v_arrayElimCell_42))))) v_prenex_23) (+ 4 v_arrayElimCell_54)) 0)))) (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_54 Int) (v_arrayElimCell_42 Int) (v_prenex_19 Int)) (let ((.cse283 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_42))) (let ((.cse281 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse283) v_prenex_19) (+ 4 v_arrayElimCell_42)))) (let ((.cse282 (store .cse283 4 .cse281))) (let ((.cse279 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse282) v_prenex_19)) (.cse280 (+ 4 v_arrayElimCell_54))) (or (= (select .cse279 4) 0) (= (select .cse279 .cse280) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= .cse281 0) (= (select .cse282 .cse280) 0))))))) .cse65) (or .cse65 (forall ((v_prenex_22 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_arrayElimCell_54 Int) (v_arrayElimCell_42 Int)) (let ((.cse285 (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|)) (.cse286 (+ 4 v_arrayElimCell_54))) (or (= (select (let ((.cse284 (store .cse285 0 v_arrayElimCell_42))) (store .cse284 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse284) v_prenex_22) (+ 4 v_arrayElimCell_42)))) .cse286) 0) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store (store .cse285 0 |c_ULTIMATE.start_append_~item~0#1.offset|) 4 0)) v_prenex_22) .cse286) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))))))))) .cse4) (or .cse6 (and .cse80 .cse82 .cse86 .cse87 .cse89 .cse91 .cse94 .cse96 .cse111 .cse112 .cse125)) (or (and (or .cse298 .cse174) (or .cse298 .cse162) .cse164 (or .cse0 (and (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_16 Int) (v_prenex_15 Int) (v_arrayElimCell_54 Int)) (= (let ((.cse300 (+ 4 v_arrayElimCell_54))) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse299 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_54))) (store .cse299 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse299) v_prenex_16) .cse300)))) v_prenex_15) .cse300)) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) (or .cse6 (and .cse169 .cse170)) .cse171)) .cse165 .cse166 (or .cse6 (and .cse132 .cse133 .cse134 .cse152 .cse153 .cse154 .cse159 (or (and .cse155 .cse156 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_20 Int) (v_arrayElimCell_54 Int)) (= (let ((.cse302 (+ 4 v_arrayElimCell_54))) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse301 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_54))) (store .cse301 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse301) v_prenex_20) .cse302)))) v_prenex_20) .cse302)) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) .cse0) .cse160 .cse161 .cse168 .cse135)) (or .cse0 (and .cse141 .cse147 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_16 Int) (v_prenex_15 Int) (v_arrayElimCell_54 Int) (v_arrayElimCell_42 Int)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse303 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_42))) (store .cse303 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse303) v_prenex_16) (+ 4 v_arrayElimCell_42))))) v_prenex_15) (+ 4 v_arrayElimCell_54)) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) .cse148 .cse149 (or .cse6 (and .cse53 .cse146)) .cse151 (or (and .cse136 .cse140 .cse51 (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_54 Int) (v_arrayElimCell_42 Int)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse304 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_42))) (store .cse304 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse304) v_prenex_20) (+ 4 v_arrayElimCell_42))))) v_prenex_20) (+ 4 v_arrayElimCell_54)) 0)))) .cse143 .cse137 .cse145 .cse54 .cse138 .cse139 .cse59 .cse61) .cse6) .cse150)) (or .cse6 .cse128 .cse167) (or .cse163 .cse6 .cse128)) .cse4) (or (and (or .cse305 .cse0) (or .cse306 .cse298) (or .cse0 .cse307) (or .cse308 .cse6 .cse128) (or .cse309 .cse6 .cse128) (or .cse0 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_prenex_19 Int)) (let ((.cse311 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (let ((.cse310 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse311) v_prenex_19) .cse2))) (or (= .cse310 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (store .cse311 4 .cse310) .cse2) 0))))))) .cse4) (or .cse65 .cse3 .cse4) (or (and (or .cse306 .cse128) (or .cse307 .cse65) (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_prenex_19 Int)) (let ((.cse313 (let ((.cse314 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse314 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse314) v_prenex_19) .cse2))))) (let ((.cse312 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse313) v_prenex_19))) (or (= (select .cse312 4) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= 0 (select .cse312 .cse2)) (= (select .cse313 .cse2) 0))))) .cse128) (or .cse309 .cse128) (or .cse308 .cse128) (or .cse305 .cse65)) .cse4) (or .cse6 (and (or .cse0 .cse315) .cse82 (or (and (or .cse316 .cse4) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_23 Int)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse317 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse317 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse317) v_prenex_23) .cse2)))) v_prenex_23) .cse2) 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_21 Int)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (store (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|) 4 0)) v_prenex_21) .cse2) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) .cse0) .cse87 .cse91 .cse96 (or .cse0 .cse318) (or (forall ((v_prenex_26 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (let ((.cse321 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (let ((.cse320 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse321) v_prenex_26) .cse2))) (let ((.cse319 (store .cse321 4 .cse320))) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse319) v_prenex_26) 4) 0) (= (select .cse319 .cse2) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= .cse320 0)))))) .cse128) (or (and (or .cse322 .cse128) .cse323 .cse324 (or .cse0 .cse325)) .cse4))) (or (and .cse78 .cse88 .cse126) .cse6)))))) is different from true