./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0232-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0232-2.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d7d99b84861b7e58e44833cf97c5fb5fa14d1ad6f1b87526d3144a9659451e97 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 17:57:08,585 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 17:57:08,680 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-11 17:57:08,686 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 17:57:08,688 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 17:57:08,716 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 17:57:08,717 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 17:57:08,717 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 17:57:08,718 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 17:57:08,718 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 17:57:08,718 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 17:57:08,719 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 17:57:08,719 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 17:57:08,720 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 17:57:08,720 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 17:57:08,720 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 17:57:08,721 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 17:57:08,721 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 17:57:08,721 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 17:57:08,722 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 17:57:08,722 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 17:57:08,723 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 17:57:08,723 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-11 17:57:08,723 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 17:57:08,724 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 17:57:08,724 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 17:57:08,724 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 17:57:08,724 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 17:57:08,725 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 17:57:08,725 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 17:57:08,725 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 17:57:08,726 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 17:57:08,726 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 17:57:08,726 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:57:08,727 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 17:57:08,727 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 17:57:08,727 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 17:57:08,727 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 17:57:08,728 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 17:57:08,728 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 17:57:08,728 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 17:57:08,730 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 17:57:08,731 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-clean/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-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d7d99b84861b7e58e44833cf97c5fb5fa14d1ad6f1b87526d3144a9659451e97 [2024-10-11 17:57:08,984 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 17:57:09,008 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 17:57:09,012 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 17:57:09,013 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 17:57:09,014 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 17:57:09,015 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0232-2.i [2024-10-11 17:57:10,422 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 17:57:10,676 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 17:57:10,677 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0232-2.i [2024-10-11 17:57:10,692 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/ce937d3f9/d41c9fd56bc04058a954636dbaf5e432/FLAG3308b4153 [2024-10-11 17:57:10,990 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/ce937d3f9/d41c9fd56bc04058a954636dbaf5e432 [2024-10-11 17:57:10,994 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 17:57:10,995 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 17:57:10,997 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 17:57:10,998 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 17:57:11,002 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 17:57:11,003 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:57:10" (1/1) ... [2024-10-11 17:57:11,003 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bb24943 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:57:11, skipping insertion in model container [2024-10-11 17:57:11,004 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:57:10" (1/1) ... [2024-10-11 17:57:11,045 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 17:57:11,358 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:57:11,367 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 17:57:11,411 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:57:11,447 INFO L204 MainTranslator]: Completed translation [2024-10-11 17:57:11,447 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:57:11 WrapperNode [2024-10-11 17:57:11,447 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 17:57:11,448 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 17:57:11,449 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 17:57:11,449 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 17:57:11,456 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:57:11" (1/1) ... [2024-10-11 17:57:11,476 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:57:11" (1/1) ... [2024-10-11 17:57:11,502 INFO L138 Inliner]: procedures = 126, calls = 35, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 91 [2024-10-11 17:57:11,503 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 17:57:11,504 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 17:57:11,504 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 17:57:11,504 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 17:57:11,515 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:57:11" (1/1) ... [2024-10-11 17:57:11,516 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:57:11" (1/1) ... [2024-10-11 17:57:11,519 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:57:11" (1/1) ... [2024-10-11 17:57:11,535 INFO L175 MemorySlicer]: Split 22 memory accesses to 3 slices as follows [2, 8, 12]. 55 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-10-11 17:57:11,535 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:57:11" (1/1) ... [2024-10-11 17:57:11,535 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:57:11" (1/1) ... [2024-10-11 17:57:11,542 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:57:11" (1/1) ... [2024-10-11 17:57:11,545 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:57:11" (1/1) ... [2024-10-11 17:57:11,546 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:57:11" (1/1) ... [2024-10-11 17:57:11,547 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:57:11" (1/1) ... [2024-10-11 17:57:11,550 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 17:57:11,551 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 17:57:11,551 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 17:57:11,551 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 17:57:11,552 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:57:11" (1/1) ... [2024-10-11 17:57:11,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:57:11,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:57:11,580 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 17:57:11,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 17:57:11,674 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 17:57:11,675 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 17:57:11,675 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 17:57:11,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 17:57:11,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 17:57:11,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-11 17:57:11,676 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 17:57:11,676 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 17:57:11,676 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-11 17:57:11,676 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 17:57:11,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-11 17:57:11,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-11 17:57:11,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-11 17:57:11,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 17:57:11,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 17:57:11,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 17:57:11,679 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 17:57:11,679 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 17:57:11,790 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 17:57:11,792 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 17:57:12,087 INFO L? ?]: Removed 103 outVars from TransFormulas that were not future-live. [2024-10-11 17:57:12,087 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 17:57:12,133 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 17:57:12,133 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-11 17:57:12,134 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:57:12 BoogieIcfgContainer [2024-10-11 17:57:12,134 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 17:57:12,137 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 17:57:12,138 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 17:57:12,141 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 17:57:12,141 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 05:57:10" (1/3) ... [2024-10-11 17:57:12,142 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27e93431 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:57:12, skipping insertion in model container [2024-10-11 17:57:12,143 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:57:11" (2/3) ... [2024-10-11 17:57:12,143 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27e93431 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:57:12, skipping insertion in model container [2024-10-11 17:57:12,144 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:57:12" (3/3) ... [2024-10-11 17:57:12,145 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0232-2.i [2024-10-11 17:57:12,160 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 17:57:12,161 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 48 error locations. [2024-10-11 17:57:12,205 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 17:57:12,210 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;@2f9c3c74, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 17:57:12,211 INFO L334 AbstractCegarLoop]: Starting to check reachability of 48 error locations. [2024-10-11 17:57:12,215 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 36 states have (on average 2.5) internal successors, (90), 84 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:57:12,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-10-11 17:57:12,221 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:12,221 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-10-11 17:57:12,222 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2024-10-11 17:57:12,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:12,227 INFO L85 PathProgramCache]: Analyzing trace with hash 161642, now seen corresponding path program 1 times [2024-10-11 17:57:12,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:12,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290458187] [2024-10-11 17:57:12,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:12,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:12,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:12,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:57:12,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:12,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290458187] [2024-10-11 17:57:12,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290458187] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:12,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:57:12,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:57:12,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671303498] [2024-10-11 17:57:12,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:12,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:57:12,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:12,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:57:12,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:57:12,585 INFO L87 Difference]: Start difference. First operand has 85 states, 36 states have (on average 2.5) internal successors, (90), 84 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:57:12,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:12,726 INFO L93 Difference]: Finished difference Result 77 states and 80 transitions. [2024-10-11 17:57:12,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:57:12,729 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-10-11 17:57:12,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:12,736 INFO L225 Difference]: With dead ends: 77 [2024-10-11 17:57:12,736 INFO L226 Difference]: Without dead ends: 76 [2024-10-11 17:57:12,738 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:57:12,741 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 73 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:57:12,742 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 59 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:57:12,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-10-11 17:57:12,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2024-10-11 17:57:12,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 36 states have (on average 2.1944444444444446) internal successors, (79), 75 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:57:12,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2024-10-11 17:57:12,778 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 3 [2024-10-11 17:57:12,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:12,778 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2024-10-11 17:57:12,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:57:12,778 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2024-10-11 17:57:12,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-10-11 17:57:12,778 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:12,779 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-10-11 17:57:12,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 17:57:12,779 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2024-10-11 17:57:12,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:12,780 INFO L85 PathProgramCache]: Analyzing trace with hash 161643, now seen corresponding path program 1 times [2024-10-11 17:57:12,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:12,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015004399] [2024-10-11 17:57:12,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:12,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:12,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:12,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:57:12,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:12,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015004399] [2024-10-11 17:57:12,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015004399] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:12,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:57:12,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:57:12,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944446398] [2024-10-11 17:57:12,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:12,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:57:12,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:12,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:57:12,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:57:12,996 INFO L87 Difference]: Start difference. First operand 76 states and 79 transitions. Second operand has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:57:13,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:13,169 INFO L93 Difference]: Finished difference Result 85 states and 89 transitions. [2024-10-11 17:57:13,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:57:13,169 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-10-11 17:57:13,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:13,170 INFO L225 Difference]: With dead ends: 85 [2024-10-11 17:57:13,171 INFO L226 Difference]: Without dead ends: 85 [2024-10-11 17:57:13,171 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:57:13,172 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 66 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:57:13,173 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 66 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:57:13,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-10-11 17:57:13,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 76. [2024-10-11 17:57:13,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 41 states have (on average 2.0) internal successors, (82), 75 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:57:13,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 82 transitions. [2024-10-11 17:57:13,185 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 82 transitions. Word has length 3 [2024-10-11 17:57:13,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:13,185 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 82 transitions. [2024-10-11 17:57:13,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:57:13,186 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2024-10-11 17:57:13,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-11 17:57:13,186 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:13,186 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-11 17:57:13,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 17:57:13,187 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2024-10-11 17:57:13,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:13,188 INFO L85 PathProgramCache]: Analyzing trace with hash 5010882, now seen corresponding path program 1 times [2024-10-11 17:57:13,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:13,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731948892] [2024-10-11 17:57:13,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:13,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:13,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:13,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:57:13,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:13,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731948892] [2024-10-11 17:57:13,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731948892] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:13,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:57:13,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:57:13,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93657287] [2024-10-11 17:57:13,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:13,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:57:13,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:13,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:57:13,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:57:13,244 INFO L87 Difference]: Start difference. First operand 76 states and 82 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:57:13,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:13,317 INFO L93 Difference]: Finished difference Result 72 states and 78 transitions. [2024-10-11 17:57:13,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:57:13,319 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-10-11 17:57:13,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:13,320 INFO L225 Difference]: With dead ends: 72 [2024-10-11 17:57:13,320 INFO L226 Difference]: Without dead ends: 72 [2024-10-11 17:57:13,320 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-10-11 17:57:13,321 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 8 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:57:13,322 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 79 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:57:13,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-10-11 17:57:13,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-10-11 17:57:13,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 41 states have (on average 1.9024390243902438) internal successors, (78), 71 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:57:13,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 78 transitions. [2024-10-11 17:57:13,330 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 78 transitions. Word has length 4 [2024-10-11 17:57:13,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:13,330 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 78 transitions. [2024-10-11 17:57:13,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:57:13,330 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 78 transitions. [2024-10-11 17:57:13,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-11 17:57:13,331 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:13,331 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-11 17:57:13,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 17:57:13,331 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2024-10-11 17:57:13,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:13,332 INFO L85 PathProgramCache]: Analyzing trace with hash 5010883, now seen corresponding path program 1 times [2024-10-11 17:57:13,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:13,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928056663] [2024-10-11 17:57:13,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:13,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:13,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:13,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:57:13,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:13,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928056663] [2024-10-11 17:57:13,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928056663] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:13,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:57:13,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:57:13,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40042714] [2024-10-11 17:57:13,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:13,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:57:13,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:13,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:57:13,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:57:13,397 INFO L87 Difference]: Start difference. First operand 72 states and 78 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:57:13,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:13,457 INFO L93 Difference]: Finished difference Result 68 states and 74 transitions. [2024-10-11 17:57:13,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:57:13,457 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-10-11 17:57:13,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:13,458 INFO L225 Difference]: With dead ends: 68 [2024-10-11 17:57:13,458 INFO L226 Difference]: Without dead ends: 68 [2024-10-11 17:57:13,458 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-10-11 17:57:13,460 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 8 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:57:13,460 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 84 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:57:13,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-10-11 17:57:13,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2024-10-11 17:57:13,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 41 states have (on average 1.8048780487804879) internal successors, (74), 67 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:57:13,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 74 transitions. [2024-10-11 17:57:13,469 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 74 transitions. Word has length 4 [2024-10-11 17:57:13,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:13,469 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 74 transitions. [2024-10-11 17:57:13,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:57:13,469 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 74 transitions. [2024-10-11 17:57:13,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-11 17:57:13,470 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:13,470 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:57:13,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 17:57:13,470 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2024-10-11 17:57:13,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:13,471 INFO L85 PathProgramCache]: Analyzing trace with hash 2084389185, now seen corresponding path program 1 times [2024-10-11 17:57:13,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:13,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313550255] [2024-10-11 17:57:13,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:13,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:13,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:13,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:57:13,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:13,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313550255] [2024-10-11 17:57:13,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313550255] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:13,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:57:13,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 17:57:13,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620447735] [2024-10-11 17:57:13,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:13,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 17:57:13,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:13,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 17:57:13,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 17:57:13,690 INFO L87 Difference]: Start difference. First operand 68 states and 74 transitions. Second operand has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 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-10-11 17:57:13,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:13,865 INFO L93 Difference]: Finished difference Result 75 states and 81 transitions. [2024-10-11 17:57:13,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 17:57:13,866 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2024-10-11 17:57:13,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:13,866 INFO L225 Difference]: With dead ends: 75 [2024-10-11 17:57:13,866 INFO L226 Difference]: Without dead ends: 75 [2024-10-11 17:57:13,867 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-10-11 17:57:13,870 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 13 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:57:13,870 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 296 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:57:13,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-10-11 17:57:13,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2024-10-11 17:57:13,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 46 states have (on average 1.7173913043478262) internal successors, (79), 72 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:57:13,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 79 transitions. [2024-10-11 17:57:13,878 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 79 transitions. Word has length 8 [2024-10-11 17:57:13,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:13,879 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 79 transitions. [2024-10-11 17:57:13,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 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-10-11 17:57:13,880 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 79 transitions. [2024-10-11 17:57:13,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-11 17:57:13,881 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:13,881 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:57:13,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 17:57:13,881 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2024-10-11 17:57:13,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:13,882 INFO L85 PathProgramCache]: Analyzing trace with hash -2024679669, now seen corresponding path program 1 times [2024-10-11 17:57:13,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:13,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828131388] [2024-10-11 17:57:13,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:13,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:13,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:14,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:57:14,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:14,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828131388] [2024-10-11 17:57:14,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828131388] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:14,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:57:14,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:57:14,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673415434] [2024-10-11 17:57:14,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:14,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:57:14,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:14,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:57:14,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:57:14,067 INFO L87 Difference]: Start difference. First operand 73 states and 79 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 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-10-11 17:57:14,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:14,205 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2024-10-11 17:57:14,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:57:14,209 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2024-10-11 17:57:14,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:14,209 INFO L225 Difference]: With dead ends: 83 [2024-10-11 17:57:14,210 INFO L226 Difference]: Without dead ends: 83 [2024-10-11 17:57:14,210 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-10-11 17:57:14,211 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 49 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:57:14,211 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 98 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:57:14,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-10-11 17:57:14,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 72. [2024-10-11 17:57:14,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 46 states have (on average 1.6956521739130435) internal successors, (78), 71 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:57:14,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 78 transitions. [2024-10-11 17:57:14,217 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 78 transitions. Word has length 13 [2024-10-11 17:57:14,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:14,218 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 78 transitions. [2024-10-11 17:57:14,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 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-10-11 17:57:14,218 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 78 transitions. [2024-10-11 17:57:14,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-11 17:57:14,219 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:14,219 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:57:14,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 17:57:14,219 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2024-10-11 17:57:14,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:14,220 INFO L85 PathProgramCache]: Analyzing trace with hash -2024679668, now seen corresponding path program 1 times [2024-10-11 17:57:14,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:14,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242998689] [2024-10-11 17:57:14,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:14,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:14,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:14,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:57:14,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:14,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242998689] [2024-10-11 17:57:14,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242998689] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:14,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:57:14,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:57:14,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994440174] [2024-10-11 17:57:14,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:14,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:57:14,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:14,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:57:14,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:57:14,464 INFO L87 Difference]: Start difference. First operand 72 states and 78 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 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-10-11 17:57:14,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:14,601 INFO L93 Difference]: Finished difference Result 83 states and 89 transitions. [2024-10-11 17:57:14,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:57:14,603 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2024-10-11 17:57:14,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:14,603 INFO L225 Difference]: With dead ends: 83 [2024-10-11 17:57:14,603 INFO L226 Difference]: Without dead ends: 83 [2024-10-11 17:57:14,604 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-11 17:57:14,607 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 57 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:57:14,607 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 99 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:57:14,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-10-11 17:57:14,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 71. [2024-10-11 17:57:14,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 46 states have (on average 1.673913043478261) internal successors, (77), 70 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:57:14,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 77 transitions. [2024-10-11 17:57:14,615 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 77 transitions. Word has length 13 [2024-10-11 17:57:14,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:14,618 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 77 transitions. [2024-10-11 17:57:14,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 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-10-11 17:57:14,619 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 77 transitions. [2024-10-11 17:57:14,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-11 17:57:14,619 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:14,619 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:57:14,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 17:57:14,620 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2024-10-11 17:57:14,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:14,620 INFO L85 PathProgramCache]: Analyzing trace with hash -96898914, now seen corresponding path program 1 times [2024-10-11 17:57:14,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:14,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431011188] [2024-10-11 17:57:14,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:14,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:14,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:14,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:57:14,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:14,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431011188] [2024-10-11 17:57:14,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431011188] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:14,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:57:14,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 17:57:14,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873167887] [2024-10-11 17:57:14,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:14,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:57:14,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:14,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:57:14,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:57:14,703 INFO L87 Difference]: Start difference. First operand 71 states and 77 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 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-10-11 17:57:14,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:14,798 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2024-10-11 17:57:14,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 17:57:14,799 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2024-10-11 17:57:14,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:14,799 INFO L225 Difference]: With dead ends: 70 [2024-10-11 17:57:14,799 INFO L226 Difference]: Without dead ends: 70 [2024-10-11 17:57:14,800 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-10-11 17:57:14,800 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 8 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:57:14,801 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 124 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:57:14,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-10-11 17:57:14,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2024-10-11 17:57:14,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 46 states have (on average 1.6521739130434783) internal successors, (76), 69 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:57:14,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 76 transitions. [2024-10-11 17:57:14,805 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 76 transitions. Word has length 15 [2024-10-11 17:57:14,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:14,806 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 76 transitions. [2024-10-11 17:57:14,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 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-10-11 17:57:14,806 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2024-10-11 17:57:14,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-11 17:57:14,807 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:14,807 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:57:14,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 17:57:14,807 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2024-10-11 17:57:14,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:14,808 INFO L85 PathProgramCache]: Analyzing trace with hash -96898913, now seen corresponding path program 1 times [2024-10-11 17:57:14,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:14,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755019246] [2024-10-11 17:57:14,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:14,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:14,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:15,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:57:15,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:15,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755019246] [2024-10-11 17:57:15,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755019246] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:15,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:57:15,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 17:57:15,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445534110] [2024-10-11 17:57:15,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:15,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 17:57:15,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:15,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 17:57:15,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-11 17:57:15,128 INFO L87 Difference]: Start difference. First operand 70 states and 76 transitions. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 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-10-11 17:57:15,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:15,279 INFO L93 Difference]: Finished difference Result 81 states and 87 transitions. [2024-10-11 17:57:15,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 17:57:15,279 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2024-10-11 17:57:15,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:15,280 INFO L225 Difference]: With dead ends: 81 [2024-10-11 17:57:15,280 INFO L226 Difference]: Without dead ends: 81 [2024-10-11 17:57:15,280 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-10-11 17:57:15,281 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 54 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:57:15,281 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 132 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:57:15,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-10-11 17:57:15,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 69. [2024-10-11 17:57:15,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 46 states have (on average 1.6304347826086956) internal successors, (75), 68 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:57:15,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 75 transitions. [2024-10-11 17:57:15,285 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 75 transitions. Word has length 15 [2024-10-11 17:57:15,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:15,285 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 75 transitions. [2024-10-11 17:57:15,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 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-10-11 17:57:15,285 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 75 transitions. [2024-10-11 17:57:15,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-11 17:57:15,286 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:15,286 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:57:15,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 17:57:15,286 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2024-10-11 17:57:15,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:15,287 INFO L85 PathProgramCache]: Analyzing trace with hash -64403600, now seen corresponding path program 1 times [2024-10-11 17:57:15,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:15,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117933308] [2024-10-11 17:57:15,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:15,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:15,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:15,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:57:15,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:15,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117933308] [2024-10-11 17:57:15,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117933308] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:15,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:57:15,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:57:15,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699355843] [2024-10-11 17:57:15,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:15,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:57:15,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:15,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:57:15,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:57:15,408 INFO L87 Difference]: Start difference. First operand 69 states and 75 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 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-10-11 17:57:15,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:15,494 INFO L93 Difference]: Finished difference Result 66 states and 68 transitions. [2024-10-11 17:57:15,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:57:15,495 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2024-10-11 17:57:15,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:15,495 INFO L225 Difference]: With dead ends: 66 [2024-10-11 17:57:15,496 INFO L226 Difference]: Without dead ends: 66 [2024-10-11 17:57:15,496 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-10-11 17:57:15,497 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 36 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:57:15,498 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 120 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:57:15,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-10-11 17:57:15,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2024-10-11 17:57:15,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 41 states have (on average 1.6097560975609757) internal successors, (66), 63 states have internal predecessors, (66), 0 states have call successors, (0), 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-10-11 17:57:15,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 66 transitions. [2024-10-11 17:57:15,504 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 66 transitions. Word has length 15 [2024-10-11 17:57:15,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:15,505 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 66 transitions. [2024-10-11 17:57:15,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 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-10-11 17:57:15,505 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 66 transitions. [2024-10-11 17:57:15,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-11 17:57:15,505 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:15,505 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:57:15,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 17:57:15,506 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2024-10-11 17:57:15,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:15,507 INFO L85 PathProgramCache]: Analyzing trace with hash 1291100999, now seen corresponding path program 1 times [2024-10-11 17:57:15,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:15,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448783247] [2024-10-11 17:57:15,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:15,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:15,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:15,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:57:15,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:15,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448783247] [2024-10-11 17:57:15,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448783247] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:15,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:57:15,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 17:57:15,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444885510] [2024-10-11 17:57:15,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:15,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 17:57:15,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:15,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 17:57:15,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-11 17:57:15,949 INFO L87 Difference]: Start difference. First operand 64 states and 66 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:57:16,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:16,165 INFO L93 Difference]: Finished difference Result 98 states and 106 transitions. [2024-10-11 17:57:16,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 17:57:16,166 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-10-11 17:57:16,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:16,166 INFO L225 Difference]: With dead ends: 98 [2024-10-11 17:57:16,166 INFO L226 Difference]: Without dead ends: 98 [2024-10-11 17:57:16,167 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-10-11 17:57:16,167 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 36 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:57:16,167 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 205 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:57:16,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-10-11 17:57:16,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 74. [2024-10-11 17:57:16,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 51 states have (on average 1.5098039215686274) internal successors, (77), 73 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:57:16,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2024-10-11 17:57:16,171 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 16 [2024-10-11 17:57:16,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:16,171 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2024-10-11 17:57:16,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:57:16,172 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2024-10-11 17:57:16,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-11 17:57:16,172 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:16,172 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:57:16,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 17:57:16,173 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2024-10-11 17:57:16,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:16,173 INFO L85 PathProgramCache]: Analyzing trace with hash -307164635, now seen corresponding path program 1 times [2024-10-11 17:57:16,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:16,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228426804] [2024-10-11 17:57:16,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:16,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:16,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:16,422 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:57:16,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:16,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228426804] [2024-10-11 17:57:16,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228426804] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:57:16,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [705400637] [2024-10-11 17:57:16,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:16,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:57:16,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:57:16,426 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:57:16,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 17:57:16,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:16,530 INFO L255 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-10-11 17:57:16,535 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:57:16,614 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-10-11 17:57:16,646 INFO L349 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2024-10-11 17:57:16,646 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-10-11 17:57:16,668 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-10-11 17:57:16,700 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-10-11 17:57:16,728 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-10-11 17:57:16,731 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:57:16,732 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:57:16,846 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-10-11 17:57:17,271 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:57:17,272 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-10-11 17:57:17,798 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:57:17,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [705400637] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:57:17,799 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:57:17,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2024-10-11 17:57:17,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166793231] [2024-10-11 17:57:17,799 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:57:17,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-11 17:57:17,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:17,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-11 17:57:17,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2024-10-11 17:57:17,800 INFO L87 Difference]: Start difference. First operand 74 states and 77 transitions. Second operand has 16 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 16 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-10-11 17:57:18,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:18,125 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions. [2024-10-11 17:57:18,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 17:57:18,126 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 16 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 16 [2024-10-11 17:57:18,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:18,126 INFO L225 Difference]: With dead ends: 75 [2024-10-11 17:57:18,127 INFO L226 Difference]: Without dead ends: 75 [2024-10-11 17:57:18,127 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2024-10-11 17:57:18,128 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 60 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 17:57:18,128 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 226 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 17:57:18,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-10-11 17:57:18,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2024-10-11 17:57:18,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 51 states have (on average 1.4901960784313726) internal successors, (76), 72 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:57:18,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 76 transitions. [2024-10-11 17:57:18,131 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 76 transitions. Word has length 16 [2024-10-11 17:57:18,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:18,132 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 76 transitions. [2024-10-11 17:57:18,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 16 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-10-11 17:57:18,132 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 76 transitions. [2024-10-11 17:57:18,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-11 17:57:18,132 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:18,133 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:57:18,152 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 17:57:18,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-11 17:57:18,334 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2024-10-11 17:57:18,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:18,334 INFO L85 PathProgramCache]: Analyzing trace with hash -307164634, now seen corresponding path program 1 times [2024-10-11 17:57:18,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:18,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703953724] [2024-10-11 17:57:18,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:18,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:18,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:18,697 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:57:18,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:18,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703953724] [2024-10-11 17:57:18,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703953724] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:57:18,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [366230961] [2024-10-11 17:57:18,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:18,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:57:18,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:57:18,700 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:57:18,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 17:57:18,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:18,806 INFO L255 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-10-11 17:57:18,812 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:57:18,866 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-10-11 17:57:18,871 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-10-11 17:57:18,897 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-10-11 17:57:18,897 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-10-11 17:57:18,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-10-11 17:57:18,931 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-10-11 17:57:18,963 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-10-11 17:57:18,966 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-10-11 17:57:19,011 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-10-11 17:57:19,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-10-11 17:57:19,019 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:57:19,020 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:57:19,226 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-10-11 17:57:19,243 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-10-11 17:57:19,247 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-10-11 17:57:19,398 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:57:19,398 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-10-11 17:57:19,415 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-10-11 17:57:19,540 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:57:19,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [366230961] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:57:19,540 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:57:19,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2024-10-11 17:57:19,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959789307] [2024-10-11 17:57:19,541 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:57:19,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-11 17:57:19,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:19,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-11 17:57:19,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2024-10-11 17:57:19,543 INFO L87 Difference]: Start difference. First operand 73 states and 76 transitions. Second operand has 19 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 19 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:57:20,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:20,009 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2024-10-11 17:57:20,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 17:57:20,010 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 19 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-10-11 17:57:20,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:20,012 INFO L225 Difference]: With dead ends: 74 [2024-10-11 17:57:20,012 INFO L226 Difference]: Without dead ends: 74 [2024-10-11 17:57:20,013 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=109, Invalid=397, Unknown=0, NotChecked=0, Total=506 [2024-10-11 17:57:20,013 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 56 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 17:57:20,013 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 334 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 17:57:20,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-10-11 17:57:20,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 72. [2024-10-11 17:57:20,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 51 states have (on average 1.4705882352941178) internal successors, (75), 71 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:57:20,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 75 transitions. [2024-10-11 17:57:20,020 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 75 transitions. Word has length 16 [2024-10-11 17:57:20,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:20,020 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 75 transitions. [2024-10-11 17:57:20,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 19 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:57:20,021 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 75 transitions. [2024-10-11 17:57:20,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-11 17:57:20,022 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:20,022 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:57:20,039 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 17:57:20,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:57:20,227 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2024-10-11 17:57:20,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:20,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1369425406, now seen corresponding path program 1 times [2024-10-11 17:57:20,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:20,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885925878] [2024-10-11 17:57:20,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:20,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:20,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:20,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:57:20,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:20,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885925878] [2024-10-11 17:57:20,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885925878] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:20,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:57:20,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 17:57:20,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206504062] [2024-10-11 17:57:20,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:20,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 17:57:20,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:20,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 17:57:20,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-11 17:57:20,490 INFO L87 Difference]: Start difference. First operand 72 states and 75 transitions. Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:57:20,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:20,726 INFO L93 Difference]: Finished difference Result 93 states and 101 transitions. [2024-10-11 17:57:20,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 17:57:20,726 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-10-11 17:57:20,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:20,727 INFO L225 Difference]: With dead ends: 93 [2024-10-11 17:57:20,727 INFO L226 Difference]: Without dead ends: 93 [2024-10-11 17:57:20,727 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-10-11 17:57:20,727 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 30 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 17:57:20,728 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 131 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 17:57:20,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-10-11 17:57:20,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 73. [2024-10-11 17:57:20,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 52 states have (on average 1.4615384615384615) internal successors, (76), 72 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:57:20,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 76 transitions. [2024-10-11 17:57:20,731 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 76 transitions. Word has length 17 [2024-10-11 17:57:20,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:20,731 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 76 transitions. [2024-10-11 17:57:20,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:57:20,732 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 76 transitions. [2024-10-11 17:57:20,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-11 17:57:20,733 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:20,733 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:57:20,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 17:57:20,734 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2024-10-11 17:57:20,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:20,734 INFO L85 PathProgramCache]: Analyzing trace with hash -497485271, now seen corresponding path program 1 times [2024-10-11 17:57:20,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:20,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779140287] [2024-10-11 17:57:20,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:20,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:20,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:21,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:57:21,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:21,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779140287] [2024-10-11 17:57:21,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779140287] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:21,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:57:21,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 17:57:21,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070981886] [2024-10-11 17:57:21,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:21,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 17:57:21,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:21,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 17:57:21,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-11 17:57:21,051 INFO L87 Difference]: Start difference. First operand 73 states and 76 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 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-10-11 17:57:21,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:21,265 INFO L93 Difference]: Finished difference Result 84 states and 88 transitions. [2024-10-11 17:57:21,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 17:57:21,266 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 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-10-11 17:57:21,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:21,266 INFO L225 Difference]: With dead ends: 84 [2024-10-11 17:57:21,266 INFO L226 Difference]: Without dead ends: 84 [2024-10-11 17:57:21,266 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-10-11 17:57:21,267 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 18 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:57:21,267 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 133 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:57:21,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-10-11 17:57:21,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 74. [2024-10-11 17:57:21,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 53 states have (on average 1.4528301886792452) internal successors, (77), 73 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:57:21,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2024-10-11 17:57:21,270 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 18 [2024-10-11 17:57:21,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:21,270 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2024-10-11 17:57:21,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 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-10-11 17:57:21,270 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2024-10-11 17:57:21,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-11 17:57:21,271 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:21,271 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:57:21,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 17:57:21,271 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2024-10-11 17:57:21,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:21,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1757825889, now seen corresponding path program 1 times [2024-10-11 17:57:21,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:21,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159366371] [2024-10-11 17:57:21,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:21,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:21,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:21,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:57:21,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:21,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159366371] [2024-10-11 17:57:21,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159366371] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:21,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:57:21,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 17:57:21,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776719065] [2024-10-11 17:57:21,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:21,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 17:57:21,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:21,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 17:57:21,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-11 17:57:21,430 INFO L87 Difference]: Start difference. First operand 74 states and 77 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:57:21,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:21,554 INFO L93 Difference]: Finished difference Result 73 states and 76 transitions. [2024-10-11 17:57:21,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:57:21,554 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-10-11 17:57:21,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:21,555 INFO L225 Difference]: With dead ends: 73 [2024-10-11 17:57:21,555 INFO L226 Difference]: Without dead ends: 73 [2024-10-11 17:57:21,555 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-11 17:57:21,556 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 38 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:57:21,556 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 40 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:57:21,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-10-11 17:57:21,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-10-11 17:57:21,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 53 states have (on average 1.4339622641509433) internal successors, (76), 72 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:57:21,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 76 transitions. [2024-10-11 17:57:21,560 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 76 transitions. Word has length 19 [2024-10-11 17:57:21,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:21,561 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 76 transitions. [2024-10-11 17:57:21,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:57:21,561 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 76 transitions. [2024-10-11 17:57:21,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-11 17:57:21,562 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:21,562 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:57:21,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 17:57:21,562 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2024-10-11 17:57:21,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:21,562 INFO L85 PathProgramCache]: Analyzing trace with hash 1757825890, now seen corresponding path program 1 times [2024-10-11 17:57:21,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:21,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607888767] [2024-10-11 17:57:21,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:21,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:21,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:21,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:57:21,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:21,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607888767] [2024-10-11 17:57:21,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607888767] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:21,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:57:21,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:57:21,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803000228] [2024-10-11 17:57:21,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:21,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:57:21,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:21,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:57:21,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:57:21,651 INFO L87 Difference]: Start difference. First operand 73 states and 76 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:57:21,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:21,697 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2024-10-11 17:57:21,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:57:21,698 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-10-11 17:57:21,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:21,698 INFO L225 Difference]: With dead ends: 67 [2024-10-11 17:57:21,698 INFO L226 Difference]: Without dead ends: 67 [2024-10-11 17:57:21,699 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 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-10-11 17:57:21,699 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 38 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:57:21,700 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 28 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:57:21,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-10-11 17:57:21,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2024-10-11 17:57:21,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 53 states have (on average 1.320754716981132) internal successors, (70), 66 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:57:21,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 70 transitions. [2024-10-11 17:57:21,702 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 70 transitions. Word has length 19 [2024-10-11 17:57:21,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:21,702 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 70 transitions. [2024-10-11 17:57:21,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:57:21,702 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 70 transitions. [2024-10-11 17:57:21,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-11 17:57:21,703 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:21,703 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-10-11 17:57:21,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 17:57:21,703 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2024-10-11 17:57:21,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:21,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1341972243, now seen corresponding path program 1 times [2024-10-11 17:57:21,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:21,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722740719] [2024-10-11 17:57:21,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:21,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:21,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:21,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:57:21,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:21,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722740719] [2024-10-11 17:57:21,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722740719] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:21,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:57:21,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 17:57:21,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551753159] [2024-10-11 17:57:21,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:21,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:57:21,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:21,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:57:21,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:57:21,840 INFO L87 Difference]: Start difference. First operand 67 states and 70 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:57:21,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:21,906 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2024-10-11 17:57:21,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 17:57:21,907 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-10-11 17:57:21,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:21,907 INFO L225 Difference]: With dead ends: 66 [2024-10-11 17:57:21,907 INFO L226 Difference]: Without dead ends: 66 [2024-10-11 17:57:21,907 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-10-11 17:57:21,908 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 22 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:57:21,908 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 99 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:57:21,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-10-11 17:57:21,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-10-11 17:57:21,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 53 states have (on average 1.3018867924528301) internal successors, (69), 65 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:57:21,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 69 transitions. [2024-10-11 17:57:21,910 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 69 transitions. Word has length 20 [2024-10-11 17:57:21,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:21,910 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 69 transitions. [2024-10-11 17:57:21,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:57:21,911 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 69 transitions. [2024-10-11 17:57:21,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-11 17:57:21,911 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:21,911 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-10-11 17:57:21,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 17:57:21,911 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2024-10-11 17:57:21,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:21,913 INFO L85 PathProgramCache]: Analyzing trace with hash 1348533537, now seen corresponding path program 1 times [2024-10-11 17:57:21,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:21,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598792256] [2024-10-11 17:57:21,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:21,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:21,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:22,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:57:22,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:22,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598792256] [2024-10-11 17:57:22,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598792256] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:22,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:57:22,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 17:57:22,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227293054] [2024-10-11 17:57:22,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:22,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:57:22,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:22,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:57:22,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:57:22,030 INFO L87 Difference]: Start difference. First operand 66 states and 69 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-10-11 17:57:22,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:22,111 INFO L93 Difference]: Finished difference Result 65 states and 68 transitions. [2024-10-11 17:57:22,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 17:57:22,112 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-10-11 17:57:22,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:22,112 INFO L225 Difference]: With dead ends: 65 [2024-10-11 17:57:22,113 INFO L226 Difference]: Without dead ends: 65 [2024-10-11 17:57:22,113 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-10-11 17:57:22,113 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 22 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:57:22,114 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 76 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:57:22,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-10-11 17:57:22,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2024-10-11 17:57:22,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 53 states have (on average 1.2830188679245282) internal successors, (68), 64 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:57:22,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 68 transitions. [2024-10-11 17:57:22,116 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 68 transitions. Word has length 21 [2024-10-11 17:57:22,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:22,116 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 68 transitions. [2024-10-11 17:57:22,116 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-10-11 17:57:22,116 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 68 transitions. [2024-10-11 17:57:22,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-11 17:57:22,117 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:22,117 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-10-11 17:57:22,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 17:57:22,117 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2024-10-11 17:57:22,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:22,118 INFO L85 PathProgramCache]: Analyzing trace with hash -1145133201, now seen corresponding path program 1 times [2024-10-11 17:57:22,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:22,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180245188] [2024-10-11 17:57:22,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:22,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:22,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:22,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:57:22,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:22,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180245188] [2024-10-11 17:57:22,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180245188] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:22,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:57:22,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 17:57:22,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112313901] [2024-10-11 17:57:22,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:22,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 17:57:22,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:22,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 17:57:22,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-10-11 17:57:22,582 INFO L87 Difference]: Start difference. First operand 65 states and 68 transitions. Second operand has 11 states, 10 states have (on average 2.2) internal successors, (22), 11 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-10-11 17:57:22,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:22,893 INFO L93 Difference]: Finished difference Result 81 states and 85 transitions. [2024-10-11 17:57:22,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 17:57:22,894 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 11 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-10-11 17:57:22,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:22,894 INFO L225 Difference]: With dead ends: 81 [2024-10-11 17:57:22,894 INFO L226 Difference]: Without dead ends: 81 [2024-10-11 17:57:22,895 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2024-10-11 17:57:22,895 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 63 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 17:57:22,895 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 114 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 17:57:22,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-10-11 17:57:22,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 69. [2024-10-11 17:57:22,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 57 states have (on average 1.263157894736842) internal successors, (72), 68 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:57:22,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 72 transitions. [2024-10-11 17:57:22,898 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 72 transitions. Word has length 22 [2024-10-11 17:57:22,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:22,899 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 72 transitions. [2024-10-11 17:57:22,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 11 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-10-11 17:57:22,899 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2024-10-11 17:57:22,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-11 17:57:22,900 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:22,900 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-10-11 17:57:22,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 17:57:22,900 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2024-10-11 17:57:22,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:22,901 INFO L85 PathProgramCache]: Analyzing trace with hash -1139390748, now seen corresponding path program 1 times [2024-10-11 17:57:22,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:22,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535069820] [2024-10-11 17:57:22,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:22,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:22,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:23,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:57:23,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:23,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535069820] [2024-10-11 17:57:23,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535069820] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:23,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:57:23,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 17:57:23,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934503] [2024-10-11 17:57:23,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:23,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:57:23,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:23,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:57:23,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:57:23,064 INFO L87 Difference]: Start difference. First operand 69 states and 72 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 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-10-11 17:57:23,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:23,157 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2024-10-11 17:57:23,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 17:57:23,157 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 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-10-11 17:57:23,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:23,158 INFO L225 Difference]: With dead ends: 68 [2024-10-11 17:57:23,158 INFO L226 Difference]: Without dead ends: 68 [2024-10-11 17:57:23,158 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-10-11 17:57:23,159 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 57 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:57:23,159 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 57 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:57:23,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-10-11 17:57:23,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2024-10-11 17:57:23,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 57 states have (on average 1.2456140350877194) internal successors, (71), 67 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:57:23,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2024-10-11 17:57:23,161 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 23 [2024-10-11 17:57:23,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:23,161 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2024-10-11 17:57:23,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 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-10-11 17:57:23,161 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2024-10-11 17:57:23,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-11 17:57:23,163 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:23,163 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:57:23,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-11 17:57:23,163 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2024-10-11 17:57:23,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:23,164 INFO L85 PathProgramCache]: Analyzing trace with hash 908043475, now seen corresponding path program 1 times [2024-10-11 17:57:23,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:23,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233553603] [2024-10-11 17:57:23,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:23,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:23,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:23,920 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 17:57:23,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:23,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233553603] [2024-10-11 17:57:23,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233553603] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:57:23,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1640281383] [2024-10-11 17:57:23,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:23,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:57:23,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:57:23,922 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:57:23,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 17:57:24,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:24,055 INFO L255 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 79 conjuncts are in the unsatisfiable core [2024-10-11 17:57:24,059 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:57:24,171 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-10-11 17:57:24,201 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-10-11 17:57:24,209 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-10-11 17:57:24,247 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-10-11 17:57:24,248 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-10-11 17:57:24,345 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-10-11 17:57:24,359 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-10-11 17:57:24,499 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-10-11 17:57:24,641 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 17:57:24,652 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-11 17:57:24,652 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-10-11 17:57:24,723 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 17:57:24,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 37 [2024-10-11 17:57:24,731 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 17:57:24,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 39 [2024-10-11 17:57:24,896 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 17:57:24,897 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-10-11 17:57:24,900 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 17:57:24,901 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:57:24,901 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-10-11 17:57:24,965 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:57:24,965 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:57:25,388 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2024-10-11 17:57:25,388 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-10-11 17:57:25,446 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2024-10-11 17:57:25,446 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-10-11 17:57:25,466 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:57:25,467 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-10-11 17:57:25,487 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:57:25,488 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-10-11 17:57:25,507 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-10-11 17:57:25,525 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-10-11 17:57:25,563 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:57:25,563 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-10-11 17:57:26,353 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:57:26,354 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 1817 treesize of output 1789 [2024-10-11 17:57:36,364 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse133 (< |c_ULTIMATE.start_main_~#list~0#1.offset| (+ 2 |c_ULTIMATE.start_append_~plist#1.offset|))) (.cse219 (< |c_ULTIMATE.start_append_~plist#1.offset| 1)) (.cse1 (< |c_ULTIMATE.start_main_~#list~0#1.offset| 1)) (.cse2 (= |c_ULTIMATE.start_main_~#list~0#1.base| |c_ULTIMATE.start_append_~plist#1.base|))) (let ((.cse48 (< |c_ULTIMATE.start_append_~plist#1.offset| 0)) (.cse73 (< |c_ULTIMATE.start_main_~#list~0#1.offset| |c_ULTIMATE.start_append_~plist#1.offset|)) (.cse74 (not .cse2)) (.cse292 (or .cse219 .cse1)) (.cse293 (or .cse1 .cse133)) (.cse4 (+ 4 |c_ULTIMATE.start_append_~item~0#1.offset|))) (let ((.cse7 (or (forall ((v_arrayElimCell_41 Int) (v_arrayElimCell_52 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_prenex_13 Int)) (let ((.cse318 (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|))) (let ((.cse314 (store .cse318 0 v_arrayElimCell_41))) (let ((.cse316 (+ 4 v_arrayElimCell_52)) (.cse315 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse314) v_prenex_13) (+ 4 v_arrayElimCell_41)))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select (store .cse314 4 .cse315) .cse316) 0) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse317 (store .cse318 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_35| .cse317) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4)))) v_prenex_13) .cse316) 0) (= .cse315 0)))))) .cse1)) (.cse8 (or (forall ((v_arrayElimCell_41 Int) (v_arrayElimCell_52 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_prenex_13 Int)) (let ((.cse311 (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|)) (.cse312 (+ 4 v_arrayElimCell_52))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select (let ((.cse310 (store .cse311 0 v_arrayElimCell_41))) (store .cse310 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse310) v_prenex_13) (+ 4 v_arrayElimCell_41)))) .cse312) 0) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse313 (store .cse311 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse313 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse313) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4)))) v_prenex_13) .cse312) 0)))) .cse1)) (.cse30 (or .cse1 (forall ((v_arrayElimCell_52 Int) (v_arrayElimCell_41 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_prenex_14 Int) (v_prenex_21 Int)) (let ((.cse307 (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|)) (.cse308 (+ 4 v_arrayElimCell_52))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse306 (store .cse307 0 v_arrayElimCell_41))) (store .cse306 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse306) v_prenex_21) (+ 4 v_arrayElimCell_41))))) v_prenex_14) .cse308) 0) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse309 (store .cse307 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse309 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse309) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4)))) v_prenex_14) .cse308) 0)))))) (.cse89 (or (forall ((v_arrayElimCell_50 Int) (v_arrayElimCell_41 Int) (v_arrayElimCell_52 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (let ((.cse303 (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|)) (.cse304 (+ 4 v_arrayElimCell_52))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse302 (store .cse303 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse302 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse302) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4)))) v_arrayElimCell_50) .cse304) 0) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse305 (store .cse303 0 v_arrayElimCell_41))) (store .cse305 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse305) v_arrayElimCell_50) (+ 4 v_arrayElimCell_41))))) v_arrayElimCell_50) .cse304) 0)))) .cse1)) (.cse115 (or .cse1 (forall ((v_arrayElimCell_52 Int) (v_arrayElimCell_41 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_prenex_13 Int)) (let ((.cse298 (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|))) (let ((.cse299 (+ 4 v_arrayElimCell_52)) (.cse297 (+ 4 v_arrayElimCell_41)) (.cse300 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse301 (store .cse298 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse301 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse301) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4)))) v_prenex_13))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select (let ((.cse296 (store .cse298 0 v_arrayElimCell_41))) (store .cse296 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse296) v_prenex_13) .cse297))) .cse299) 0) (= (select .cse300 .cse299) 0) (= (select (select |c_#memory_$Pointer$#1.offset| v_prenex_13) .cse297) 0) (= (select .cse300 4) 0))))))) (.cse132 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_arrayElimCell_42 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse295 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse295 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse295) v_arrayElimCell_42) .cse4)))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4) 0)))) (.cse75 (and (or .cse1 .cse2) .cse292 .cse293)) (.cse231 (or (forall ((v_prenex_12 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse294 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse294 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse294) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4)))) v_prenex_12) .cse4) 0))) .cse48 .cse73 .cse74)) (.cse78 (and .cse292 .cse293)) (.cse6 (< |c_ULTIMATE.start_main_~#list~0#1.offset| 0)) (.cse120 (= |c_ULTIMATE.start_main_~#list~0#1.offset| |c_ULTIMATE.start_append_~plist#1.offset|))) (and (or (let ((.cse5 (forall ((v_arrayElimCell_52 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (= (let ((.cse119 (+ 4 v_arrayElimCell_52))) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse118 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_52))) (store .cse118 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse118) |c_ULTIMATE.start_append_~item~0#1.base|) .cse119)))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse119)) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0))))) (.cse0 (forall ((v_arrayElimCell_52 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_arrayElimCell_42 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (let ((.cse117 (+ 4 v_arrayElimCell_52))) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse116 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_52))) (store .cse116 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse116) v_arrayElimCell_42) .cse117)))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse117)) 0))))) (and (or .cse0 .cse1 .cse2) (or .cse1 (forall ((v_arrayElimCell_52 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_prenex_14 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse3 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse3 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse3) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4)))) v_prenex_14) (+ 4 v_arrayElimCell_52)) 0)))) (or .cse5 .cse6) .cse7 .cse8 (or (forall ((v_arrayElimCell_52 Int) (v_prenex_18 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (let ((.cse12 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_52)) (.cse11 (+ 4 v_arrayElimCell_52))) (let ((.cse9 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse12) v_prenex_18) .cse11))) (let ((.cse10 (store .cse12 4 .cse9))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= .cse9 0) (= (select .cse10 .cse11) 0) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse10) v_prenex_18) 4) 0)))))) .cse6) (or (and (or (forall ((v_arrayElimCell_52 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_prenex_24 Int)) (let ((.cse16 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_52)) (.cse14 (+ 4 v_arrayElimCell_52))) (let ((.cse15 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse16) v_prenex_24) .cse14))) (let ((.cse13 (store .cse16 4 .cse15))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select .cse13 .cse14) 0) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse13) v_prenex_24) 4) 0) (= .cse15 0)))))) .cse6) (or (forall ((v_arrayElimCell_52 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_prenex_25 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_52)) v_prenex_25) (+ 4 v_arrayElimCell_52)) 0))) .cse6) (or .cse1 (forall ((v_arrayElimCell_52 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_prenex_24 Int)) (let ((.cse18 (+ 4 v_arrayElimCell_52))) (let ((.cse17 (let ((.cse19 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_52))) (store .cse19 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse19) v_prenex_24) .cse18))))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select .cse17 .cse18) 0) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse17) v_prenex_24) .cse18) 0)))))) (or (forall ((v_arrayElimCell_52 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_prenex_24 Int)) (let ((.cse20 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_52))) (let ((.cse21 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse20) v_prenex_24) (+ 4 v_arrayElimCell_52)))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (store .cse20 4 .cse21)) v_prenex_24) 4) 0) (= .cse21 0))))) .cse6) (or .cse1 (forall ((v_prenex_26 Int) (v_arrayElimCell_52 Int) (v_prenex_22 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (= (let ((.cse23 (+ 4 v_arrayElimCell_52))) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse22 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_52))) (store .cse22 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse22) v_prenex_26) .cse23)))) v_prenex_22) .cse23)) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0))))) (or (forall ((v_arrayElimCell_52 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_prenex_24 Int)) (let ((.cse25 (+ 4 v_arrayElimCell_52))) (let ((.cse24 (let ((.cse27 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_52))) (store .cse27 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse27) v_prenex_24) .cse25))))) (let ((.cse26 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse24) v_prenex_24))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select .cse24 .cse25) 0) (= (select .cse26 4) 0) (= (select .cse26 .cse25) 0)))))) .cse6) (or (forall ((v_arrayElimCell_52 Int) (v_prenex_23 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (let ((.cse29 (+ 4 v_arrayElimCell_52))) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse28 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_52))) (store .cse28 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse28) v_prenex_23) .cse29)))) v_prenex_23) .cse29)) 0))) .cse1)) .cse2) .cse30 (or (and (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_arrayElimCell_52 Int) (v_arrayElimCell_41 Int) (v_prenex_23 Int)) (= 0 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse31 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_41))) (store .cse31 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse31) v_prenex_23) (+ 4 v_arrayElimCell_41))))) v_prenex_23) (+ 4 v_arrayElimCell_52)))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_arrayElimCell_52 Int) (v_arrayElimCell_41 Int) (v_prenex_24 Int)) (let ((.cse32 (let ((.cse34 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_41))) (store .cse34 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse34) v_prenex_24) (+ 4 v_arrayElimCell_41))))) (.cse33 (+ 4 v_arrayElimCell_52))) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse32) v_prenex_24) .cse33) 0) (= (select .cse32 .cse33) 0)))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_arrayElimCell_52 Int) (v_arrayElimCell_41 Int) (v_prenex_24 Int)) (let ((.cse39 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_41))) (let ((.cse37 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse39) v_prenex_24) (+ 4 v_arrayElimCell_41)))) (let ((.cse38 (store .cse39 4 .cse37))) (let ((.cse36 (+ 4 v_arrayElimCell_52)) (.cse35 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse38) v_prenex_24))) (or (= (select .cse35 .cse36) 0) (= .cse37 0) (= (select .cse38 .cse36) 0) (= (select .cse35 4) 0))))))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_arrayElimCell_52 Int) (v_arrayElimCell_41 Int) (v_prenex_24 Int)) (let ((.cse43 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_41))) (let ((.cse42 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse43) v_prenex_24) (+ 4 v_arrayElimCell_41)))) (let ((.cse40 (store .cse43 4 .cse42)) (.cse41 (+ 4 v_arrayElimCell_52))) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse40) v_prenex_24) .cse41) 0) (= .cse42 0) (= (select .cse40 .cse41) 0)))))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_prenex_26 Int) (v_arrayElimCell_52 Int) (v_arrayElimCell_41 Int) (v_prenex_22 Int)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse44 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_41))) (store .cse44 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse44) v_prenex_26) (+ 4 v_arrayElimCell_41))))) v_prenex_22) (+ 4 v_arrayElimCell_52)) 0))))) .cse1 .cse2) (or (forall ((v_arrayElimCell_52 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse45 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse45 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse45) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4)))) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_52)) 0))) .cse6) (or (forall ((v_arrayElimCell_52 Int) (v_prenex_18 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (let ((.cse47 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_52))) (let ((.cse46 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse47) v_prenex_18) (+ 4 v_arrayElimCell_52)))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= .cse46 0) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (store .cse47 4 .cse46)) v_prenex_18) 4) 0))))) .cse6) (or .cse48 (and (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_arrayElimCell_52 Int) (v_arrayElimCell_41 Int) (v_prenex_13 Int)) (let ((.cse50 (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|)) (.cse51 (+ 4 v_arrayElimCell_52))) (or (= (select (let ((.cse49 (store .cse50 0 v_arrayElimCell_41))) (store .cse49 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse49) v_prenex_13) (+ 4 v_arrayElimCell_41)))) .cse51) 0) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse52 (store .cse50 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse52 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse52) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4)))) v_prenex_13) .cse51) 0)))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (forall ((v_arrayElimCell_52 Int) (v_prenex_12 Int)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse53 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse53 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse53) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4)))) v_prenex_12) (+ 4 v_arrayElimCell_52)) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_arrayElimCell_50 Int) (v_arrayElimCell_52 Int) (v_arrayElimCell_41 Int)) (let ((.cse55 (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|)) (.cse56 (+ 4 v_arrayElimCell_52))) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse54 (store .cse55 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse54 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse54) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4)))) v_arrayElimCell_50) .cse56) 0) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse57 (store .cse55 0 v_arrayElimCell_41))) (store .cse57 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse57) v_arrayElimCell_50) (+ 4 v_arrayElimCell_41))))) v_arrayElimCell_50) .cse56) 0)))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_arrayElimCell_52 Int) (v_arrayElimCell_41 Int) (v_prenex_14 Int) (v_prenex_21 Int)) (let ((.cse59 (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|)) (.cse60 (+ 4 v_arrayElimCell_52))) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse58 (store .cse59 0 v_arrayElimCell_41))) (store .cse58 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse58) v_prenex_21) (+ 4 v_arrayElimCell_41))))) v_prenex_14) .cse60) 0) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse61 (store .cse59 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse61 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse61) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4)))) v_prenex_14) .cse60) 0)))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_arrayElimCell_52 Int) (v_arrayElimCell_41 Int) (v_prenex_13 Int)) (let ((.cse66 (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|))) (let ((.cse62 (store .cse66 0 v_arrayElimCell_41))) (let ((.cse64 (+ 4 v_arrayElimCell_52)) (.cse63 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse62) v_prenex_13) (+ 4 v_arrayElimCell_41)))) (or (= (select (store .cse62 4 .cse63) .cse64) 0) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse65 (store .cse66 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse65 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse65) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4)))) v_prenex_13) .cse64) 0) (= .cse63 0)))))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (forall ((v_arrayElimCell_52 Int) (v_arrayElimCell_41 Int) (v_prenex_13 Int)) (let ((.cse69 (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|))) (let ((.cse70 (+ 4 v_arrayElimCell_52)) (.cse68 (+ 4 v_arrayElimCell_41)) (.cse71 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse72 (store .cse69 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse72 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse72) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4)))) v_prenex_13))) (or (= (select (let ((.cse67 (store .cse69 0 v_arrayElimCell_41))) (store .cse67 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse67) v_prenex_13) .cse68))) .cse70) 0) (= (select .cse71 .cse70) 0) (= (select (select |c_#memory_$Pointer$#1.offset| v_prenex_13) .cse68) 0) (= (select .cse71 4) 0))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0))))) .cse73 .cse74) (or .cse75 (and (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_arrayElimCell_52 Int) (v_arrayElimCell_41 Int) (v_arrayElimCell_42 Int)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse76 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_41))) (store .cse76 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse76) v_arrayElimCell_42) (+ 4 v_arrayElimCell_41))))) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_52)) 0)))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_arrayElimCell_52 Int) (v_arrayElimCell_41 Int)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse77 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_41))) (store .cse77 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse77) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_41))))) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_52)) 0)))))) (or .cse78 (forall ((v_arrayElimCell_52 Int) (v_prenex_18 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (let ((.cse80 (+ 4 v_arrayElimCell_52))) (let ((.cse79 (let ((.cse81 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_52))) (store .cse81 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse81) v_prenex_18) .cse80))))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select .cse79 .cse80) 0) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse79) v_prenex_18) .cse80) 0)))))) (or .cse78 (forall ((v_prenex_16 Int) (v_arrayElimCell_52 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_prenex_20 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (let ((.cse83 (+ 4 v_arrayElimCell_52))) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse82 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_52))) (store .cse82 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse82) v_prenex_20) .cse83)))) v_prenex_16) .cse83)) 0)))) (or (forall ((v_arrayElimCell_52 Int) (v_prenex_17 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_52)) v_prenex_17) (+ 4 v_arrayElimCell_52)) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)))) .cse6) (or (forall ((v_arrayElimCell_52 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_prenex_13 Int)) (let ((.cse86 (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|)) (.cse85 (+ 4 v_arrayElimCell_52))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select (let ((.cse84 (store .cse86 0 v_arrayElimCell_52))) (store .cse84 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse84) v_prenex_13) .cse85))) .cse85) 0) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse87 (store .cse86 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse87 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse87) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4)))) v_prenex_13) .cse85) 0)))) .cse1) (or (forall ((v_arrayElimCell_52 Int) (v_prenex_12 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse88 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse88 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse88) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4)))) v_prenex_12) (+ 4 v_arrayElimCell_52)) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)))) .cse48 .cse73 .cse74) .cse89 (or .cse78 (forall ((v_arrayElimCell_52 Int) (v_prenex_18 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (let ((.cse91 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_52)) (.cse92 (+ 4 v_arrayElimCell_52))) (let ((.cse90 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse91) v_prenex_18) .cse92))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= .cse90 0) (= (select (store .cse91 4 .cse90) .cse92) 0)))))) (or .cse1 (forall ((v_arrayElimCell_50 Int) (v_arrayElimCell_52 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse93 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse93 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse93) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4)))) v_arrayElimCell_50) (+ 4 v_arrayElimCell_52)) 0)))) (or .cse5 .cse6 .cse2) (or .cse78 (forall ((v_arrayElimCell_52 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_prenex_19 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (let ((.cse95 (+ 4 v_arrayElimCell_52))) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse94 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_52))) (store .cse94 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse94) v_prenex_19) .cse95)))) v_prenex_19) .cse95)) 0)))) (or .cse78 (and (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_prenex_16 Int) (v_arrayElimCell_52 Int) (v_arrayElimCell_41 Int) (v_prenex_20 Int)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse96 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_41))) (store .cse96 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse96) v_prenex_20) (+ 4 v_arrayElimCell_41))))) v_prenex_16) (+ 4 v_arrayElimCell_52)) 0)))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_arrayElimCell_52 Int) (v_arrayElimCell_41 Int) (v_prenex_18 Int)) (let ((.cse100 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_41))) (let ((.cse99 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse100) v_prenex_18) (+ 4 v_arrayElimCell_41)))) (let ((.cse97 (store .cse100 4 .cse99)) (.cse98 (+ 4 v_arrayElimCell_52))) (or (= (select .cse97 .cse98) 0) (= .cse99 0) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse97) v_prenex_18) .cse98) 0)))))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_arrayElimCell_52 Int) (v_arrayElimCell_41 Int) (v_prenex_19 Int)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse101 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_41))) (store .cse101 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse101) v_prenex_19) (+ 4 v_arrayElimCell_41))))) v_prenex_19) (+ 4 v_arrayElimCell_52)) 0)))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_arrayElimCell_52 Int) (v_arrayElimCell_41 Int) (v_prenex_18 Int)) (let ((.cse106 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_41))) (let ((.cse104 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse106) v_prenex_18) (+ 4 v_arrayElimCell_41)))) (let ((.cse102 (store .cse106 4 .cse104))) (let ((.cse103 (+ 4 v_arrayElimCell_52)) (.cse105 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse102) v_prenex_18))) (or (= (select .cse102 .cse103) 0) (= .cse104 0) (= (select .cse105 .cse103) 0) (= (select .cse105 4) 0))))))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_arrayElimCell_52 Int) (v_arrayElimCell_41 Int) (v_prenex_18 Int)) (let ((.cse107 (let ((.cse109 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_41))) (store .cse109 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse109) v_prenex_18) (+ 4 v_arrayElimCell_41))))) (.cse108 (+ 4 v_arrayElimCell_52))) (or (= (select .cse107 .cse108) 0) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse107) v_prenex_18) .cse108) 0)))))))) (or (forall ((v_arrayElimCell_52 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_prenex_13 Int)) (let ((.cse112 (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|))) (let ((.cse111 (+ 4 v_arrayElimCell_52)) (.cse113 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse114 (store .cse112 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse114 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse114) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4)))) v_prenex_13))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select (let ((.cse110 (store .cse112 0 v_arrayElimCell_52))) (store .cse110 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse110) v_prenex_13) .cse111))) .cse111) 0) (= (select .cse113 .cse111) 0) (= (select .cse113 4) 0))))) .cse1) (or .cse0 .cse78) .cse115)) .cse120) (or .cse1 (and (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_prenex_26 Int) (v_arrayElimCell_41 Int) (v_prenex_22 Int)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse121 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_41))) (store .cse121 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse121) v_prenex_26) (+ 4 v_arrayElimCell_41))))) v_prenex_22) .cse4) 0)))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_arrayElimCell_41 Int) (v_prenex_23 Int)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse122 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_41))) (store .cse122 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse122) v_prenex_23) (+ 4 v_arrayElimCell_41))))) v_prenex_23) .cse4) 0)))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_arrayElimCell_41 Int) (v_prenex_24 Int)) (let ((.cse123 (let ((.cse124 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_41))) (store .cse124 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse124) v_prenex_24) (+ 4 v_arrayElimCell_41)))))) (or (= (select .cse123 .cse4) 0) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse123) v_prenex_24) .cse4) 0)))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_arrayElimCell_41 Int) (v_prenex_24 Int)) (let ((.cse127 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_41))) (let ((.cse126 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse127) v_prenex_24) (+ 4 v_arrayElimCell_41)))) (let ((.cse125 (store .cse127 4 .cse126))) (or (= (select .cse125 .cse4) 0) (= .cse126 0) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse125) v_prenex_24) .cse4) 0)))))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_arrayElimCell_41 Int) (v_prenex_24 Int)) (let ((.cse131 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_41))) (let ((.cse129 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse131) v_prenex_24) (+ 4 v_arrayElimCell_41)))) (let ((.cse128 (store .cse131 4 .cse129))) (let ((.cse130 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse128) v_prenex_24))) (or (= (select .cse128 .cse4) 0) (= .cse129 0) (= (select .cse130 4) 0) (= (select .cse130 .cse4) 0)))))))))) .cse2) (or .cse1 .cse132 .cse133) (or (and (or (forall ((v_arrayElimCell_41 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (= (let ((.cse135 (+ 4 v_arrayElimCell_41))) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse134 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_41))) (store .cse134 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse134) |c_ULTIMATE.start_append_~item~0#1.base|) .cse135)))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse135)) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)))) .cse6) (or (forall ((v_arrayElimCell_41 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_prenex_25 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_41)) v_prenex_25) (+ 4 v_arrayElimCell_41)) 0))) .cse6) (or .cse1 (forall ((v_arrayElimCell_41 Int) (v_arrayElimCell_52 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse136 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_41))) (store .cse136 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse136) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_41))))) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_52)) 0)))) (or (forall ((v_arrayElimCell_41 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_prenex_24 Int)) (let ((.cse140 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_41)) (.cse139 (+ 4 v_arrayElimCell_41))) (let ((.cse137 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse140) v_prenex_24) .cse139))) (let ((.cse138 (store .cse140 4 .cse137))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= .cse137 0) (= (select .cse138 .cse139) 0) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse138) v_prenex_24) 4) 0)))))) .cse6) (or .cse1 (forall ((v_arrayElimCell_41 Int) (v_arrayElimCell_52 Int) (v_prenex_23 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= 0 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse141 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_41))) (store .cse141 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse141) v_prenex_23) (+ 4 v_arrayElimCell_41))))) v_prenex_23) (+ 4 v_arrayElimCell_52)))))) (or (forall ((v_arrayElimCell_41 Int) (v_arrayElimCell_52 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_prenex_24 Int)) (let ((.cse145 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_41))) (let ((.cse144 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse145) v_prenex_24) (+ 4 v_arrayElimCell_41)))) (let ((.cse142 (store .cse145 4 .cse144)) (.cse143 (+ 4 v_arrayElimCell_52))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse142) v_prenex_24) .cse143) 0) (= .cse144 0) (= (select .cse142 .cse143) 0)))))) .cse1) (or (forall ((v_prenex_26 Int) (v_arrayElimCell_41 Int) (v_arrayElimCell_52 Int) (v_prenex_22 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse146 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_41))) (store .cse146 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse146) v_prenex_26) (+ 4 v_arrayElimCell_41))))) v_prenex_22) (+ 4 v_arrayElimCell_52)) 0))) .cse1) (or (forall ((v_arrayElimCell_41 Int) (v_prenex_23 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (let ((.cse148 (+ 4 v_arrayElimCell_41))) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse147 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_41))) (store .cse147 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse147) v_prenex_23) .cse148)))) v_prenex_23) .cse148)) 0))) .cse1) (or .cse6 (forall ((v_arrayElimCell_41 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_prenex_24 Int)) (let ((.cse150 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_41))) (let ((.cse149 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse150) v_prenex_24) (+ 4 v_arrayElimCell_41)))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= .cse149 0) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (store .cse150 4 .cse149)) v_prenex_24) 4) 0)))))) (or .cse1 (forall ((v_arrayElimCell_41 Int) (v_arrayElimCell_52 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_prenex_24 Int)) (let ((.cse155 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_41))) (let ((.cse153 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse155) v_prenex_24) (+ 4 v_arrayElimCell_41)))) (let ((.cse154 (store .cse155 4 .cse153))) (let ((.cse152 (+ 4 v_arrayElimCell_52)) (.cse151 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse154) v_prenex_24))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select .cse151 .cse152) 0) (= .cse153 0) (= (select .cse154 .cse152) 0) (= (select .cse151 4) 0)))))))) (or .cse1 (forall ((v_arrayElimCell_41 Int) (v_arrayElimCell_52 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_arrayElimCell_42 Int)) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse156 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_41))) (store .cse156 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse156) v_arrayElimCell_42) (+ 4 v_arrayElimCell_41))))) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_52)) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0))))) (or (forall ((v_prenex_26 Int) (v_arrayElimCell_41 Int) (v_prenex_22 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (let ((.cse158 (+ 4 v_arrayElimCell_41))) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse157 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_41))) (store .cse157 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse157) v_prenex_26) .cse158)))) v_prenex_22) .cse158)) 0))) .cse1) (or .cse120 (and .cse7 (or .cse78 (and (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_arrayElimCell_41 Int) (v_arrayElimCell_52 Int) (v_prenex_18 Int)) (let ((.cse159 (let ((.cse161 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_41))) (store .cse161 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse161) v_prenex_18) (+ 4 v_arrayElimCell_41))))) (.cse160 (+ 4 v_arrayElimCell_52))) (or (= (select .cse159 .cse160) 0) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse159) v_prenex_18) .cse160) 0)))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_arrayElimCell_41 Int) (v_arrayElimCell_52 Int) (v_prenex_19 Int)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse162 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_41))) (store .cse162 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse162) v_prenex_19) (+ 4 v_arrayElimCell_41))))) v_prenex_19) (+ 4 v_arrayElimCell_52)) 0)))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (forall ((v_arrayElimCell_41 Int) (v_arrayElimCell_52 Int) (v_prenex_18 Int)) (let ((.cse166 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_41))) (let ((.cse165 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse166) v_prenex_18) (+ 4 v_arrayElimCell_41)))) (let ((.cse163 (store .cse166 4 .cse165)) (.cse164 (+ 4 v_arrayElimCell_52))) (or (= (select .cse163 .cse164) 0) (= .cse165 0) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse163) v_prenex_18) .cse164) 0)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_arrayElimCell_41 Int) (v_arrayElimCell_52 Int) (v_prenex_18 Int)) (let ((.cse171 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_41))) (let ((.cse169 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse171) v_prenex_18) (+ 4 v_arrayElimCell_41)))) (let ((.cse167 (store .cse171 4 .cse169))) (let ((.cse168 (+ 4 v_arrayElimCell_52)) (.cse170 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse167) v_prenex_18))) (or (= (select .cse167 .cse168) 0) (= .cse169 0) (= (select .cse170 .cse168) 0) (= (select .cse170 4) 0))))))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_prenex_16 Int) (v_arrayElimCell_41 Int) (v_arrayElimCell_52 Int) (v_prenex_20 Int)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse172 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_41))) (store .cse172 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse172) v_prenex_20) (+ 4 v_arrayElimCell_41))))) v_prenex_16) (+ 4 v_arrayElimCell_52)) 0)))))) .cse8 .cse30 .cse89 .cse115)) (or .cse1 (forall ((v_arrayElimCell_41 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_prenex_24 Int)) (let ((.cse174 (+ 4 v_arrayElimCell_41))) (let ((.cse173 (let ((.cse175 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_41))) (store .cse175 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse175) v_prenex_24) .cse174))))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select .cse173 .cse174) 0) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse173) v_prenex_24) .cse174) 0)))))) (or .cse1 (forall ((v_arrayElimCell_41 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_prenex_24 Int)) (let ((.cse177 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_41)) (.cse178 (+ 4 v_arrayElimCell_41))) (let ((.cse176 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse177) v_prenex_24) .cse178))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= .cse176 0) (= (select (store .cse177 4 .cse176) .cse178) 0)))))) (or .cse120 (and (or (forall ((v_arrayElimCell_41 Int) (v_prenex_17 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_41)) v_prenex_17) (+ 4 v_arrayElimCell_41)) 0))) .cse6) (or (and (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_arrayElimCell_41 Int) (v_prenex_13 Int)) (let ((.cse180 (+ 4 v_arrayElimCell_41)) (.cse181 (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|))) (or (= (select (let ((.cse179 (store .cse181 0 v_arrayElimCell_41))) (store .cse179 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse179) v_prenex_13) .cse180))) .cse180) 0) (= (select (select |c_#memory_$Pointer$#1.offset| v_prenex_13) .cse180) 0) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse182 (store .cse181 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse182 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse182) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4)))) v_prenex_13) 4) 0)))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_arrayElimCell_50 Int) (v_arrayElimCell_41 Int)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse183 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse183 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse183) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4)))) v_arrayElimCell_50) (+ 4 v_arrayElimCell_41)) 0)))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_arrayElimCell_41 Int) (v_prenex_14 Int)) (= 0 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse184 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse184 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse184) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4)))) v_prenex_14) (+ 4 v_arrayElimCell_41)))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_arrayElimCell_41 Int) (v_prenex_13 Int)) (let ((.cse187 (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|)) (.cse186 (+ 4 v_arrayElimCell_41))) (or (= (select (let ((.cse185 (store .cse187 0 v_arrayElimCell_41))) (store .cse185 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse185) v_prenex_13) .cse186))) .cse186) 0) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse188 (store .cse187 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse188 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse188) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4)))) v_prenex_13) .cse186) 0))))))) .cse1) (or (forall ((v_arrayElimCell_41 Int) (v_prenex_18 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (let ((.cse190 (+ 4 v_arrayElimCell_41))) (let ((.cse189 (let ((.cse191 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_41))) (store .cse191 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse191) v_prenex_18) .cse190))))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse189) v_prenex_18) .cse190) 0) (= (select .cse189 .cse190) 0))))) .cse78) (or .cse78 (forall ((v_arrayElimCell_41 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_prenex_19 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (let ((.cse193 (+ 4 v_arrayElimCell_41))) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse192 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_41))) (store .cse192 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse192) v_prenex_19) .cse193)))) v_prenex_19) .cse193)) 0)))) (or (forall ((v_arrayElimCell_41 Int) (v_prenex_18 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (let ((.cse195 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_41))) (let ((.cse194 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse195) v_prenex_18) (+ 4 v_arrayElimCell_41)))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= .cse194 0) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (store .cse195 4 .cse194)) v_prenex_18) 4) 0))))) .cse6) (or .cse78 (forall ((v_prenex_16 Int) (v_arrayElimCell_41 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_prenex_20 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (let ((.cse197 (+ 4 v_arrayElimCell_41))) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse196 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_41))) (store .cse196 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse196) v_prenex_20) .cse197)))) v_prenex_16) .cse197)) 0)))) (or .cse6 (forall ((v_arrayElimCell_41 Int) (v_prenex_18 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (let ((.cse199 (+ 4 v_arrayElimCell_41))) (let ((.cse200 (let ((.cse201 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_41))) (store .cse201 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse201) v_prenex_18) .cse199))))) (let ((.cse198 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse200) v_prenex_18))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select .cse198 .cse199) 0) (= (select .cse200 .cse199) 0) (= (select .cse198 4) 0))))))))) (or (forall ((v_arrayElimCell_41 Int) (v_arrayElimCell_52 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_prenex_24 Int)) (let ((.cse202 (let ((.cse204 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_41))) (store .cse204 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse204) v_prenex_24) (+ 4 v_arrayElimCell_41))))) (.cse203 (+ 4 v_arrayElimCell_52))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse202) v_prenex_24) .cse203) 0) (= (select .cse202 .cse203) 0)))) .cse1) (or .cse1 (forall ((v_arrayElimCell_41 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_arrayElimCell_42 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (let ((.cse206 (+ 4 v_arrayElimCell_41))) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse205 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_41))) (store .cse205 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse205) v_arrayElimCell_42) .cse206)))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse206)) 0))))) .cse2) (or (and (or (forall ((v_prenex_23 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse207 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse207 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse207) v_prenex_23) .cse4)))) v_prenex_23) .cse4) 0))) .cse1) (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_prenex_24 Int)) (let ((.cse208 (let ((.cse209 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse209 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse209) v_prenex_24) .cse4))))) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse208) v_prenex_24) .cse4) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select .cse208 .cse4) 0)))) .cse1) (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_prenex_24 Int)) (let ((.cse212 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (let ((.cse211 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse212) v_prenex_24) .cse4))) (let ((.cse210 (store .cse212 4 .cse211))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse210) v_prenex_24) 4) 0) (= (select .cse210 .cse4) 0) (= .cse211 0)))))) .cse6) (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_prenex_25 Int)) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|)) v_prenex_25) .cse4) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)))) .cse6) (or .cse1 (forall ((v_prenex_26 Int) (v_prenex_22 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse213 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse213 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse213) v_prenex_26) .cse4)))) v_prenex_22) .cse4) 0)))) (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_prenex_24 Int)) (let ((.cse215 (let ((.cse216 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse216 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse216) v_prenex_24) .cse4))))) (let ((.cse214 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse215) v_prenex_24))) (or (= (select .cse214 .cse4) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select .cse214 4) 0) (= (select .cse215 .cse4) 0))))) .cse6) (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_prenex_24 Int)) (let ((.cse217 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (let ((.cse218 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse217) v_prenex_24) .cse4))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (store .cse217 4 .cse218)) v_prenex_24) 4) 0) (= .cse218 0))))) .cse6)) .cse2) (or .cse219 .cse1 .cse132) (or (and (or (forall ((v_prenex_18 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (let ((.cse220 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (let ((.cse221 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse220) v_prenex_18) .cse4))) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (store .cse220 4 .cse221)) v_prenex_18) 4) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= .cse221 0))))) .cse6) (or .cse1 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_prenex_13 Int)) (let ((.cse222 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (let ((.cse223 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse222))) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (store .cse222 4 (select (select .cse223 |c_ULTIMATE.start_append_~item~0#1.base|) .cse4))) v_prenex_13) .cse4) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select (store .cse222 4 (select (select .cse223 v_prenex_13) .cse4)) .cse4) 0)))))) (or (forall ((v_prenex_18 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (let ((.cse224 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (let ((.cse225 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse224) v_prenex_18) .cse4))) (or (= 0 (select (store .cse224 4 .cse225) .cse4)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= .cse225 0))))) .cse78) (or .cse1 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_prenex_13 Int)) (let ((.cse227 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (let ((.cse228 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse227))) (let ((.cse226 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (store .cse227 4 (select (select .cse228 |c_ULTIMATE.start_append_~item~0#1.base|) .cse4))) v_prenex_13))) (or (= (select .cse226 .cse4) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select (store .cse227 4 (select (select .cse228 v_prenex_13) .cse4)) .cse4) 0) (= (select .cse226 4) 0))))))) (or (forall ((v_arrayElimCell_50 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse229 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse229 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse229) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4)))) v_arrayElimCell_50) .cse4) 0))) .cse1) (or .cse78 (forall ((v_prenex_16 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_prenex_20 Int)) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse230 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse230 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse230) v_prenex_20) .cse4)))) v_prenex_16) .cse4) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0))))) .cse231 (or .cse78 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_prenex_19 Int)) (or (= 0 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse232 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse232 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse232) v_prenex_19) .cse4)))) v_prenex_19) .cse4)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0))))) (or (forall ((v_prenex_17 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|)) v_prenex_17) .cse4) 0))) .cse6) (or .cse78 (forall ((v_prenex_18 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (let ((.cse233 (let ((.cse234 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse234 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse234) v_prenex_18) .cse4))))) (or (= 0 (select .cse233 .cse4)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse233) v_prenex_18) .cse4) 0))))) (or .cse1 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_prenex_14 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse235 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse235 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse235) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4)))) v_prenex_14) .cse4) 0)))) (or (forall ((v_prenex_18 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (let ((.cse238 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (let ((.cse237 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse238) v_prenex_18) .cse4))) (let ((.cse236 (store .cse238 4 .cse237))) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse236) v_prenex_18) 4) 0) (= 0 (select .cse236 .cse4)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= .cse237 0)))))) .cse6)) .cse120) (or .cse1 .cse132 .cse2) (or .cse75 (and (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_arrayElimCell_41 Int)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse239 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_41))) (store .cse239 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse239) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_41))))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4) 0)))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_arrayElimCell_41 Int) (v_arrayElimCell_42 Int)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse240 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_41))) (store .cse240 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse240) v_arrayElimCell_42) (+ 4 v_arrayElimCell_41))))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4) 0)))))) (or (and (or .cse1 (forall ((v_arrayElimCell_41 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_prenex_14 Int) (v_prenex_21 Int)) (let ((.cse242 (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|))) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse241 (store .cse242 0 v_arrayElimCell_41))) (store .cse241 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse241) v_prenex_21) (+ 4 v_arrayElimCell_41))))) v_prenex_14) .cse4) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse243 (store .cse242 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse243 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse243) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4)))) v_prenex_14) .cse4) 0))))) (or .cse1 (forall ((v_arrayElimCell_50 Int) (v_arrayElimCell_41 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (let ((.cse245 (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse244 (store .cse245 0 v_arrayElimCell_41))) (store .cse244 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse244) v_arrayElimCell_50) (+ 4 v_arrayElimCell_41))))) v_arrayElimCell_50) .cse4) 0) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse246 (store .cse245 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse246 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse246) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4)))) v_arrayElimCell_50) .cse4) 0))))) (or .cse1 (forall ((v_arrayElimCell_41 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_prenex_13 Int)) (let ((.cse248 (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|))) (let ((.cse249 (store .cse248 0 v_arrayElimCell_41))) (let ((.cse250 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse249) v_prenex_13) (+ 4 v_arrayElimCell_41)))) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse247 (store .cse248 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse247 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse247) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4)))) v_prenex_13) .cse4) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select (store .cse249 4 .cse250) .cse4) 0) (= .cse250 0))))))) (or .cse1 (forall ((v_arrayElimCell_41 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_prenex_13 Int)) (let ((.cse252 (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|))) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse251 (store .cse252 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse251 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse251) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4)))) v_prenex_13) .cse4) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select (let ((.cse253 (store .cse252 0 v_arrayElimCell_41))) (store .cse253 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse253) v_prenex_13) (+ 4 v_arrayElimCell_41)))) .cse4) 0))))) .cse231 (or .cse78 (and (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_arrayElimCell_41 Int) (v_prenex_18 Int)) (let ((.cse256 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_41))) (let ((.cse255 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse256) v_prenex_18) (+ 4 v_arrayElimCell_41)))) (let ((.cse254 (store .cse256 4 .cse255))) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse254) v_prenex_18) .cse4) 0) (= (select .cse254 .cse4) 0) (= .cse255 0)))))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (forall ((v_arrayElimCell_41 Int) (v_prenex_19 Int)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse257 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_41))) (store .cse257 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse257) v_prenex_19) (+ 4 v_arrayElimCell_41))))) v_prenex_19) .cse4) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_arrayElimCell_41 Int) (v_prenex_18 Int)) (let ((.cse258 (let ((.cse259 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_41))) (store .cse259 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse259) v_prenex_18) (+ 4 v_arrayElimCell_41)))))) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse258) v_prenex_18) .cse4) 0) (= (select .cse258 .cse4) 0)))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (forall ((v_prenex_16 Int) (v_arrayElimCell_41 Int) (v_prenex_20 Int)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse260 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_41))) (store .cse260 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse260) v_prenex_20) (+ 4 v_arrayElimCell_41))))) v_prenex_16) .cse4) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_arrayElimCell_41 Int) (v_prenex_18 Int)) (let ((.cse264 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_41))) (let ((.cse263 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse264) v_prenex_18) (+ 4 v_arrayElimCell_41)))) (let ((.cse262 (store .cse264 4 .cse263))) (let ((.cse261 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse262) v_prenex_18))) (or (= (select .cse261 .cse4) 0) (= (select .cse262 .cse4) 0) (= .cse263 0) (= (select .cse261 4) 0))))))))))) (or .cse1 (forall ((v_arrayElimCell_41 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_prenex_13 Int)) (let ((.cse268 (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|))) (let ((.cse267 (+ 4 v_arrayElimCell_41)) (.cse265 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse269 (store .cse268 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse269 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse269) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4)))) v_prenex_13))) (or (= (select .cse265 .cse4) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select (let ((.cse266 (store .cse268 0 v_arrayElimCell_41))) (store .cse266 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse266) v_prenex_13) .cse267))) .cse4) 0) (= (select (select |c_#memory_$Pointer$#1.offset| v_prenex_13) .cse267) 0) (= (select .cse265 4) 0))))))) .cse120) (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_arrayElimCell_42 Int)) (let ((.cse270 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (let ((.cse271 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse270))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (store .cse270 4 (select (select .cse271 v_arrayElimCell_42) .cse4))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4) 0) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (store .cse270 4 (select (select .cse271 |c_ULTIMATE.start_append_~item~0#1.base|) .cse4))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4) 0))))) .cse1) (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse272 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse272 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse272) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4)))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4) 0))) .cse6) (or .cse48 .cse73 .cse120 (and (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_arrayElimCell_50 Int) (v_arrayElimCell_41 Int)) (let ((.cse274 (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|))) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse273 (store .cse274 0 v_arrayElimCell_41))) (store .cse273 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse273) v_arrayElimCell_50) (+ 4 v_arrayElimCell_41))))) v_arrayElimCell_50) .cse4) 0) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse275 (store .cse274 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse275 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse275) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4)))) v_arrayElimCell_50) .cse4) 0)))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_arrayElimCell_41 Int) (v_prenex_13 Int)) (let ((.cse279 (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|))) (let ((.cse278 (+ 4 v_arrayElimCell_41)) (.cse276 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse280 (store .cse279 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse280 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse280) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4)))) v_prenex_13))) (or (= (select .cse276 .cse4) 0) (= (select (let ((.cse277 (store .cse279 0 v_arrayElimCell_41))) (store .cse277 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse277) v_prenex_13) .cse278))) .cse4) 0) (= (select (select |c_#memory_$Pointer$#1.offset| v_prenex_13) .cse278) 0) (= (select .cse276 4) 0))))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_arrayElimCell_41 Int) (v_prenex_13 Int)) (let ((.cse282 (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|))) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse281 (store .cse282 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse281 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse281) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4)))) v_prenex_13) .cse4) 0) (= (select (let ((.cse283 (store .cse282 0 v_arrayElimCell_41))) (store .cse283 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse283) v_prenex_13) (+ 4 v_arrayElimCell_41)))) .cse4) 0)))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_prenex_12 Int)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse284 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse284 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse284) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4)))) v_prenex_12) .cse4) 0)))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_arrayElimCell_41 Int) (v_prenex_13 Int)) (let ((.cse286 (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|))) (let ((.cse287 (store .cse286 0 v_arrayElimCell_41))) (let ((.cse288 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse287) v_prenex_13) (+ 4 v_arrayElimCell_41)))) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse285 (store .cse286 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse285 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse285) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4)))) v_prenex_13) .cse4) 0) (= (select (store .cse287 4 .cse288) .cse4) 0) (= .cse288 0)))))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_arrayElimCell_41 Int) (v_prenex_14 Int) (v_prenex_21 Int)) (let ((.cse290 (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|))) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse289 (store .cse290 0 v_arrayElimCell_41))) (store .cse289 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse289) v_prenex_21) (+ 4 v_arrayElimCell_41))))) v_prenex_14) .cse4) 0) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse291 (store .cse290 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse291 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse291) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4)))) v_prenex_14) .cse4) 0))))))) .cse74))))) is different from true